A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network

Call admission control (CAC) extends the capabilities of Quality of service (QoS) tools which protect voice traffic from the negative effects of other voice traffic. It does not allow oversubscription of a Voice over Internet Protocol (VoIP) network. To achieve better performance for efficient call...

Full description

Bibliographic Details
Main Author: Mandal, Sandipan
Other Authors: Pendse, Ravi
Format: Others
Language:en_US
Published: 2007
Subjects:
Online Access:http://hdl.handle.net/10057/548
id ndltd-WICHITA-oai-soar.wichita.edu-10057-548
record_format oai_dc
spelling ndltd-WICHITA-oai-soar.wichita.edu-10057-5482013-04-19T20:59:45ZA new alternate routing scheme with endpoint admission control for low call loss probability in VoIP networkMandal, SandipanVoice over Internet Protocol networksElectronic dissertationsCall admission control (CAC) extends the capabilities of Quality of service (QoS) tools which protect voice traffic from the negative effects of other voice traffic. It does not allow oversubscription of a Voice over Internet Protocol (VoIP) network. To achieve better performance for efficient call admission control, various dynamic routings are being proposed. In the dynamic routing mechanism, the condition of the network is learned by observing the network condition via the probe packets and according to the defined threshold, routes are chosen dynamically. In such schemes, various combination of route selection is used such as two routes are used where one is fixed and other is random or two random routes are chosen and after observation one is chosen if it passes the test. Few schemes use a route history table along with the two random routes. But all have some issues like it selects random routes (not considering the number of hops), does not process memorization before admission threshold test, it calculates all selected paths regardless of the fact that they are selected or not, thereby wasting central processing unit (CPU) time and since these uses two routes so obviously the call admission probability is less. In this thesis work, a new dynamic routing scheme is proposed which considers a routing history table with endpoint admission control increasing the call admission probability, makes call establishment time faster and it saves valuable CPU resources. The proposed scheme considers a combination of three routes with routing history table--one is the direct route and the other two are selected randomly from all available routes and the routing history table is used to memorize the rejected calls. CAC tests like Admission Threshold were performed on the selected routes. Various parameters such as delay, packet loss, jitter, latency etc from the probe packets are used to carry out the tests. Performance of the proposed scheme with respect to other dynamic routing schemes is studied using a mathematical / analytical model. Also, effect of arrival rate probe packets on utilization, busy period, waiting period, acceptance probability of calls, probe packets, and the number of successful calls was also studied.Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering."July 2006."Pendse, Ravi2007-04-27T04:26:57Z2007-04-27T04:26:57Z2006-07Thesisxiii, 74 leaves: col. ill., digital, PDF file.707193 bytesapplication/pdft06101http://hdl.handle.net/10057/548en_USCopyright Sandipan Mandal, 2006. All rights reserved.
collection NDLTD
language en_US
format Others
sources NDLTD
topic Voice over Internet Protocol networks
Electronic dissertations
spellingShingle Voice over Internet Protocol networks
Electronic dissertations
Mandal, Sandipan
A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network
description Call admission control (CAC) extends the capabilities of Quality of service (QoS) tools which protect voice traffic from the negative effects of other voice traffic. It does not allow oversubscription of a Voice over Internet Protocol (VoIP) network. To achieve better performance for efficient call admission control, various dynamic routings are being proposed. In the dynamic routing mechanism, the condition of the network is learned by observing the network condition via the probe packets and according to the defined threshold, routes are chosen dynamically. In such schemes, various combination of route selection is used such as two routes are used where one is fixed and other is random or two random routes are chosen and after observation one is chosen if it passes the test. Few schemes use a route history table along with the two random routes. But all have some issues like it selects random routes (not considering the number of hops), does not process memorization before admission threshold test, it calculates all selected paths regardless of the fact that they are selected or not, thereby wasting central processing unit (CPU) time and since these uses two routes so obviously the call admission probability is less. In this thesis work, a new dynamic routing scheme is proposed which considers a routing history table with endpoint admission control increasing the call admission probability, makes call establishment time faster and it saves valuable CPU resources. The proposed scheme considers a combination of three routes with routing history table--one is the direct route and the other two are selected randomly from all available routes and the routing history table is used to memorize the rejected calls. CAC tests like Admission Threshold were performed on the selected routes. Various parameters such as delay, packet loss, jitter, latency etc from the probe packets are used to carry out the tests. Performance of the proposed scheme with respect to other dynamic routing schemes is studied using a mathematical / analytical model. Also, effect of arrival rate probe packets on utilization, busy period, waiting period, acceptance probability of calls, probe packets, and the number of successful calls was also studied. === Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering. === "July 2006."
author2 Pendse, Ravi
author_facet Pendse, Ravi
Mandal, Sandipan
author Mandal, Sandipan
author_sort Mandal, Sandipan
title A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network
title_short A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network
title_full A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network
title_fullStr A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network
title_full_unstemmed A new alternate routing scheme with endpoint admission control for low call loss probability in VoIP network
title_sort new alternate routing scheme with endpoint admission control for low call loss probability in voip network
publishDate 2007
url http://hdl.handle.net/10057/548
work_keys_str_mv AT mandalsandipan anewalternateroutingschemewithendpointadmissioncontrolforlowcalllossprobabilityinvoipnetwork
AT mandalsandipan newalternateroutingschemewithendpointadmissioncontrolforlowcalllossprobabilityinvoipnetwork
_version_ 1716583233482653696