A systematic analysis of equivalence in multistage networks

Many approaches to switching in optoelectronic and optical networks decompose the switching function across multiple stages or hops. This paper addresses the problem of determining whether two multistage or multihop networks are functionally equivalent. Various ad-hoc methods have been used in the past to establish such equivalences. A systematic method for determining equivalence is presented based on properties of the link permutations used to interconnect stages of the network. This method is useful in laying out multistage networks, in determining optimal channel assignments for multihop networks, and in establishing the routing required in such networks. A purely graphical variant of the method, requiring no mathematics or calculations, is also described

An application of a genetic algorithm for throughput optimization in non-broadcast WDM optical networks with regular topologies

We apply a genetic algorithm from Podnar and Skorin-Kapov [5] to a virtual topology design of a Wide-Area WDM Optical Network with regular topologies. Based on a given physical topology a virtual topology consisting of optical lightpaths is constructed. The objective is to minimize the maximal throughput, which implies balancing link loads and accommodating on-growing traffic requirements in a timely fashion. The genetic algorithm is applied to benchmark instances of regular topologies

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

Topology control for wireless networks with highly-directional antennas

In order to steer antenna beams towards one another for communication, wireless nodes with highly-directional antennas must track the channel state of their neighbors. To keep this overhead manageable, each node must limit the number of neighbors that it tracks. The subset of neighbors that each node chooses to track constitutes a network topology over which traffic can be routed. We consider this topology design problem, taking into account channel modeling, transmission scheduling, and traffic demand. We formulate the optimal topology design problem, with the objective of maximizing the scaling of traffic demand, and propose a distributed method, where each node rapidly builds a segment of the topology around itself by forming connections with its nearest neighbors in discretized angular regions. The method has low complexity and message passing overhead. The resulting topologies are shown to have desirable structural properties and approach the optimal solution in high path loss environments.National Science Foundation (U.S.) (Grant CNS-1524317)National Science Foundation (U.S.) (Grant CNS-1116209)National Science Foundation (U.S.) (Grant AST-1547331)United States. Air Force (Contract FA8721-05-C-0002

Wavelength conversion in optical packet switching

A detailed traffic analysis of optical packet switch design is performed. Special consideration is given to the complexity of the optical buffering and the overall switch block structure is considered in general. Wavelength converters are shown to improve the traffic performance of the switch blocks for both random and bursty traffic. Furthermore, the traffic performance of switch blocks with add--drop sports has been assessed in a Shufflenetwork showing the advantage of having converters at the inlets. Finally, the aspect of synchronization is discussed through a proposal to operate the packet switch block asynchronously, i.e., without packet alignment at the input

UPANets: Learning from the Universal Pixel Attention Networks

Among image classification, skip and densely-connection-based networks have dominated most leaderboards. Recently, from the successful development of multi-head attention in natural language processing, it is sure that now is a time of either using a Transformer-like model or hybrid CNNs with attention. However, the former need a tremendous resource to train, and the latter is in the perfect balance in this direction. In this work, to make CNNs handle global and local information, we proposed UPANets, which equips channel-wise attention with a hybrid skip-densely-connection structure. Also, the extreme-connection structure makes UPANets robust with a smoother loss landscape. In experiments, UPANets surpassed most well-known and widely-used SOTAs with an accuracy of 96.47% in Cifar-10, 80.29% in Cifar-100, and 67.67% in Tiny Imagenet. Most importantly, these performances have high parameters efficiency and only trained in one customer-based GPU. We share implementing code of UPANets in https://github.com/hanktseng131415go/UPANets