Eum, Suyong and Harris, Richard J. and Kist, Alexander (2006) Generalized Kruithof approach for traffic matrix estimation. In: 14th IEEE International Conference on Networks (ICON 2006), 13-15 Sep 2006, Singapore.
Metadata
| HTML Citation | EndNote | Dublin Core | Reference Manager |
Full text available as:
![[img]](/style/images/fileicons/application_pdf.png)
| PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 661Kb |
Official URL: http://www.sp.edu.sg/icon2006/CFP.htm
Abstract
[Abstract]: In this paper, the traffic matrix estimation problem is formulated as an nonlinear optimization problem based on the generalized Kruithof approach which uses the Kullback distance to measure the probabilistic distance between two traffic matrices. In addition, an algorithm using the affine scaling method is provided to solve the constraint optimization problem.
| Item Type: | Conference or Workshop Item (Commonwealth Reporting Category E) (Paper) |
|---|---|
| Additional Information: | Deposited in accordance with the copyright policy of the publisher. Copyright 2006 IEEE. Personal use of this material is permitted. This material is posted here with permission of the IEEE. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Uncontrolled Keywords: | traffic matrix, Kruithof method, affine scaling method, Kullback distance |
| Fields of Research (FOR2008): | 10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks |
| Subjects: | 290000 Engineering and Technology > 291700 Communications Technologies > 291704 Computer Communications Networks |
| Socio-Economic Objective (SEO2008): | UNSPECIFIED |
| ID Code: | 1743 |
| Deposited By: | |
| Deposited On: | 11 Oct 2007 10:50 |
| Last Modified: | 12 Dec 2011 14:37 |
Archive Staff Only: edit this record