• Title/Summary/Keyword: static bandwidth allocation

Search Result 17, Processing Time 0.025 seconds

The Study on the Dynamic Bandwidth Allocation Algorithm using Cell Delay Variation (셀지연변이를 이용한 동적 대역폭 할당 알고리즘에 관한 연구)

  • 신승호;박상민
    • 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.

  • PDF

The Study on the Dynamic Bandwidth Allocation Algorithm using by Cell Delay Variation (셀지연변이를 이용한 동적 대역폭 할당 알고리즘에 관한 연구)

  • 신승호;박상민
    • 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.

  • PDF

A Two-Step Scheduling Algorithm to Support Dual Bandwidth Allocation Policies in an Ethernet Passive Optical Network

  • Lee, Ho-Sook;Yoo, Tae-Whan;Moon, Ji-Hyun;Lee, Hyeong-Ho
    • ETRI Journal
    • /
    • v.26 no.2
    • /
    • pp.185-188
    • /
    • 2004
  • In this paper, we design a two-step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on-demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start- time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.

  • PDF

Optimal Bandwidth Allocation and QoS-adaptive Control Co-design for Networked Control Systems

  • Ji, Kun;Kim, Won-Jong
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.4
    • /
    • pp.596-606
    • /
    • 2008
  • In this paper, we present a co-design methodology of dynamic optimal network-bandwidth allocation (ONBA) and adaptive control for networked control systems (NCSs) to optimize overall control performance and reduce total network-bandwidth usage. The proposed dynamic co-design strategy integrates adaptive feedback control with real-time scheduling. As part of this co-design methodology, a "closed-loop" ONBA algorithm for NCSs with communication constraints is presented. Network-bandwidth is dynamically assigned to each control loop according to the quality of performance (QoP) information of each control loop. As another part of the co-design methodology, a network quality of service (QoS)-adaptive control design approach is also presented. The idea is based on calculating new control values with reference to the network QoS parameters such as time delays and packet losses measured online. Simulation results show that this co-design approach significantly improves overall control performance and utilizes less bandwidth compared to static strategies.

EPON Bandwidth Allocation Scheme for Improved Utilization (Bandwidth 이용률을 높이기 위한 EPON 대역 할당 기법)

  • 윤춘희;이성창
    • 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.

Hierarchical Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Ahn, Kye-Hyun;Han, Kyeong-Eun;Kim, Young-Chon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.321-331
    • /
    • 2004
  • In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

  • PDF

An Efficient Algorithm of Network Bandwidth Allocations for Multimedia Services (멀티미디어 서비스를 위한 효율적인 대역폭 할당)

  • 김정택;고인선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1112-1123
    • /
    • 2002
  • Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.

A Study on QoS for Dynamic Bandwidth Allocation Algorithm in Wireless ATM (무선 ATM에서의 동적 대역폭 할당 알고리즘에 대한 QoS 성능 연구)

  • 류기훈;전광탁;양해권
    • 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.

  • PDF

A Dynamic Bandwidth Allocation Scheme based on Playback Buffer Level in a Distributed Mobile Multimedia System (분산 모바일 멀티미디어 시스템에서 재생 버퍼 수준에 기반한 동적 대역폭 할당 기법)

  • Kim, Jin-Hwan
    • The KIPS Transactions:PartB
    • /
    • v.17B no.6
    • /
    • pp.413-420
    • /
    • 2010
  • In this paper, we propose a scheme for dynamic allocating network bandwidth based on the playback buffer levels of the clients in a distributed mobile multimedia system. In this scheme, the amount of bandwidth allocated to serve a video request depends on the buffer level of the requesting client. If the buffer level of a client is low or high temporarily, more or less bandwidth will be allocated to serve it with an objective to make it more adaptive to the playback situation of this client. By employing the playback buffer level based bandwidth allocation policy, fair services can also be provided to the clients. In order to support high quality video playbacks, video frames must be transported to the client prior to their playback times. The main objectives in this bandwidth allocation scheme are to enhance the quality of service and performance of individual video playback such as to minimize the number of dropped video frames and at the same time to provide fair services to all the concurrent video requests. The performance of the proposed scheme is compared with that of other static bandwidth allocation scheme through extensive simulation experiments, resulting in the 4-9% lower ratio of frames dropped according to the buffer level.

Simple Protocol for Dynamic Bandwidth Allocation in WDM/SCM-FTTH Access Network (WDM/SCM-FTTH 가입자망에서 효율적인 대역할당을 위한 프로토콜)

  • 조충건;박혁규;김영철;강동국;안계현;김영천
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.73-76
    • /
    • 2003
  • The capacity of backbone networks has largely kept pace with the tremendous of growth of Internet traffic. But there has been little progress in the access networks. In this paper, we introduce the access network that is able to offers high bandwidth and its simple protocol. The network architecture is basically multiple ring and use WDM(Wavelength Division Multiplexing), SCM (SubCarrier Multiplexing), and static WADM (Wavelenth Add/Drop Multiplexer) for simplicity, low cost, and offering high bandwidth.

  • PDF