Sciweavers

830 search results - page 37 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
ICDCS
1992
IEEE
14 years 26 days ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
CCR
2008
120views more  CCR 2008»
13 years 9 months ago
OpenFlow: enabling innovation in campus networks
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an interna...
Nick McKeown, Tom Anderson, Hari Balakrishnan, Gur...
SIGCOMM
2012
ACM
11 years 11 months ago
DeTail: reducing the flow completion time tail in datacenter networks
Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page ...
David Zats, Tathagata Das, Prashanth Mohan, Dhruba...
MOBIHOC
2000
ACM
14 years 1 months ago
Utility-based decision-making in wireless sensor networks
— We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. We addres...
John W. Byers, Gabriel Nasser
PIMRC
2010
IEEE
13 years 6 months ago
Efficient cooperative protocols for general outage-limited multihop wireless networks
Abstract-- Due to the limited energy supplies of nodes in wireless networks, achieving energy efficiency is crucial for extending the lifetime of these networks. Thus, we study eff...
Behrouz Maham, Walid Saad, Mérouane Debbah,...