Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,295 papers for “Dynamic bandwidth allocation”

Dynamic bandwidth allocation

CELANDRONI N, FERRO E, GOTTA A et al. · CINECA IRIS Institutial Research Information System (University of Genoa) · 2007

Cited by 0

Dynamic Bandwidth Allocation in MUPBED

Wessing, Henrik, Mortensen, Brian Bach, Dittmann, Lars et al. · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · 2006

Cited by 0

Dynamic bandwidth allocation EPON survey

Nurul Asyikin Mohamed Radzi, N. M. Din, Sajaa Kh. Sadon et al. · 2013

One of the best options to support fiber to the home is Ethernet passive optical network (EPON) as it provides high bandwidth as well as it is cost effective. However, the issues arise in the EPON system nowadays is the bandwidth allocation. There are numerous research works that are able to allocate the upstream bandwidth dynamically to the optical network units (ONUs). In this paper, we compile and classify these research works in order to provide the state-of-art of the dynamic bandwidth allocation algorithm (DBA). The classifications provide perceptive presentations of the previous research works on EPONs. The survey allows the researchers to better understand the DBA research quickly.

Cited by 7

On-line Dynamic Bandwidth Allocation

2008

Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed toprovide these guarantees as e ciently as possible since resources are limited. This paper presents an allocation method called Dynamic Search Algorithm (DSA+). DSA+ is an on-line algorithm that dynamically adjusts the resource allocation based upon the measured quality of service. Advantages of DSA+ include e cient use of resources, reasonable implementation cost and stringent quality of service control. In this paper we demonstrate how DSA+ dynamically allocates bandwidth to achieve a given loss rate for actual variable bit rate MPEG videos. Performance and cost advantages over other allocation methods are presented, as well as allocation for multiple hop connections. 1

Cited by 0

On-line dynamic bandwidth allocation

E.W. Fulp, Douglas S. Reeves · 2002

Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed to provide these guarantees as efficiently as possible since resources are limited. This paper presents an allocation method called Dynamic Search Algorithm (DSA+). DSA+ is an on-line algorithm that dynamically adjusts the resource allocation based upon the measured quality of service. Advantages of DSA+ include efficient use of resources, reasonable implementation cost and stringent quality of service control. In this paper we demonstrate how DSA+ dynamically allocates bandwidth to achieve a given loss rate for actual variable bit rate MPEG videos. Performance and cost advantages over other allocation methods are presented, as well as allocation for multiple hop connections.

Cited by 24

Dynamic bandwidth allocation for ATM switches

Ivy Hsu, Jean Walrand · Journal of Applied Probability · 1996

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traffic models and thus simplify the tasks of supplying traffic statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to find the minimum bandwidth necessary to satisfy a cell loss probability constraint at an asynchronous transfer mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a finite number of choices, the expected learning time is finite.

Cited by 38

EFFICIENT DYNAMIC BANDWIDTH ALLOCATION FOR EPON

A. S. M. Delowar Hossain, M. A. Ali · 2015

Ethernet Passive Optical Network (EPON) has emerged as the solution of choice for the access network. In EPON, the data transfer channel is shared among users in the upstream direction. Therefore, it requires an arbitration method to allow ONUs to share the upstream bandwidth. There are many research papers on bandwidth arbitration schemes. Most of the Dynamic Bandwidth Allocation (DBA) schemes in the literatures do not consider the overall network condition to globally optimize their algorithm. Furthermore, they do not consider the ONU MAC frame boundary when granting bandwidth to an ONU. This causes mismatch between granted bandwidth and ONU frame boundary. Since fragmentation of Ethernet frame to fit the remaining ONU slot is not allowed, it causes unused ONU slot bandwidth (ONU slot remainder). In addition, number of them require DBA calculation time when no upstream traffic is allowed (idle cycle time). In this paper, we propose a DBA scheme that eliminates ONU slot remainder and idle cycle time and reuses all unused cycle bandwidth in a globally optimized fashion to maximize the upstream bandwidth utilization. Improved utilization will result in minimization of packet delay, packet loss ratio and ONU buffer occupancy. Simulation was done to demonstrate the advantages of the proposed DBA.

Cited by 0

Dynamic bandwidth allocation for EPON networks

Carmen Orencia Carrasco Arbieto · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2007

As redes de telecomunicações se dividem em redes de longa distância, redes metropolitanas e redes de acesso. As redes de longa distância e metropolitana usufruem a alta capacidade de largura de banda da fibra óptica, enquanto nas redes de acesso há um gargalo de largura de banda por causa do uso de pares de fios e cabo coaxial. Para solucionar este problema e oferecer aos usuários acesso banda larga de baixo custo foram propostas as redes ópticas passivas (passive optical network - PON). A PON é formada por dois elementos básicos, a unidade de rede óptica (optical network unit - ONU), localizada perto dos assinantes, e o terminal de linha óptica (optical line terminal - OLT), localizado próximo ao provedor de serviços. Dentre os padrões disponíveis para redes PON, o Ethernet (EPON), padronizado pelo grupo IEEE 802.3ah, é opção atraente porque ele é bastante difundido nas redes locais. O protocolo de controle multiponto (multipoint control protocol - MPCP), já especificado, é responsável pelo controle de acesso ao meio, fornecendo infra-estrutura de sinalização para transmissão entre OLT e ONUs. Entretanto, o algoritmo de alocação de largura de banda, que realiza o controle de acesso ao meio com base no MPCP, foi considerado fora do escopo de trabalho do grupo de trabalho, permitindo que seja desenvolvido pelos fornecedores de equipamentos. Neste trabalho, arquiteturas de rede EPON e o protocolo MPCP são descritos e algoritmos de alocação de largura de banda são avaliados mediante simulação computacional. São abordados os algoritmos de alocação de largura de banda que integram multiplexação estatística e técnicas para o suporte a classes de serviços diferenciados, com base no esquema de multiplexação por divisão no tempo (time division multiplexing - TDM). Algoritmos que integram a multiplexação por divisão em comprimento de onda (wavelength division multiplexing - WDM) à arquitetura EPON TDM são também investigados. Os algoritmos WDM-TDM permitem a atualização progressiva da EPON que emprega o esquema TDM para WDM.

Cited by 0

Dynamic bandwidth allocation algorithm for EPON

Wang Shu-hua · 2004

Ethernet passive optical networks are being considered as a promising solution for next-generation broadband access network. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidth in a multipoint control protocol of Ethernet PONs.

Cited by 0

Simulations Of Dynamic Bandwidth Allocation Algorithms

Pavel Sikora · Brno University of Technology Digital Library (Brno University of Technology) · 2019

This paper deals with dynamic bandwidth allocation algorithms, which are used in passive optical networks. Deployment of these algorithm is appropriate for efficient use of optical fibers. Work focus on algorithm called Hybrid Reporting Allocation and static allocation tested on own developed simulator for ten gigabit passive optical network. Paper include results from simulations.

Cited by 0Open access

Dynamic bandwidth allocation in IP/optical networks

J.W. Gannett · 2005

IP over optical network performance and traffic carrying capacity can be significantly improved with dynamic bandwidth allocation. For IP networks it is highly desirable to reallocate bandwidth without changing the IP virtual topology. We accomplish this using SDH/SONET virtual concatenation. (2 pages)

Cited by 1

Dynamic bandwidth allocation using loss-load curves

Carey Williamson · IEEE/ACM Transactions on Networking · 1996

Loss-load curves are a feedback mechanism for rate-based congestion control in packet-switched networks. The novel feature of loss-load curves is that they provide a direct mathematical relationship between offered load and the level of packet loss within the network. With this feedback information, traffic sources can dynamically compete for and share the available bandwidth on a network. Sources can use loss-load curve information to maximize raw throughput, to optimize file transfer response time, or to control end-to-end packet loss within the network. The focus of this paper is on the mathematical underpinnings of the loss-load model. The paper presents three key theoretical results for the loss-load model, and then discusses the advantages and disadvantages of the loss-load approach to dynamic bandwidth allocation. Formal proofs of the theoretical results are given.

