J. Cohen, P. Fraigniaud, J.-C. Konig, and A. Raspaud. Optimized broadcasting and multicasting protocols in cut-through routed networks. IEEE Transaction on Parallel and Distributed Systems, 9(8):788-802, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Length-constrained Path-matchings in Graphs - Ghodsi, Hajiaghayi, Mahdian.. (2002) (Correct)
....consider restrictions on the length of the paths. Other restrictions such as an upper bound on the total length of the paths, the number of vertices used, maximum degree of a vertex in the subgraph induced by the paths, and the weight of the paths in weighted graphs can also be considered (see [1, 9]) The path matching problem (under the name of pseudo matching) is considered in [1] in the study of broadcasting and multicasting protocols in some communication networks. The authors provide algorithms for broadcasting in log n steps in a network with n nodes. The algorithm is based on nding ....
.... bound on the total length of the paths, the number of vertices used, maximum degree of a vertex in the subgraph induced by the paths, and the weight of the paths in weighted graphs can also be considered (see [1, 9] The path matching problem (under the name of pseudo matching) is considered in [1] in the study of broadcasting and multicasting protocols in some communication networks. The authors provide algorithms for broadcasting in log n steps in a network with n nodes. The algorithm is based on nding a path matching at each step. A graph theoretic version of the path matching problem ....
[Article contains additional citation context not shown here]
J. Cohen, P. Fraigniaud, J.C. Koing, A. Raspaud, Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks, IEEE Transactions on Parallel and Distributed Systems 9 (1998), 788-802.
Polynomial Time Algorithms for Minimum-Time Broadcast in.. - Cohen, Fraigniaud, Mitjana Self-citation (Cohen Fraigniaud) (Correct)
No context found.
J. Cohen, P. Fraigniaud, J.-C. Konig, and A. Raspaud. Optimized broadcasting and multicasting protocols in cut-through routed networks. IEEE Transaction on Parallel and Distributed Systems, 9(8):788-802, 1998.
Scheduling Calls for Multicasting in Tree-Networks - Cohen, Fraigniaud, Mitjana (1998) Self-citation (Cohen Fraigniaud) (Correct)
....problem in which the set of destinations is a subset of the nodes of the tree, it yields an inefficient protocol. In the 1 port edge disjoint model, Farley [8] has shown that every undirected n node network has a broadcast time of dlog 2 ne (see also [17] This result has been extended in [5] to the case in which the routes are chosen according to a shortest path routing function. However, the results of [5, 8] do not hold in directed networks: take as a counter example the digraph in which a node u has a unique outgoing arc to a node v which has in turn n Gamma 2 outgoing arcs to n ....
....In the 1 port edge disjoint model, Farley [8] has shown that every undirected n node network has a broadcast time of dlog 2 ne (see also [17] This result has been extended in [5] to the case in which the routes are chosen according to a shortest path routing function. However, the results of [5, 8] do not hold in directed networks: take as a counter example the digraph in which a node u has a unique outgoing arc to a node v which has in turn n Gamma 2 outgoing arcs to n Gamma 2 vertices w 1 ; w n Gamma2 , each connected by an outgoing arc to node u. Actually, broadcasting in a ....
J. Cohen, P. Fraigniaud, J.-C. Konig, and A. Raspaud, Optimized broadcasting and multicasting protocols in cut-through routed networks, IEEE Transaction on Parallel and Distributed Systems, (to appear). (See also IPPS '97.).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC