Sciweavers

4037 search results - page 66 / 808
» Routing without ordering
Sort
View
CCR
2005
96views more  CCR 2005»
13 years 9 months ago
Stability of end-to-end algorithms for joint routing and rate control
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...
Frank P. Kelly, Thomas Voice
TCAD
2002
73views more  TCAD 2002»
13 years 8 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
PERCOM
2005
ACM
14 years 8 months ago
Enabling Reliable Many-to-Many Communication in Ad-Hoc Pervasive Environments
In order for pervasive computing to realize its full potential, pervasive applications have to be able to operate without support from fixed communication infrastructure at least ...
Einar Vollset, Paul D. Ezhilchelvan
AIPS
2007
13 years 11 months ago
Context-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
Adriaan ter Mors, Jonne Zutt, Cees Witteveen
ISPAN
2005
IEEE
14 years 2 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...