Sciweavers

61 search results - page 1 / 13
» Stability of a localized and greedy routing algorithm
Sort
View
IPPS
2010
IEEE
13 years 2 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
INFOCOM
2009
IEEE
13 years 11 months ago
Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing
Abstract—Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a ...
Yujun Li, Yaling Yang, Xianliang Lu
INFOCOM
2006
IEEE
13 years 10 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
MOBIHOC
2004
ACM
14 years 4 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
ICNP
2005
IEEE
13 years 10 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov