Adaptive resource reservation protocol for high-speed resource information advertisement

Masahiro Nishida, Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Satoru Okamoto, Naoaki Yamanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

This paper proposes an adaptive resource reservation protocol for high-speed resource information advertisement. The adaptive resource reservation protocol (ARRP) is a protocol that adaptively decides whether to uses a 1-way reservation scheme or 2-way reservation scheme on the basis of resource information in the route calculation. Examples of the resource information are unreserved bandwidth and unreserved wavelength. The 1-way reservation is used when all links along the calculated route has enough resources. Otherwise, the 2-way reservation is used. In GMPLS (Generalized Multi-Protocol Label Switching) network, the source router decides a label switched path (LSP) route using collected resource information from the network. The resource information is advertised by an OSPFTE (Open Shortest Path First-Traffic Engineering) protocol. If the unreserved resource information of calculated LSP route is too old and inconsistent with the current information, the resources on the LSP route cannot be reserved and thus data loss will be occurred. In order to support realtime unreserved information update, quite a lot of update packet transmissions are needed. It causes increasing of the processing load of all routers. Therefore OSPF-TE cannot advertise real-time unreserved resource information. In the proposed method, when a LSP route is established or released by ARRP, only one packet informs update information of each links along LSP route to all edge routers. The proposed method can support more frequent updates by decreasing the amount of the update packets and can advertise the real-time resource information. By use of the real-time resource information, the proposed method certainly guarantees the reservation of resources on LSP route in spite of the 1-way reservation. By the computation simulation, it is indicated that the number of the control packets in proposed method is one digit less than that in the conventional OSPF-TE. Compared to the OSPF-TE, the proposed method keeps low blocking probability even when traffic occurs more frequently. Thus, it is shown that the proposed method effectively use network resources. copyright

Original languageEnglish
Title of host publication2008 14th Asia-Pacific Conference on Communications, APCC 2008
Publication statusPublished - 2008
Event2008 14th Asia-Pacific Conference on Communications, APCC 2008 - Akihabara, Tokyo, United States
Duration: 2008 Oct 142008 Oct 16

Other

Other2008 14th Asia-Pacific Conference on Communications, APCC 2008
CountryUnited States
CityAkihabara, Tokyo
Period08/10/1408/10/16

Fingerprint

Labels
Routers
resources
Blocking probability
Switching networks
Telecommunication traffic
Bandwidth
Wavelength
traffic
Processing
guarantee

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Nishida, M., Ishikawa, H., Shimizu, S., Arakawa, Y., Okamoto, S., & Yamanaka, N. (2008). Adaptive resource reservation protocol for high-speed resource information advertisement. In 2008 14th Asia-Pacific Conference on Communications, APCC 2008 [4773774]

Adaptive resource reservation protocol for high-speed resource information advertisement. / Nishida, Masahiro; Ishikawa, Hiroyuki; Shimizu, Sho; Arakawa, Yutaka; Okamoto, Satoru; Yamanaka, Naoaki.

2008 14th Asia-Pacific Conference on Communications, APCC 2008. 2008. 4773774.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nishida, M, Ishikawa, H, Shimizu, S, Arakawa, Y, Okamoto, S & Yamanaka, N 2008, Adaptive resource reservation protocol for high-speed resource information advertisement. in 2008 14th Asia-Pacific Conference on Communications, APCC 2008., 4773774, 2008 14th Asia-Pacific Conference on Communications, APCC 2008, Akihabara, Tokyo, United States, 08/10/14.
Nishida M, Ishikawa H, Shimizu S, Arakawa Y, Okamoto S, Yamanaka N. Adaptive resource reservation protocol for high-speed resource information advertisement. In 2008 14th Asia-Pacific Conference on Communications, APCC 2008. 2008. 4773774
Nishida, Masahiro ; Ishikawa, Hiroyuki ; Shimizu, Sho ; Arakawa, Yutaka ; Okamoto, Satoru ; Yamanaka, Naoaki. / Adaptive resource reservation protocol for high-speed resource information advertisement. 2008 14th Asia-Pacific Conference on Communications, APCC 2008. 2008.
@inproceedings{20df23d05d5c4cd0868a3e5b71e036ea,
title = "Adaptive resource reservation protocol for high-speed resource information advertisement",
abstract = "This paper proposes an adaptive resource reservation protocol for high-speed resource information advertisement. The adaptive resource reservation protocol (ARRP) is a protocol that adaptively decides whether to uses a 1-way reservation scheme or 2-way reservation scheme on the basis of resource information in the route calculation. Examples of the resource information are unreserved bandwidth and unreserved wavelength. The 1-way reservation is used when all links along the calculated route has enough resources. Otherwise, the 2-way reservation is used. In GMPLS (Generalized Multi-Protocol Label Switching) network, the source router decides a label switched path (LSP) route using collected resource information from the network. The resource information is advertised by an OSPFTE (Open Shortest Path First-Traffic Engineering) protocol. If the unreserved resource information of calculated LSP route is too old and inconsistent with the current information, the resources on the LSP route cannot be reserved and thus data loss will be occurred. In order to support realtime unreserved information update, quite a lot of update packet transmissions are needed. It causes increasing of the processing load of all routers. Therefore OSPF-TE cannot advertise real-time unreserved resource information. In the proposed method, when a LSP route is established or released by ARRP, only one packet informs update information of each links along LSP route to all edge routers. The proposed method can support more frequent updates by decreasing the amount of the update packets and can advertise the real-time resource information. By use of the real-time resource information, the proposed method certainly guarantees the reservation of resources on LSP route in spite of the 1-way reservation. By the computation simulation, it is indicated that the number of the control packets in proposed method is one digit less than that in the conventional OSPF-TE. Compared to the OSPF-TE, the proposed method keeps low blocking probability even when traffic occurs more frequently. Thus, it is shown that the proposed method effectively use network resources. copyright",
author = "Masahiro Nishida and Hiroyuki Ishikawa and Sho Shimizu and Yutaka Arakawa and Satoru Okamoto and Naoaki Yamanaka",
year = "2008",
language = "English",
isbn = "4885522323",
booktitle = "2008 14th Asia-Pacific Conference on Communications, APCC 2008",

}

