Sciweavers

482 search results - page 76 / 97
» On routing table growth
Sort
View
INFOCOM
2002
IEEE
14 years 19 days ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
NSDI
2004
13 years 9 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
INFOCOM
2012
IEEE
11 years 10 months ago
Comparing alternative approaches for networking of named objects in the future Internet
Abstract—This paper describes and compares alternative architectures for achieving the functional goals of name oriented networking. The CCN (content-centric network) scheme prop...
Akash Baid, Tam Vu, Dipankar Raychaudhuri
AIMS
2009
Springer
14 years 11 days ago
Evaluation of Sybil Attacks Protection Schemes in KAD
In this paper, we assess the protection mechanisms entered into recent clients to fight against the Sybil attack in KAD, a widely deployed Distributed Hash Table. We study three m...
Thibault Cholez, Isabelle Chrisment, Olivier Festo...
TMC
2010
138views more  TMC 2010»
13 years 6 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li