Sciweavers

CORR
2010
Springer
231views Education» more  CORR 2010»
13 years 9 months ago
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks
Scheduling is a critical and challenging resource allocation mechanism for multi-hop wireless networks. It is well known that scheduling schemes that give a higher priority to the ...
Bo Ji, Changhee Joo, Ness B. Shroff
SPAA
1996
ACM
14 years 4 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
ICC
2007
IEEE
14 years 6 months ago
Locating Congested Segments on the Internet by Clustering the Delay Performance of Multiple Paths
— A practical method of locating congested segments on the Internet by periodic end-to-end packet delay measurements along multiple paths is presented. This method is a network t...
Atsuo Tachibana, Shigehiro Ano, Toru Hasegawa, Mas...
CDC
2008
IEEE
134views Control Systems» more  CDC 2008»
14 years 6 months ago
Networked control systems with packet delays and losses
— We investigate the effect of packet delays and packet drops on networked control systems. First we consider the problem of where to locate a controller or state estimator in a...
Craig L. Robinson, P. R. Kumar
IPSN
2010
Springer
14 years 6 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...