Sciweavers

24 search results - page 1 / 5
» Domination Between Traffic Matrices
Sort
View
CN
2011
88views more  CN 2011»
12 years 12 months ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...
MOR
2008
63views more  MOR 2008»
13 years 4 months ago
Domination Between Traffic Matrices
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...
Gianpaolo Oriolo
SIGMETRICS
2010
ACM
129views Hardware» more  SIGMETRICS 2010»
12 years 11 months ago
From traffic matrix to routing matrix: PoP level traffic characteristics for a Tier-1 ISP
Traffic matrices play a pivotal role in the management of an ISP's network such as various levels of traffic engineering and capacity planning. However, it is unclear how the...
Vijay Kumar Adhikari, Sourabh Jain, Zhi-Li Zhang
EOR
2008
119views more  EOR 2008»
13 years 4 months ago
Market sharing dynamics between two service providers
We study the market partition between two distinct firms that deliver services to waiting time sensitive customers. In our model, the incoming customers select a firm on the basis...
Olivier Gallay, Max-Olivier Hongler
ICALP
2003
Springer
13 years 10 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren