Name
Abstract | ||
|---|---|---|
Traffic matrices describe the volume of traffic between a set of sources and destinations within a network. These matrices are used in a variety of tasks in network planning and traffic engineering, such as the design of network topologies. Traffic matrices naturally possess complex spatiotemporal characteristics, but their proprietary nature means that little data about them is available publicly, and this situation is unlikely to change.
Our goal is to develop techniques to synthesize traffic matrices for researchers who wish to test new network applications or protocols. The paucity of available data, and the desire to build a general framework for synthesis that could work in various settings requires a new look at this problem. We show how the principle of maximum entropy can be used to generate a wide variety of traffic matrices constrained by the needs of a particular task, and the available information, but otherwise avoiding hidden assumptions about the data. We demonstrate how the framework encompasses existing models and measurements, and we apply it in a simple case study to illustrate the value.
|
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2829988.2787471 | Special Interest Group on Data Communication |
Keywords | DocType | Volume |
maximum entropy,network design,spatiotemporal modeling,traffic engineering,traffic matrix synthesis | Conference | 45 |
Issue | ISSN | Citations |
4 | 0146-4833 | 9 |
PageRank | References | Authors |
0.54 | 27 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Tune | 1 | 83 | 8.83 |
| Matthew Roughan | 2 | 1638 | 148.27 |