Sciweavers

Share
INFOCOM
2009
IEEE
9 years 29 days ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
INFOCOM
2009
IEEE
9 years 29 days ago
Adaptive Early Packet Filtering for Defending Firewalls Against DoS Attacks
—A major threat to data networks is based on the fact that some traffic can be expensive to classify and filter as it will undergo a longer than average list of filtering rule...
Adel El-Atawy, Ehab Al-Shaer, Tung Tran, Raouf Bou...
INFOCOM
2009
IEEE
9 years 29 days ago
CFP: Cooperative Fast Protection
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Ta...
INFOCOM
2009
IEEE
9 years 29 days ago
Detecting Selfish Exploitation of Carrier Sensing in 802.11 Networks
Konstantinos Pelechrinis, Guanhua Yan, Stephan Eid...
INFOCOM
2009
IEEE
9 years 29 days ago
Physical Interference Modeling for Transmission Scheduling on Commodity WiFi Hardware
—The demand for capacity in WiFi networks is driving a new look at transmission scheduling based link layers, particularly in the context of mesh networks. One basic issue here i...
Ritesh Maheshwari, Jing Cao, Samir R. Das
INFOCOM
2009
IEEE
9 years 29 days ago
On Mechanism Design without Payments for Throughput Maximization
—It is well-known that the overall efficiency of a distributed system can suffer if the participating entities seek to maximize their individual performance. Consequently, mecha...
Thomas Moscibroda, Stefan Schmid
INFOCOM
2009
IEEE
9 years 29 days ago
Fit a Spread Estimator in Small Memory
—The spread of a source host is the number of distinct destinations that it has sent packets to during a measurement period. A spread estimator is a software/hardware module on a...
MyungKeun Yoon, Tao Li, Shigang Chen, Jih-Kwon Pei...
INFOCOM
2009
IEEE
9 years 29 days ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
INFOCOM
2009
IEEE
9 years 29 days ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
INFOCOM
2009
IEEE
9 years 29 days ago
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
Eitan Altaian, Philippe Nain, Jean-Claude Bermond
books