AbstractWe study on-line bandwidth allocation on two parallel links. Motivated by issues of quality of service and fair resource allocation, the goal is to maximize the load of the least loaded link. We analyze several models for which we give tight bounds on the competitive ratio
Recently, efficient network resource management and qualityof -service (QoS) guarantee become more a...
Content Delivery Networks (CDNs) deliver web content to end-users from a large distributed platform ...
A group of switch schedulers make packet scheduling decisions based on predefined bandwidth allocati...
We study on-line bandwidth allocation on two parallel links. Motivated by issues of Quality of Serv...
Transmission protocols like TCP are usually divided into a time scheduling and a data selection poli...
This paper addresses the optimal rate allocation problem in overlay content distribution for efficie...
htmlabstractBandwidth-sharing networks as introduced by Massouli\'e~\& Roberts (1998) model the dyna...
Bandwidth-sharing networks as introduced by Massoulie ́ & Roberts (1998) model the dynamic inte...
We consider the problem of link capacity dimensioning and routing optimization in networks that supp...
AbstractThis paper presents online algorithms for routing and bandwidth allocation which simultaneou...
Abstract—Fairness in network traffic management can improve the isolation between traffic streams, o...
Abstract — The problem of achieving fairness in the allocation of the bandwidth resource on a link s...
In communication networks, fair sharing of resources is an important issue for one main reason. The ...
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandw...
Bandwidth allocation is one of the main problems in network virtualization. Mechanisms to allocate b...
Recently, efficient network resource management and qualityof -service (QoS) guarantee become more a...
Content Delivery Networks (CDNs) deliver web content to end-users from a large distributed platform ...
A group of switch schedulers make packet scheduling decisions based on predefined bandwidth allocati...
We study on-line bandwidth allocation on two parallel links. Motivated by issues of Quality of Serv...
Transmission protocols like TCP are usually divided into a time scheduling and a data selection poli...
This paper addresses the optimal rate allocation problem in overlay content distribution for efficie...
htmlabstractBandwidth-sharing networks as introduced by Massouli\'e~\& Roberts (1998) model the dyna...
Bandwidth-sharing networks as introduced by Massoulie ́ & Roberts (1998) model the dynamic inte...
We consider the problem of link capacity dimensioning and routing optimization in networks that supp...
AbstractThis paper presents online algorithms for routing and bandwidth allocation which simultaneou...
Abstract—Fairness in network traffic management can improve the isolation between traffic streams, o...
Abstract — The problem of achieving fairness in the allocation of the bandwidth resource on a link s...
In communication networks, fair sharing of resources is an important issue for one main reason. The ...
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandw...
Bandwidth allocation is one of the main problems in network virtualization. Mechanisms to allocate b...
Recently, efficient network resource management and qualityof -service (QoS) guarantee become more a...
Content Delivery Networks (CDNs) deliver web content to end-users from a large distributed platform ...
A group of switch schedulers make packet scheduling decisions based on predefined bandwidth allocati...
DOI
Add to ORKG