Sciweavers

14 search results - page 2 / 3
» Constructing Pairwise Disjoint Paths with Few Links
Sort
View
COMCOM
2004
85views more  COMCOM 2004»
13 years 5 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
ICC
2008
IEEE
167views Communications» more  ICC 2008»
14 years 15 days ago
Traceroute-Based Topology Inference without Network Coordinate Estimation
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
INFOCOM
2003
IEEE
13 years 11 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 19 days ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ICALP
1998
Springer
13 years 10 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...