Sciweavers

67 search results - page 7 / 14
» Algorithms for Computing QoS Paths with Restoration
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
QSHINE
2005
IEEE
14 years 1 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
LCN
2007
IEEE
14 years 1 months ago
Experiments on Network Services for the Grid
—For demanding Grid applications that use resources at different cluster sites a reservation mechanism ensures the availability of resources to guarantee a certain level of QoS. ...
Christoph Barz, Peter Martini, Markus Pilz, Floria...
IPPS
2008
IEEE
14 years 1 months ago
On performance bottleneck of anonymous communication networks
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
Ryan Pries, Wei Yu, Steve Graham, Xinwen Fu