Sciweavers

1321 search results - page 88 / 265
» Optimal Routing in Communication Networks with Delay Variati...
Sort
View
GLOBECOM
2008
IEEE
16 years 11 days ago
Distributed and Dynamic Resource Allocation for Delay Sensitive Network Services
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...
Michael G. Kallitsis, Robert D. Callaway, Michael ...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
16 years 10 days ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
MOBIHOC
2005
ACM
16 years 5 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
INFOCOM
2003
IEEE
15 years 11 months ago
Load optimal MPLS routing with N+M labels
Abstract— MPLS is becoming an important protocol for intradomain routing. MPLS routers are offered by the major vendors and many ISPs are deploying MPLS in their IP backbones, as...
David Applegate, Mikkel Thorup
NCA
2003
IEEE
15 years 11 months ago
Scalable Protocol for Content-Based Routing in Overlay Networks
In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alte...
Raphaël Chand, Pascal Felber