NAISTAR
Advanced Search
Japanese | English

naistar (NAIST Academic Repository) >
学術リポジトリ naistar / NAIST Academic Repository naistar >
学術雑誌論文 / Journal Article >
情報科学研究科 / Graduate School of Information Science >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10061/6051

Title: Hose Bandwidth Allocation Method to Achieve a Minimum Throughput Assurance Service for Provider Provisioned VPNs
Authors: Shimamura, Masayoshi
Iida, Katsuyoshi
Koga, Hiroyuki
Kadobayashi, Youki
Yamaguchi, Suguru
Issue Date: Dec-2008
Publisher: 情報処理学会
Journal Title: 情報処理学会論文誌
Volume: 49
Issue: 12
Start page: 3967
End page: 3984
Abstract: We propose a hose bandwidth allocation method to achieve a minimum throughput assurance (MTA) service for the hose model. Although the hose model which has been proposed as a novel VPN service model for provider provisioned virtual private networks (PPVPNs) has been proven to be effective for network resource efficiency and configuration complexity there has been no consideration of a mechanism to assure quality of service (QoS) in the hose model. The basic idea of our method is to gather available bandwidth information from inside a network and use it to divide the available bandwidth into hoses on each bottleneck link. We evaluate and clarify our method through computer simulation runs. The simulation results show that our method can achieve an MTA service in the hose model. We propose a hose bandwidth allocation method to achieve a minimum throughput assurance (MTA) service for the hose model. Although the hose model, which has been proposed as a novel VPN service model for provider provisioned virtual private networks (PPVPNs), has been proven to be effective for network resource efficiency and configuration complexity, there has been no consideration of a mechanism to assure quality of service (QoS) in the hose model. The basic idea of our method is to gather available bandwidth information from inside a network and use it to divide the available bandwidth into hoses on each bottleneck link. We evaluate and clarify our method through computer simulation runs. The simulation results show that our method can achieve an MTA service in the hose model.
URI: http://hdl.handle.net/10061/6051
ISSN: 1882-7837
Rights: ここに掲載した著作物の利用に関する注意: 本著作物の著作権は(社)情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。
Notice for the use of this material: The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author(s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof.
Text Version: publisher
Appears in Collections:情報科学研究科 / Graduate School of Information Science

Files in This Item:

File Description SizeFormat
TIPSJ_49_12_3967.pdf36.07 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Copyright (c) 2007-2012 Nara Institute of Science and Technology All Rights Reserved.
DSpace Software Copyright © 2002-2010  Duraspace - Feedback