Sciweavers

1333 search results - page 156 / 267
» Packet Routing on the Grid
Sort
View
CN
2007
142views more  CN 2007»
15 years 4 months ago
Performance modeling of epidemic routing
In this paper, we develop a rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived a...
Xiaolan Zhang, Giovanni Neglia, James F. Kurose, D...
CORR
2007
Springer
160views Education» more  CORR 2007»
15 years 4 months ago
On the Correlation of Geographic and Network Proximity at Internet Edges and its Implications for Mobile Unicast and Multicast R
Signicant eort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing ecient mobile multicast man...
Thomas C. Schmidt, Matthias Wählisch, Ying Zh...
TPDS
1998
73views more  TPDS 1998»
15 years 3 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
15 years 9 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
IPSN
2004
Springer
15 years 9 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...