J.-C. Bermond, F.O. Ergincan, Bus interconnection networks, Discrete Appl. Math. 68 (1996) 1-15. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Broadcasting In Bus Interconnection Networks - Ferreira (1999) (1 citation) (Correct)
....technology, to fully utilize the high bandwidth provided, a physical optical channel should be shared by multiple transmissions [18] This induces the use of BINs instead of point to point interconnections. Bermond and Ergincan present an excellent survey on structural problems related to BINs [6]. For more applications of BINs in optical networks, we refer the interested reader to [9; 12] Another approach for using buses in interconnection networks is to enhance existing point to point networks with multiple bus systems, and many papers can be found on this subject [1; 2; 7; 8; 10; 17; ....
J-C. Bermond and F.O. Ergincan. Bus interconnection networks. Technical Report 93-56, Universite de Nice - Sophia Antipolis, September 1993.
Two Constructions for Making Partitionable Graphs - Pecher (2001) (Correct)
....to results of Lovsz (1972) 8] and Padberg (1974) 9] the partitionable graphs contain all minimal counter example to this conjecture. Making partitionable graphs is also of interest for the study of bus interconnexion networks, as partitionable graphs are related to directed Moore hypergraphs [2] [6] In 1979, Chvtal, Graham, Perold and Whitesides introduced two constructions for making partitionable graphs [5] In 1984, Grinstead proved that there is no counter example to the Strong Perfect Graph Conjecture in the normalized graphs of the second one [7] In 1998, Bacs, Boros, Gurvich, ....
J.-C. Bermond and F. . Ergincan, Bus interconnection networks, Disc. Appl. Math. 68 (1996), 115.
Applications of Combinatorial Designs to Communications, .. - Colbourn, Dinitz.. (1999) (1 citation) (Correct)
....on at least one link, subject to the constraint that no link has more than k sites on it, and no site appears on more than r links. Problems of this type have been studied extensively. Mickunas [101] considered the case when k and r are close to equal. Subsequently, Bermond and his colleagues [92, 93, 94] considered general network design problems of this type under the name bus interconnection networks . They are primarily responsible for observing that numerous well studied combinatorial configurations lead to useful solutions to such network design problems; see also [3, 88, 97, 103, 105] ....
....(r Gamma 1)d k r e elements. Now choosing so that all element weights are as equal as possible subject to the constraint on block weight leads to coverings for which Furedi s bound is achieved infinitely often, and approaches this bound as k 1 for fixed r when r Gamma 1 is a prime power [93, 94]. Hence, although there are many potential methods for producing coverings, Furedi s result establishes that the asymptotically optimal coverings arise from replicating elements in projective planes. Bermond et al. 93, 94] do not address the question of finding the largest number of elements in ....
[Article contains additional citation context not shown here]
J.-C. Bermond & F. O. Ergincan, Bus interconnection networks, Discrete Applied Math., 68 (1996), 1--15.
Projective Planes and Congestion-Free Networks - Colbourn (1998) (Correct)
....on at least one link, subject to the constraint that no link has more than k sites on it, and no site appears on more than r links. Problems of this type have been studied extensively. Mickunas [22] considered the case when k and r are close to equal. Subsequently, Bermond and his colleagues [4, 5, 6] considered general network design problems of this type under the name bus interconnection networks . They are primarily responsible for observing that numerous well studied combinatorial configurations lead to useful solutions to such network design problems; see also [9, 18] In order to ....
....k r e elements. Now choosing so that all element weights are as equal as possible subject to the constraint on block weight leads to coverings for which Furedi s bound is achieved infinitely often, and approaches this bound as k 1 for fixed r when r Gamma 1 is a prime power [5, 6]. Hence, although there are many potential methods for producing coverings, Furedi s result establishes that the asymptotically optimal coverings arise from replicating elements in projective planes. Bermond et al. 5, 6] do not address the question of finding the largest number of elements in a ....
[Article contains additional citation context not shown here]
J.-C. Bermond and F. O. Ergincan, Bus interconnection networks, Discrete Applied Math. 68 (1996), 1-15.
Moore Graphs and Beyond: - The (Correct)
No context found.
J.-C. Bermond, F.O. Ergincan, Bus interconnection networks, Discrete Appl. Math. 68 (1996) 1-15.
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