Dissertation/Thesis Abstract

Packet adaptive routing in communication network
by Bankapura, Sagar, M.S., California State University, Long Beach, 2016, 49; 10004161
Abstract (Summary)

The idea of the back-pressure algorithm is each data packet in the network has been routed in all possible directions. The effect of routing packets in random directions lead to looping and may end up with the complex network. The back-pressure algorithm also results in packet delay due to packets shooting into random directions and may take a longer path to reach the destination. So considering all the above factors we have developed a new adaptive routing back-pressure algorithm in which the algorithm tries to overcome issues like routing loops and delay problems. The algorithm is designed to overcome the issue by decoupling the routing and scheduling components using the probabilistic method. The scheduling decisions are made using counters called shadow queues. By the proposed new algorithm, we can decrease the network complexity and delay related issues. The practical proof will be shown in the simulations.

Indexing (document details)
Advisor: Chassiakos, Anastasios
Commitee: Ary, James, Tran, Boi
School: California State University, Long Beach
Department: Electrical Engineering
School Location: United States -- California
Source: MAI 55/03M(E), Masters Abstracts International
Subjects: Electrical engineering
Keywords: Communication network, Packet adaptive routing
Publication Number: 10004161
ISBN: 978-1-339-43055-3
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy