Sciweavers

266 search results - page 39 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 7 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...
SENSYS
2010
ACM
13 years 5 months ago
A case against routing-integrated time synchronization
To achieve more accurate global time synchronization, this paper argues for decoupling the clock distribution network from the routing tree in a multihop wireless network. We find...
Thomas Schmid, Zainul Charbiwala, Zafeiria Anagnos...
IWCMC
2006
ACM
14 years 1 months ago
A novel broadcast technique for high-density ad hoc networks
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...
Ai Hua Ho, Alexander J. Aved, Kien A. Hua
ICCAD
2003
IEEE
123views Hardware» more  ICCAD 2003»
14 years 4 months ago
The Y-Architecture for On-Chip Interconnect: Analysis and Methodology
The Y-architecture for on-chip interconnect is based on pervasive use of 0-, 120-, and 240-degree oriented semi-global and global wiring. Its use of three uniform directions explo...
Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Io...