DAC
2012
ACM
12 years 2 months ago
2012
ACM
Improving detailed routing routability is an important objective of a global router. In this paper, we propose GDRouter, an interleaved global routing and detailed routing algorit...
INFOCOM
2011
IEEE
13 years 4 months ago
2011
IEEE
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
ANCS
2009
ACM
13 years 10 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
WINET
2010
13 years 10 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
TMC
2010
13 years 10 months ago
2010
—Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes fo...
SIGMETRICS
2002
ACM
14 years 2 days ago
2002
ACM
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
IJAHUC
2006
14 years 13 days ago
2006
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
CN
2006
14 years 14 days ago
2006
We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multiple unicast sources. Multiple paths are established using overla...
AAAI
2000
14 years 1 months ago
2000
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
SODA
2004
ACM
14 years 1 months ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...