Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/112204
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tune, P. | - |
dc.contributor.author | Roughan, M. | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | IEEE ACM Transactions on Networking, 2017; 25(3):1582-1592 | - |
dc.identifier.issn | 1063-6692 | - |
dc.identifier.issn | 1558-2566 | - |
dc.identifier.uri | http://hdl.handle.net/2440/112204 | - |
dc.description | Date of publication January 24, 2017; date of current version June 14, 2017. | - |
dc.description.abstract | The traffic matrix (TM) is a chief input in many network design and planning applications. In this paper, we propose a model, called the spherically additive noise model (SANM). In conjunction with iterative proportional fitting (IPF), it enables fast generation of synthetic TMs around a predicted TM. We analyze SANM and IPF’s action on the model to show theoretical guarantees on asymptotic convergence, in particular, convergence to the well-known gravity model. | - |
dc.description.statementofresponsibility | Paul Tune and Matthew Roughan | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.rights | © 2017 IEEE | - |
dc.subject | Internet traffic matrix; iterative proportional fitting; sensitivity analysis; synthetic generation | - |
dc.title | Controlled synthesis of traffic matrices | - |
dc.type | Journal article | - |
dc.identifier.doi | 10.1109/TNET.2016.2639066 | - |
dc.relation.grant | http://purl.org/au-research/grants/arc/DP110103505 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Roughan, M. [0000-0002-7882-7329] | - |
Appears in Collections: | Aurora harvest 8 Mathematical Sciences publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.