155 search results - page 9 / 31 » A New Necessary Condition for Shortest Path Routing |
ICC
2000
IEEE
13 years 11 months ago
2000
IEEE
—Owing to the absence of any static support structure, Ad-hoc networks are prone to link failures. The ‘shortest path seeking’ routing protocols may not lead to stable routes...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
INFOCOM
2002
IEEE
14 years 8 days ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...