Title :
Data transfers in broadcast networks
Author :
Bagchi, Anindo ; Hakimi, S. Louis
Author_Institution :
Bellcore, Red Bank, NJ, USA
fDate :
7/1/1992 12:00:00 AM
Abstract :
One of the main methods for designing data link protocols in broadcast networks is based on the allocation of transmission rights to nodes in timeslots guaranteeing collision-free access to the channel. Extensions of certain results on vertex coloring are used to establish bounds on the number of timeslots required for a network to finish transmitting a backlog of data. Such networks are also observed when they are structured as rings and trees. Distributed algorithms for the allocation of timeslots in these networks are presented
Keywords :
graph colouring; protocols; radio networks; broadcast networks; collision-free access; data link protocols; data transfers; distributed algorithms; rings; transmission rights; trees; vertex coloring; Access protocols; Bandwidth; Design methodology; Distributed algorithms; Intelligent networks; Multiaccess communication; Radio broadcasting; Radio network; Routing protocols; Tree graphs;
Journal_Title :
Computers, IEEE Transactions on
