Loading…
MMPP-2 approximation of aggregate IPPs with application to expedited forwarding class in ipbased networks
In this paper, we investigate the suitability of a two state Markov Modulated Poisson Process (MMPP-2) approximation to the superposition of n homogeneous Interrupted Poisson Process (IPP) streams which pass through a series of m homogeneous network nodes. Earlier, such approximations have been atte...
Saved in:
Main Author: | |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 498 |
container_issue | |
container_start_page | 494 |
container_title | |
container_volume | |
creator | Anjum, B. |
description | In this paper, we investigate the suitability of a two state Markov Modulated Poisson Process (MMPP-2) approximation to the superposition of n homogeneous Interrupted Poisson Process (IPP) streams which pass through a series of m homogeneous network nodes. Earlier, such approximations have been attempted with the following restrictions: a) only a single node, b) deterministic service rate and c) at most a few hundred streams. We compare the performance of an MMPP-2 approximation to superposed IPPs for increased number of nodes (5, 7, 10), for exponential service rates and for 500 to 2500 IPP streams, each of which is better reflective of a real IP network scenario. Detailed simulation results show that the MMPP-2 approximation works exceedingly well with less than 4% average relative error and less than 6% maximum error. Furthermore, the approximation improves as the number of arriving IPPs, i.e., n increases. A subsequent example shows that this model can be utilized to calculate bandwidth bounds to ensure QoS for aggregate VoIP calls using the Expedited Forwarding class in the IP network. |
doi_str_mv | 10.1109/ICCT.2011.6157925 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6157925</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6157925</ieee_id><sourcerecordid>6157925</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-5e2c17719b94316015b7f29eb2c9e60eb3aeaef80e6659228b9cf0a7029582c13</originalsourceid><addsrcrecordid>eNpFUMtKxDAUjYigjvMB4iY_0DE3naTNUoqPwgx20f2QtLc1WpuSBDr-vZUZ8GwOl_OAewi5B7YBYOqxLIp6wxnARoLIFBcX5BYk8HybMsEu_w-prsk6hE-2QMpcgbghdr-vqoRTPU3eHe23jtaN1HVU973HXkekZVUFOtv48WcabHOyREfxOGFrI7a0c37WvrVjT5tBh0DtSO1kdFi0EePs_Fe4I1edHgKuz7wi9ctzXbwlu_fXsnjaJVaxmAjkDWQZKKO2KUgGwmQdV2h4o1AyNKlGjV3OUEqhOM-NajqmM8aVyJdouiIPp1qLiIfJLy_5n8N5mfQXiflYNQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>MMPP-2 approximation of aggregate IPPs with application to expedited forwarding class in ipbased networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Anjum, B.</creator><creatorcontrib>Anjum, B.</creatorcontrib><description>In this paper, we investigate the suitability of a two state Markov Modulated Poisson Process (MMPP-2) approximation to the superposition of n homogeneous Interrupted Poisson Process (IPP) streams which pass through a series of m homogeneous network nodes. Earlier, such approximations have been attempted with the following restrictions: a) only a single node, b) deterministic service rate and c) at most a few hundred streams. We compare the performance of an MMPP-2 approximation to superposed IPPs for increased number of nodes (5, 7, 10), for exponential service rates and for 500 to 2500 IPP streams, each of which is better reflective of a real IP network scenario. Detailed simulation results show that the MMPP-2 approximation works exceedingly well with less than 4% average relative error and less than 6% maximum error. Furthermore, the approximation improves as the number of arriving IPPs, i.e., n increases. A subsequent example shows that this model can be utilized to calculate bandwidth bounds to ensure QoS for aggregate VoIP calls using the Expedited Forwarding class in the IP network.</description><identifier>ISBN: 1612843069</identifier><identifier>ISBN: 9781612843063</identifier><identifier>EISBN: 1612843050</identifier><identifier>EISBN: 9781612843070</identifier><identifier>EISBN: 9781612843056</identifier><identifier>EISBN: 1612843077</identifier><identifier>DOI: 10.1109/ICCT.2011.6157925</identifier><language>eng</language><publisher>IEEE</publisher><subject>aggregate VoIP ; Aggregates ; Approximation methods ; Asynchronous transfer mode ; Bandwidth ; bandwidth allocation ; Computational modeling ; Delay ; MMPP-2 approximation ; Multiplexing ; quality of service</subject><ispartof>2011 IEEE 13th International Conference on Communication Technology, 2011, p.494-498</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6157925$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6157925$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Anjum, B.</creatorcontrib><title>MMPP-2 approximation of aggregate IPPs with application to expedited forwarding class in ipbased networks</title><title>2011 IEEE 13th International Conference on Communication Technology</title><addtitle>ICCT</addtitle><description>In this paper, we investigate the suitability of a two state Markov Modulated Poisson Process (MMPP-2) approximation to the superposition of n homogeneous Interrupted Poisson Process (IPP) streams which pass through a series of m homogeneous network nodes. Earlier, such approximations have been attempted with the following restrictions: a) only a single node, b) deterministic service rate and c) at most a few hundred streams. We compare the performance of an MMPP-2 approximation to superposed IPPs for increased number of nodes (5, 7, 10), for exponential service rates and for 500 to 2500 IPP streams, each of which is better reflective of a real IP network scenario. Detailed simulation results show that the MMPP-2 approximation works exceedingly well with less than 4% average relative error and less than 6% maximum error. Furthermore, the approximation improves as the number of arriving IPPs, i.e., n increases. A subsequent example shows that this model can be utilized to calculate bandwidth bounds to ensure QoS for aggregate VoIP calls using the Expedited Forwarding class in the IP network.</description><subject>aggregate VoIP</subject><subject>Aggregates</subject><subject>Approximation methods</subject><subject>Asynchronous transfer mode</subject><subject>Bandwidth</subject><subject>bandwidth allocation</subject><subject>Computational modeling</subject><subject>Delay</subject><subject>MMPP-2 approximation</subject><subject>Multiplexing</subject><subject>quality of service</subject><isbn>1612843069</isbn><isbn>9781612843063</isbn><isbn>1612843050</isbn><isbn>9781612843070</isbn><isbn>9781612843056</isbn><isbn>1612843077</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFUMtKxDAUjYigjvMB4iY_0DE3naTNUoqPwgx20f2QtLc1WpuSBDr-vZUZ8GwOl_OAewi5B7YBYOqxLIp6wxnARoLIFBcX5BYk8HybMsEu_w-prsk6hE-2QMpcgbghdr-vqoRTPU3eHe23jtaN1HVU973HXkekZVUFOtv48WcabHOyREfxOGFrI7a0c37WvrVjT5tBh0DtSO1kdFi0EePs_Fe4I1edHgKuz7wi9ctzXbwlu_fXsnjaJVaxmAjkDWQZKKO2KUgGwmQdV2h4o1AyNKlGjV3OUEqhOM-NajqmM8aVyJdouiIPp1qLiIfJLy_5n8N5mfQXiflYNQ</recordid><startdate>201109</startdate><enddate>201109</enddate><creator>Anjum, B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201109</creationdate><title>MMPP-2 approximation of aggregate IPPs with application to expedited forwarding class in ipbased networks</title><author>Anjum, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-5e2c17719b94316015b7f29eb2c9e60eb3aeaef80e6659228b9cf0a7029582c13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>aggregate VoIP</topic><topic>Aggregates</topic><topic>Approximation methods</topic><topic>Asynchronous transfer mode</topic><topic>Bandwidth</topic><topic>bandwidth allocation</topic><topic>Computational modeling</topic><topic>Delay</topic><topic>MMPP-2 approximation</topic><topic>Multiplexing</topic><topic>quality of service</topic><toplevel>online_resources</toplevel><creatorcontrib>Anjum, B.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Anjum, B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>MMPP-2 approximation of aggregate IPPs with application to expedited forwarding class in ipbased networks</atitle><btitle>2011 IEEE 13th International Conference on Communication Technology</btitle><stitle>ICCT</stitle><date>2011-09</date><risdate>2011</risdate><spage>494</spage><epage>498</epage><pages>494-498</pages><isbn>1612843069</isbn><isbn>9781612843063</isbn><eisbn>1612843050</eisbn><eisbn>9781612843070</eisbn><eisbn>9781612843056</eisbn><eisbn>1612843077</eisbn><abstract>In this paper, we investigate the suitability of a two state Markov Modulated Poisson Process (MMPP-2) approximation to the superposition of n homogeneous Interrupted Poisson Process (IPP) streams which pass through a series of m homogeneous network nodes. Earlier, such approximations have been attempted with the following restrictions: a) only a single node, b) deterministic service rate and c) at most a few hundred streams. We compare the performance of an MMPP-2 approximation to superposed IPPs for increased number of nodes (5, 7, 10), for exponential service rates and for 500 to 2500 IPP streams, each of which is better reflective of a real IP network scenario. Detailed simulation results show that the MMPP-2 approximation works exceedingly well with less than 4% average relative error and less than 6% maximum error. Furthermore, the approximation improves as the number of arriving IPPs, i.e., n increases. A subsequent example shows that this model can be utilized to calculate bandwidth bounds to ensure QoS for aggregate VoIP calls using the Expedited Forwarding class in the IP network.</abstract><pub>IEEE</pub><doi>10.1109/ICCT.2011.6157925</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1612843069 |
ispartof | 2011 IEEE 13th International Conference on Communication Technology, 2011, p.494-498 |
issn | |
language | eng |
recordid | cdi_ieee_primary_6157925 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | aggregate VoIP Aggregates Approximation methods Asynchronous transfer mode Bandwidth bandwidth allocation Computational modeling Delay MMPP-2 approximation Multiplexing quality of service |
title | MMPP-2 approximation of aggregate IPPs with application to expedited forwarding class in ipbased networks |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T23%3A08%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=MMPP-2%20approximation%20of%20aggregate%20IPPs%20with%20application%20to%20expedited%20forwarding%20class%20in%20ipbased%20networks&rft.btitle=2011%20IEEE%2013th%20International%20Conference%20on%20Communication%20Technology&rft.au=Anjum,%20B.&rft.date=2011-09&rft.spage=494&rft.epage=498&rft.pages=494-498&rft.isbn=1612843069&rft.isbn_list=9781612843063&rft_id=info:doi/10.1109/ICCT.2011.6157925&rft.eisbn=1612843050&rft.eisbn_list=9781612843070&rft.eisbn_list=9781612843056&rft.eisbn_list=1612843077&rft_dat=%3Cieee_6IE%3E6157925%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-5e2c17719b94316015b7f29eb2c9e60eb3aeaef80e6659228b9cf0a7029582c13%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6157925&rfr_iscdi=true |