145 search results - page 17 / 29 » Weak State Routing for Large-Scale Dynamic Networks |
ISCAPDCS
2003
14 years 11 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
91
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
—A methodology is presented for integrating effective-bandwidth-based routing for QoS-sensitive traffic and datagram routing of the best-effort traffic. To prevent excessive dela...
100
click to vote
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—For a large-scale mesh network with dynamic traffic, maintaining the global state information in a centralized fashion is impractical. Hence, distributed schemes are needed to ...
189
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
— Mobile ad hoc networks (MANETs) are dynamic wireless networks without any infrastructure. These networks are weak against many types of attacks. One of these attacks is the bla...
102
click to vote
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...