Sciweavers

364 search results - page 35 / 73
» Shortest-path network interdiction
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford
WSC
2000
13 years 9 months ago
Predicting enemy force closure with simulation
This paper presents a model and an analysis done to predict enemy force closure. The simulation replaces a pencil and ruler method that has been used by Department of Defense plan...
Mark R. Grabau, Michael D. Payne
INFOCOM
2011
IEEE
12 years 11 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
INFOCOM
2012
IEEE
11 years 10 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
INFOCOM
2003
IEEE
14 years 26 days ago
Detecting Network Intrusions via Sampling: A Game Theoretic Approach
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
Murali S. Kodialam, T. V. Lakshman