Sciweavers

1692 search results - page 161 / 339
» A Dynamic Network Interdiction Problem
Sort
View
ICC
2007
IEEE
174views Communications» more  ICC 2007»
16 years 21 days ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...
JCP
2008
117views more  JCP 2008»
15 years 6 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...
SIGCOMM
2004
ACM
15 years 11 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
FTNET
2007
107views more  FTNET 2007»
15 years 6 months ago
Network Optimization and Control
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves unde...
Srinivas Shakkottai, R. Srikant
GLOBECOM
2009
IEEE
15 years 4 months ago
On the Efficiency of a Game Theoretic Approach to Sparse Regenerator Placement in WDM Networks
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
Diego Lucerna, Nicola Gatti, Guido Maier, Achille ...