Sciweavers

661 search results - page 9 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
ICNP
2002
IEEE
14 years 10 days ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
ICNP
2002
IEEE
14 years 10 days ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
SPAA
1995
ACM
13 years 11 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
CEE
2008
91views more  CEE 2008»
13 years 7 months ago
Self-adapting algorithm to fair time sharing in wireless access networks
To adapt the data rate in accordance with the quality of the link, the IEEE 802.11 standard proposes the variable rate shifting functionality. This intrinsic functionality of the ...
Anelise Munaretto, Mauro Fonseca
WACV
2005
IEEE
14 years 29 days ago
Shared Features for Scalable Appearance-Based Object Recognition
We present a framework for learning object representations for fast recognition of a large number of different objects. Rather than learning and storing feature representations s...
Erik Murphy-Chutorian, Jochen Triesch