Sciweavers

99 search results - page 4 / 20
» Modeling the AIADD paradigm in networks with variable delays
Sort
View
CN
2002
98views more  CN 2002»
13 years 5 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
DCOSS
2008
Springer
13 years 7 months ago
Techniques for Improving Opportunistic Sensor Networking Performance
Abstract. A number of recently proposed mobile sensor network architectures rely on uncontrolled, or weakly-controlled mobility to achieve sensing coverage over time at low cost, a...
Shane B. Eisenman, Nicholas D. Lane, Andrew T. Cam...
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 5 months ago
A New Phase Transition for Local Delays in MANETs
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
François Baccelli, Bartek Blaszczyszyn
ITRE
2005
IEEE
13 years 11 months ago
MR-FQ: a fair scheduling algorithm for wireless networks with variable transmission rates
— Wireless networks are characterized by bursty and location-dependent errors. Although many fair scheduling methods have been proposed to address these issues, most of them assu...
You-Chiun Wang, Yu-Chee Tseng, Wen-Tsuen Chen, Kun...
TON
2002
76views more  TON 2002»
13 years 5 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec