• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.59-79
• /
• 2010

This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.367-376
• /
• 1999

A variable bit-rate based video services have much limitation for bandwidth management, since its trarfic has a some variances in frame level. In particular, the bandwidth management for video which has characteristics of VBR traffic such a MPEG video could be more complicated. Also, it is difficult to manage the bandwidth effectively for proving a VCR function from VOD service, since we don't know the traffic variance exactly at that time. In this paper, we proposed the dynamic bandwidth allocation a scheme based on VBR traffic based stored video such as MPEG for interactive video service. This scheme can maximize the given total bandwidth through the prefetch based variable length bandwidth allocation scheme and dynamic bandwidth management scheme for multiple streams. Also, our scheme can be used for a MPEG-based bandwidth allocation scheme, and provides the method that can maximize the utilization of network resource for multiple stream by using a dynamic bandwidth management.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.35-38
• /
• 1999

In this paper, we propose bandwidth management scheme to efficiently guarantee the QoS of various services on ATM based IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control to reduce a handoff failure probability and the scheduling scheme to efficiently allocate a time slot based on the QoS requirements in wireless links. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and packet delay time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.838-847
• /
• 2006

In order to support multiple multimedia streaming services in home networks, many critical issues must be considered. In addition, handling the shortage of network bandwidth is one of the most significant and complicated issues. In this paper, real-time bandwidth management service is suggested as a solution to the problem regarding the IEEE1394-based home network. In order to handle the shortage of network bandwidth and to enhance the bus utilization rate, the proposed service combines two methods. First, the bus bandwidth management function determines the state of the network bandwidth and restores the residual bandwidth, which is excessively occupied by a streaming service, to the available free bandwidth. Second, the Isochronous Streaming (IS) Scheduler manages all streaming services according to priority. In order to test the proposed service, we implemented a prototype steaming management middleware and evaluated it by using the IEEE1394 network test-bed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.361-364
• /
• 2005

As increasing the Internet traffic, many researches on access network are reported for end-to-end high-speed broadband network, where E-PON(Ethernet-Passive Active Network) is one of reasonable candidate fur the network with respect to cost and bandwidth utilization. For the high-speed access network, E-PON need an efficient bandwidth allocation method. This paper suggests a WFA(Water-Filling Allocation) algorithm for the efficient bandwidth allocation with various simulation test.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.83-93
• /
• 2003

Differentiated service networks, based on bandwidth broker, perform the control and management of QoS provisioning for the QoS guaranteed services, However, the centralized bandwidth broker model has a scalability problem since it has centralized resource management for the admission control function of all call attempts, Therefore, in this paper, we proposea novel adaptive admission control mechanism according to the attempted call status for enhancing the scalability under the centralized bandwidth broker model in IP differentiated service networks, The proposed mechanism decouples the function of admission control from the bandwidth broker, So, the ingress edge node performs the admission control and the bandwidth broker performs the resource management and QoS provisioning, We also introduce an edge-to-edge path concepts and the ingress edge node performs the admission control under the allocated bandwidth to eachpath. The allocated bandwidth per path adaptively varies according to the status of the attempted calls, This mechanism can significantly reduce the number of communication message between the bandwidth broker and each edge node in the network and increase the bandwidth utilization via adaptable resource allocation, In this paper we study the adaptive admission control operation and show the efficient and extensive improvement through the performance evaluation.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.4
• /
• pp.165-176
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories： static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks.. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.205-206
• /
• 2008

We propose load balancing algorithm based on cross layer designing for MIMO OFDM system. When there are many users using data service, base station(BS) should distribute traffic. Moreover, cross layer design gives benefit managing radio resource and network bandwidth management. Proposed cross layer load balancing technique manages both BS's bandwidth allocation and MS’s power control. One BS request bandwidth to other BSes and other BSes reduce each bandwidth. And BSes reduce power of sub carriers for reserving available bandwidth of backhaul. MSes that didn't get service can be served by obtaining bandwidth from other BSes. The simulation result shows more users can be served and cell throughput was increased

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.131-134
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.