Sciweavers

505 search results - page 25 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
INFOCOM
2008
IEEE
15 years 6 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
COMCOM
2006
120views more  COMCOM 2006»
14 years 11 months ago
Energy efficient routing and scheduling for real-time data aggregation in WSNs
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
Hongwei Du, Xiaodong Hu, Xiaohua Jia
NPC
2005
Springer
15 years 5 months ago
A Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...
Yifeng Chen, Yanxiang He, Jiannong Cao, Jie Wu
NETWORKS
2008
14 years 11 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CN
2006
82views more  CN 2006»
14 years 11 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue