Full-mesh Network Research Articles

Extraction of AMCC Signal Superposed by SOA-Integrated EA-DFB Laser for In-Service Monitoring in All-Photonics Network

We propose an in-line monitoring method that enables fully passive extraction of the control signal for end-to-end optical direct connection on the All-Photonics Network (APN), which is one of the elements of the Innovative Optical and Wireless Network (IOWN). In our approach, the auxiliary management and control channel (AMCC) signal superposed on the client signal as the control signal is extracted by a fully passive configuration without any optical to electrical conversion. By installing the proposed configuration in the Photonic Gateway (Ph-GW), which is an edge optical node of the APN located at the boundary between the access network and the local full-mesh network, the AMCC signal can be extracted in the middle of a route even when the users are communicating via direct optical connection. The proposed configuration enables in-service user terminal monitoring for end-to-end optical direct connection, which is the core concept of the APN. We conducted transmission experiments on the area management of cyber physical system (CPS) in which we assumed that an intensity modulation-direct detection (IM-DD) system with low power consumption and economy is used. We then determined the target transmission distance and bandwidth and conducted 60-km optical transmission in the local full-mesh network. The results demonstrated that a loss budget of 36 dB for the client signal was achieved. We also investigated extending the transmission distance of the client signal by adjusting the branch ratio of the passive extractor so that the optical power of the AMCC signal reached the minimum receiver sensitivity. As a result, we were able to extend the transmission distance to 80 km.

Cyber-physical co-modeling and optimal energy dispatching within internet of smart charging points for vehicle-to-grid operation

Vehicle-to-grid (V2G) technology plays an important part in achieving carbon neutrality. Hence, reducing the execution time under the real-time application becomes an urgent issue. In this paper, we develop a cyber-physical co-modeling to fulfill the fundamental insights into the internet of smart charging points (ISCP), wherein the local controllers are designed near the plug-in electric vehicles (PEVs), and are coordinated with each other. In perspective of energy dispatching, a hierarchical V2G scheduling is implemented in a distributed way to decompose the optimization problem into several sub-problems. Besides, the parallel computing is applied in the V2G problem to accelerate the speed of obtaining results. Moreover, the voltage regulation is applied near the energy coordinator with high-performance computer rather than by the local controller. In perspective of network communication, the small-world network is applied to ensure the communication efficiency and decrease the wiring costs. Besides, the privacy-preserving of both the energy coordinator and the PEV users is guaranteed by processing and storing the sensitive information of the two participants nearby. Finally, the cyber-physical co-modeling is performed in Matlab and Network Simulator 2. Results show load flatting, self-consumption of photovoltaic output, voltage regulation, and up/down regulation are achieved. Moreover, the delay of small-world network is 90.94 times faster than that of lattice network, and the cost of small-world network is nearly 500 times less than that of full mesh network. Particularly, the execution time for V2G operation at one-time interval is less than 1 s.

OPTIMUM FLOW DISTRIBUTION IN THE NETWORK WITH ADAPTIVE DATA TRANSFER

This paper considers a fundamentally new model of data network construction for servicing the flows given by the gravitational matrix with restrictions on the time of information transmission. The proposed network model differs from the known ones because it has an expanded capacity of node and channel resources, combining the lowest possible cost of channels and switching nodes. As part of the development of the proposed model and algorithm for allocation of flows in a full mesh network, the developed mathematical apparatus provides a high degree of reliability and survivability of the synthesized network as a whole. One of the used approaches to the solution of the linear programming problem is based on the choice of the target function, the type of which is determined by the consumer conditions of the synthesis of a particular data network. Within the framework of the article, it is established that the linear programming problem, for each specific case, has an admissible, practically realizable solution with the optimal choice of the target function without additional simplex transformations. An important obtained result of the research is the simplicity of flow control, which is in direct dependence on the strict ordering of the proposed structure, because it was possible to connect by analytical dependences the flows in the branches and the path data transfer flows. The obtained analytical results can be used as a basis for statistical algorithms of information flow control.

Resource prioritization and balancing for the quantum internet

The quantum Internet enables networking based on the fundamentals of quantum mechanics. Here, methods and procedures of resource prioritization and resource balancing are defined for the quantum Internet. We define a model for resource consumption optimization in quantum repeaters, and a strongly-entangled network structure for resource balancing. We study the resource-balancing efficiency of the strongly-entangled structure. We prove that a strongly-entangled quantum network is two times more efficient in a resource balancing problem than a full-mesh network of the traditional Internet.

Optical Full-mesh Network Technologies Supporting the All-Photonics Network

Optical Full-mesh Network Technologies Supporting the All-Photonics Network

Topological influence on optimality of Tit-for-Tat based P2P content distribution

Peer-to-Peer (P2P) content distribution is a powerful scheme to distribute content on the Internet. Since the P2P content distribution relies on the cooperation among peers, one of the most famous P2P file distribution systems, BitTorrent, has applied a game theoretical approach called the Tit-for-Tat (TFT) strategy to encourage selfish peers to cooperatively exchange the fragments of a file, i.e., pieces, with others. In recent years, the basic characteristics of such TFT-based P2P content distribution under a full-mesh network has been investigated by modeling the determination of the optimal piece flow as Integer Linear Programming (ILP). However, the topological influence on optimal piece flow has not been revealed yet. In this paper, we propose an approach to analyze the topological influence by extending the previous model. Through numerical results, we reveal that the optimal piece flow can be achieved on a hierarchical and circular topology with O(NP) links where NP is the number of peers. We also show the whole network can be divided into multiple sub-networks while keeping the system performance.

Equal-cost multi-pathing in high power systems with TRILL

The article presents a hierarchical diagram of the network farm and a model of the network architecture levels. Protocols for disposal full mesh network topologies are considered. Modern data transfer protocol TRILL is presented. Its advantages are analysed in comparison with other possible protocols that may be used in the full-mesh topology. Empirical calculations of data routing based on a Dijkstra's algorithm and a patent formula of the TRILL protocol are given. Two monitoring systems of downloading data channels are described. The data obtained from 40G interfaces through each monitoring systems is presented, and their behaviour is analysed. The main result is that the discrepancy of experimental data with theoretical predictions to be equal to the weight balancing of the traffic when transmitting the batch information over the equivalent edges of the graph. It is shown that the distribution of the traffic over such routes is of arbitrary and inconsistent with the patent formula character. The conclusion analyses issues of the traffic behaviour under extreme conditions.

ICE: A Scalable, Low-Cost FPGA-Based Telescope Signal Processing and Networking System

We present an overview of the ‘ICE’ hardware and software framework that implements large arrays of interconnected field-programmable gate array (FPGA)-based data acquisition, signal processing and networking nodes economically. The system was conceived for application to radio, millimeter and sub-millimeter telescope readout systems that have requirements beyond typical off-the-shelf processing systems, such as careful control of interference signals produced by the digital electronics, and clocking of all elements in the system from a single precise observatory-derived oscillator. A new generation of telescopes operating at these frequency bands and designed with a vastly increased emphasis on digital signal processing to support their detector multiplexing technology or high-bandwidth correlators — data rates exceeding a terabyte per second — are becoming common. The ICE system is built around a custom FPGA motherboard that makes use of an Xilinx Kintex-7 FPGA and ARM-based co-processor. The system is specialized for specific applications through software, firmware and custom mezzanine daughter boards that interface to the FPGA through the industry-standard FPGA mezzanine card (FMC) specifications. For high density applications, the motherboards are packaged in 16-slot crates with ICE backplanes that implement a low-cost passive full-mesh network between the motherboards in a crate, allow high bandwidth interconnection between crates and enable data offload to a computer cluster. A Python-based control software library automatically detects and operates the hardware in the array. Examples of specific telescope applications of the ICE framework are presented, namely the frequency-multiplexed bolometer readout systems used for the South Pole Telescope (SPT) and Simons Array and the digitizer, F-engine, and networking engine for the Canadian Hydrogen Intensity Mapping Experiment (CHIME) and Hydrogen Intensity and Real-time Analysis eXperiment (HIRAX) radio interferometers.

NEURAL NETWORK MODELING IN PROBLEMS OF PREDICTION MODES OF ELECTRICAL GRIDS

Purpose. Form a neuro-fuzzy network based on temperature monitoring of overhead transmission line for the prediction modes of the electrical network. Methodology. To predict the load capacity of the overhead line architecture provides the use of neuro-fuzzy network based on temperature monitoring of overhead line. The proposed neuro-fuzzy network has a four-layer architecture with direct transmission of information. To create a full mesh network architecture based on hybrid neural elements with power estimation accuracy of the following two stages of the procedure: - in the first stage a core network (without power estimation accuracy) is generated; - in the second stage architecture and network parameters are fixed obtained during the first stage, and it is added to the block estimation accuracy, the input signals which are all input, internal and output signals of the core network, as well as additional input signals. Results. Formed neuro-fuzzy network based on temperature monitoring of overhead line. Originality. A distinctive feature of the proposed network is the ability to process information specified in the different scales of measurement, and high performance for prediction modes mains. Practical value. The monitoring system will become a tool parameter is measuring the temperature of the wire, which will, based on a retrospective analysis of the accumulated information on the parameters to predict the thermal resistance of the HV line and as a result carry out the calculation of load capacity in real time.

E|Flow - From Production Line Concept to a Physically and Digitally Full-Meshed Production Network

The continuous change of the consumers’ behavior combined with the impact of new technologies to the shop-floor is a challenge for the classic and established line production. Due to the effects of mass-customization there is an increase of the variants of the products combined with a reduction of the number of units per variation. Therefore, it is necessary that the next generations of production lines, especially the assembling devices, have to be designed more adaptable. Regarding to business information systems this trend is realized by a progressive digital integration of the particular units. However, at the physical level of the value stream the sequenced units are linked to each other and arranged flow-orientated since Taylor. Particularly, for mass production the so called “line concept” is well established. This inflexibility of the physical material flow blocks the spread of mass-customization into established industrial sectors where linked manufacturing steps are common use. A product which is very individualized is not, or only with an additional expense, producible on such linked lines. Therefore, it is necessary to resolve the linking of the physical material flow similar to the digital integration of the work flow. The result will be a physically and digitally full-meshed network of production units with a high variability. Especially for a production of goods with a high variant diversity the benefits of a physically meshed production site are obvious. Each part gets its own and individual routing, which depends on the current machine availability, the set-up and other factors. Furthermore, a change of the general conditions during the manufacturing of the part can be considered and lead to an adaption of the routing. One of the most important parts of a flexible physical production network is the transport system, consisting of autonomous and smart entities which are interconnected with business information systems, products and machines.

Large-scale structure of a network of co-occurring MeSH terms: statistical analysis of macroscopic properties.

Concept associations can be represented by a network that consists of a set of nodes representing concepts and a set of edges representing their relationships. Complex networks exhibit some common topological features including small diameter, high degree of clustering, power-law degree distribution, and modularity. We investigated the topological properties of a network constructed from co-occurrences between MeSH descriptors in the MEDLINE database. We conducted the analysis on two networks, one constructed from all MeSH descriptors and another using only major descriptors. Network reduction was performed using the Pearson's chi-square test for independence. To characterize topological properties of the network we adopted some specific measures, including diameter, average path length, clustering coefficient, and degree distribution. For the full MeSH network the average path length was 1.95 with a diameter of three edges and clustering coefficient of 0.26. The Kolmogorov-Smirnov test rejects the power law as a plausible model for degree distribution. For the major MeSH network the average path length was 2.63 edges with a diameter of seven edges and clustering coefficient of 0.15. The Kolmogorov-Smirnov test failed to reject the power law as a plausible model. The power-law exponent was 5.07. In both networks it was evident that nodes with a lower degree exhibit higher clustering than those with a higher degree. After simulated attack, where we removed 10% of nodes with the highest degrees, the giant component of each of the two networks contains about 90% of all nodes. Because of small average path length and high degree of clustering the MeSH network is small-world. A power-law distribution is not a plausible model for the degree distribution. The network is highly modular, highly resistant to targeted and random attack and with minimal dissortativity.

