Sciweavers

1687 search results - page 255 / 338
» On the complexity of scheduling in wireless networks
Sort
View
INFOCOM
2005
IEEE
15 years 12 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown
HPDC
1999
IEEE
15 years 10 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
ICNS
2007
IEEE
16 years 20 days ago
A Case Study-based Performance Evaluation Framework for CSCF Processes on a Blade-Server
Abstract— The study of protocol behavior and traffic characteristics in a simulated environment is commonly supported by ad-hoc or general purpose simulators (e.g., Opnet, NS-2)...
Preetam Ghosh, Nirmalya Roy, Kalyan Basu, Sajal K....
MOBICOM
2009
ACM
16 years 26 days ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
MIDDLEWARE
2007
Springer
16 years 15 days ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta