Bermond, J.C., Dawes, R.W., Ergincan, F. O.: De Bruijn and Kautz bus networks. Networks 30 (1997) 205--218  Home/Search   Document Details and Download   Summary   Related Articles   Check

....constraints appear when using WDM, di erent from those in TDM. An example of problems arising from WDM was given in the previous section. New models for networks are being developed due to the new devices in optical technology. In this context there have appeared many studies on bus networks [6, 18] in which the network topology is no more modeled by a graph but by a hypergraph. 6 Also, in this direction we will explain a more detailed example in the next section in which we model a network by a directed hypergraph using existing optical devices. 5.1 Using directed hypergraphs with OTIS ....

....Although a great deal of research e orts have been concentrated on single OPS topologies [24, 15, 37] the OPS coupler presents a severe drawback since its size is technologically limited by its splitting capabilities. That is the reason why multi OPS topologies seems more viable and scalable [6, 18]. In this section, we present some multi OPS topologies with the single hop Partitioned OPS networks (POPS) 13] and the multi hop stack Kautz network [18] We also present the stackgraphs, a family of directed hypergraphs which is very useful to model and manipulated multi OPS networks. Finally, ....

[Article contains additional citation context not shown here]

J-C. Bermond, R. Dawes, and F. Ergincan. De Bruijn and Kautz bus networks. Networks, 30:205-218, 1997.

....to label the nodes. Notice that the generalized de Bruijn digraph, GB(d; n) with n nodes of degree d, has no OT IS(d; n) layout, and we proposed an OT IS layout using one OT IS(d; n) and one OT IS(1; dn) 3. 4 De Bruijn and Kautz bus networks The de Bruijn and Kautz bus networks were dened in [1] as hypergraphs built from the generalized de Bruijn and the generalized Kautz digraphs. As an Optical Passive Star coupler is equivalent to a directed bus, we propose for both networks an optical implementation using two OT IS 2D and one OT IS 2D (1; m) 3.5 Extension of the Results to OT IS 3D ....

J-C. Bermond, R. Dawes, and F. Ergincan. De Bruijn and Kautz bus networks. Networks, 30:

....nodes can be broadcast to all outputs of the OPS couplers. Therefore, they can be better modeled by hypergraphs, a generalization of graphs, where edges may connect more than two nodes [1] Hence, hypergraphs can be used to design one to many communication networks, as the HyperKautz proposed in [2]. In a nutshell, a HyperKautz network, with n nodes of degree d, uses m OPS couplers of size s, such that dn = sm, and has the same routing mechanism as a Kautz network with n nodes of degree sd and diameter log sd n. Thus, a HyperKautz network can be viewed as a Kautz network with n nodes of ....

....= sm, and has the same routing mechanism as a Kautz network with n nodes of degree sd and diameter log sd n. Thus, a HyperKautz network can be viewed as a Kautz network with n nodes of degree sd, in which groups of s arcs, coming from s di erent nodes, are merged into OPS couplers of size s (see [2] for more details) On the other hand, since the nodes connected to the inputs of any OPS coupler are di erent of the nodes connected to its outputs, HyperKautz networks are dicult to control and to implement, because they lack regularity. Nevertheless, this topology was evaluated as an optical ....

J-C. Bermond, R. Dawes, and F. Ergincan. De Bruijn and Kautz bus networks. Networks, 30:205-218, 1997.

....algorithms for it [12, 30] Furthermore, it has been used to build various multi stage interconnection networks like ButterAEy [30] Shuenet [27] and GEMNET [27] and also to build RR n# 3817 4 D. Coudert, A. Ferreira, S. P#rennes fully scalable networks of any size [22] and very large bus networks [2]. More interestingly, the Galileo space probe of the NASA uses a de Bruijn network to implement a signal decoder [11] From a theoretical point of view, we show in this paper that there are many ways to build digraphs isomorphic to the de Bruijn. For this, we start showing, in Proposition 3.2, ....

J-C. Bermond, R. Dawes, and F. Ergincan. De Bruijn and Kautz bus networks. Networks, 30:

No context found.

Bermond, J.C., Dawes, R.W., Ergincan, F. O.: De Bruijn and Kautz bus networks. Networks 30 (1997) 205--218

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