Sciweavers

259 search results - page 5 / 52
» On Constraints for Path Computation in Multi-Layer Switched ...
Sort
View
ICN
2005
Springer
14 years 1 months ago
A Fast Path Recovery Mechanism for MPLS Networks
The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing ...
Jenhui Chen, Chung-Ching Chiou, Shih-Lin Wu
LCN
2000
IEEE
13 years 11 months ago
Load-Balanced Routing and Scheduling for Real-Time Traffic in Packet-Switch Networks
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
Sangman Bak, Albert Mo Kim Cheng, Jorge Arturo Cob...
COMCOM
2006
75views more  COMCOM 2006»
13 years 7 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
EDCC
2008
Springer
13 years 9 months ago
Targeted Distribution of Resource Allocation for Backup LSP Computation
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
FOCS
1997
IEEE
13 years 11 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...