No abstract

No abstract

No abstract

A node ranking scheme provides the necessary structural view for developing algorithms on a network. We present two ranking schemes for the star interconnection network both of which allow constant time order preserving communication. The first scheme is based on a hierarchical view of the star network. It enables one to efficiently implement order preserving ASCEND/DESCEND class of algorithms. This class includes several important algorithms such as the Fast Fourier Transform (FFT) and matrix multiplication. The other ranking scheme gives a flexible pipelined view of the star interconnection network and provides a suitable framework for implementation of pipelined algorithms.

In this paper, we propose a QoS-aware dynamic bandwidth allocation scheme to mitigate congestion problem in gateway-based multi-hop WiFi-based long distance networks and thereby enhance QoS guarantees for real-time traffic. It presents a dynamic slot scheduling scheme which efficiently distributes the unused TDMA time slots among the needy nodes. The distribution process is carried out in a hierarchical manner through the use of parent-child relationship of a tree topology. By doing so, end-to-end performance of real-time traffic is enhanced manifold. Furthermore, the proposed protocol provides assured packet forwarding for already admitted flows by allowing transmission of nodes according to the capacity of ancestral links. Simulation results show that the proposed protocol achieves a significant performance improvement in terms of throughput and delay of real-time traffic.