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 10,000 papers for “Bandwidth allocation”

Online Bandwidth Allocation

Michal Forišek, Branislav Katreniak, Jana Katreniaková et al. · Lecture notes in computer science · 2007

Cited by 12

Bandwidth Allocation Games

Niloofar Bayat, Vishal Misra, Dan Rubenstein · arXiv (Cornell University) · 2022

Internet providers often offer data plans that, for each user's monthly billing cycle, guarantee a fixed amount of data at high rates until a byte threshold is reached, at which point the user's data rate is throttled to a lower rate for the remainder of the cycle. In practice, the thresholds and rates of throttling can appear and may be somewhat arbitrary. In this paper, we evaluate the choice of threshold and rate as an optimization problem (regret minimization) and demonstrate that intuitive formulations of client regret, which preserve desirable fairness properties, lead to optimization problems that have tractably computable solutions. We begin by exploring the effectiveness of using thresholding mechanisms to modulate overall bandwidth consumption. Next, we separately consider the regret of heterogeneous users who are {\em streamers}, wishing to view content over a finite period of fixed rates, and users who are {\em file downloaders}, desiring a fixed amount of bandwidth per month at their highest obtainable rate. We extend our analysis to a game-theoretic setting where users can choose from a variety of plans that vary the cap on the unbounded-rate data, and demonstrate the convergence of the game. Our model provides a fresh perspective on a fair allocation of resources where the demand is higher than capacity, while focusing on the real-world phenomena of bandwidth throttling practiced by ISPs. We show how the solution to the optimization problem results in allocations that exhibit several desirable fairness properties among the users between whom the capacity must be partitioned.

Cited by 0Open access

Dynamic bandwidth allocation

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

Cited by 0

WDM Bandwidth Allocation

Nahid Saberi, Mark Coates · 2011

In an all-optical network, wavelength division multiplexing (WDM) has been introduced as a means to support the rapidly increasing bandwidth demand of the network users. Partitioning the enormous bandwidth in optical networks into WDM channels makes the optical bandwidth compatible with the speed of electronic components. In WDM systems the end users communicate via optical

Cited by 0

Bandwidth Allocation with Preemption

Amotz Bar-Noy, Ran Canetti, Shay Kutten et al. · SIAM Journal on Computing · 1999

Bandwidth allocation is a fundamental problem in the design of networks where bandwidth has to be reserved for connections in advance. The problem is intensified when the overall requested bandwidth exceeds the capacity and not all requests can be served. Furthermore, acceptance/rejection decisions regarding connections have to be made online, without knowledge of future requests. We show that the ability to preempt (i.e., abort) connections while in service in order to schedule "more valuable" connections substantially improves the throughput of some networks. We present bandwidth allocation strategies that use preemption and show that they achieve constant competitiveness with respect to the throughput, given that any single call requests at most a constant fraction of the bandwidth. Our results should be contrasted with recent works showing that nonpreemptive strategies have at most inverse logarithmic competitiveness.

Cited by 37

Robust bandwidth allocation strategies

Oliver Heckmann, Johannes Schmitt, Ralf Steinmetz · 2003

Allocating bandwidth for a certain period of time is an often encountered problem in networks offering some kind of quality of service (QoS) support. In particular, for aggregate demand the required bandwidth at each point in time may exhibit considerable fluctuations, random fluctuations as well as systematic fluctuations due to different activity at different times of day. In any case, there is a considerable amount of uncertainty to be dealt with by strategies for effectively allocating bandwidth. In this paper, we try to devise so-called robust strategies for bandwidth allocation under uncertainty. The notion of robustness here means that we look for strategies which perform well under most circumstances, but not necessarily best for a given situation. By simulations, we compare the different strategies we propose with respect to the robustness and performance they achieve in terms of (virtual) cost savings. We show that robustness and good performance need not be contradictory goals and furthermore that very good strategies need not be complex, either.

Cited by 12

Kahaanii - Bandwidth allocation policies

Kahaanii · Bulletin of Miscellaneous Information (Royal Gardens Kew)

Music recorded in Mumbai, Pune, Bangalore and Paris on a cheap casio toy and a laptop running FastTracker 2

Cited by 0

Stateless Proportional Bandwidth Allocation

Prasanna K. Jagannathan *a, Arjan Durresi *a, Raj Jain **b · 2010

This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during congestion all flows get a share of available bandwidth, which is in proportion to their subscribed information rate. We suggest a method for implementing this with minimum signaling and without storing per-flow state. Our method is based on the principles of differentiated services – diffserv. We show by simulation that it is possible to obtain proportional bandwidth allocation without per-flow state storing and minimum signaling.

Cited by 0

Utility Based Fair Bandwidth Allocation

Corinne Touati, Eitan Altman, Jérôme Galtier · 2002

For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game the- ory has been used in networks as a concept that allows sharing resources fairly. Due to its many appealing properties, it has recently been used for assigning bandwidth in a general topology network between applications that have linear utilities. In this paper, we use this concept for the bandwidth allocation between applications with general concave utilities and focus on the case of quadratic utility.

Cited by 0

Bandwidth Allocation in ATM PON

Zhi Wang · 2000

ATM PON(APON) is a kind of economical wide band access network. As multi service and multi user transmission platform, the APON plays an important part in bandwidth allocation among different services and users to improve the bandwidth utilization of the system.The bandwidth allocation schemes among different services in APONs, including the bandwidth allocation schemes among services of the same priority and the bandwidth allocation schemes among different priorities of services are diccussed.The MAC protocols dealt with the bandwidth allocation among different ONUs are discussed as well.

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

Bandwidth allocation for multimedia teleconferences

Tak-Shing Peter Yum, Mon-Song Chen, Yiu-Wing Leung · 2002

A conference traffic model is formulated and link level and conference level congestion measures are derived. Motivated by the advantages of sharing transmission resources in time assigned speech interpolation (TASI) related voice communication systems, an analogous transmission policy for conference videos is proposed. The quantification of conference traffic also alloys an admission policy to be set so that the network can accommodate as many conferences as possible without violating conference quality constraints.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 10

On fairness in Bandwidth Allocation

Corinne Touati, Eitan Altman, Jérôme Galtier · OpenGrey (Institut de l'Information Scientifique et Technique) · 2001

For over a decade, the Nash bargaining solution (NBS) concept from cooperative game theory has been used in networks as a concept that allows one to share resources fairly. Due to its many appealing properties, it has recently been used for assigning bandwidth in a general topology network between applications that have linear utilities. In this paper, we use this concept for the bandwidth allocation between applications with general concave utilities. We study the impact of concavity on the allocation and present computational methods for obtaining fair allocations in a general topology, based on a dual Lagrangian approach and on Semi-Definite Programming.

Cited by 17Open access

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