Sciweavers

75 search results - page 14 / 15
» Improved Algorithm for Degree Bounded Survivable Network Des...
Sort
View
COCOA
2010
Springer
13 years 5 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
MINENET
2005
ACM
14 years 27 days ago
Shrink: a tool for failure diagnosis in IP networks
Faults in an IP network have various causes such as the failure of one or more routers at the IP layer, fiber-cuts, failure of physical elements at the optical layer, or extraneo...
Srikanth Kandula, Dina Katabi, Jean-Philippe Vasse...
WSC
2007
13 years 9 months ago
Allocation of simulation runs for simulation optimization
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
Alireza Kabirian, Sigurdur Ólafsson
PODC
2009
ACM
14 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
INFOCOM
2006
IEEE
14 years 1 months ago
Minimum-Energy Broadcast Using Practical Directional Antennas in All-Wireless Networks
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
Sabyasachi Roy, Y. Charlie Hu, Dimitrios Peroulis,...