Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models
Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that are invariant across a range of time scales, such as self-similarity, LRD and multifractality. These properties have a...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 306 |
---|---|
container_issue | |
container_start_page | 297 |
container_title | |
container_volume | |
creator | Salvador, Paulo Nogueira, António Valadas, Rui Pacheco, António |
description | Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that are invariant across a range of time scales, such as self-similarity, LRD and multifractality. These properties have a significant impact on network performance and, therefore, traffic models must be able to incorporate them in their mathematical structure and parameter inference procedures.
In this work, we address the modeling of network traffic using a multi-time-scale framework. We evaluate the performance of two classes of traffic models (Markovian and Lindenmayer-Systems based traffic models) that incorporate the notion of time scale using different approaches: directly in the model structure, in the case of the Lindenmayer-Systems based models, or indirectly through a fitting of the second-order statistics, in the case of the Markovian models. In addition, we address the importance of modeling packet size for IP traffic, an issue that is frequently misregarded. Thus, in each class we evaluate models that are intended to describe only the packet arrival process and models that are intended to describe both the packet arrival and packet size processes: specifically, we consider a Markov modulated Poisson process and a batch Markovian arrival process as examples of Markovian models and a set of four Lindenmayer-Systems based models as examples of non Markovian models that are able to perform a multi-time-scale modeling of network traffic. All models are evaluated by comparing the density function, the autocovariance function, the loss ratio and the average waiting time in queue corresponding to measured traces and to traces synthesized from the fitted models. We resort to the well known Bellcore pOct traffic trace and to a trace measured at the University of Aveiro.
The results obtained show that (i) both the packet arrival and packet size processes need to be modeled for an accurate characterization of IP traffic and (ii) despite the differences in the ways Markovian and L-System models incorporate multiple time scales in their mathematical framework, both can achieve very good performance. |
doi_str_mv | 10.1007/978-3-540-30197-4_30 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16367540</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16367540</sourcerecordid><originalsourceid>FETCH-LOGICAL-p228t-bd11dbb59b34890bcd965417ac7c0965a7401b6c772e897fbdb2f68d5405a9c3</originalsourceid><addsrcrecordid>eNotkEtPwzAMgMNLYhv7Bxx64RiIkzRpjmhigLSJw8Y5yqtTWNdOTUHi35NuXGzL_mTZH0L3QB6BEPmkZIUZLjnBjICSmGtGLtCU5c6pIS7RBAQAZoyrKzTP_DijrCyBX6NJpihWkrNbNE3pixBCpaITtFx_N0PEQzwEvHGmCcW2N3UdXbHufGhiuys-0xjXpt93P9G0hWl9scKb3zSEQzpj6Q7d1KZJYf6fZ2i7fNku3vDq4_V98bzCR0qrAVsP4K0tlWW8UsQ6r0TJQRonHcmlkZyAFU5KGiola-strUXl8yelUY7N0MN57dGkfGzdm9bFpI99PJj-V4NgQo5GZoieuZRH7S702nbdPmkgerSpsx3NdCb1SZ4ebbI_OPViMw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models</title><source>Springer Books</source><creator>Salvador, Paulo ; Nogueira, António ; Valadas, Rui ; Pacheco, António</creator><contributor>Gravey, Annie ; Lorenz, Pascal ; Chemouil, Prosper ; Freire, Mário Marques</contributor><creatorcontrib>Salvador, Paulo ; Nogueira, António ; Valadas, Rui ; Pacheco, António ; Gravey, Annie ; Lorenz, Pascal ; Chemouil, Prosper ; Freire, Mário Marques</creatorcontrib><description>Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that are invariant across a range of time scales, such as self-similarity, LRD and multifractality. These properties have a significant impact on network performance and, therefore, traffic models must be able to incorporate them in their mathematical structure and parameter inference procedures.
In this work, we address the modeling of network traffic using a multi-time-scale framework. We evaluate the performance of two classes of traffic models (Markovian and Lindenmayer-Systems based traffic models) that incorporate the notion of time scale using different approaches: directly in the model structure, in the case of the Lindenmayer-Systems based models, or indirectly through a fitting of the second-order statistics, in the case of the Markovian models. In addition, we address the importance of modeling packet size for IP traffic, an issue that is frequently misregarded. Thus, in each class we evaluate models that are intended to describe only the packet arrival process and models that are intended to describe both the packet arrival and packet size processes: specifically, we consider a Markov modulated Poisson process and a batch Markovian arrival process as examples of Markovian models and a set of four Lindenmayer-Systems based models as examples of non Markovian models that are able to perform a multi-time-scale modeling of network traffic. All models are evaluated by comparing the density function, the autocovariance function, the loss ratio and the average waiting time in queue corresponding to measured traces and to traces synthesized from the fitted models. We resort to the well known Bellcore pOct traffic trace and to a trace measured at the University of Aveiro.
The results obtained show that (i) both the packet arrival and packet size processes need to be modeled for an accurate characterization of IP traffic and (ii) despite the differences in the ways Markovian and L-System models incorporate multiple time scales in their mathematical framework, both can achieve very good performance.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540235514</identifier><identifier>ISBN: 3540235515</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540301976</identifier><identifier>EISBN: 9783540301974</identifier><identifier>DOI: 10.1007/978-3-540-30197-4_30</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Exact sciences and technology ; L-Systems ; Markovian arrival processes ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teletraffic ; Traffic modeling</subject><ispartof>Lecture notes in computer science, 2004, p.297-306</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30197-4_30$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30197-4_30$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27929,38259,41446,42515</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16367540$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Gravey, Annie</contributor><contributor>Lorenz, Pascal</contributor><contributor>Chemouil, Prosper</contributor><contributor>Freire, Mário Marques</contributor><creatorcontrib>Salvador, Paulo</creatorcontrib><creatorcontrib>Nogueira, António</creatorcontrib><creatorcontrib>Valadas, Rui</creatorcontrib><creatorcontrib>Pacheco, António</creatorcontrib><title>Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models</title><title>Lecture notes in computer science</title><description>Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that are invariant across a range of time scales, such as self-similarity, LRD and multifractality. These properties have a significant impact on network performance and, therefore, traffic models must be able to incorporate them in their mathematical structure and parameter inference procedures.
In this work, we address the modeling of network traffic using a multi-time-scale framework. We evaluate the performance of two classes of traffic models (Markovian and Lindenmayer-Systems based traffic models) that incorporate the notion of time scale using different approaches: directly in the model structure, in the case of the Lindenmayer-Systems based models, or indirectly through a fitting of the second-order statistics, in the case of the Markovian models. In addition, we address the importance of modeling packet size for IP traffic, an issue that is frequently misregarded. Thus, in each class we evaluate models that are intended to describe only the packet arrival process and models that are intended to describe both the packet arrival and packet size processes: specifically, we consider a Markov modulated Poisson process and a batch Markovian arrival process as examples of Markovian models and a set of four Lindenmayer-Systems based models as examples of non Markovian models that are able to perform a multi-time-scale modeling of network traffic. All models are evaluated by comparing the density function, the autocovariance function, the loss ratio and the average waiting time in queue corresponding to measured traces and to traces synthesized from the fitted models. We resort to the well known Bellcore pOct traffic trace and to a trace measured at the University of Aveiro.
The results obtained show that (i) both the packet arrival and packet size processes need to be modeled for an accurate characterization of IP traffic and (ii) despite the differences in the ways Markovian and L-System models incorporate multiple time scales in their mathematical framework, both can achieve very good performance.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>L-Systems</subject><subject>Markovian arrival processes</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><subject>Traffic modeling</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540235514</isbn><isbn>3540235515</isbn><isbn>3540301976</isbn><isbn>9783540301974</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkEtPwzAMgMNLYhv7Bxx64RiIkzRpjmhigLSJw8Y5yqtTWNdOTUHi35NuXGzL_mTZH0L3QB6BEPmkZIUZLjnBjICSmGtGLtCU5c6pIS7RBAQAZoyrKzTP_DijrCyBX6NJpihWkrNbNE3pixBCpaITtFx_N0PEQzwEvHGmCcW2N3UdXbHufGhiuys-0xjXpt93P9G0hWl9scKb3zSEQzpj6Q7d1KZJYf6fZ2i7fNku3vDq4_V98bzCR0qrAVsP4K0tlWW8UsQ6r0TJQRonHcmlkZyAFU5KGiola-strUXl8yelUY7N0MN57dGkfGzdm9bFpI99PJj-V4NgQo5GZoieuZRH7S702nbdPmkgerSpsx3NdCb1SZ4ebbI_OPViMw</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Salvador, Paulo</creator><creator>Nogueira, António</creator><creator>Valadas, Rui</creator><creator>Pacheco, António</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models</title><author>Salvador, Paulo ; Nogueira, António ; Valadas, Rui ; Pacheco, António</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p228t-bd11dbb59b34890bcd965417ac7c0965a7401b6c772e897fbdb2f68d5405a9c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>L-Systems</topic><topic>Markovian arrival processes</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><topic>Traffic modeling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Salvador, Paulo</creatorcontrib><creatorcontrib>Nogueira, António</creatorcontrib><creatorcontrib>Valadas, Rui</creatorcontrib><creatorcontrib>Pacheco, António</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Salvador, Paulo</au><au>Nogueira, António</au><au>Valadas, Rui</au><au>Pacheco, António</au><au>Gravey, Annie</au><au>Lorenz, Pascal</au><au>Chemouil, Prosper</au><au>Freire, Mário Marques</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models</atitle><btitle>Lecture notes in computer science</btitle><date>2004</date><risdate>2004</risdate><spage>297</spage><epage>306</epage><pages>297-306</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540235514</isbn><isbn>3540235515</isbn><eisbn>3540301976</eisbn><eisbn>9783540301974</eisbn><abstract>Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that are invariant across a range of time scales, such as self-similarity, LRD and multifractality. These properties have a significant impact on network performance and, therefore, traffic models must be able to incorporate them in their mathematical structure and parameter inference procedures.
In this work, we address the modeling of network traffic using a multi-time-scale framework. We evaluate the performance of two classes of traffic models (Markovian and Lindenmayer-Systems based traffic models) that incorporate the notion of time scale using different approaches: directly in the model structure, in the case of the Lindenmayer-Systems based models, or indirectly through a fitting of the second-order statistics, in the case of the Markovian models. In addition, we address the importance of modeling packet size for IP traffic, an issue that is frequently misregarded. Thus, in each class we evaluate models that are intended to describe only the packet arrival process and models that are intended to describe both the packet arrival and packet size processes: specifically, we consider a Markov modulated Poisson process and a batch Markovian arrival process as examples of Markovian models and a set of four Lindenmayer-Systems based models as examples of non Markovian models that are able to perform a multi-time-scale modeling of network traffic. All models are evaluated by comparing the density function, the autocovariance function, the loss ratio and the average waiting time in queue corresponding to measured traces and to traces synthesized from the fitted models. We resort to the well known Bellcore pOct traffic trace and to a trace measured at the University of Aveiro.
The results obtained show that (i) both the packet arrival and packet size processes need to be modeled for an accurate characterization of IP traffic and (ii) despite the differences in the ways Markovian and L-System models incorporate multiple time scales in their mathematical framework, both can achieve very good performance.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30197-4_30</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2004, p.297-306 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_16367540 |
source | Springer Books |
subjects | Applied sciences Exact sciences and technology L-Systems Markovian arrival processes Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Traffic modeling |
title | Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T19%3A49%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Multi-time-Scale%20Traffic%20Modeling%20Using%20Markovian%20and%20L-Systems%20Models&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Salvador,%20Paulo&rft.date=2004&rft.spage=297&rft.epage=306&rft.pages=297-306&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540235514&rft.isbn_list=3540235515&rft_id=info:doi/10.1007/978-3-540-30197-4_30&rft_dat=%3Cpascalfrancis_sprin%3E16367540%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540301976&rft.eisbn_list=9783540301974&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |