• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.367-376
• /
• 2001

For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.347-354
• /
• 2001

This paper proposes and analyzes an error control scheme which tries to recover the transmission error within the deadline of a message on FDDI networks. The error control procedure does not interfere other normal message transmissions by delivering retransmission request via asynchronous traffic as well as by delivering retarnsmitted message via overallocated bandwidth which is inevitably produced by the bandwidth allocation scheme for hard real-time guarantee. The receiver counts the number of tokens which it meets, determines the completion of message transmission, and finally sends error report. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real-time network can be built at cost lower than, but performacne comparable to the dual link network.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1433-1442
• /
• 1997

Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1195-1207
• /
• 1999

Wireless channel has high error rate and limited bandwidth. In order to guarantee the quality of service for multimedia through wireless channel, wireless ATM network requires the cell structure with error control schemes and an efficient medium access control protocol. In this paprt, an efficient medium access control protocol, which is considered of cell structure and the QOS, is proposed for wireless ATM networks. Many kinds of ATM cell structures are analyzed in terms of cell error rate and cell loss rate to choose the proper cell structures for this proposed MAC protocol. And a bandwidth allocation algorithm is also designed to satisfy the priority of services. The performance of proposed MAC protocol are evaluated in terms of channel utilization, call blocking and packet discard probability accotding to different kinds of cell structure through simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.6
• /
• pp.381-381
• /
• 2000

In this paper, we propose a real-time bandwidth allocation scheme of multiplexed VBR MPEG video sequences over ATM network. In order to real time processing, multiplexed source is estimated by linear-prediction per measurement period. If the result CLR value were not sufficient, we proposed a overallocation method and a reallocation one to guarantee QoS. We used two kinds of sources, one is random multiplexed source made of foot different video sources, the other is the one considered the arrange of I frame in the sequence. With those sources, we analyzed the linear prediction, compared overallocation with reallocation method. As a result, in both schemes, the objected CLR value is achieved, the sufficient value COR under 10% when mp is over 1.8 sec, the utilization is over 0.9. Especially, the COR value of the reallocation scheme is better at the same condition.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.6
• /
• pp.21-27
• /
• 2000

In this paper, we propose a real-time bandwidth allocation scheme of multiplexed VBR MPEG video sequences over ATM network. In order to real time processing, multiplexed source is estimated by linear-prediction per measurement period. If the result CLR value were not sufficient, we proposed a overallocation method and a reallocation one to guarantee QoS. We used two kinds of sources, one is random multiplexed source made of foot different video sources, the other is the one considered the arrange of I frame in the sequence. With those sources, we analyzed the linear prediction, compared overallocation with reallocation method. As a result, in both schemes, the objected CLR value is achieved, the sufficient value COR under 10% when mp is over 1.8 sec, the utilization is over 0.9. Especially, the COR value of the reallocation scheme is better at the same condition.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.9
• /
• pp.1-6
• /
• 2010

H.264 video coding standard is widely used due to the high compression rate and quality. H.264 decoders usually have pipeline architecture by a macroblock or a $4{\times}4$ sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and the requirement of high data bandwidth and high performance processing units. We propose adaptive pipeline architecture for H.264 decoders for efficient decoding and lower the requirement of the bandwidth for the memory bus. Parameters and coefficients are delivered using hand-shaking communication through dedicated interconnections and frame pixel data are transferred using AMBA AHB network. The processing time of each block is variable depending on the characteristics of images, and the processing units start to work whenever they are ready. An H.264 decoder is designed and implemented using the proposed architecture to verify the operation using an FPGA.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.409-418
• /
• 2009

Providing Quality-of-Service (QoS) guarantee requires for each router on the path of a traffic flow not to violate the flow's delay budget allocated to itself. Since the amount of load being offered to the router is determined by the budget, some imbalance in load among routers on the path may be alleviated by means of adjusting the budget. The equal allocation applied to the resource reservation protocol (RSVP) is simple to implement, but it has the drawback of a poor resource utilization. A load balancing method in which the delay budget being allocated to a router depends on its load state was developed to improve the drawback, but it's too complex to apply to the RSVP. This paper proposes an intra-path load balancing method not only applicable to the RSVP but also more effective in improving the drawback. The proposed method first partitions the end-to-end delay bound of a flow to routers by the RSVP and then let them adjust their budgets according to both the bottleneck state of the path and their links' bandwidth availabilities. The results of the simulation applying the proposed method to an evaluation network showed that the proposed method may provide the gain of 4 ${\sim}$ 17 % compared to that in the legacy one in terms of the number of maximally admittable flows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.1070-1088
• /
• 2017

Recently, the applications of Internet of Things (IoTs) are growing rapidly. Wireless Sensor Network (WSN) becomes an emerging technology to provide the low power wireless connectivity for IoTs. The IPv6 over low-power wireless personal area networks (6LoWPAN) has been proposed by IETF, which gives each WSN device an IPv6 address to connect with the Internet. The transmission congestion in IoTs could be a problem when a large numbers of sensors are deployed in the field. Therefore, it is important to consider whether the WSN devices have be completely integrated into the Internet with proper quality of service (QoS) requirements. The Software Defined Network (SDN) is a new architecture of network decoupling the data and control planes, and using the logical centralized control to manage the forwarding issues in large-scale networks. In this research, the SDN-based 6LoWPAN Border Router (6LBR) is proposed to integrate the transmission from WSNs to Internet. The proposed SDN-based 6LBR communicating between WSNs and the Internet will bring forward the requirements of end-to-end QoS with bandwidth guarantee. Based on our experimental results, we have observed that the selected 6LoWPAN traffic flows achieve lower packet loss rate in the Internet. Therefore, the 6LoWPAN traffic flows classified by SDN-based 6LBR can be reserved for the required bandwidth in the Internet to meet the QoS requirements.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.277-285
• /
• 2002

This paper proposes and analyzes an error control scheme for the transmission control based real-time communication, such as FDDI, TDMA, and wireless LAN, which delivers the message according to the round robin fashion after the off-line bandwidth allocation. Taking into account the time constraint of each message, the proposed error control scheme makes the receiver transmit the error report via asynchronous traffic while the sender resend the requested message via overallocated access time which is inevitably introduced by the bandwidth allocation procedure for hard real -time guarantee. The error control procedure does not interfere other real -time message transmissions. In addition, as each frame contains the size of the message it belongs, the receiver can recognize the end of completion of message transmission. This enables earlier error report to the receiver so that the sender can cope with more network errors. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real -time network can be built at cost lower than, but performance comparable to the expensive dual link network.