570 search results - page 19 / 114 » Approximating Some Network Design Problems with Node Costs |
116
click to vote
ASIAMS
2007
IEEE
15 years 7 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
HICSS
2003
IEEE
15 years 6 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
106
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper, we propose a cost-based model to evaluate the resources that each node has to contribute for participating in an overlay network. Such a cost model allows to gau...
114
click to vote
SUTC
2006
IEEE
15 years 7 months ago
2006
IEEE
Sensor networks have attracted intensive interests due to its extendable capability. In this paper, we attempt to answer a fundamental but practical question:” how should we dep...
146
click to vote
MOR
2007
15 years 29 days ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...