TY - GEN

T1 - Adaptive resource reservation protocol for high-speed resource information advertisement

AU - Nishida, Masahiro

AU - Ishikawa, Hiroyuki

AU - Shimizu, Sho

AU - Arakawa, Yutaka

AU - Okamoto, Satoru

AU - Yamanaka, Naoaki

PY - 2008

Y1 - 2008

N2 - This paper proposes an adaptive resource reservation protocol for high-speed resource information advertisement. The adaptive resource reservation protocol (ARRP) is a protocol that adaptively decides whether to uses a 1-way reservation scheme or 2-way reservation scheme on the basis of resource information in the route calculation. Examples of the resource information are unreserved bandwidth and unreserved wavelength. The 1-way reservation is used when all links along the calculated route has enough resources. Otherwise, the 2-way reservation is used. In GMPLS (Generalized Multi-Protocol Label Switching) network, the source router decides a label switched path (LSP) route using collected resource information from the network. The resource information is advertised by an OSPFTE (Open Shortest Path First-Traffic Engineering) protocol. If the unreserved resource information of calculated LSP route is too old and inconsistent with the current information, the resources on the LSP route cannot be reserved and thus data loss will be occurred. In order to support realtime unreserved information update, quite a lot of update packet transmissions are needed. It causes increasing of the processing load of all routers. Therefore OSPF-TE cannot advertise real-time unreserved resource information. In the proposed method, when a LSP route is established or released by ARRP, only one packet informs update information of each links along LSP route to all edge routers. The proposed method can support more frequent updates by decreasing the amount of the update packets and can advertise the real-time resource information. By use of the real-time resource information, the proposed method certainly guarantees the reservation of resources on LSP route in spite of the 1-way reservation. By the computation simulation, it is indicated that the number of the control packets in proposed method is one digit less than that in the conventional OSPF-TE. Compared to the OSPF-TE, the proposed method keeps low blocking probability even when traffic occurs more frequently. Thus, it is shown that the proposed method effectively use network resources. copyright

AB - This paper proposes an adaptive resource reservation protocol for high-speed resource information advertisement. The adaptive resource reservation protocol (ARRP) is a protocol that adaptively decides whether to uses a 1-way reservation scheme or 2-way reservation scheme on the basis of resource information in the route calculation. Examples of the resource information are unreserved bandwidth and unreserved wavelength. The 1-way reservation is used when all links along the calculated route has enough resources. Otherwise, the 2-way reservation is used. In GMPLS (Generalized Multi-Protocol Label Switching) network, the source router decides a label switched path (LSP) route using collected resource information from the network. The resource information is advertised by an OSPFTE (Open Shortest Path First-Traffic Engineering) protocol. If the unreserved resource information of calculated LSP route is too old and inconsistent with the current information, the resources on the LSP route cannot be reserved and thus data loss will be occurred. In order to support realtime unreserved information update, quite a lot of update packet transmissions are needed. It causes increasing of the processing load of all routers. Therefore OSPF-TE cannot advertise real-time unreserved resource information. In the proposed method, when a LSP route is established or released by ARRP, only one packet informs update information of each links along LSP route to all edge routers. The proposed method can support more frequent updates by decreasing the amount of the update packets and can advertise the real-time resource information. By use of the real-time resource information, the proposed method certainly guarantees the reservation of resources on LSP route in spite of the 1-way reservation. By the computation simulation, it is indicated that the number of the control packets in proposed method is one digit less than that in the conventional OSPF-TE. Compared to the OSPF-TE, the proposed method keeps low blocking probability even when traffic occurs more frequently. Thus, it is shown that the proposed method effectively use network resources. copyright

UR - http://www.scopus.com/inward/record.url?scp=66149111285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=66149111285&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:66149111285

SN - 4885522323

SN - 9784885522321

BT - 2008 14th Asia-Pacific Conference on Communications, APCC 2008

ER -