A cost-effective approach to selective IP paging scheme using explicit multicast

Sangheon Pack, Kyoungae Kim, Yanghee Choi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we propose a cost-effective IP paging protocol, which can be used for terminal paging in next-generation wireless IP networks. In the existing IP paging protocols, a paging request packet is delivered to access routers belonging to a paging area by unicast or multicast. However, unicast and multicast result in higher cost, so that we present a selective paging algorithm utilizing explicit multicast (xcast). Xcast is a new kind of multicast scheme for small sized groups which uses unicast with low maintenance overhead. In terms of the paging algorithm, we use a selective paging algorithm to minimize the paging cost, by dividing a paging area into several subpaging areas, while meeting the paging delay bound. In addition, we propose flexible grouping algorithms. For the performance analysis, we develop analytical paging cost and delay models based on the random walk model. Using the models, we compare the selective IP paging scheme using xcast with the existing paging schemes that use unicast or multicast. The results indicate that the proposed scheme significantly reduces the paging cost compared with traditional schemes, especially when the transmission cost is relatively less than the processing cost and the delivery path is not long. In addition, our flexible grouping algorithms, which are adaptive to the session-to-mobility ratio, provide less paging cost and guarantee equal to or less paging delay compared with the existing schemes.

Original languageEnglish
Pages (from-to)2577-2594
Number of pages18
JournalComputer Networks
Volume50
Issue number15
DOIs
Publication statusPublished - 2006 Oct 18
Externally publishedYes

Fingerprint

Costs
Routers
Processing

Keywords

  • Explicit multicast
  • IP paging
  • Paging cost
  • Paging delay
  • Performance analysis
  • Selective paging

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

A cost-effective approach to selective IP paging scheme using explicit multicast. / Pack, Sangheon; Kim, Kyoungae; Choi, Yanghee.

In: Computer Networks, Vol. 50, No. 15, 18.10.2006, p. 2577-2594.

Research output: Contribution to journalArticle

Pack, Sangheon ; Kim, Kyoungae ; Choi, Yanghee. / A cost-effective approach to selective IP paging scheme using explicit multicast. In: Computer Networks. 2006 ; Vol. 50, No. 15. pp. 2577-2594.
@article{2eacec592d0f4a99b9e5b0565e00b629,
title = "A cost-effective approach to selective IP paging scheme using explicit multicast",
abstract = "In this paper, we propose a cost-effective IP paging protocol, which can be used for terminal paging in next-generation wireless IP networks. In the existing IP paging protocols, a paging request packet is delivered to access routers belonging to a paging area by unicast or multicast. However, unicast and multicast result in higher cost, so that we present a selective paging algorithm utilizing explicit multicast (xcast). Xcast is a new kind of multicast scheme for small sized groups which uses unicast with low maintenance overhead. In terms of the paging algorithm, we use a selective paging algorithm to minimize the paging cost, by dividing a paging area into several subpaging areas, while meeting the paging delay bound. In addition, we propose flexible grouping algorithms. For the performance analysis, we develop analytical paging cost and delay models based on the random walk model. Using the models, we compare the selective IP paging scheme using xcast with the existing paging schemes that use unicast or multicast. The results indicate that the proposed scheme significantly reduces the paging cost compared with traditional schemes, especially when the transmission cost is relatively less than the processing cost and the delivery path is not long. In addition, our flexible grouping algorithms, which are adaptive to the session-to-mobility ratio, provide less paging cost and guarantee equal to or less paging delay compared with the existing schemes.",
keywords = "Explicit multicast, IP paging, Paging cost, Paging delay, Performance analysis, Selective paging",
author = "Sangheon Pack and Kyoungae Kim and Yanghee Choi",
year = "2006",
month = "10",
day = "18",
doi = "10.1016/j.comnet.2005.09.017",
language = "English",
volume = "50",
pages = "2577--2594",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "15",

}

TY - JOUR

T1 - A cost-effective approach to selective IP paging scheme using explicit multicast

AU - Pack, Sangheon

AU - Kim, Kyoungae

AU - Choi, Yanghee

PY - 2006/10/18

Y1 - 2006/10/18

N2 - In this paper, we propose a cost-effective IP paging protocol, which can be used for terminal paging in next-generation wireless IP networks. In the existing IP paging protocols, a paging request packet is delivered to access routers belonging to a paging area by unicast or multicast. However, unicast and multicast result in higher cost, so that we present a selective paging algorithm utilizing explicit multicast (xcast). Xcast is a new kind of multicast scheme for small sized groups which uses unicast with low maintenance overhead. In terms of the paging algorithm, we use a selective paging algorithm to minimize the paging cost, by dividing a paging area into several subpaging areas, while meeting the paging delay bound. In addition, we propose flexible grouping algorithms. For the performance analysis, we develop analytical paging cost and delay models based on the random walk model. Using the models, we compare the selective IP paging scheme using xcast with the existing paging schemes that use unicast or multicast. The results indicate that the proposed scheme significantly reduces the paging cost compared with traditional schemes, especially when the transmission cost is relatively less than the processing cost and the delivery path is not long. In addition, our flexible grouping algorithms, which are adaptive to the session-to-mobility ratio, provide less paging cost and guarantee equal to or less paging delay compared with the existing schemes.

AB - In this paper, we propose a cost-effective IP paging protocol, which can be used for terminal paging in next-generation wireless IP networks. In the existing IP paging protocols, a paging request packet is delivered to access routers belonging to a paging area by unicast or multicast. However, unicast and multicast result in higher cost, so that we present a selective paging algorithm utilizing explicit multicast (xcast). Xcast is a new kind of multicast scheme for small sized groups which uses unicast with low maintenance overhead. In terms of the paging algorithm, we use a selective paging algorithm to minimize the paging cost, by dividing a paging area into several subpaging areas, while meeting the paging delay bound. In addition, we propose flexible grouping algorithms. For the performance analysis, we develop analytical paging cost and delay models based on the random walk model. Using the models, we compare the selective IP paging scheme using xcast with the existing paging schemes that use unicast or multicast. The results indicate that the proposed scheme significantly reduces the paging cost compared with traditional schemes, especially when the transmission cost is relatively less than the processing cost and the delivery path is not long. In addition, our flexible grouping algorithms, which are adaptive to the session-to-mobility ratio, provide less paging cost and guarantee equal to or less paging delay compared with the existing schemes.

KW - Explicit multicast

KW - IP paging

KW - Paging cost

KW - Paging delay

KW - Performance analysis

KW - Selective paging

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

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

U2 - 10.1016/j.comnet.2005.09.017

DO - 10.1016/j.comnet.2005.09.017

M3 - Article

AN - SCOPUS:33746675000

VL - 50

SP - 2577

EP - 2594

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 15

ER -