233 search results - page 8 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
CN
2004
13 years 7 months ago
2004
QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Sever...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...
ISPD
2004
ACM
14 years 1 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
JEC
2006
13 years 7 months ago
2006
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...