Link dimensioning in WDM networks with dynamic traffic grooming
This paper presents an analytical model to determine the number of required wavelengths to meet a specified grade of service (GoS) in WDM networks with dynamic grooming capabilities. The GoS is defined in terms of overall call blocking probability in the system. Traffic consists of two rate streams,...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1655 |
|---|---|
| container_issue | |
| container_start_page | 1652 |
| container_title | |
| container_volume | |
| creator | Morsharaf, K. Lamadaris, I. Talim, J. Shokrani, A. |
| description | This paper presents an analytical model to determine the number of required wavelengths to meet a specified grade of service (GoS) in WDM networks with dynamic grooming capabilities. The GoS is defined in terms of overall call blocking probability in the system. Traffic consists of two rate streams, low-rate and high-rate. For each traffic stream, call interarrival and holding times are exponentially distributed. Two wavelength assignment strategies, random and first-fit, are considered to accommodate the calls in the network, in the case of random assignment, the system can be formulated as a Markov process from which a product form solution can be approximated the overall call blocking probabilities. Numerical and simulation results show that in low traffic regime this formula is a lower bound for the random assignment and an upper bound for the first-fit assignment. Numerically, we show that the product form formula can be used to dimension the network, when implementing the first-fit assignment strategy |
| doi_str_mv | 10.1109/CCECE.2005.1557300 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1557300</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1557300</ieee_id><sourcerecordid>1557300</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1340-8e0d8a353d43355a0c9724e7b33e7b2ba8cc46324b924478a09d72fa71d02c103</originalsourceid><addsrcrecordid>eNotj81KxDAUhYM_YGf0BXSTF2i9yU2a25VIrT9QcaO4HNImHePYVNrCMG9vwdmcb3P4DoexawGZEFDclmVVVpkE0JnQ2iDACUukNnlqQOWnbAWGAIlIyzOWAClIjaHigq2m6RsAFOUqYXd1iDvuQu_jFIYY4paHyD8fXnn0834YdxPfh_mLu0O0fWj5PNquW7gdh6Ff2pfsvLM_k786cs0-Hqv38jmt355eyvs6DQKXZfLgyKJGpxC1ttAWRipvGsQlZGOpbVWOUjWFVMqQhcIZ2VkjHMhWAK7Zzb83eO83v2Po7XjYHI_jH9XKSZo</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Link dimensioning in WDM networks with dynamic traffic grooming</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Morsharaf, K. ; Lamadaris, I. ; Talim, J. ; Shokrani, A.</creator><creatorcontrib>Morsharaf, K. ; Lamadaris, I. ; Talim, J. ; Shokrani, A.</creatorcontrib><description>This paper presents an analytical model to determine the number of required wavelengths to meet a specified grade of service (GoS) in WDM networks with dynamic grooming capabilities. The GoS is defined in terms of overall call blocking probability in the system. Traffic consists of two rate streams, low-rate and high-rate. For each traffic stream, call interarrival and holding times are exponentially distributed. Two wavelength assignment strategies, random and first-fit, are considered to accommodate the calls in the network, in the case of random assignment, the system can be formulated as a Markov process from which a product form solution can be approximated the overall call blocking probabilities. Numerical and simulation results show that in low traffic regime this formula is a lower bound for the random assignment and an upper bound for the first-fit assignment. Numerically, we show that the product form formula can be used to dimension the network, when implementing the first-fit assignment strategy</description><identifier>ISSN: 0840-7789</identifier><identifier>ISBN: 0780388852</identifier><identifier>ISBN: 9780780388857</identifier><identifier>EISSN: 2576-7046</identifier><identifier>DOI: 10.1109/CCECE.2005.1557300</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Bandwidth ; Computer networks ; Intelligent networks ; Markov processes ; Telecommunication traffic ; Traffic control ; Wavelength assignment ; Wavelength division multiplexing ; WDM networks</subject><ispartof>Canadian Conference on Electrical and Computer Engineering, 2005, 2005, p.1652-1655</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1557300$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4040,4041,27916,54911</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1557300$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Morsharaf, K.</creatorcontrib><creatorcontrib>Lamadaris, I.</creatorcontrib><creatorcontrib>Talim, J.</creatorcontrib><creatorcontrib>Shokrani, A.</creatorcontrib><title>Link dimensioning in WDM networks with dynamic traffic grooming</title><title>Canadian Conference on Electrical and Computer Engineering, 2005</title><addtitle>CCECE</addtitle><description>This paper presents an analytical model to determine the number of required wavelengths to meet a specified grade of service (GoS) in WDM networks with dynamic grooming capabilities. The GoS is defined in terms of overall call blocking probability in the system. Traffic consists of two rate streams, low-rate and high-rate. For each traffic stream, call interarrival and holding times are exponentially distributed. Two wavelength assignment strategies, random and first-fit, are considered to accommodate the calls in the network, in the case of random assignment, the system can be formulated as a Markov process from which a product form solution can be approximated the overall call blocking probabilities. Numerical and simulation results show that in low traffic regime this formula is a lower bound for the random assignment and an upper bound for the first-fit assignment. Numerically, we show that the product form formula can be used to dimension the network, when implementing the first-fit assignment strategy</description><subject>Analytical models</subject><subject>Bandwidth</subject><subject>Computer networks</subject><subject>Intelligent networks</subject><subject>Markov processes</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Wavelength assignment</subject><subject>Wavelength division multiplexing</subject><subject>WDM networks</subject><issn>0840-7789</issn><issn>2576-7046</issn><isbn>0780388852</isbn><isbn>9780780388857</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81KxDAUhYM_YGf0BXSTF2i9yU2a25VIrT9QcaO4HNImHePYVNrCMG9vwdmcb3P4DoexawGZEFDclmVVVpkE0JnQ2iDACUukNnlqQOWnbAWGAIlIyzOWAClIjaHigq2m6RsAFOUqYXd1iDvuQu_jFIYY4paHyD8fXnn0834YdxPfh_mLu0O0fWj5PNquW7gdh6Ff2pfsvLM_k786cs0-Hqv38jmt355eyvs6DQKXZfLgyKJGpxC1ttAWRipvGsQlZGOpbVWOUjWFVMqQhcIZ2VkjHMhWAK7Zzb83eO83v2Po7XjYHI_jH9XKSZo</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Morsharaf, K.</creator><creator>Lamadaris, I.</creator><creator>Talim, J.</creator><creator>Shokrani, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Link dimensioning in WDM networks with dynamic traffic grooming</title><author>Morsharaf, K. ; Lamadaris, I. ; Talim, J. ; Shokrani, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1340-8e0d8a353d43355a0c9724e7b33e7b2ba8cc46324b924478a09d72fa71d02c103</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Analytical models</topic><topic>Bandwidth</topic><topic>Computer networks</topic><topic>Intelligent networks</topic><topic>Markov processes</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Wavelength assignment</topic><topic>Wavelength division multiplexing</topic><topic>WDM networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Morsharaf, K.</creatorcontrib><creatorcontrib>Lamadaris, I.</creatorcontrib><creatorcontrib>Talim, J.</creatorcontrib><creatorcontrib>Shokrani, A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Morsharaf, K.</au><au>Lamadaris, I.</au><au>Talim, J.</au><au>Shokrani, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Link dimensioning in WDM networks with dynamic traffic grooming</atitle><btitle>Canadian Conference on Electrical and Computer Engineering, 2005</btitle><stitle>CCECE</stitle><date>2005</date><risdate>2005</risdate><spage>1652</spage><epage>1655</epage><pages>1652-1655</pages><issn>0840-7789</issn><eissn>2576-7046</eissn><isbn>0780388852</isbn><isbn>9780780388857</isbn><abstract>This paper presents an analytical model to determine the number of required wavelengths to meet a specified grade of service (GoS) in WDM networks with dynamic grooming capabilities. The GoS is defined in terms of overall call blocking probability in the system. Traffic consists of two rate streams, low-rate and high-rate. For each traffic stream, call interarrival and holding times are exponentially distributed. Two wavelength assignment strategies, random and first-fit, are considered to accommodate the calls in the network, in the case of random assignment, the system can be formulated as a Markov process from which a product form solution can be approximated the overall call blocking probabilities. Numerical and simulation results show that in low traffic regime this formula is a lower bound for the random assignment and an upper bound for the first-fit assignment. Numerically, we show that the product form formula can be used to dimension the network, when implementing the first-fit assignment strategy</abstract><pub>IEEE</pub><doi>10.1109/CCECE.2005.1557300</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0840-7789 |
| ispartof | Canadian Conference on Electrical and Computer Engineering, 2005, 2005, p.1652-1655 |
| issn | 0840-7789 2576-7046 |
| language | eng |
| recordid | cdi_ieee_primary_1557300 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Analytical models Bandwidth Computer networks Intelligent networks Markov processes Telecommunication traffic Traffic control Wavelength assignment Wavelength division multiplexing WDM networks |
| title | Link dimensioning in WDM networks with dynamic traffic grooming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T23%3A22%3A08IST&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=Link%20dimensioning%20in%20WDM%20networks%20with%20dynamic%20traffic%20grooming&rft.btitle=Canadian%20Conference%20on%20Electrical%20and%20Computer%20Engineering,%202005&rft.au=Morsharaf,%20K.&rft.date=2005&rft.spage=1652&rft.epage=1655&rft.pages=1652-1655&rft.issn=0840-7789&rft.eissn=2576-7046&rft.isbn=0780388852&rft.isbn_list=9780780388857&rft_id=info:doi/10.1109/CCECE.2005.1557300&rft_dat=%3Cieee_6IE%3E1557300%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1557300&rfr_iscdi=true |