Sciweavers

315 search results - page 3 / 63
» Dynamic vs. Oblivious Routing in Network Design
Sort
View
INFOCOM
2006
IEEE
13 years 11 months ago
Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks
— Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing strategy p...
Vincent Lenders, Martin May, Bernhard Plattner
FCCM
2006
IEEE
131views VLSI» more  FCCM 2006»
13 years 11 months ago
Packet Switched vs. Time Multiplexed FPGA Overlay Networks
— Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited ...
Nachiket Kapre, Nikil Mehta, Michael DeLorimier, R...
MOBIHOC
2012
ACM
11 years 7 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
ICCD
2008
IEEE
120views Hardware» more  ICCD 2008»
14 years 2 months ago
Near-optimal oblivious routing on three-dimensional mesh networks
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
Rohit Sunkam Ramanujam, Bill Lin
INFOCOM
2005
IEEE
13 years 11 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...