Modeling Concurrent Search in All-IP Heterogeneous Wireless Networks

In this paper, we propose a novel probabilistic method for evaluating concurrent search in all-Internet protocol (IP) networks. It is expected that the next-generation Internet will consist of a variety of wireless-access networks. To be independent of wireless-access technology and to reduce the co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2007-09, Vol.56 (5), p.3137-3148
Main Author: GAU, Rung-Hung
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
All-IP networks
Analytical models
Applied sciences
concurrent search
Costs
Delay
Delay systems
Exact sciences and technology
Interconnected networks
Internet
IP (Internet Protocol)
IP networks
Land mobile radio cellular systems
Mathematical analysis
Mobile radio mobility management
mobility management
Networks
Networks and services in france and abroad
Next generation networking
Paging
performance analysis
Protocols
Radiocommunication specific techniques
Radiocommunications
Searching
Simulation
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Throughput
Transmission and modulation (techniques and equipments)
Wireless networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a novel probabilistic method for evaluating concurrent search in all-Internet protocol (IP) networks. It is expected that the next-generation Internet will consist of a variety of wireless-access networks. To be independent of wireless-access technology and to reduce the cost of mobility management in a heterogeneous environment, we propose integrating IP Paging with concurrent search, which was originally proposed for homogeneous cellular networks. We focus on the case in which the call-arrival process is general and has stationary independent increments. Since a number of calls could arrive simultaneously, the blocking probability is not equal to the probability with the system that is full. Therefore, we resort to renewal theory to accurately derive the blocking probability. Furthermore, we obtain the throughput, the average system size, and the average system delay. Our analytical results are consistent with simulation results.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2007.900480