Sciweavers

5 search results - page 1 / 1
» Deterministic Online Optical Call Admission Revisited
Sort
View
WAOA
2005
Springer
77views Algorithms» more  WAOA 2005»
13 years 10 months ago
Deterministic Online Optical Call Admission Revisited
Elisabeth Gassner, Sven Oliver Krumke
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 6 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
RTCSA
2003
IEEE
13 years 10 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong
FOCS
1993
IEEE
13 years 9 months ago
Throughput-Competitive On-Line Routing
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
BROADNETS
2006
IEEE
13 years 10 months ago
A Flexible Advance Reservation Model for Multi-Domain WDM Optical Networks
— Advance reservation is a mechanism to guarantee the availability of resources when they are needed. In the context of LambdaGrid, this mechanism is used to provide data-intensi...
Eric He, Xi Wang, Jason Leigh