Cited by 12

Dynamic Bandwidth Allocation for VBR Video Transmission

Nirwan Ansari, Hai Liu, Yun Q. Shi · Journal of Computing and Information Technology · 2003

To guarantee quality of service (QoS), the requirements for video transmission, such as delay and cell loss rate (CLR), are very stringent. These constraints are difficult to meet if high network utilization is desired. In this paper, dynamic bandwidth allocation algorithms are proposed to improve the bandwidth utilization. The first approach based on scene change identification, in which the bandwidth is allocated based on the maximum and mean bandwidth of the scene, is applicable to delivering pre-recorded videos. The second approach, in which the bandwidth is adjusted based on the current frame size, is on-line and can be used to deliver real-time videos on-line. When the bandwidth deviation is large enough, the bandwidth renegotiation process is triggered. Compared with CBR service, network utilization can be improved significantly for the same CLR. In general, to achieve a very low CLR and high bandwidth utilization, the renegotiation frequency may become high. Algorithms, which are proven to be effective in reducing the renegotiation frequency while keeping the bandwidth utilization at a reasonable level, are also proposed.

Cited by 4Open access

Dynamic Bandwidth Allocation in EPON and GPON

Björn Skubic, Jiajia Chen, Jawwad Ahmed et al. · 2010

This chapter presents an overview of dynamic bandwidth allocation (DBA) schemes for the two major standards for time-division multiplexing- passive optical networks (TDM-PON), namely, Ethernet PON (EPON) and gigabit-capable PON (GPON). It illustrates the differences between EPON and GPON and how they are overcome. The chapter then considers the evolution toward next - generation TDM-PON with higher upstream bit rates and how this affects the design of the DBA. The implementation and performance of a DBA algorithm is related to the nature and the requirements of different types of network traffic. Traffic is mainly characterized by frame size distribution and burstiness. The chapter then discusses the performance parameters used for evaluating and comparing the operation of different DBA algorithms. It focuses on DBA for two alternative architectures i.e., broadcast PON and two-stage PON. Controlled Vocabulary Terms Channel allocation; ethernet networks; passive optical networks; telecommunication traffic; time division multiplexing

Cited by 10

Dynamic bandwidth allocation in fixed BWA systems

Xiaohui Xu, Dong Liang, Hongqi Jiang et al. · 2004

Broadband wireless access systems are members of a large class of shared medium access systems where a single central site communicates with multiple subscriber stations over a single transmission medium. This article introduces a novel method of sharing the single transmission medium with a number of subscriber stations in fixed BWA systems, which supports integrated voice/data transport and dynamic bandwidth allocation. A MAC implementation in 3.5 GHz fixed BWA system is given, which focuses on the dynamic access technology of voice. FDD/TDM/TDMA mode is applied in the system. In the end of this article, block diagrams describing how voice access PSTN through E1 interface are given.

Cited by 9

Dynamic Bandwidth Allocation in MIMO 5G Networks

Nikolaos Prodromos, Damianos Diasakos, Vasileios Kokkinos et al. · 2024

The advent of 5 G technology has ushered in a new era of wireless communication, characterized by its promise of high data rates, low latency, and enhanced connectivity. In this context, Multiple-Input Multiple-Output (MIMO) systems have emerged as a key enabler, leveraging advanced antenna arrays to simultaneously serve multiple users with increased spectral efficiency. This paper investigates the dynamic resource allocation problem in a MIMO 5 G environment, where each user possesses distinct bandwidth requirements. The focus is on optimizing user allocation while considering the limited bandwidth and user capacity of base stations. By harnessing the power of deep learning techniques, the proposed solution aims to efficiently manage the allocation of users to base station antennas, thereby maximizing overall network performance while accommodating heterogeneous user demands.

Cited by 2