• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.928-938
• /
• 2008

Though services requiring Quality-of-Service (QoS) guarantees such as Voice over Internet Protocol (VoIP) have been widely deployed on the internet, most of internet backbone networks, unfortunately, do not distinguish them from the best-effort services. Thus estimating the effective capacity meaning the traffic volume that the backbone networks maximally accommodate with keeping QoS guarantees for the services is very important for Internet Service Providers. This paper proposes a test-bed based on ns-2 to evaluate the effective capacity of backbone networks and then estimates the effective capacity of an experimental backbone network using the test-bed in terms of the service standard of the VoIP service. The result showed that the effective capacity of the network is estimated as between 12% and 55% of its physical capacity, which is depending on the maximum delay guarantee probability, and strongly affected by not only the type of offered workload but also the quality standard. Especially, it demonstrated that in order to improve the effective capacity the maximum end-to-end delay requirement of the VoIP service needs to be loosened in terms of the probability to guarantee.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.23-34
• /
• 2004

This paper presents architecture and control method of packet scheduler to guarantee QoS of high quality streaming services in high-speed packet-switched networks. Since streaming services need far more stringent QoS requirements than the typical sort of burst data applications, they should be guaranteed minimum bandwidth and end-to-end delay bound to each flow, regardless of the behavior of other flows. To meet these requirements, a packet scheduler isolate a flow from the undesirable effects of other flows and provides end-to-end delay guarantees for individual flow and divides stringently the available link bandwidth among flows sharing the link. Until now, many vendors are developing traffic management chips running at 10Gbps, but most of chips have drawbacks to support high quality streaming services. In this paper, we investigate the drawbacks of commercial TM chips and traffic characteristic of streaming services and present implementation frameworks of the proposed packet scheduler. Finally, we analyze the simulation results of the proposed scheduler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.595-604
• /
• 2009

The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.58-62
• /
• 2007

Recnetly, the demands of QoS(Quality of Service) and the traffic in network is increased. So, H-MPLS(Hierarchical MPLS) network research what guarantees the scalability is in progress. But, the H-MPLS has a problem of increasing of groups and the links of these group's nodes. It happens a problem that is increasing of H-MPLS setup cost. In this paper, We setup the H-MPLS groups. We use NS simulator in order to analyze the performance and traffic transfer times of each H-MPLS groups. In conclusion, we can find out the elevation of the traffic performance, by increasing a amount of links.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.101-108
• /
• 1998

Recently, growing Internet traffic have come to mandate the speed-up of Internet links. Also, emerging real-time services generally require QoS (Quality of Service) guarantees in networks. ATM is considered to be the most promising subnetwork technology to meet these requirements efficiently. In this paper, we first analyze recent protocol standardization activities in IETF and ATM Forum for integrating Internet with ATM. This includes brief reviews of protocols such as IETF's IP/ATM, NHRP, RSVP and IS/ATM, as well as ATM Forum's LAN Emulation and MPOA. We then identify two types of integration methodologies, and suggest a classification of the integration. Our work might be helpful to outlook better the future direction of standardization in this field.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.25-38
• /
• 2013

Future wireless systems will be required to support the increasingly nomadic lifestyle of people. This support will be provided through the use of multiple overlaid networks which have very different characteristics. Moreover, these networks will be required to support the seamless delivery of today's popular desktop services, such as web browsing, interactive multimedia and video conferencing to the mobile devices. Thus one of the major challenges in the design of these mobile systems will be the provision of the quality of service (QoS) guarantees that the applications demand under this diverse networking infrastructure. We believe that it is necessary to use resource reservation and adaptation techniques to deliver these QoS guarantee to applications. However, reservation and pre-configuration in the entire service region is overly aggressive, and results in schemes that are extremely inefficient and unreliable. To overcome this, the mobility pattern of a user can be exploited. If the movement of a user is known, the reservation and configuration procedure can be limited to the regions of the network a user is likely to visit. Our proposed Proxy-UMP is not sensitive to increase of the search cost than other schemes and shows that the increasing rate of total cost is low as the SMR increases.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1446-1459
• /
• 2008

In an infrastructure-based wireless network, an access point is used for all communications among mobile devices. However, when a mobile device moves into a dead Bone, a connectivity disruption between the mobile device and the access point occurs. Such connectivity disruption consequently leads to another connectivity disruption between the mobile device moving toward the dead zone and other wireless-enabled devices located within the area of the infrastructure-based wireless network. To cope with the connectivity disruption in the infrastructure-based wireless network the ad hoc network that dynamically forms a network without any preexisting communication infrastructure needs to be set up to provide seamless connections among mobile devices. In this paper, we propose the DNSQ-MAC (Dynamic Network State aware QoS-Medium Access Control) technique that meets the deadlines of MAC frames forwarded over hop-by-hop multipaths and guarantees the QoS performance of an ad hoc-based wireless network. Mobile devices incorporating the DNSQ-MAC technique are capable of adjusting to the new dynamic network status in order to enhance the QoS performance in the ad hoc-based wireless network. A case study which exploits the Qualnet simulator shows that the proposed DNSQ-MAC technique can guarantee the deadlines of MAC frames forwarded over hop-by-hop multipaths and enhance the QoS performance of various routing protocols and packet schedulers running on the network layer above the MAC layer.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.339-348
• /
• 2001

In this paper, a cell scheduling algorithm which can be applied to all of the service class in ATM network is proposed. The proposed algorithm classifies the order of priority in each service class into 4 categories and generates the weight of each class service based on the traffic parameters which are negotiated in connection contract. The proposed algorithm guarantees QoS(Quality of Service) to the traffic which is sensitive to delay carrying out CBR and rt_VBR service. As it effectively manages the connection which has small bandwidth, it minimizes the cell delay in the queue. For verifying the effectiveness of the proposed algorithm the proposed algorithm is simulated with existing cell scheduling algorithm and the result is showed.