@conference {12280,
	title = {Measurement-based multipath multicast},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2803 - 2808 vol. 4 - 2803 - 2808 vol. 4},
	abstract = {We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities.},
	keywords = {algorithm;, allocation;, application-layer, approximation, approximation;, balance, communication;, Convergence, convergence;, intradomain, load, measurement-based, methods;, Multicast, multipath, network, numerical, of, overlaying;, perturbation, processes;, resource, Routing, routing;, source;, Stochastic, techniques;, Telecommunication, theory;, traffic;},
	doi = {10.1109/INFCOM.2005.1498566},
	author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby}
}
@conference {14939,
	title = {An efficient parallel algorithm for channel routing},
	booktitle = {Computer Design: VLSI in Computers and Processors, 1990. ICCD {\textquoteright}90. Proceedings., 1990 IEEE International Conference on},
	year = {1990},
	month = {1990/09//},
	pages = {400 - 403},
	abstract = {The channel-routing of a set of multiterminal nets in the standard two-layer model is considered. The sequential algorithms based on the greedy strategy do not seem to be easily parallelizable. Proposed is an efficient parallel algorithm for routing channels with cyclic constraints. The algorithm runs in time <e1>O</e1>(<e1>n</e1><sup>2</sup>/<e1>p</e1>+log<sup>2</sup><e1>p</e1>), with <e1>p</e1> processors, on a shared memory parallel random access machine (PRAM) model where 1 les;<e1>p</e1> les;<e1>n</e1><sup>2</sup> radic; and <e1>n</e1> is the size of the input. An efficient adaptation of this algorithm on a Sequent Balance 21000 multiprocessor system is reported},
	keywords = {21000;channel, access, algorithm;sequential, algorithms;, algorithms;shared, balance, CAD;computational, complexity;parallel, Layout, machine;standard, memory, model;circuit, nets;parallel, Parallel, PRAM;Sequent, random, routing;multiprocessor, system;multiterminal, two-layer},
	doi = {10.1109/ICCD.1990.130261},
	author = {Krishnamurthy, S. and JaJa, Joseph F.}
}