Partial Probing for Scaling Overlay Routing

Recent work has demonstrated that path diversity is an effective way to improve the end-to-end performance of network applications. For every node pair in a full-mesh network with n nodes, this paper presents a family of new approaches that efficiently identify an acceptable indirect path that has a similar to or even better performance than the direct path, hence considerably scaling the network at the cost of low per-node traffic overhead. In prior techniques, every node frequently incurs O(n1.5) traffic overhead to probe the links from itself to all other nodes and to broadcast its probing results to a small set of nodes. In contrast, in our approaches, each node measures its links to only O(√n) other nodes and transmits the measuring results to O(√n) other nodes, where the two node sets of size O(√n) are determined by the partial sampling schemes presented in this paper. Mathematical analyses and trace-driven simulations show that our approaches dramatically reduce the per-node traffic overhead to O(n) while maintaining an acceptable backup path for each node pair with high probability. More precisely, our approaches, which are based on enhanced and rotational partial sampling schemes, are capable of increasing said probability to about 65 and 85 percent, respectively. For many network applications, this is sufficiently high such that the increased scalability outweighs such a drawback. In addition, it is not desirable to identify an outstanding backup path for every node pair in reality, due to the variable link quality.

Ad Hoc Network Duplexing, Multiplexing, and Multiple Access: Canonical Results for Two Limiting Topologies

Wireless ad-hoc networks have seen much attention in recent years, for the numerous benefits they offer. There are still a number of open research questions regarding these networks, and this paper addresses the question of which duplexing, multiplexing, and multiple access (D/M/MA) techniques are preferable in ad hoc networks. These techniques have substantial impact on network performance, yet this particular topic has seen surprisingly little attention. In this paper, we investigate D/M/MA techniques in ad-hoc networks and specifically address how to allocate time/frequency resources to improve network performance. We provide a comparison of time, frequency, and time-frequency schemes in terms of a number of features, including throughput, relative range and capacity. To keep the analyses tractable, we conduct our study using two limiting or "extreme" topologies: full mesh and pure relay networks. Our results show that for a peak power constraint, in terms of data rate, range, or capacity, continuous single-carrier waveforms are superior to bursted multi-carrier waveforms, and these schemes are attained with appropriate application of "hybrid" time-frequency division. Latency and throughput simulation results are provided for mesh networks, and analytical signal-to-noise-plus-interference ratio and simulation results for relay networks are also provided, to support our theoretically-based claims.

Media handling aspects of multimedia conferencing in broadband wireless ad hoc networks

The emergence of broadband wireless technologies has made broadband wireless ad hoc networks a reality. Broadband wireless ad hoc networks are infrastructure-less and can be used in a wide range of scenarios in private, public, commercial, and military settings. Multimedia conferencing is an important application area. Its two main components are signaling and media handling. This article focuses on the media handling aspects or multimedia conferencing in broadband wireless ad hoc networks, with a critical review of the state of the art and a proposed novel architecture. The main components of this architecture are a distributed mixing system and a self-organizing system. The distributed mixing system is a two-level structure. The first level is a full mesh network of active nodes that act as media mixers. The second level is made up of passive nodes that rely on the mixers in the first level. Each second-level node is connected to a first-level node. The self-organizing system is based on a resource efficient scheme that provides for the automatic allocation (or deallocation) of mixers when the network grows (or shrinks). Furthermore, it enables the automatic assignment of new nodes to mixers when they join the conference. We have built a proof-of-concept prototype of the architecture and have evaluated the self-organizing system through simulations. We have simulated conferences and observed how mixers are allocated and deallocated. The simulations show that our self-organizing system utilizes resources efficiently in most cases

