• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.227-233
• /
• 2007

According to the recent development of network technology, the demands of users are diversified and the needs of multimedia traffic are increasing. In general, UDP(User Datagram Protocol) traffic is used to transport multimedia data, which satisfied the real-time and isochronous characteristics. UDP traffic competes with TCP traffic and incur the network congestion. However, TCP traffic performs network congestion control but does not consider the receiver's status. Thus, it is not appropriate in case of streaming services. In this paper, we solve a fairness problems and proposed a network algorithm based on RTP/RTCP(Real-time Transport Protocol/Realtime Transport Control Protocol) in view of receiver status. The POBA(Priority Ordered Buffer Algorithm), which applies priorities in the receiver's buffer and networks, shows that it provides the appropriate environment for streaming services in view of packet loss ratio and buffer utilization of receiver's buffer compared with the previous method.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.156-166
• /
• 2005

Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.239-244
• /
• 2019

With the development of Cyber-Physical Systems(CPS), several technologies such as automation control, automotive and intelligent house systems have been developed. To enable communication among various components of such systems, several wired and wireless communication protocols are used. The Controller Area Network(CAN) is one of such wired communication protocols that is popularly used for communication in automobiles and other machinery in the industry. In this paper, we designed and implemented a response time analysis system for CAN communication. The reliable data transfer among various electronic components in a significant time is crucial for the smooth operation of an electric vehicle. Therefore, this system is designed to conveniently analyze the response time of various electronic components of a CAN enabled system. The priority for transmission of the messages in the CAN bus is determined by the message identifier. As the number of nodes increases the transmission of low priority messages is delayed due to the existence of higher priority messages on the bus. We used Raspberry Pi3 and PiCAN2 board to simulate the data transfer for studying the comparative delay in low priority nodes.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.716-719
• /
• 1999

In this paper, a real-time control system for robot manipulator is implemented using real-time operating system with capabilities of multitasking, intertask communication and synchronization, event-driven, priority-driven scheduling, real-time clock control, etc. The hardware system with VME bus and related devices is developed and applied to implement a dynamic learning control scheme for robot manipulator. Real-time performance of the proposed dynamic learning controller is tested for tasks of tracking moving objects and compared with the conventional servo controller.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.70-80
• /
• 1999

In this paper, a new hierarchical image segmentation algorithm based on human visual system(HVS) characteristic is proposed which can efficiently reduce and control transmission information quantity without the degradation of the subjective and objective image quality. It consists of image segmentation based on mathematical morphology and region merging considering HVS characteristic for the pairs of two adjacent regions at each level of the hierarchy. Image segmentation is composed of 3-level hierarchical structure. In the region merging structure of each level, we extract the pairs of two adjacent regions which human vision can't discriminate, and then merge them. The proposed region merging method extracts pairs of two neighbor regions to be merged and performs region merging according to merging priority based on HVS characteristics. The merging priority for each adjacent pair is determined by the proposed merging priority function(MPF). First of all, the highest priority pair is merged. The information control factor is used to regulate the transmission information at each level. The proposed segmentation algorithm can efficiently improve bottleneck problem caused by excessive contour information at region-based very low bit rate coding. And it shows that it is more flexible structure than that of conventional method. In experimental results, though PSNR and the subjective image quality by the proposed algorithm is similar to that of conventional method, the contour information quantity to be transmitted is reduced considerably. Therefore it is an efficient image segmentation algorithm for region-based very low bit rate coding.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.526-534
• /
• 2014

Most of the multiplayer games available online are based on a client-server architecture because this architecture gives better administration control to the game providers than peer-to-peer architecture. In this architecture, the server is responsible for all the communication between the connected clients. The weakness of this architecture is its bandwidth requirement and scalability. Peer-to-peer architectures have then been proposed to solve these issues. In this paper, we propose a hybrid client-server architecture in which the game state is partially shared by the mobile terminal to achieve consistency among different players. Like a peer-to-peer architecture, this architecture uses client-side capacities to reduce bandwidth requirements for the server and improves consistency in wireless networks. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In the proposed architecture, either the server or the client applies consistency mechanism according to the priority level. Simulation experiments show that the bandwidth of the server in this architecture is smaller than that of the client-server architecture. As a result, the server in the proposed architecture can accommodate more clients with enhancing the scalability.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.805-814
• /
• 2001

In this paper, we propose a new scheduling algorithm that guarantees the delay property of real-time traffic, not considered in previous DWRR(Dynamic Weighted Round Robin) algorithm and also transmits non-real-time traffic efficiently. The proposed scheduling algorithm is a variation of DWRR algorithm to guarantee the delay property of real-time traffic by adding cell transmission method based on delay priority. It also uses the threshold to prevent the cell loss of non-real-time traffic due to cell transmission method based on delay priority. Proposed scheduling algorithm may increase some complexity over conventional DWRR scheme because of cell transmission method based on delay priority. However, the consideration of delay priority can minimize cell delay and require less size of temporary buffer. Also, the results of our performance study shows that the proposed scheduling algorithm has better performance than conventional DWRR scheme due to reliable ABR service and congestion avoidance capacity.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.57-57
• /
• 2004