Traffic matrix estimation using spike flow detection

Susumu Shimizu, Kensuke Fukuda, Ken Ichiro Murakami, Shigeki Goto

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    This paper proposes a new method of estimating real-time traffic matrices that only incurs small errors in estimation. A traffic matrix represents flows of traffic in a network. It is an essential tool for capacity planning and traffic engineering. However, the high costs involved in measurement make it difficult to assemble an accurate traffic matrix. It is therefore important to estimate a traffic matrix using limited information that only incurs small errors. Existing approaches have used IP-related information to reduce the estimation errors and computational complexity. In contrast, our method, called spike flow measurement (SFM) reduces errors and complexity by focusing on spikes. A spike is transient excessive usage of a communications link. Spikes are easily monitored through an SNMP framework. This reduces the measurement costs compared to that of other approaches. SFM identifies spike flows from traffic byte counts by detecting pairs of incoming and outgoing spikes in a network. A matrix is then constructed from collected spike flows as an approximation of the real traffic matrix. Our experimental evaluation reveals that the average error in estimation is 28%, which is sufficiently small for the method to be applied to a wide range of network nodes, including Ethernet switches and IP routers.

    Original languageEnglish
    Pages (from-to)1484-1491
    Number of pages8
    JournalIEICE Transactions on Communications
    VolumeE88-B
    Issue number4
    DOIs
    Publication statusPublished - 2005

    Fingerprint

    Flow measurement
    Ethernet
    Measurement errors
    Routers
    Error analysis
    Telecommunication links
    Costs
    Computational complexity
    Switches
    Planning

    Keywords

    • Network management
    • Network measurement
    • Spike flow
    • Traffic matrix

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications

    Cite this

    Traffic matrix estimation using spike flow detection. / Shimizu, Susumu; Fukuda, Kensuke; Murakami, Ken Ichiro; Goto, Shigeki.

    In: IEICE Transactions on Communications, Vol. E88-B, No. 4, 2005, p. 1484-1491.

    Research output: Contribution to journalArticle

    Shimizu, S, Fukuda, K, Murakami, KI & Goto, S 2005, 'Traffic matrix estimation using spike flow detection', IEICE Transactions on Communications, vol. E88-B, no. 4, pp. 1484-1491. https://doi.org/10.1093/ietcom/e88-b.4.1484
    Shimizu, Susumu ; Fukuda, Kensuke ; Murakami, Ken Ichiro ; Goto, Shigeki. / Traffic matrix estimation using spike flow detection. In: IEICE Transactions on Communications. 2005 ; Vol. E88-B, No. 4. pp. 1484-1491.
    @article{10c8f5b9a11d44cca802ff83930502a7,
    title = "Traffic matrix estimation using spike flow detection",
    abstract = "This paper proposes a new method of estimating real-time traffic matrices that only incurs small errors in estimation. A traffic matrix represents flows of traffic in a network. It is an essential tool for capacity planning and traffic engineering. However, the high costs involved in measurement make it difficult to assemble an accurate traffic matrix. It is therefore important to estimate a traffic matrix using limited information that only incurs small errors. Existing approaches have used IP-related information to reduce the estimation errors and computational complexity. In contrast, our method, called spike flow measurement (SFM) reduces errors and complexity by focusing on spikes. A spike is transient excessive usage of a communications link. Spikes are easily monitored through an SNMP framework. This reduces the measurement costs compared to that of other approaches. SFM identifies spike flows from traffic byte counts by detecting pairs of incoming and outgoing spikes in a network. A matrix is then constructed from collected spike flows as an approximation of the real traffic matrix. Our experimental evaluation reveals that the average error in estimation is 28{\%}, which is sufficiently small for the method to be applied to a wide range of network nodes, including Ethernet switches and IP routers.",
    keywords = "Network management, Network measurement, Spike flow, Traffic matrix",
    author = "Susumu Shimizu and Kensuke Fukuda and Murakami, {Ken Ichiro} and Shigeki Goto",
    year = "2005",
    doi = "10.1093/ietcom/e88-b.4.1484",
    language = "English",
    volume = "E88-B",
    pages = "1484--1491",
    journal = "IEICE Transactions on Communications",
    issn = "0916-8516",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "4",

    }

    TY - JOUR

    T1 - Traffic matrix estimation using spike flow detection

    AU - Shimizu, Susumu

    AU - Fukuda, Kensuke

    AU - Murakami, Ken Ichiro

    AU - Goto, Shigeki

    PY - 2005

    Y1 - 2005

    N2 - This paper proposes a new method of estimating real-time traffic matrices that only incurs small errors in estimation. A traffic matrix represents flows of traffic in a network. It is an essential tool for capacity planning and traffic engineering. However, the high costs involved in measurement make it difficult to assemble an accurate traffic matrix. It is therefore important to estimate a traffic matrix using limited information that only incurs small errors. Existing approaches have used IP-related information to reduce the estimation errors and computational complexity. In contrast, our method, called spike flow measurement (SFM) reduces errors and complexity by focusing on spikes. A spike is transient excessive usage of a communications link. Spikes are easily monitored through an SNMP framework. This reduces the measurement costs compared to that of other approaches. SFM identifies spike flows from traffic byte counts by detecting pairs of incoming and outgoing spikes in a network. A matrix is then constructed from collected spike flows as an approximation of the real traffic matrix. Our experimental evaluation reveals that the average error in estimation is 28%, which is sufficiently small for the method to be applied to a wide range of network nodes, including Ethernet switches and IP routers.

    AB - This paper proposes a new method of estimating real-time traffic matrices that only incurs small errors in estimation. A traffic matrix represents flows of traffic in a network. It is an essential tool for capacity planning and traffic engineering. However, the high costs involved in measurement make it difficult to assemble an accurate traffic matrix. It is therefore important to estimate a traffic matrix using limited information that only incurs small errors. Existing approaches have used IP-related information to reduce the estimation errors and computational complexity. In contrast, our method, called spike flow measurement (SFM) reduces errors and complexity by focusing on spikes. A spike is transient excessive usage of a communications link. Spikes are easily monitored through an SNMP framework. This reduces the measurement costs compared to that of other approaches. SFM identifies spike flows from traffic byte counts by detecting pairs of incoming and outgoing spikes in a network. A matrix is then constructed from collected spike flows as an approximation of the real traffic matrix. Our experimental evaluation reveals that the average error in estimation is 28%, which is sufficiently small for the method to be applied to a wide range of network nodes, including Ethernet switches and IP routers.

    KW - Network management

    KW - Network measurement

    KW - Spike flow

    KW - Traffic matrix

    UR - http://www.scopus.com/inward/record.url?scp=24144473082&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=24144473082&partnerID=8YFLogxK

    U2 - 10.1093/ietcom/e88-b.4.1484

    DO - 10.1093/ietcom/e88-b.4.1484

    M3 - Article

    AN - SCOPUS:24144473082

    VL - E88-B

    SP - 1484

    EP - 1491

    JO - IEICE Transactions on Communications

    JF - IEICE Transactions on Communications

    SN - 0916-8516

    IS - 4

    ER -