Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Hierarchical wireless mobile MPLS mechanism using foreign tracking agent based on M/G/1 with capacity c queueing model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dai, J.-W. ; Chienkuo Inst. of Technol.-Comput. & Commun., Changhua ; Chiang, L.-F.

Within the Multiprotocol Label Switching (MPLS) network, packets with the same forwarding equivalent class can easily be identified by their attached label value. The cross-layer topology associates with access protocol and IP mobility agents. The necessity of agent discovery is reduced and an approach to enhance handoff efficiency proposed. This efficient handoff scheme is performed by a foreign tracking agent (FTA) that plays a role as an administrator of a hierarchy that consists of some foreign agents (FAs) to localise the routing operation of forwarded packets. To analyse the performance of a hierarchical mobile MPLS network, the system is modelled as an M/G/1 system with capacity c, where c represents the number of FAs that can be administered for an FTA. The mean delay time of the FTA to process the forwarding of packets is analysed using M/M/l with capacity c queueing model. The minimum number of FAs that can be administered for an FTA is derived to improve network performance by minimising mean delay time.

Published in:

Communications, IET  (Volume:1 ,  Issue: 5 )