International Journal of Emerging Technology in Computer Science and Electronics ( IJETCSE)
The back-pressure algorithm is a well-known throughput-optimal algorithm. The delay performance may be quite poor even when the traffic load is not close to network capacity. The back-pressure based algorithms can be dividing into two categories: fixed routing and adaptive routing. Backpressure-based adaptive routing algorithms where each packet is routed along a possibly different path. Such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, the authors propose an algorithm which decouples the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues.