Fast synchronization 3R burst-mode receivers for passive optical networks

This paper gives a tutorial overview on high speed burst-mode receiver (BM-RX) requirements, specific for time division multiplexing passive optical networks, and design issues of such BM-RXs as well as their advanced design techniques. It focuses on how to design BM-RXs with short burst overhead for fast synchronization. We present design principles and circuit architectures of various types of burst-mode transimpedance amplifiers, burst-mode limiting amplifiers and burst-mode clock and data recovery circuits. The recent development of 10 Gb/s BM-RXs is highlighted also including dual-rate operation for coexistence with deployed PONs and on-chip auto reset generation to eliminate external timing-critical control signals provided by a PON medium access control. Finally sub-system integration and state-of-the-art system performance for 10 Gb/s PONs are reviewed

Symmetry groupoids and admissible vector fields for coupled cell networks

The space of admissible vector fields, consistent with the structure of a network of coupled dynamical systems, can be specified in terms of the network's symmetry groupoid. The symmetry groupoid also determines the robust patterns of synchrony in the network – those that arise because of the network topology. In particular, synchronous cells can be identified in a canonical manner to yield a quotient network. Admissible vector fields on the original network induce admissible vector fields on the quotient, and any dynamical state of such an induced vector field can be lifted to the original network, yielding an analogous state in which certain sets of cells are synchronized. In the paper, necessary and sufficient conditions are specified for all admissible vector fields on the quotient to lift in this manner. These conditions are combinatorial in nature, and the proof uses invariant theory for the symmetric group. Also the symmetry groupoid of a quotient is related to that of the original network, and it is shown that there is a close analogy with the usual normalizer symmetry that arises in group-equivariant dynamics

A Survey on Handover Management in Mobility Architectures

This work presents a comprehensive and structured taxonomy of available techniques for managing the handover process in mobility architectures. Representative works from the existing literature have been divided into appropriate categories, based on their ability to support horizontal handovers, vertical handovers and multihoming. We describe approaches designed to work on the current Internet (i.e. IPv4-based networks), as well as those that have been devised for the "future" Internet (e.g. IPv6-based networks and extensions). Quantitative measures and qualitative indicators are also presented and used to evaluate and compare the examined approaches. This critical review provides some valuable guidelines and suggestions for designing and developing mobility architectures, including some practical expedients (e.g. those required in the current Internet environment), aimed to cope with the presence of NAT/firewalls and to provide support to legacy systems and several communication protocols working at the application layer

The lattice of balanced equivalence relations of a coupled cell network

A coupled cell system is a collection of dynamical systems, or ‘cells’, that are coupled together. The associated coupled cell network is a labelled directed graph that indicates how the cells are coupled, and which cells are equivalent. Golubitsky, Stewart, Pivato and Török have presented a framework for coupled cell systems that permits a classification of robust synchrony in terms of the concept of a ‘balanced equivalence relation’, which depends solely on the network architecture. In their approach the network is assumed to be finite. We prove that the set of all balanced equivalence relations on a network forms a lattice, in the sense of a partially ordered set in which any two elements have a meet and a join. The partial order is defined by refinement. Some aspects of the theory make use of infinite networks, so we work in the category of networks of ‘finite type’, a class that includes all locally finite networks. This context requires some modifications to the standard framework. As partial compensation, the lattice of balanced equivalence relations can then be proved complete. However, the intersection of two balanced equivalence relations need not be balanced, as we show by a simple example, so this lattice is not a sublattice of the lattice of all equivalence relations with its usual operations of meet and join. We discuss the structure of this lattice and computational issues associated with it. In particular, we describe how to determine whether the lattice contains more than the equality relation. As an example, we derive the form of the lattice for a linear chain of identical cells with feedback

Emergence of Complex Dynamics in a Simple Model of Signaling Networks

A variety of physical, social and biological systems generate complex fluctuations with correlations across multiple time scales. In physiologic systems, these long-range correlations are altered with disease and aging. Such correlated fluctuations in living systems have been attributed to the interaction of multiple control systems; however, the mechanisms underlying this behavior remain unknown. Here, we show that a number of distinct classes of dynamical behaviors, including correlated fluctuations characterized by $1/f$-scaling of their power spectra, can emerge in networks of simple signaling units. We find that under general conditions, complex dynamics can be generated by systems fulfilling two requirements: i) a ``small-world'' topology and ii) the presence of noise. Our findings support two notable conclusions: first, complex physiologic-like signals can be modeled with a minimal set of components; and second, systems fulfilling conditions (i) and (ii) are robust to some degree of degradation, i.e., they will still be able to generate $1/f$-dynamics