Title :
Schemes for scheduling of control messages by hierarchical protocols
Author :
Bortnikov, Edward ; Cohen, Reuven
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
fDate :
29 Mar-2 Apr 1998
Abstract :
The paper addresses the problem of designing efficient scheduling policies for the transmission of control messages by hierarchical network protocols. Such protocols encounter a tradeoff between the desire to forward a control message across the tree as soon, as it is received, and the desire to reduce control traffic. Scheduling problems that arise in this context are defined and discussed. The paper mainly concentrates on minimizing the average extra delay encountered by the control messages under an upper bound on the number of outgoing messages a node can send during a fixed period of time. A polynomial-time algorithm is presented for the off-line version of the problem, and then several efficient on-line heuristics are presented and compared
Keywords :
delays; scheduling; telecommunication control; telecommunication traffic; transport protocols; average extra delay; control messages scheduling; control messages transmission; control traffic reduction; efficient scheduling policies; hierarchical network protocols; minimum average delay scheduling; network node; on-line heuristics; optimal off-line algorithm; outgoing messages; polynomial-time algorithm; tree; upper bound; Communication networks; Computer science; Delay effects; Dynamic programming; Dynamic scheduling; Polynomials; Processor scheduling; Protocols; Scalability; Upper bound;
Conference_Titel :
INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-4383-2
DOI :
10.1109/INFCOM.1998.665111
