Sciweavers

2076 search results - page 200 / 416
» Universal Routing in Distributed Networks
Sort
View
INFOCOM
2009
IEEE
15 years 10 months ago
On the Effectiveness of Measurement Reuse for Performance-Based Detouring
— For both technological and economic reasons, the default path between two end systems in the wide-area Internet can be suboptimal. This observation has motivated a number of sy...
David R. Choffnes, Fabian E. Bustamante
135
Voted
IMC
2007
ACM
15 years 5 months ago
Blind source separation approach to performance diagnosis and dependency discovery
We consider the problem of diagnosing performance problems in distributed system and networks given end-to-end performance measurements provided by test transactions, or probes. C...
Gaurav Chandalia, Irina Rish
131
Voted
IWCMC
2009
ACM
15 years 10 months ago
On fault tolerant ad hoc network design
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, e...
Wasim El-Hajj, Hazem Hajj, Zouheir Trabelsi
123
Voted
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
15 years 9 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
INFOCOM
1999
IEEE
15 years 8 months ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste