Sciweavers

22 search results - page 4 / 5
» Route oracle: where have all the packets gone
Sort
View
SPAA
1996
ACM
14 years 20 days ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
ADHOC
2007
144views more  ADHOC 2007»
13 years 8 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
ANCS
2008
ACM
13 years 10 months ago
A remotely accessible network processor-based router for network experimentation
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packe...
Charlie Wiseman, Jonathan S. Turner, Michela Becch...
NBIS
2009
Springer
14 years 3 months ago
Enhancing Simulation Mode Operation of ospfd
In this paper, we describe our modifications to ospfd, a popular open-source implementation of OSPF routing protocol. The ospfd software can also be run in simulation mode, where...
Weigao Xie, Balaji Polepalli, Mukul Goyal, Hossein...
ICDE
2011
IEEE
244views Database» more  ICDE 2011»
13 years 7 days ago
Algorithms for local sensor synchronization
— In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in c...
Lixing Wang, Yin Yang, Xin Miao, Dimitris Papadias...