Logical Topology Reconfiguration in Full-Mesh WDM Networks (AWG-STAR) Based on Wavelength Routing Technology

Logical Topology Reconfiguration in Full-Mesh WDM Networks (AWG-STAR) Based on Wavelength Routing Technology

Temperature control-free full-mesh wavelength routing network (AWG-STAR) with CWDM AWG-router

AWG-STAR is a star-shaped network that utilizes a uniform-loss cyclic frequency arrayed-waveguide grating (AWG) as a wavelength router to obtain full-mesh interconnection between surrounding wavelength-division-multiplexing nodes. In this paper, we describe a temperature control-free AWG-STAR network that employs a coarse wavelength-division-multiplexing AWG-router. The center wavelength and transmission band of the AWG-router are designed based on the light source wavelength shift that results from changes in operating temperature. The system employs bidirectional transmission to avoid coherent crosstalk from adjacent channels. A cost-effective and small-scale full-mesh network is realized for metropolitan areas.

Reservation information sharing enhancement for deflection routing in OBS network

The resource contention problem is critical in Just-Enough-Time (JET) based optical burst switching (OBS) networks. Although deflection routing (DR) reduces the contention probability in some degree, it does not give much improvement under heavy traffic load. This paper analyzed the inducement causing contention in OBS networks, and proposed Resource Information Sharing Enhancement (RISE) scheme. Theoretical analysis shows that this scheme achieves shorter length of the detour path than normal DR. We simulated this scheme on both full mesh network and practical 14-node NSFNET. The simulation results show that it gives at best 2 orders magnitude improvement in reducing the burst contention probability over its previous routing approaches.

Field Trial of Full-Mesh WDM Network (AWG-STAR) in Metropolitan/Local Area

We describe a field trial of a wavelength routing full-mesh wavelength-division-multiplexing (WDM) (AWG-STAR) network for citywide local administration in Japan. An AWG router and five WDM nodes were connected to the existing fiber in the downtown area of the city of Chitose, Hokkaido. A 5 /spl times/ 5 full-mesh network was overlaid on the Chitose intranet. A video-on-demand system based on Gigabit Ethernet links, high-definition serial digital interface signals, and synchronous digital hierarchy signals of STM-16 links are transmitted and routed simultaneously on the wavelength paths of the network. These systems are used for administration and education information sharing for city residents. The network is managed and controlled remotely from the NTT R&D Center in Atsugi, Japan, which is 50 km southwest of Tokyo and approximately 1000 km from Chitose. AWG-STAR exhibits promising potential as a large capacity network system for both simple full-mesh systems and highly secure private networks.

Information Technology Industry and Laser Technology. Full-Mesh WDM Network.

We have developed an arrayed-waveguide grating (AWG) with a wavelength-routing function and have built a prototype system called AWG-STAR (wavelength routing star network) for a photonic network. The system's logical topology is a 32×32 full mesh that uses 32 wavelengths, while its physical topologyis a WDM star network with a wavelength-routing AWG at its center. It works independently of the protocol and bit rate of the data. (Gbit Ethernet, OC-4 ATM, HD-SDI, and 10-Gbit's random data can be transported without interference.) A wavelength is assigned to each node, and data are routed to the nodes according to the assigned wavelengths.

Optimal design of the two-level distributed network with dual homing local connections

To keep abreast of the ever-tightening robustness standards of communication services, we consider the topological design of the two-level network where a sufficient level of structural redundancy is imposed: the embedded backbone subnet is fully meshed and each user node is connected to two different backbone nodes. This complicated design problem for the dual homing full-mesh network is formulated as a 0-1 integer problem so that the key structural characteristics of the single homing network design model are carried over. By applying the usual dual-based solution procedure, we develop ours, which consists of three dual and one primal subprocedures. The computational experiments conducted with a variety of test problems illustrate the effectiveness of the proposed solution approach.