• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.465-474
• /
• 2001

In the network with small cell radius, a mobile terminal which has large mobility should perform frequent handover. This requires that handover mechanism must be done fastly. The currently existing method for handover uses an algorithm in which the bandwidth corresponding to the adjacent cells is supposed to be allocated. However, this method leads to the problem of requiring bandwidth allocation for many-unknown cells, due to the lack of information toward moving direction in mobile terminal. In this paper, we propose an efficient dynamic bandwidth allocation algorithm for solving those problem above, based on both path rerouting handover and soft handover mechanism with wireless ATM. As for the QoS, it has been shown that proposed algorithm shows better performance than that with static bandwidth allocation algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1632-1638
• /
• 2020

In this paper, we investigate a multi-beam satellite communication system where multiple terminals transmit information signals to the gateway via a satellite. The satellite is equipped with phased array antennas to form multiple spot beams of which bandwidths are not identically allocated. We formulate an optimization problem to maximize fairness of beam bandwidth allocation. In order to solve the problem, we propose two heuristic algorithms; iterative beam bandwidth allocation (IBBA) and request ratio-based beam bandwidth allocation (RRBBA) algorithms. The IBBA algorithm iteratively equalizes the ratio of allocated bandwidth of each beam to their resource request while the RRBBA algorithm allocates beam bandwidth calculated from the ratio. Simulation results show that the IBBA algorithm has close fairness performance to the optimum while the RRBBA algorithm has less performance than the IBBA algorithm at the price of reduced computational complexity.

• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.303-310
• /
• 2016

Due to the ossification of the Internet, it is difficult to accommodate variety services. One of the efficient solution to this problem is network virtualization. It allows multiple parallel virtual networks to run on the shared physical infrastructure. It needs new resource allocation mechanism to share efficient physical resources. In this paper, we present efficient bandwidth allocation algorithm for virtual network request with high service priority. Our proposed algorithm can withdraw allocated bandwidth from low-level priority virtual network and maintain low-level virtual network service. We evaluated the performance of our proposed algorithm using simulation and found the improvement of approximately 8% acceptance rate.

• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.693-694
• /
• 2014

This paper proposes a new pipelined dynamic bandwidth allocation algorithm for XG-PON (10-Gbps-capable passive optical network) passive optical networks) system. The pipelined algorithm is used when a dynamic bandwidth allocation algorithm cannot finished in an unit time. In the proposed mechanism, the request is immediately transferred to each pipeline block to improve performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.89-94
• /
• 2003

Passive Optical Network(PON) architecture is a very simple. However media access protocol is necessary to the PON because the ONUs should share a channel in the upsteam direction. We propose the design of dynamic bandwidth allocation algorithm for improved bandwidth utilization in the broad bandwidth access network that uses Ethernet PON. The object of our study shall be to decrease a unused remainder bandwidth of granted timeslot for a upstream traffic transmission. We propose that OLT notifies ONU of maximum transmission window during discovery and ONU request a amount under maximum transmission window after it checks a frame length. We confirm that the proposed algorithm shown improving performance from bandwidth utilization and queueing delay point of view through the simulation result.

• Proceedings of the Optical Society of Korea Conference
• /
• 2005.02a
• /
• pp.162-163
• /
• 2005

One of the most important things in EPON(Ethernet Passive Optical Network) is that ONUs(Optical Network Units) have to share a channel in upstream direction. We proposed a new algorithm of Dynamic Bandwidth Allocation using Multiple LLID(Logical Link IDentifier). We show how to allocate bandwidth in Queues for improving performance from Bandwidth using Multiple LLID.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.663-665
• /
• 2004

Ethernet-based passive optical network(EPON) technology is being considered as a promising solution for next-generation broadband access network. It must have the property of high efficiency, low cost, and support quality of service(QoS). A major feature for this new architecture is the use of a shared transmission media between all connected optical network unit(ONU). Hence, medium access control(MAC) arbitration mechanisms are essential for the successful implementation of EPON. In this paper we propose a simple dynamic bandwidth allocation(DBA) algorithm that improves the performance of network and supports IP-based multimedia applications with the bursty data traffic. In addition, we introduce analytic models of proposed algorithms and prove the system based on our algorithm to be asymptotically stable. Simulation results show the new DBA algorithm provides high bandwidth efficiency and low queueing delay of ONU in EPON.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.21-27
• /
• 2008

In this paper, we design and implement the upstream packet bandwidth allocation algorithm on OPNET-based DOCSIS 3.0 simulator including channel-bonding CM (Cable Modem)s. Previous DOCSIS CM could not support channel bonding, it has problem in upstream bandwidth allocation and determine the contention area. The proposed upstream bandwidth allocation algorithm has been improved the queuing time and success rate. For the simulation, we design the MAC frame structure with channel bonding supported CM and not. And then, this paper design and implement the CMTS node model, CM node model, CMTS process model, and CM process model.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.760-772
• /
• 1999

The CAN is a serial communication protocol for distributed real-time control and automation systems. Data generated from field devices in the distributed control of power plant are classified into three categories: real-time event data, real-time control data, non-real-time data. These data share a CAN medium. If the traffic of the CAN protocol is not efficiently controlled, performance requirements of the power plant system could not be satisfied. This paper proposes a bandwidth allocation algorithm that can be applicable to the CAN protocol. The bandwidth allocation algorithm not only satisfies the performance requirements of the real-time systems in the power plant but also fully utilizes the bandwidth of CAN. The bandwidth allocation algorithm introduced in this paper is validated using the integrated discrete-event/continuous-time simulation model which comprises the CAN network and distributed control system of power plant.