103 search results - page 3 / 21 » A bidirected generalization of network matrices |
IMC
2007
ACM
13 years 7 months ago
2007
ACM
In this paper we consider the problem of determining traffic matrices for end-to-end demands in an IP/MPLS network that supports multiple quality of service (QoS) classes. More pr...
TCOM
2011
13 years 22 days ago
2011
—We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirec...
MOR
2008
13 years 5 months ago
2008
A traffic matrix D1 dominates a traffic matrix D2 if D2 can be routed on every (capacitated) network where D1 can be routed. We prove that D1 dominates D2 if and only if D1 , cons...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
CCR
2005
13 years 5 months ago
2005
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...