Sciweavers

46 search results - page 8 / 10
» Scalable routing on flat names
Sort
View
SIGCOMM
2005
ACM
14 years 2 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
INFOCOM
2011
IEEE
13 years 2 hour ago
Forwarding anomalies in Bloom filter-based multicast
Abstract—Several recently proposed multicast protocols use inpacket Bloom filters to encode multicast trees. These mechanisms are in principle highly scalable because no per-fl...
Mikko Särelä, Christian Esteve Rothenber...
TKDE
2002
239views more  TKDE 2002»
13 years 8 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
INFOCOM
2005
IEEE
14 years 2 months ago
Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks
— In this paper, we present a novel packet delivery mechanism called Multi-path and Multi-Speed Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor netw...
Emad Felemban, Chang-Gun Lee, Eylem Ekici, Ryan Bo...
GLOBECOM
2010
IEEE
13 years 6 months ago
Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
Brigitte Jaumard, Jens Buysse, Ali Shaikh, Marc De...