A Service Ratio-Based Dynamic Fair Queueing Algorithm for Packet-Switching Networks

A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.

An Arrangement of Channels and Transceivers in Optical Packet Switching Networks

Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.

Event-triggered H_(∞) PI state estimation for delayed switched neural networks

On state estimation problems of switched neural networks,most existing results with an event-triggered scheme(ETS)not only ignore the estimator information,but also just employ a fixed triggering threshold,and the estimation error cannot be guaranteed to converge to zero.In addition,the state estimator of non-switched neural networks with integral and exponentially convergent terms cannot be used to improve the estimation performance of switched neural networks due to the difficulties caused by the nonsmoothness of the considered Lyapunov function at the switching instants.In this paper,we aim at overcoming such difficulties and filling in the gaps,by proposing a novel adaptive ETS(AETS)to design an event-based H_(∞)switched proportional-integral(PI)state estimator.A triggering-dependent exponential convergence term and an integral term are introduced into the switched PI state estimator.The relationship among the average dwell time,the AETS and the PI state estimator are established by the triggering-dependent exponential convergence term such that estimation error asymptotically converges to zero with H_(∞)performance level.It is shown that the convergence rate of the resultant error system can be adaptively adjusted according to triggering signals.Finally,the validity of the proposed theoretical results is verified through two illustrative examples.

A new burst assembly technique for supporting QoS in optical burst switching networks

This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme. The assembly mechanism, which is fit well to multi-class burst assembly, not only matches with IP QoS mechanism based on packet classification, and also utilizes fairly and efficiently assembly capacity. Based on token-bucket model and burst segment selective discard (BSSD), the offset-time scheme can smooth the traffic to support OBS QoS. The simulation results show that the technique can improve the performance in terms of packet loss probability (PLP).

A QoS-Guanranteed Scheduling Algorithm with High Throughput for Edge Nodes of Optical Burst Switching Networks

A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.

A novel scheme based on minimum delay at the edges for optical burst switching networks

This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE scheme features simultaneous burst assembly, channel scheduling, and pre-transmission of control packet. It also features estimated setup and explicit release (ESXR) signaling protocol. The MDE scheme can minimize the delay at the edge nodes for data packets, and improve the end-to-end latency performance for OBS networks. In addition, comparing with the conventional scheme, the performances of the MDE scheme are analyzed in this paper.

Improved adaptive-threshold burst assembly in optical burst switching networks

An improved adaptive-threshold burst assembly algorithm is proposed to alleviate the limitation of conventional assembly schemes on data loss and delay. The algorithm will adjust the values of assembly factors according to variant traffic regions. And the simulation results show that, by using the adaptive-factor adaptive assembly scheme, the performance of networks is extensively enhanced in terms of burst loss probability and average queuing delay.

Scalable and Practical Nonblocking Switching Networks

Large-scale strictly nonblocking （SNB） and wide-sense nonblocking （WSNB） networks may be infeasible due to their high cost. In contrast, rearrangeable nonblocking （RNB） networks are more scalable because of their much lower cost. However, RNB networks are not suitable for circuit switching. In this paper, the concept of virtual nonblockingness is introduced. It is shown that a virtual nonblocking （VNB） network functions like an SNB or WSNB network, but it is constructed with the cost of an RNB network. The results indicate that for large-scale circuit switching applications, it is only needed to build VNB networks.

Discontinuous event-trigger scheme for global stabilization of state-dependent switching neural networks with communication delay

This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggering times,a discontinuous event-trigger scheme is utilized to determine whether the sampling information is required to be sent outor not.Meanwhile,under the effect of communication delay,the trigger condition and SDSNNs are transformed into twotractable models by designing a fictitious delay function.Then,using the Lyapunov–Krasovskii stability theory,someinequality estimation techniques,and extended reciprocally convex combination method,two sufficient criteria are established for ensuring the global stabilization of the resulting closed-loop SDSNNs,respectively.A unified framework isderived that has the ability to handle the simultaneous existence of the communication delay,the properties of discontinuousevent-trigger scheme,as well as feedback controller design.Additionally,the developed results demonstrate a quantitativerelationship among the event trigger parameter,communication delay,and triggering times.Finally,two numerical examples are presented to illustrate the usefulness of the developed stabilization scheme.

Robust Feedback Set Stabilization of Logic Networks with State-Dependent Uncertain Switching and Control Constraints

This study investigates the robust feedback set stabilization of switched logic control networks(SLCNs)with state-dependent uncertain switching and control constraints.First,based on the properties of the semi-tensor product of matrices and the vector representation of logic,an SLCN with state-dependent uncertain switching and control constraints is expressed in algebraic form.Second,an input transformation and a switching model are constructed to transfer the original SLCN into one with a free control input and arbitrary switching.The equivalence between the set stabilizability of the original SLCN and that of the resulting SLCN is established.Based on such equivalence,the authors propose a necessary and sufficient condition for robust feedback set stabilizability.Finally,an example is presented to demonstrate the application of the results obtained.

Stability of multiple fans in mine ventilation networks

In large mines,single fan is usually not enough to ventilate all the working areas.Single mine-fan approach cannot be directly applied to multiple-fan networks because the present of multiple pressures and air quantities associated with each fan in the network.Accordingly,each fan in a multiple-fan system has its own mine characteristic curve,or a subsystem curve.Under some consideration,the conventional concept of a mine characteristic curve of a single-fan system can be directly extended to that of a particular fan within a multiple-fan system.In this paper the mutual effect of the fans on each other and their effect on the stability of the ventilation network were investigated by Hardy Cross algorithm combined with a switching-parameters technique.To show the validity and reliability of this algorithm,the stability of the ventilation system of Abu-Tartur Mine(one of the largest underground mine in Egypt)has been studied.

An Interconnected Multi-Plane Multi-Stage Fault-Tolerant On-Board Switching Fabric

The harsh space radiation environment compromises the reliability of an on-board switching fabric by leading to cross-point and switching element(SE)faults.Different from traditional faulttolerant switching fabrics only taking crosspoint faults into account,a novel Input and Output Parallel Clos network,referred to as the(p_1,p_2)-IOPClos,is proposed to tolerate both cross-point and SE faults.In the(p_1,p_2)-IOPClos,there are p_1 and p_2 expanded parallel switching planes in the input and output stages,respectively.The multiple input/output switching planes are interconnected through the middle stage to provide multiple paths in each stage by which the network throughput can be increased remarkably.Furthermore,the network reliability of the(p_1,p_2)-IOPClos under the above both kinds of faults is analyzed.The corresponding implementation cost is also presented along with the network size.Both theoretical analysis and numerical results indicate that the(p_1,p_2)-IOPClos outperforms traditional Clos-type networks at reliability,while has less implementation cost than the multi-plane Clos network.

Performance Analysis of DEBT Routing Protocols for Pocket Switch Networks

Pocket Switched Networks(PSN)represent a particular remittent network for direct communication between the handheld mobile devices.Compared to traditional networks,there is no stable topology structure for PSN where the nodes observe the mobility model of human society.It is a kind of Delay Tolerant Networks(DTNs)that gives a description to circulate information among the network nodes by the way of taking the benefit of transferring nodes from one area to another.Considering its inception,there are several schemes for message routing in the infrastructure-less environment in which human mobility is only the best manner to exchange information.For routing messages,PSN uses different techniques such asDistributed Expectation-Based Spatio-Temporal(DEBT)Epidemic(DEBTE),DEBT Cluster(DEBTC),and DEBT Tree(DEBTT).Understanding on how the network environment is affected for these routing strategies are the main motivation of this research.In this paper,we have investigated the impact of network nodes,the message copies per transmission,and the overall carrying out of these routing protocols.ONE simulator was used to analyze those techniques on the basis of delivery,overhead,and latency.The result of this task demonstrates that for a particular simulation setting,DEBTE is the best PSN routing technique among all,against DEBTC and DEBTT.

Network Resource Provisioning for IP over Multi-Granular Optical Networks

In the internet protocol（IP） over multi-granular optical switch network （IP/MG-OXC）, the network node is a typical multilayer switch comprising several layers, the IP packet switching （PXC） layer, wavelength switching （WXC） layer and fiber switching （FXC） layer. This network is capable of both IP layer grooming and wavelength grooming in a hierarchical manner. Resource provisioning in the multi-granular network paradigm is called hierarchical grooming problem. An integer linear programming （ILP） model is proposed to formulate the problem. An iterative heuristic approach is developed for solving the problem in large networks. Case study shows that IP/MG-OXC network is much more extendible and can significantly save the overall network cost as compared with IP over wavelength division multiplexing network.

Event-Triggered Zero-Gradient-Sum Distributed Algorithm for Convex Optimization with Time-Varying Communication Delays and Switching Directed Topologies

Nowadays, distributed optimization algorithms are widely used in various complex networks. In order to expand the theory of distributed optimization algorithms in the direction of directed graph, the distributed convex optimization problem with time-varying delays and switching topologies in the case of directed graph topology is studied. The event-triggered communication mechanism is adopted, that is, the communication between agents is determined by the trigger conditions, and the information exchange is carried out only when the conditions are met. Compared with continuous communication, this greatly saves network resources and reduces communication cost. Using Lyapunov-Krasovskii function method and inequality analysis, a new sufficient condition is proposed to ensure that the agent state finally reaches the optimal state. The upper bound of the maximum allowable delay is given. In addition, Zeno behavior will be proved not to exist during the operation of the algorithm. Finally, a simulation example is given to illustrate the correctness of the results in this paper.

Cognitive Analysis of Auditory Temporal Sequence Information Difference Based on Network Switching

Auditory sense is an important way for people to receive and interact with foreign information.In different environment,the auditory sense changes.Therefore,it is necessary to find a detection method that can detect hearing in a timely manner.In this paper,EEG experiments were used to construct and compare brain functional networks in different states,and auditory state models were constructed with different auditory input signals.Secondly,the cross-correlation method is used to slice the signal and construct the adjacency matrix.Louvain community detection algorithm is used to process the data and calculate the network conversion rate under different parameters.It is concluded that the network conversion rate can be used to analyze the temporal variation of auditory information under the condition of controlled parameters.This indicates that the network conversion rate can also be used as a method to analyze auditory signals in the future.

N×N Clos Digital Cross-Connect Switch Using Quantum Dot Cellular Automata(QCA)

Quantum dot cellular automata(QCA)technology is emerging as a future technology which designs the digital circuits at quantum levels.The tech-nology has gained popularity in terms of designing digital circuits,which occupy very less area and less power dissipation in comparison to the present comple-mentary metal oxide semiconductor(CMOS)technology.For designing the rou-ters at quantum levels with non-blocking capabilities various multi-stage networks have been proposed.This manuscript presents the design of the N×NClos switch matrix as a multistage interconnecting network using quantum-dot cellular automata technology.The design of the Clos switch matrix presented in the article uses three input majority gates(MG).To design the 4×4 Clos switch matrix,a basic 2×2 switch architecture has been proposed as a basic mod-ule.The 2×2 switching matrix(SM)design presented in the manuscript utilizes three input majority gates.Also,the 2×2 SM has been proposed usingfive input majority gates.Two different approaches(1&2)have been presented for designing 2×2 SM usingfive input majority gates.The 2×2 SM design based on three input majority gate utilizes four zone clocking scheme to allow signal transmis-sion.Although,the clocking scheme used in 2×2 SM using three input MG and in 2×2 SM approach 1 usingfive input MG is conventional.The 2×2 SM approach 2 design,utilizes the clocking scheme in which clocks can be applied by electricfield generators easily and in turn the switch element becomes physically realizable.The simulation results conclude that the 2×2 SM is suitable for designing a 4×4 Clos network.A higher order of input-output switching matrix,supporting more number of users can utilize the proposed designs.

A Universal Hybrid Precoding Scheme for Massive MIMO Communications

Based on an analog radio frequency(RF)network,hybrid precoding(HPC)for massive MIMO can achieve very high spectral efficiencies with moderate hardware cost and power consumption.Despite the extensive research efforts in recent years,the practioners are still looking for HPCs that are efficient and easy-to-implement.In this paper,we present a new method termed as the universal hybrid precoding(UHP),which is nearly optimal,computationally efficient,and applicable to various types of RF network(thus,the name universal):the components of the network can be phase shifters(with finite or infinite resolutions),switches,or their combinations;the topology of the network can be fully-connected or partiallyconnected.Besides the standard UHP,we also propose a simplified version termed as sUHP to trade a negligible performance loss for much reduced computational complexity.The analysis shows that the computational complexity of the proposed UHP/sUHP is one to two orders of magnitude lower than the state-of-theart methods.Simulation results verify the(near-)optimality of the proposed UHP scheme for various forms of the analog networks.

A novel optical burst switching architecture for high speed networks

A novel optical burst switching （OBS） high speed network architecture has been proposed. To verify its feasibility and evaluate its performance, just-enough-time （JET） signaling has been considered as a high performance protocol. In the proposed architecture, to avoid burst losses, firstly, a short-prior- confirmation-packet （SPCP） is sent over the control channel that simulates the events that the actual packet will experience. Once SPCP detects a drop at any of the intermediate nodes, the actual packet is not sent but the process repeats. In order to increase network utilization, cost effectiveness and to overcome some limitations of conventional OBS, inherent codes （e.g., orthogonal optical codes （OOC））, which are codified only in intensity, has been used. Through simulations, it shows that a decrease in burst loss probability, cost effectiveness and a gain in processing time are obtained when optical label processing is used as compared with electronic processing.

Heralded linear optical quantum Fredkin gate based on one auxiliary qubit and one single photon detector

Linear optical quantum Fredkin gate can be applied to quantum computing and quantum multi-user communication networks. In the existing linear optical scheme, two single photon detectors （SPDs） are used to herald the success of the quantum Fredkin gate while they have no photon count. But analysis results show that for non-perfect SPD, the lower the detector efficiency, the higher the heralded success rate by this scheme is. We propose an improved linear optical quantum Fredkin gate by designing a new heralding scheme with an auxiliary qubit and only one SPD, in which the higher the detection efficiency of the heralding detector, the higher the success rate of the gate is. The new heralding scheme can also work efficiently under a non-ideal single photon source. Based on this quantum Fredkin gate, large-scale quantum switching networks can be built. As an example, a quantum Bene~ network is shown in which only one SPD is used.