Title :
Constrained Content Distribution and Communication Scheduling for Several Restricted Classes of Graphs
Author :
Andreica, Mugurel Ionut ; Tapus, Nicolae
Author_Institution :
Comput. Sci. & Eng. Dept., Politeh. Univ. of Bucharest, Bucharest, Romania
Abstract :
In this paper we address several problems regarding content distribution (broadcast) and communication optimization and scheduling for some restricted classes of graphs (trees, intersecting cliques). For the broadcast problem in trees we introduce some new extensions and present some new algorithmic results for determining optimal offline broadcast strategies. The communication scheduling problems are also addressed from an offline algorithmic perspective, considering mutual exclusion constraints or geometric aspects.
Keywords :
optimisation; trees (mathematics); communication optimization; communication scheduling; constrained content distribution; content distribution; geometric aspects; intersecting cliques; mutual exclusion constraints; optimal offline broadcast strategies; restricted graph class; Broadcasting; Computer networks; Computer science; Constraint optimization; Distributed computing; Intelligent networks; Processor scheduling; Scheduling algorithm; Scientific computing; Tree graphs; broadcast strategy; communication scheduling; intersecting cliques; mutual exclusion; tree network;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-0-7695-3523-4
DOI :
10.1109/SYNASC.2008.50
