Search

In this paper, we focus on convergence packet routing techniques in an all-optical network, obtained from an Eulerian routing in the digraph modeling the target network. Given an Eulerian circuit C in a digraph C, we deal with the maximal number diamWC of arcs that a packet has to follow on C from its origin to its destination (we talk about the ending guarantee of the routing). We consider the Eulerian diameter of C as defined by E(C) = mm C ∈ Eul(G) diamWc, where E(G) is the set of all the Eulerian circuits in C. After giving a preliminary result about the complexity of finding ((C) for any digraph G, we give some lower and upper bounds of this parameter. The main part of the paper is devoted to the description of a combinatorial design of various network topologies having good Eulerian diameters. [ABSTRACT FROM AUTHOR]

Software systems can be modeled as complex networks in which software components are abstract nodes and their interactions are abstract edges. This paper attempts to characterize the structural quality of complex software networks. We propose to use a novel statistical measure, called average propagation ratio, to characterize the structural quality of general complex software networks, such as software adaptivity and maintainability. Several real-world complex software networks are analyzed in some depth to demonstrate the application of average propagation ratios. Furthermore, we investigate the key factors that determine the average propagation ratios of general complex software networks, resulting in a set of guiding principles that can be used in practical network design for improving the structural quality of complex software systems. [ABSTRACT FROM AUTHOR]

This paper proposes an adaptive network architecture, which can emulate the human knowledge as the fuzzy logic rule, and its applications as the controller for nonlinear systems. The structure of this proposed network, multi-input Fuzzy Rule Emulated Network or FREN, is derived based on human knowledge in the form of fuzzy IF-THEN rules. The initial setting of its parameters can be intuitively chosen from expert's experience. During the learning phase based on the gradient search, the learning rate can be adapted itself to remain the stability with the Lyapunov method. The performance of our network is presented by using this network as controller for the single invert pendulum plant and the water bath temperature control system. The comparison results with other conventional control algorithms such as artificial neural networks and PID controllers can be illustrated in each example. [ABSTRACT FROM AUTHOR]

Multicasting protocols deliver data packets from a source node to multiple receivers, and serve a very important function in mobile ad-hoc networks (MANETs). In this paper, a novel receiver-initiated soft-state probabilistic multicasting protocol (RISP) for MANETs is proposed. RISP is inspired by the ant colony's route-seeking mechanism, in which an individual ant chooses the optimal path to its destination through cooperation with others in a totally distributed manner. Imitating the behaviour of ants in nature, RISP introduces probabilistic forwarding and soft-state for making relay decisions that are automatically adaptive to node mobility in MANETs. Compared with other protocols, we show by computer simulations that RISP has lower delivery redundancy, while achieving higher delivery ratio at all mobility scenarios. Furthermore, RISP has lower control overhead. [ABSTRACT FROM AUTHOR]

In this paper we study the square grid area required for laying out H[sub l], the Boolean hypercube of N=2[sup l] vertices. It is shown that this area is [formula]. We describe a layout which occupies this much area and prove that no layout of less area exists. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of constructing a multicast tree in star interconnection networks under the single-port communication model. Unlike previous schemes for constructing space-efficient multicast trees, we adopt the completion time of each multicast as the objective function to be minimized. In particular, we study a special case of the problem in which all destination vertices are immediate neighbors of the source vertex, and propose a multicast scheme of [formula] time units for the star graph of dimension n. [ABSTRACT FROM AUTHOR]