4781 search results - page 641 / 957 » Online algorithms for network design |
199
click to vote
ICPADS
2006
IEEE
16 years 22 days ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
183
Voted
ICPADS
2005
IEEE
16 years 8 days ago
2005
IEEE
- This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an ...
178
click to vote
ICPP
2005
IEEE
16 years 8 days ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
171
click to vote
MOBICOM
2005
ACM
16 years 7 days ago
2005
ACM
This paper presents the first quantitative evaluation of the role of routing computations on performance when mobility is introduced to a content-based routing network. Additiona...
176
click to vote
SIGCOMM
2004
ACM
16 years 3 days ago
2004
ACM
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...