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.
|Commitee:||Ary, James, Tran, Boi|
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 55/03M(E), Masters Abstracts International|
|Keywords:||Communication network, Packet adaptive routing|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be