Sciweavers

1201 search results - page 224 / 241
» Linear Probing and Graphs
Sort
View
INFOCOM
2008
IEEE
14 years 5 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
INFOCOM
2007
IEEE
14 years 5 months ago
Network Coding in a Multicast Switch
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
Jay Kumar Sundararajan, Muriel Médard, MinJ...
PODC
2006
ACM
14 years 4 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
SPAA
2006
ACM
14 years 4 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ICALP
2004
Springer
14 years 4 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt