535 research outputs found
Optical control plane: theory and algorithms
In this thesis we propose a novel way to achieve global network information dissemination in which some wavelengths are reserved exclusively for global control information exchange. We study the routing and wavelength assignment problem for the special communication pattern of non-blocking all-to-all broadcast in WDM optical networks. We provide efficient solutions to reduce the number of wavelengths needed for non-blocking all-to-all broadcast, in the absence of wavelength converters, for network information dissemination. We adopt an approach in which we consider all nodes to be tap-and-continue capable thus studying lighttrees rather than lightpaths. To the best of our knowledge, this thesis is the first to consider âtap-and-continueâ capable nodes in the context of conflict-free all-to-all broadcast. The problem of all to-all broadcast using individual lightpaths has been proven to be an NP-complete problem [6]. We provide optimal RWA solutions for conflict-free all-to-all broadcast for some particular cases of regular topologies, namely the ring, the torus and the hypercube. We make an important contribution on hypercube decomposition into edge-disjoint structures. We also present near-optimal polynomial-time solutions for the general case of arbitrary topologies. Furthermore, we apply for the first time the âcactusâ representation of all minimum edge-cuts of graphs with arbitrary topologies to the problem of all-to-all broadcast in optical networks. Using this representation recursively we obtain near-optimal results for the number of wavelengths needed by the non-blocking all-to-all broadcast. The second part of this thesis focuses on the more practical case of multi-hop RWA for non- blocking all-to-all broadcast in the presence of Optical-Electrical-Optical conversion. We propose two simple but efficient multi-hop RWA models. In addition to reducing the number of wavelengths we also concentrate on reducing the number of optical receivers, another important optical resource. We analyze these models on the ring and the hypercube, as special cases of regular topologies. Lastly, we develop a good upper-bound on the number of wavelengths in the case of non-blocking multi-hop all-to-all broadcast on networks with arbitrary topologies and offer a heuristic algorithm to achieve it. We propose a novel network partitioning method based on âvirtual perfect matchingâ for use in the RWA heuristic algorithm
Cross-layer design for network performance optimization in wireless networks
In this dissertation, I use mathematical optimization approach to solve the complex network problems. Paper l and paper 2 first show that ignoring the bandwidth constraint can lead to infeasible routing solutions. A sufficient condition on link bandwidth is proposed that makes a routing solution feasible, and then a mathematical optimization model based on this sufficient condition is provided. Simulation results show that joint optimization models can provide more feasible routing solutions and provide significant improvement on throughput and lifetime. In paper 3 and paper 4, an interference model is proposed and a transmission scheduling scheme is presented to minimize the end-to-end delay. This scheduling scheme is designed based on integer linear programming and involves interference modeling. Using this schedule, there are no conflicting transmissions at any time. Through simulation, it shows that the proposed link scheduling scheme can significantly reduce end-to-end latency. Since to compute the maximum throughput is an NP-hard problem, efficient heuristics are presented in Paper 5 that use sufficient conditions instead of the computationally-expensive-to-get optimal condition to capture the mutual conflict relation in a collision domain. Both one-way transmission and two-way transmission are considered. Simulation results show that the proposed algorithms improve network throughput and reduce energy consumption, with significant improvement over previous work on both aspects. Paper 6 studies the complicated tradeoff relation among multiple factors that affect the sensor network lifetime and proposes an adaptive multi-hop clustering algorithm. It realizes the best tradeoff among multiple factors and outperforms others that do not. It is adaptive in the sense the clustering topology changes over time in order to have the maximum lifetime --Abstract, page iv
Modular expansion and reconfiguration of shufflenets in multi-star implementations.
by Philip Pak-tung To.Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.Includes bibliographical references (leaves 57-60).Chapter 1 --- Introduction --- p.1Chapter 2 --- Modular Expansion of ShuffleNet --- p.8Chapter 2.1 --- Multi-Star Implementation of ShuffleNet --- p.10Chapter 2.2 --- Modular Expansion of ShuffleNet --- p.21Chapter 2.2.1 --- Expansion Phase 1 --- p.21Chapter 2.2.2 --- Subsequent Expansion Phases --- p.24Chapter 2.3 --- Discussions --- p.26Chapter 3 --- Reconfigurability of ShuffleNet in Multi-Star Implementation --- p.33Chapter 3.1 --- Reconfigurability of ShuffleNet --- p.34Chapter 3.1.1 --- Definitions --- p.34Chapter 3.1.2 --- Rearrangable Conditions --- p.35Chapter 3.1.3 --- Formal Representation --- p.38Chapter 3.2 --- Maximizing Network Reconfigurability --- p.40Chapter 3.2.1 --- Rules to maximize Tsc and Rsc --- p.41Chapter 3.2.2 --- Rules to Maximize Z --- p.42Chapter 3.3 --- Channels Assignment Algorithms --- p.43Chapter 3.3.1 --- Channels Assignment Algorithm for w = p --- p.45Chapter 3.3.2 --- Channels Assignment Algorithm for w = p. k --- p.46Chapter 3.3.3 --- Channels Assignment Algorithm for w=Mpk --- p.49Chapter 3.4 --- Discussions --- p.51Chapter 4 --- Conclusions --- p.5
OpTree: An Efficient Algorithm for All-gather Operation in Optical Interconnect Systems
All-gather collective communication is one of the most important
communication primitives in parallel and distributed computation, which plays
an essential role in many HPC applications such as distributed Deep Learning
(DL) with model and hybrid parallelism. To solve the communication bottleneck
of All-gather, optical interconnection network can provide unprecedented high
bandwidth and reliability for data transfer among the distributed nodes.
However, most traditional All-gather algorithms are designed for electrical
interconnection, which cannot fit well for optical interconnect systems,
resulting in poor performance. This paper proposes an efficient scheme, called
OpTree, for All-gather operation on optical interconnect systems. OpTree
derives an optimal -ary tree corresponding to the optimal number of
communication stages, achieving minimum communication time. We further analyze
and compare the communication steps of OpTree with existing All-gather
algorithms. Theoretical results exhibit that OpTree requires much less number
of communication steps than existing All-gather algorithms on optical
interconnect systems. Simulation results show that OpTree can reduce
communication time by 72.21%, 94.30%, and 88.58%, respectively, compared with
three existing All-gather schemes, WRHT, Ring, and NE.Comment: This paper is under review at a conferenc
A survey on Bluetooth multi-hop networks
Bluetooth was firstly announced in 1998. Originally designed as cable replacement connecting devices in a point-to-point fashion its high penetration arouses interest in its ad-hoc networking potential. This ad-hoc networking potential of Bluetooth is advertised for years - but until recently no actual products were available and less than a handful of real Bluetooth multi-hop network deployments were reported. The turnaround was triggered by the release of the Bluetooth Low Energy Mesh Profile which is unquestionable a great achievement but not well suited for all use cases of multi-hop networks. This paper surveys the tremendous work done on Bluetooth multi-hop networks during the last 20 years. All aspects are discussed with demands for a real world Bluetooth multi-hop operation in mind. Relationships and side effects of different topics for a real world implementation are explained. This unique focus distinguishes this survey from existing ones. Furthermore, to the best of the authorsâ knowledge this is the first survey consolidating the work on Bluetooth multi-hop networks for classic Bluetooth technology as well as for Bluetooth Low Energy. Another individual characteristic of this survey is a synopsis of real world Bluetooth multi-hop network deployment efforts. In fact, there are only four reports of a successful establishment of a Bluetooth multi-hop network with more than 30 nodes and only one of them was integrated in a real world application - namely a photovoltaic power plant. © 2019 The Author
Topological Interference Management With Transmitter Cooperation
Interference networks with no channel state information at the transmitter except for the knowledge of the connectivity graph have been recently studied under the topological interference management framework. In this paper, we consider a similar problem with topological knowledge but in a distributed broadcast channel setting, i.e., a network where transmitter cooperation is enabled. We show that the topological information can also be exploited in this case to strictly improve the degrees of freedom (DoF) as long as the network is not fully connected, which is a reasonable assumption in practice. Achievability schemes from graph theoretic and interference alignment perspectives are proposed. Together with outer bounds built upon generator sequence, the concept of compound channel settings, and the relation to index coding, we characterize the symmetric DoF for the so-called regular networks with constant number of interfering links, and identify the sufficient and/or necessary conditions for the arbitrary network topologies to achieve a certain amount of symmetric DoF
Topological Interference Management with Transmitter Cooperation
Interference networks with no channel state information at the transmitter
(CSIT) except for the knowledge of the connectivity graph have been recently
studied under the topological interference management (TIM) framework. In this
paper, we consider a similar problem with topological knowledge but in a
distributed broadcast channel setting, i.e. a network where transmitter
cooperation is enabled. We show that the topological information can also be
exploited in this case to strictly improve the degrees of freedom (DoF) as long
as the network is not fully connected, which is a reasonable assumption in
practice. Achievability schemes based on selective graph coloring, interference
alignment, and hypergraph covering, are proposed. Together with outer bounds
built upon generator sequence, the concept of compound channel settings, and
the relation to index coding, we characterize the symmetric DoF for so-called
regular networks with constant number of interfering links, and identify the
sufficient and/or necessary conditions for the arbitrary network topologies to
achieve a certain amount of symmetric DoF.Comment: 46 pages, 10 figures, short version presented at the International
Symposium on Information Theory 201
Online Permutation Routing in Partitioned Optical Passive Star Networks
This paper establishes the state of the art in both deterministic and
randomized online permutation routing in the POPS network. Indeed, we show that
any permutation can be routed online on a POPS network either with
deterministic slots, or, with high probability, with
randomized slots, where constant
. When , that we claim to be the
"interesting" case, the randomized algorithm is exponentially faster than any
other algorithm in the literature, both deterministic and randomized ones. This
is true in practice as well. Indeed, experiments show that it outperforms its
rivals even starting from as small a network as a POPS(2,2), and the gap grows
exponentially with the size of the network. We can also show that, under proper
hypothesis, no deterministic algorithm can asymptotically match its
performance
- âŠ