Sciweavers

70 search results - page 11 / 14
» Lowering security overhead in link state routing
Sort
View
ADHOC
2007
144views more  ADHOC 2007»
14 years 10 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
ICC
2000
IEEE
137views Communications» more  ICC 2000»
15 years 2 months ago
Internet QoS Routing with IP Telephony and TCP Traffic
— In this paper, we propose the use of QoS routing to enhance the support of IP Telephony. Our proposed scheme is based on QoS intradomain OSPF routing, an extension of the conve...
Alex Dubrovsky, Mario Gerla, Scott Seongwook Lee, ...
BROADNETS
2007
IEEE
15 years 4 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
SIGCOMM
2006
ACM
15 years 3 months ago
MIRO: multi-path interdomain routing
The Internet consists of thousands of independent domains with different, and sometimes competing, business interests. However, the current interdomain routing protocol (BGP) limi...
Wen Xu, Jennifer Rexford
ADHOC
2008
88views more  ADHOC 2008»
14 years 10 months ago
Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking
As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper...
Shu Du, Ahamed Khan, Santashil PalChaudhuri, Ansle...