An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP

Takeshi Murakami, Tomoaki Takazawa, Michito Takahashi, Masaki Bandai, Iwao Sasase

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

1 Citation (Scopus)

Abstract

In order to improve both performances of the renewing time and the number of hops, we propose an adaptive Resource reSerVation Protocol (RSVP) connection renewing scheme using the address of neighbor routers in Mobile IP. In the proposed scheme, in order to renew RSVP connection after handoff of a Mobile Node (MM), each router on RSVP connection records the IP address of the downstream router in addition to the IP address of the upstream router, and the MN sends a SEARCH message. Since the router in the existing RSVP connection renews RSVP connection by means of comparing the IP address of the upstream router, the IP address of the downstream router, and the SEARCH message, the proposed scheme can renew RSVP connection neither setting up whole RSVP connection nor adding RSVP connection. We evaluate the renewing time and the number of hops of the proposed scheme and the conventional schemes by means of computer simulations. At the result, we show that the proposed scheme can improve both performances of the renewing time and the number of hops compared with the conventional schemes.

Original languageEnglish
Title of host publicationIEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings
EditorsF. Gebali
Pages875-878
Number of pages4
VolumeII
Publication statusPublished - 2003
Event2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada
Duration: 2003 Aug 282003 Aug 30

Other

Other2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
CountryCanada
CityVictoria, B.C.
Period03/8/2803/8/30

Fingerprint

Routers
Computer simulation

ASJC Scopus subject areas

  • Signal Processing

Cite this

Murakami, T., Takazawa, T., Takahashi, M., Bandai, M., & Sasase, I. (2003). An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP. In F. Gebali (Ed.), IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings (Vol. II, pp. 875-878)

An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP. / Murakami, Takeshi; Takazawa, Tomoaki; Takahashi, Michito; Bandai, Masaki; Sasase, Iwao.

IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. ed. / F. Gebali. Vol. II 2003. p. 875-878.

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

Murakami, T, Takazawa, T, Takahashi, M, Bandai, M & Sasase, I 2003, An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP. in F Gebali (ed.), IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. vol. II, pp. 875-878, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada, 03/8/28.
Murakami T, Takazawa T, Takahashi M, Bandai M, Sasase I. An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP. In Gebali F, editor, IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. Vol. II. 2003. p. 875-878
Murakami, Takeshi ; Takazawa, Tomoaki ; Takahashi, Michito ; Bandai, Masaki ; Sasase, Iwao. / An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP. IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings. editor / F. Gebali. Vol. II 2003. pp. 875-878
@inproceedings{18667b2d55cb408bb80edd77e78cf800,
title = "An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP",
abstract = "In order to improve both performances of the renewing time and the number of hops, we propose an adaptive Resource reSerVation Protocol (RSVP) connection renewing scheme using the address of neighbor routers in Mobile IP. In the proposed scheme, in order to renew RSVP connection after handoff of a Mobile Node (MM), each router on RSVP connection records the IP address of the downstream router in addition to the IP address of the upstream router, and the MN sends a SEARCH message. Since the router in the existing RSVP connection renews RSVP connection by means of comparing the IP address of the upstream router, the IP address of the downstream router, and the SEARCH message, the proposed scheme can renew RSVP connection neither setting up whole RSVP connection nor adding RSVP connection. We evaluate the renewing time and the number of hops of the proposed scheme and the conventional schemes by means of computer simulations. At the result, we show that the proposed scheme can improve both performances of the renewing time and the number of hops compared with the conventional schemes.",
author = "Takeshi Murakami and Tomoaki Takazawa and Michito Takahashi and Masaki Bandai and Iwao Sasase",
year = "2003",
language = "English",
volume = "II",
pages = "875--878",
editor = "F. Gebali",
booktitle = "IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings",

}

TY - GEN

T1 - An Adaptive RSVP Connection Renewing Scheme Using the Address of Neighbor Routers in Mobile IP

AU - Murakami, Takeshi

AU - Takazawa, Tomoaki

AU - Takahashi, Michito

AU - Bandai, Masaki

AU - Sasase, Iwao

PY - 2003

Y1 - 2003

N2 - In order to improve both performances of the renewing time and the number of hops, we propose an adaptive Resource reSerVation Protocol (RSVP) connection renewing scheme using the address of neighbor routers in Mobile IP. In the proposed scheme, in order to renew RSVP connection after handoff of a Mobile Node (MM), each router on RSVP connection records the IP address of the downstream router in addition to the IP address of the upstream router, and the MN sends a SEARCH message. Since the router in the existing RSVP connection renews RSVP connection by means of comparing the IP address of the upstream router, the IP address of the downstream router, and the SEARCH message, the proposed scheme can renew RSVP connection neither setting up whole RSVP connection nor adding RSVP connection. We evaluate the renewing time and the number of hops of the proposed scheme and the conventional schemes by means of computer simulations. At the result, we show that the proposed scheme can improve both performances of the renewing time and the number of hops compared with the conventional schemes.

AB - In order to improve both performances of the renewing time and the number of hops, we propose an adaptive Resource reSerVation Protocol (RSVP) connection renewing scheme using the address of neighbor routers in Mobile IP. In the proposed scheme, in order to renew RSVP connection after handoff of a Mobile Node (MM), each router on RSVP connection records the IP address of the downstream router in addition to the IP address of the upstream router, and the MN sends a SEARCH message. Since the router in the existing RSVP connection renews RSVP connection by means of comparing the IP address of the upstream router, the IP address of the downstream router, and the SEARCH message, the proposed scheme can renew RSVP connection neither setting up whole RSVP connection nor adding RSVP connection. We evaluate the renewing time and the number of hops of the proposed scheme and the conventional schemes by means of computer simulations. At the result, we show that the proposed scheme can improve both performances of the renewing time and the number of hops compared with the conventional schemes.

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

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

M3 - Conference contribution

VL - II

SP - 875

EP - 878

BT - IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings

A2 - Gebali, F.

ER -