A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks

A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks

The IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Funabiki, N., Sugano, A., Higashino, T.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Communication networks
Communication standards
Information science
Intelligent networks
Media Access Protocol
Metropolitan area networks
Payloads
Proposals
Telecommunication traffic
Traffic control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 232
container_issue
container_start_page 229
container_title
container_volume
creator Funabiki, N.
Sugano, A.
Higashino, T.
description The IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of ICRP is to maximize the number of satisfied requests by finding a proper channel assignment, such that no established connection is not only reassigned a channel, but also any pair of active connections does not interfere each other. We propose a minimal-state processing search algorithm for ICRP (MIPS/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.
doi_str_mv 10.1109/AINA.2003.1192877
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1192877</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1192877</ieee_id><sourcerecordid>1192877</sourcerecordid><originalsourceid>FETCH-LOGICAL-i262t-a67833bf8027ec2f9a353f4126276059bbc8b39a7bf9571f692b515705ddb1343</originalsourceid><addsrcrecordid>eNotUF9LwzAcDIigzn0A8SVfoDN_mqZ5rJt_BkMR9HkkWbJG26Tm1yF-e6vuXo7juIM7hK4oWVBK1E2zfmoWjBA-ScVqKU_QBZGVElSRSp6hOcA7mVAKUZbsHH02eMhpSKA7nDzWuA8x9LorYNSj-_WsAwhxj8HpbFusu33KYWx77FPGAZJtc4rpANi2OkbX4ewO8Jc0nesBh4hXL6tbHN34lfIHXKJTrztw8yPP0Nv93evysdg8P6yXzaYIrGJjoStZc258TZh0lnmlueC-pJMpKyKUMbY2XGlpvBKS-koxI6iQROx2hvKSz9D1f29wzm2HPK3K39vjK_wH33xZSg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Funabiki, N. ; Sugano, A. ; Higashino, T.</creator><creatorcontrib>Funabiki, N. ; Sugano, A. ; Higashino, T.</creatorcontrib><description>The IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of ICRP is to maximize the number of satisfied requests by finding a proper channel assignment, such that no established connection is not only reassigned a channel, but also any pair of active connections does not interfere each other. We propose a minimal-state processing search algorithm for ICRP (MIPS/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.</description><identifier>ISBN: 0769519067</identifier><identifier>ISBN: 9780769519067</identifier><identifier>DOI: 10.1109/AINA.2003.1192877</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communication networks ; Communication standards ; Information science ; Intelligent networks ; Media Access Protocol ; Metropolitan area networks ; Payloads ; Proposals ; Telecommunication traffic ; Traffic control</subject><ispartof>17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003, 2003, p.229-232</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/1192877$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27912,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1192877$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Funabiki, N.</creatorcontrib><creatorcontrib>Sugano, A.</creatorcontrib><creatorcontrib>Higashino, T.</creatorcontrib><title>A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks</title><title>17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003</title><addtitle>AINA</addtitle><description>The IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of ICRP is to maximize the number of satisfied requests by finding a proper channel assignment, such that no established connection is not only reassigned a channel, but also any pair of active connections does not interfere each other. We propose a minimal-state processing search algorithm for ICRP (MIPS/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.</description><subject>Communication networks</subject><subject>Communication standards</subject><subject>Information science</subject><subject>Intelligent networks</subject><subject>Media Access Protocol</subject><subject>Metropolitan area networks</subject><subject>Payloads</subject><subject>Proposals</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><isbn>0769519067</isbn><isbn>9780769519067</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotUF9LwzAcDIigzn0A8SVfoDN_mqZ5rJt_BkMR9HkkWbJG26Tm1yF-e6vuXo7juIM7hK4oWVBK1E2zfmoWjBA-ScVqKU_QBZGVElSRSp6hOcA7mVAKUZbsHH02eMhpSKA7nDzWuA8x9LorYNSj-_WsAwhxj8HpbFusu33KYWx77FPGAZJtc4rpANi2OkbX4ewO8Jc0nesBh4hXL6tbHN34lfIHXKJTrztw8yPP0Nv93evysdg8P6yXzaYIrGJjoStZc258TZh0lnmlueC-pJMpKyKUMbY2XGlpvBKS-koxI6iQROx2hvKSz9D1f29wzm2HPK3K39vjK_wH33xZSg</recordid><startdate>20030101</startdate><enddate>20030101</enddate><creator>Funabiki, N.</creator><creator>Sugano, A.</creator><creator>Higashino, T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20030101</creationdate><title>A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks</title><author>Funabiki, N. ; Sugano, A. ; Higashino, T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i262t-a67833bf8027ec2f9a353f4126276059bbc8b39a7bf9571f692b515705ddb1343</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Communication networks</topic><topic>Communication standards</topic><topic>Information science</topic><topic>Intelligent networks</topic><topic>Media Access Protocol</topic><topic>Metropolitan area networks</topic><topic>Payloads</topic><topic>Proposals</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Funabiki, N.</creatorcontrib><creatorcontrib>Sugano, A.</creatorcontrib><creatorcontrib>Higashino, T.</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 Electronic Library (IEL)</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>Funabiki, N.</au><au>Sugano, A.</au><au>Higashino, T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks</atitle><btitle>17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003</btitle><stitle>AINA</stitle><date>2003-01-01</date><risdate>2003</risdate><spage>229</spage><epage>232</epage><pages>229-232</pages><isbn>0769519067</isbn><isbn>9780769519067</isbn><abstract>The IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of ICRP is to maximize the number of satisfied requests by finding a proper channel assignment, such that no established connection is not only reassigned a channel, but also any pair of active connections does not interfere each other. We propose a minimal-state processing search algorithm for ICRP (MIPS/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.</abstract><pub>IEEE</pub><doi>10.1109/AINA.2003.1192877</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769519067
ispartof 17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003, 2003, p.229-232
issn
language eng
recordid cdi_ieee_primary_1192877
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Communication networks
Communication standards
Information science
Intelligent networks
Media Access Protocol
Metropolitan area networks
Payloads
Proposals
Telecommunication traffic
Traffic control
title A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T00%3A21%3A02IST&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=A%20proposal%20of%20a%20minimal-state%20processing%20search%20algorithm%20for%20isochronous%20channel%20reuse%20problems%20in%20DQDB%20networks&rft.btitle=17th%20International%20Conference%20on%20Advanced%20Information%20Networking%20and%20Applications,%202003.%20AINA%202003&rft.au=Funabiki,%20N.&rft.date=2003-01-01&rft.spage=229&rft.epage=232&rft.pages=229-232&rft.isbn=0769519067&rft.isbn_list=9780769519067&rft_id=info:doi/10.1109/AINA.2003.1192877&rft_dat=%3Cieee_6IE%3E1192877%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=1192877&rfr_iscdi=true