Sciweavers

2050 search results - page 319 / 410
» constraints 2010
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...
INFOCOM
2010
IEEE
13 years 7 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li
INFOCOM
2010
IEEE
13 years 7 months ago
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
Praveen Kumar Muthuswamy, Koushik Kar, Sambit Sahu...
INFOCOM
2010
IEEE
13 years 7 months ago
Evaluating Potential Routing Diversity for Internet Failure Recovery
—As the Internet becomes a critical infrastructure component of our global information-based society, any interruption to its availability can have significant economical and so...
Chengchen Hu, Kai Chen, Yan Chen, Bin Liu
INFOCOM
2010
IEEE
13 years 7 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz