Issues in Gradient-Based Adaptive and Distributed Schemes for Dynamic Network Management
Final technical rept. Apr 1988-Apr 1989
SYRACUSE UNIV NY
Pagination or Media Count:
This report details work which proceeded in three primary areas 1 Algorithm performance, 2 flow control of real-time traffic and 3 scheduling mechanisms for real-time traffic. Algorithm performance was made between Gallaghers distributed datagram algorithm, the CODEC virtual circuit, and the Arpanet datagram primarily single path algorithms. Results on the comparative mean-delay performance study includes the ability of gradient-based algorithms to out-perform their shortest path counterparts, especially under moderate to heavy traffic. A key research issue was the use of Perturbation Analysis to obtain gradient estimates on-line without imposing any queueing modeling assumptions on the network. The approach on real-time traffic control research was toward developing algorithms to reduce packet loss end-to-end due to deadline constraints. It was shown that it is advantageous to apply flow control that deliberately rejects or discards portions of the incoming traffic. Various policies that were examined included traffic rejection as a function of queue length and LIFO Service disciplines. Results, simulation, analysis and mathematical proofs are included. Keywords Routing algorithms, Flow control, Queueing systems.
- Radio Communications