Sciweavers

315 search results - page 47 / 63
» Shortest path optimization under limited information
Sort
View
CN
2006
116views more  CN 2006»
13 years 8 months ago
Techniques for available bandwidth measurement in IP networks: A performance comparison
As the Internet grows in scale and complexity, the need for accurate traffic measurement increases. Among the different parameters relevant to traffic measurement, the paper pays ...
Leopoldo Angrisani, Salvatore D'Antonio, Marcello ...
SPAA
2005
ACM
14 years 1 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
TIT
2008
65views more  TIT 2008»
13 years 7 months ago
Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels
We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and ...
Xin Wang, Georgios B. Giannakis
GLOBECOM
2007
IEEE
14 years 2 months ago
A Distributed Bandwidth Sharing Heuristic for Backup LSP Computation
— With the advent of MPLS, the restoration times of communications is decreased down to 50 ms by the use of preconfigured backup LSPs. To ensure there are enough resources after ...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
ICC
2009
IEEE
101views Communications» more  ICC 2009»
13 years 5 months ago
Adaptive Bitrate and Resource Allocation for Relay-Assisted ARQ Transmissions
Automatic repeat request (ARQ) protocols deal with the situations where the selected data rate is not supported by the current channel realization. The inappropriate selection is m...
Adrian Agustin, Josep Vidal, Olga Muñoz