• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.1
• /
• pp.24-32
• /
• 2006

In this paper, we proposed the multimedia call admission control algorithm with the bandwidth reservation based on the prediction of wireless terminal's location to guarantee quality of service for multimedia applications in cellular networks. This algorithm aims at minimizing possible errors In predicting the moving direction of terminals using a mobility prediction scheme. This prediction reduces the size of bandwidth reserved redundantly. In order to evaluate the performance of the algorithm, the blocking rate of new calls and the forced termination rate of hand-off calls are measured and compared the results with those of existing schemes. The results of the experiment revealed that the algorithm presented in this paper achieved better performance with lower call blocking rates and forced-termination rates than those of other methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.22-33
• /
• 2014

As a standard of WMNs, IEEE 802.11s supports two kinds of MAC algorithm: a mandatory EDCA used by IEEE 802.11e and an optional MCCA. While EDCA classifies traffic according to four Access Categories (AC) and offer differentiated service using a classified priority, MCCA can guarantee the specific bandwidth of users with a TDMA-style bandwidth reservation scheme between mesh routers. In case that a flow is VBR traffic of a multimedia application, MCCA has disadvantage that the reserved bandwidth does not be used entirely, though it guarantees required bandwidth of users and fairness using bandwidth reservation with neighbors' node. In this paper, we showed a problem that is wastes the reserved bandwidth when MCCA is enabled and proposed a new scheduling algorithm to prevent waste of bandwidth and to improve network utilization effectively, named Resource Sharing Round Robin (RSRR) scheduling. Finally we showed simulation results that performance of a proposed RSRR is better than the legacy MCCA through NS-2 simulation.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.253-262
• /
• 2004

In this paper, a session allocation algorithm for a switch with multiple shared links is proposed. The algorithm guarantees the reserved bandwidth to each service class and keeps the delay of sessions belonging to a service class as close as possible even if the sessionsare allocated to different shared links. To support these qualities of services, a new scheduling model for multiple shared links is defined and a session allocation algorithm to decide a shared link to be allocated to a new session on the connection establishmentis developed based on the model. The proposed heuristic algorithm allocates a session to a link including the subclass with the shortest (expected) delay that subclasses of the service class the session belongs to will experience. Simulation results verify that a switch with multiple shared links hiring the proposed algorithm provides service classes with fairer bandwidth allocation and higher throughput, and guarantees reserved bandwidth better than the switch hiring other session algorithms. It also guarantees very similarservice delay to the sessions in the same service class.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10B
• /
• pp.891-899
• /
• 2006

Generally, a geographical area consists of many regions called cells in wireless networks. Each mobile host(MH) in a cell communicates with a base station(BS) located in the center of the cell. The BSs are connected to each other by a static wired network. Since users are expected to move around during communication sessions, one of the most important QoS factors is related to the handoff. But, the handoff could fail due to unavailability of sufficient bandwidth in the next cell. As the individual cell size gradually shrinks to accommodate increasing the number of MHs, the probability of successful handoffs can be dropped. In this paper, we suppose a bandwidth reservation method to guarantee MHs against connection failure in case of frequent handoffs. This method predicts the mobility based on the geographical information and assigns the bandwidth reservation in proportion to the speed of MHs' motion. As a result, we can expect more exact moving path of MH and to reduce the waste of bandwidth.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.200-214
• /
• 2000

In general, it is difficult to transmit a VBR video like MPEG efficiently since MPEG fames are construct with various size. To solve this problem, some bandwidth smoothing techniques are proposed which is based on the prefetching video data into the client buffer with low bandwidth allocation. However these techniques do not provide efficient bandwidth smoothing technology and transmission technique for interactive video services like VCR-like functionality. In this paper, we propose and evaluated a new bandwidth allocation mechanism for interactive video services which has VBR traffic characteristics such a MPEG. This technique provides VCR-like functionality which is not supported on previous techniques and also maximizes the bandwidth utilization when interactive video services are provided. Through our experimental, we prove that the proposed technique dramatically decreases a traffic and guarantee the continuous playback simulaneously.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.41-47
• /
• 2002

Path setup considering QoS is one of the main problems to solve in Internet traffic engineering. In network restoration that is one of the traffic engineering components, to establish a backup path or backup path for a working path to be protected is the main task. The backup path should have enough bandwidth to guarantee the working paths. Thus this work requires the QoS routing solution that is to set up a backup path as well as a working path at the same time provisioning enough bandwidth. In this paper, we propose an algorithm to setup a backup path that shares the bandwidth of other backup paths whose working path does not pass along the same link with the working path we are considering. In this way we can reduce much bandwidth consumption caused by setting up backup paths. We also analyze the disjoint path computation algorithms. Finally we show simulation results how the algorithm can reduce the bandwidth consumption and how it will affect blocking when we setup paths.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.520-528
• /
• 2002

The ATM Forum recently introduced the Guaranteed Frame Rate(GFR) service category GFR service has been designed to support classical best effort traffic such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput, but also supports fair distribution of available bandwidth to completing VCs. In this paper, we proposed a new buffer management algorithm based on leaky bucket to provide minimum cell rate guarantee and improve fairness. The proposed algorithm reduces complexity and processing overhead of leaky-bucket algorithm to implement easily.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.100-104
• /
• 2004

In this paper, we propose multicast routing algorithm to guarantee QoS in mobile computing environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that DQDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Current Optics and Photonics
• /
• v.2 no.1
• /
• pp.39-46
• /
• 2018

Visible-light communication (VLC) combined with advanced illumination can be expected to become an integral part of next-generation communication networks. One of the major concerns in VLC implementation is developing resource-allocation schemes in a multi-user scenario. However, the scheduling for heterogeneous quality of service (QoS) traffic has not been studied so far, for the indoor VLC downlink system. In this paper, we creatively introduce effective-bandwidth and effective-capacity theory into the multi-user scheduling (MUS) problem, to guarantee the user's statistical delay QoS. We also take account of the aggregate interference (AI) in the indoor VLC downlink system, and analyze its impact on the user-centric MUS problem for the first time. Simulations show that the AI has a nonnegligible influence on the scheduling result, and that the proposed scheduling scheme could guarantee the user's QoS requirement under the premise of ensuring sum capacity.