Recommendation-Based Bandwidth Calendaring for Packet Transport Network
This paper proposes a recommendation-based bandwidth calendaring system for packet transport networks. The system provides a user-portal interface with which users can directly reserve packet transport resources. In this regard, the system recommends multi-grade (e.g., multi-price) reservation plans...
Gespeichert in:
| Veröffentlicht in: | IEICE Transactions on Communications 2017/01/01, Vol.E100.B(1), pp.122-130 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 130 |
|---|---|
| container_issue | 1 |
| container_start_page | 122 |
| container_title | IEICE Transactions on Communications |
| container_volume | E100.B |
| creator | KAMAMURA, Shohei HAYASHI, Rie DATE, Hiroki YAMAMOTO, Hiroshi MIYAMURA, Takashi UEMATSU, Yoshihiko GENDA, Kouichi |
| description | This paper proposes a recommendation-based bandwidth calendaring system for packet transport networks. The system provides a user-portal interface with which users can directly reserve packet transport resources. In this regard, the system recommends multi-grade (e.g., multi-price) reservation plans. By adjusting grades of plans in accordance with network resource utilization, this system provides not only reservation flexibility for users but also efficient utilization of network resources. For recommending multi-grade plans, pre-computation of resource allocation is required for every time slot. Because the number of time slots is huge, we also propose an algorithm for fast computation of resource allocation based on time-slot aggregation. Our evaluation suggests that our algorithm can produce a sub-optimal solution within quasi-real time for a large-scale network. We also show that our recommendation-based system can increase the service-provider-revenue in peaky traffic demand environments. |
| doi_str_mv | 10.1587/transcom.2016EBP3126 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1880027807</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2302589187</sourcerecordid><originalsourceid>FETCH-LOGICAL-c510t-f4cbc4b224845de29cd95e3ec69c58218e6ab029f17e1143e3244fd23e2f66ef3</originalsourceid><addsrcrecordid>eNpdkE1Lw0AQhhdRsFb_gYeAFy_Rnf1INkdbahWKFtHzst1MNG2arbtbxH9vQv0onmZgnmdmeAk5B3oFUuXX0Zs2WLe-YhSyyWjOgWUHZAC5kClwIQ_JgBaQpUpCdkxOQlhSCooBG5DpE3biGtvSxNq16cgELJORacuPuoxvydg0_czX7WtSOZ_MjV1hTJ77ixvnY_KA8cP51Sk5qkwT8Oy7DsnL7eR5fJfOHqf345tZaiXQmFbCLqxYMCaUkCWywpaFRI42K6zsPlKYmQVlRQU5AgiOnAlRlYwjq7IMKz4kl7u9G-_etxiiXtfBYtOYFt02aFCKUpYrmnfoxT906ba-7b7TjFMmVQGqp8SOst6F4LHSG1-vjf_UQHWfrv5JV--l22lPO20ZonnFX8n4WNsG_6QJUKpHGn6avSW_sH0zXmPLvwCAy4xt</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2302589187</pqid></control><display><type>article</type><title>Recommendation-Based Bandwidth Calendaring for Packet Transport Network</title><source>Alma/SFX Local Collection</source><creator>KAMAMURA, Shohei ; HAYASHI, Rie ; DATE, Hiroki ; YAMAMOTO, Hiroshi ; MIYAMURA, Takashi ; UEMATSU, Yoshihiko ; GENDA, Kouichi</creator><creatorcontrib>KAMAMURA, Shohei ; HAYASHI, Rie ; DATE, Hiroki ; YAMAMOTO, Hiroshi ; MIYAMURA, Takashi ; UEMATSU, Yoshihiko ; GENDA, Kouichi</creatorcontrib><description>This paper proposes a recommendation-based bandwidth calendaring system for packet transport networks. The system provides a user-portal interface with which users can directly reserve packet transport resources. In this regard, the system recommends multi-grade (e.g., multi-price) reservation plans. By adjusting grades of plans in accordance with network resource utilization, this system provides not only reservation flexibility for users but also efficient utilization of network resources. For recommending multi-grade plans, pre-computation of resource allocation is required for every time slot. Because the number of time slots is huge, we also propose an algorithm for fast computation of resource allocation based on time-slot aggregation. Our evaluation suggests that our algorithm can produce a sub-optimal solution within quasi-real time for a large-scale network. We also show that our recommendation-based system can increase the service-provider-revenue in peaky traffic demand environments.</description><identifier>ISSN: 0916-8516</identifier><identifier>EISSN: 1745-1345</identifier><identifier>DOI: 10.1587/transcom.2016EBP3126</identifier><language>eng</language><publisher>Tokyo: The Institute of Electronics, Information and Communication Engineers</publisher><subject>Algorithms ; Bandwidth ; bandwidth calendaring ; Flexibility ; Networks ; packet transport network ; Packets (communication) ; recommendation ; Reserves ; Resource allocation ; Resource utilization ; SDN controller ; Transportation networks</subject><ispartof>IEICE Transactions on Communications, 2017/01/01, Vol.E100.B(1), pp.122-130</ispartof><rights>2017 The Institute of Electronics, Information and Communication Engineers</rights><rights>Copyright Japan Science and Technology Agency 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c510t-f4cbc4b224845de29cd95e3ec69c58218e6ab029f17e1143e3244fd23e2f66ef3</citedby><cites>FETCH-LOGICAL-c510t-f4cbc4b224845de29cd95e3ec69c58218e6ab029f17e1143e3244fd23e2f66ef3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>KAMAMURA, Shohei</creatorcontrib><creatorcontrib>HAYASHI, Rie</creatorcontrib><creatorcontrib>DATE, Hiroki</creatorcontrib><creatorcontrib>YAMAMOTO, Hiroshi</creatorcontrib><creatorcontrib>MIYAMURA, Takashi</creatorcontrib><creatorcontrib>UEMATSU, Yoshihiko</creatorcontrib><creatorcontrib>GENDA, Kouichi</creatorcontrib><title>Recommendation-Based Bandwidth Calendaring for Packet Transport Network</title><title>IEICE Transactions on Communications</title><addtitle>IEICE Trans. Commun.</addtitle><description>This paper proposes a recommendation-based bandwidth calendaring system for packet transport networks. The system provides a user-portal interface with which users can directly reserve packet transport resources. In this regard, the system recommends multi-grade (e.g., multi-price) reservation plans. By adjusting grades of plans in accordance with network resource utilization, this system provides not only reservation flexibility for users but also efficient utilization of network resources. For recommending multi-grade plans, pre-computation of resource allocation is required for every time slot. Because the number of time slots is huge, we also propose an algorithm for fast computation of resource allocation based on time-slot aggregation. Our evaluation suggests that our algorithm can produce a sub-optimal solution within quasi-real time for a large-scale network. We also show that our recommendation-based system can increase the service-provider-revenue in peaky traffic demand environments.</description><subject>Algorithms</subject><subject>Bandwidth</subject><subject>bandwidth calendaring</subject><subject>Flexibility</subject><subject>Networks</subject><subject>packet transport network</subject><subject>Packets (communication)</subject><subject>recommendation</subject><subject>Reserves</subject><subject>Resource allocation</subject><subject>Resource utilization</subject><subject>SDN controller</subject><subject>Transportation networks</subject><issn>0916-8516</issn><issn>1745-1345</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNpdkE1Lw0AQhhdRsFb_gYeAFy_Rnf1INkdbahWKFtHzst1MNG2arbtbxH9vQv0onmZgnmdmeAk5B3oFUuXX0Zs2WLe-YhSyyWjOgWUHZAC5kClwIQ_JgBaQpUpCdkxOQlhSCooBG5DpE3biGtvSxNq16cgELJORacuPuoxvydg0_czX7WtSOZ_MjV1hTJ77ixvnY_KA8cP51Sk5qkwT8Oy7DsnL7eR5fJfOHqf345tZaiXQmFbCLqxYMCaUkCWywpaFRI42K6zsPlKYmQVlRQU5AgiOnAlRlYwjq7IMKz4kl7u9G-_etxiiXtfBYtOYFt02aFCKUpYrmnfoxT906ba-7b7TjFMmVQGqp8SOst6F4LHSG1-vjf_UQHWfrv5JV--l22lPO20ZonnFX8n4WNsG_6QJUKpHGn6avSW_sH0zXmPLvwCAy4xt</recordid><startdate>20170101</startdate><enddate>20170101</enddate><creator>KAMAMURA, Shohei</creator><creator>HAYASHI, Rie</creator><creator>DATE, Hiroki</creator><creator>YAMAMOTO, Hiroshi</creator><creator>MIYAMURA, Takashi</creator><creator>UEMATSU, Yoshihiko</creator><creator>GENDA, Kouichi</creator><general>The Institute of Electronics, Information and Communication Engineers</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>20170101</creationdate><title>Recommendation-Based Bandwidth Calendaring for Packet Transport Network</title><author>KAMAMURA, Shohei ; HAYASHI, Rie ; DATE, Hiroki ; YAMAMOTO, Hiroshi ; MIYAMURA, Takashi ; UEMATSU, Yoshihiko ; GENDA, Kouichi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c510t-f4cbc4b224845de29cd95e3ec69c58218e6ab029f17e1143e3244fd23e2f66ef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Bandwidth</topic><topic>bandwidth calendaring</topic><topic>Flexibility</topic><topic>Networks</topic><topic>packet transport network</topic><topic>Packets (communication)</topic><topic>recommendation</topic><topic>Reserves</topic><topic>Resource allocation</topic><topic>Resource utilization</topic><topic>SDN controller</topic><topic>Transportation networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>KAMAMURA, Shohei</creatorcontrib><creatorcontrib>HAYASHI, Rie</creatorcontrib><creatorcontrib>DATE, Hiroki</creatorcontrib><creatorcontrib>YAMAMOTO, Hiroshi</creatorcontrib><creatorcontrib>MIYAMURA, Takashi</creatorcontrib><creatorcontrib>UEMATSU, Yoshihiko</creatorcontrib><creatorcontrib>GENDA, Kouichi</creatorcontrib><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEICE Transactions on Communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>KAMAMURA, Shohei</au><au>HAYASHI, Rie</au><au>DATE, Hiroki</au><au>YAMAMOTO, Hiroshi</au><au>MIYAMURA, Takashi</au><au>UEMATSU, Yoshihiko</au><au>GENDA, Kouichi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Recommendation-Based Bandwidth Calendaring for Packet Transport Network</atitle><jtitle>IEICE Transactions on Communications</jtitle><addtitle>IEICE Trans. Commun.</addtitle><date>2017-01-01</date><risdate>2017</risdate><volume>E100.B</volume><issue>1</issue><spage>122</spage><epage>130</epage><pages>122-130</pages><issn>0916-8516</issn><eissn>1745-1345</eissn><abstract>This paper proposes a recommendation-based bandwidth calendaring system for packet transport networks. The system provides a user-portal interface with which users can directly reserve packet transport resources. In this regard, the system recommends multi-grade (e.g., multi-price) reservation plans. By adjusting grades of plans in accordance with network resource utilization, this system provides not only reservation flexibility for users but also efficient utilization of network resources. For recommending multi-grade plans, pre-computation of resource allocation is required for every time slot. Because the number of time slots is huge, we also propose an algorithm for fast computation of resource allocation based on time-slot aggregation. Our evaluation suggests that our algorithm can produce a sub-optimal solution within quasi-real time for a large-scale network. We also show that our recommendation-based system can increase the service-provider-revenue in peaky traffic demand environments.</abstract><cop>Tokyo</cop><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transcom.2016EBP3126</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0916-8516 |
| ispartof | IEICE Transactions on Communications, 2017/01/01, Vol.E100.B(1), pp.122-130 |
| issn | 0916-8516 1745-1345 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1880027807 |
| source | Alma/SFX Local Collection |
| subjects | Algorithms Bandwidth bandwidth calendaring Flexibility Networks packet transport network Packets (communication) recommendation Reserves Resource allocation Resource utilization SDN controller Transportation networks |
| title | Recommendation-Based Bandwidth Calendaring for Packet Transport Network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T09%3A46%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Recommendation-Based%20Bandwidth%20Calendaring%20for%20Packet%20Transport%20Network&rft.jtitle=IEICE%20Transactions%20on%20Communications&rft.au=KAMAMURA,%20Shohei&rft.date=2017-01-01&rft.volume=E100.B&rft.issue=1&rft.spage=122&rft.epage=130&rft.pages=122-130&rft.issn=0916-8516&rft.eissn=1745-1345&rft_id=info:doi/10.1587/transcom.2016EBP3126&rft_dat=%3Cproquest_cross%3E2302589187%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2302589187&rft_id=info:pmid/&rfr_iscdi=true |