Sciweavers

47 search results - page 2 / 10
» Deadlock-Free Routing Based on Ordered Links
Sort
View
TON
2002
138views more  TON 2002»
13 years 8 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
WIOPT
2010
IEEE
13 years 6 months ago
Cooperative diversity routing in wireless networks
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
Mostafa Dehghan, Majid Ghaderi, Dennis Goeckel
INFOCOM
2009
IEEE
14 years 3 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 7 days ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
INFOCOM
2010
IEEE
13 years 7 months ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang