Sciweavers

1616 search results - page 248 / 324
» networks 2002
Sort
View
TELSYS
2002
73views more  TELSYS 2002»
13 years 9 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
NOMS
2002
IEEE
127views Communications» more  NOMS 2002»
14 years 2 months ago
Intelligent search of correlated alarms from database containing noise data
Alarm correlation plays an important role in improving the service and reliability in modern telecommunication networks. Most previous research of alarm correlation didn’t consi...
Qingguo Zheng, Ke Xu, Weifeng Lv, Shilong Ma
FOCS
2002
IEEE
14 years 3 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
ISPAN
2002
IEEE
14 years 2 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
OSDI
2002
ACM
14 years 10 months ago
Ivy: A Read/Write Peer-to-Peer File System
Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to ful...
Athicha Muthitacharoen, Robert Morris, Thomer M. G...