290 search results - page 14 / 58 » Network as a Computer: Ranking Paths to Find Flows |
AINA
2004
IEEE
15 years 1 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
IMC
2010
ACM
14 years 7 months ago
2010
ACM
Prior studies of Internet traffic have considered traffic at different resolutions and time scales: packets and flows for hours or days, aggregate packet statistics for days or we...
ICCSA
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
83
Voted
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...