SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN

A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.

微段子

路由器 A：“当我的生命需要用设备维持的时候，请帮我拔掉它。” B：“真的吗？” A：“嗯……，哎，你干嘛呢？赶紧把无线路由器给我接上!”

A low-power high-throughput link splitting router for NoCs

In this paper, we propose a technique for lowering the latency of the communication in a NoC （network on chip）. The technique, which can support two qualities of service （QoS）, i.e., the guaranteed throughput （GT） and best effort （BE）, is based on splitting a wider link into narrower links to increase throughput and decrease latency in the NoC. In addition, to ease the synchronization and reduce the crosstalk, we use the l-of-4 encoding for the smaller buses. The use of the encoding in the proposed NoC architecture considerably lowers the latency for both BE and GT packets. In addition, the bandwidth is increased while the power consumption of the links is reduced.

Energy-Aware Traffic Routing with Named Data Networking

Greening Internet is an important issue now, which studies the way to reduce the increas- ing energy expenditure. Our work focuses on the network infrastructure and considers its energy awareness in traffic routing. We formulate the model by traffic engineering to achieve link rate a- daption, and also predict traffic matrices to pre- serve network stability. However, we realize that there is a tradeoff between network performance and energy efficiency, which is an obvious issue as Internet grows larger and larger. An essential cause is the huge traffic, and thus we try to fred its so- lution from a novel architecture called Named Data Networking （NDN） which tent in edge routers and can flexibly cache con- decrease the backbone traffic. We combine our methods with NDN, and finally improve both the network performance and the energy efficiency. Our work shows that it is effective, necessary and feasible to consider green- ing idea in the design of future Internet.

Using Lyapunov function to design optimal controller for AQM routers

It was shown that active queue management schemes implemented in the routers of communication networks sup-porting transmission control protocol (TCP) flows can be modelled as a feedback control system. In this paper based on Lyapunov function we developed an optimal controller to improve active queue management (AQM) router’s stability and response time, which are often in conflict with each other in system performance. Ns-2 simulations showed that optimal controller outperforms PI controller significantly.

Preventing“Bad”Content Dispersal in Named Data Networking

Named Data Networking(NDN)improves the data delivery efficiency by caching contents in routers. To prevent corrupted and faked contents be spread in the network,NDN routers should verify the digital signature of each published content. Since the verification scheme in NDN applies the asymmetric encryption algorithm to sign contents,the content verification overhead is too high to satisfy wire-speed packet forwarding. In this paper, we propose two schemes to improve the verification performance of NDN routers to prevent content poisoning. The first content verification scheme, called "user-assisted",leads to the best performance, but can be bypassed if the clients and the content producer collude. A second scheme, named ``RouterCooperation ‘', prevents the aforementioned collusion attack by making edge routers verify the contents independently without the assistance of users and the core routers no longer verify the contents. The Router-Cooperation verification scheme reduces the computing complexity of cryptographic operation by replacing the asymmetric encryption algorithm with symmetric encryption algorithm.The simulation results demonstrate that this Router-Cooperation scheme can speed up18.85 times of the original content verification scheme with merely extra 80 Bytes transmission overhead.

A Router Based Packet Filtering Scheme for Defending Against DoS Attacks

The filter-based reactive packet filtering is a key technology in attack traffic filtering for defending against the Denial-of- Service （DOS） attacks. Two kinds of relevant schemes have been proposed as victim- end filtering and source-end filtering. The first scheme prevents attack traffic from reaching the victim, but causes the huge loss of legitimate flows due to the scarce filters （termed as collateral damages）; the other extreme scheme can obtain the sufficient filters, but severely degrades the network transmission performance due to the abused filtering routers. In this paper, we propose a router based packet filtering scheme, which provides relatively more filters while reducing the quantity of filtering touters. We implement this scheme on the emulated DoS scenarios based on the synthetic and real-world Internet topologies. Our evaluation results show that compared to the previous work, our scheme just uses 20% of its filtering routers, but only increasing less than 15 percent of its collateral damage.

SAFE:a Scalable Filter-Based Packet Filtering Scheme

Recently, attacks have become Denial-of-Service （DOS） the mainstream threat to the internet service availability. The filter-based packet filtering is a key technology to defend against such attacks. Relying on the filtering location, the proposed schemes can be grouped into Victim-end Filtering and Source-end Filtering. The first scheme uses a single filtering router to block the attack flows near the victim, but does not take the factor that the filters are scarce resource into account, which causes the huge loss of legitimate flows; considering each router could contribute a few filters, the other extreme scheme pushes the filtering location back into each attack source so as to obtain ample filters, but this may incur the severe network transmission delay due to the abused filtering routers. Therefore, in this paper, we propose a scalable filter-based packet filtering scheme to balance the number of filtering routers and the available filters. Through emulating DoS scenarios based on the synthetic and real-world Intemet topologies and further implementing the various filter-based packet filtering schemes on them, the results show that our scheme just uses fewer filtering routers to cut off all attack flows while minimizing the loss of legitimate flows.

Mobility Support for Content Source in Content-Centric Networking

Content-centric networking(CCN) is rising to solve the problems suffered by traditional networks,especially in terms of content delivery.One of the critical issues for basic CCN is supporting mobility.Handoff of Mobile Content Source(MCS) will result in a large scale routing update,which generates huge amount of routing overhead and leads to service interruption.Most of the existing CCN mobility mechanisms are transplanted from the IP mobility solutions,which are unnaturally integrated with CCN.Different from previous works,a mobility strategy from the perspective of CCN architecture is proposed to support the handoff of MCS in this paper.Especially,we define the critical network routers that can limit the routing update scale effectively when MCS handoff is conducted.Based on the defined critical network routers,the proposed scheme can provide lower routing update overhead,faster routing convergence and shorter service interruption time.Finally,series of simulations are conducted to validate the effectiveness of our proposed scheme.

A Bilevel Programming Approach for Optimization of Airport Ground Movement

This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.

G-MER： Green Mobility Estimation- Based Routing Protocol in Wireless Sensor Network

As a core technology of Intemet of Things （loT）, Wireless Sensor Network （WSN） has become a research hotspot recently. More and more WSNs are being deployed in highly mobile environments. The fast moving sensor nodes bring significant challenges for the routing decision. In this paper, we propose an efficient logical location method, and designe a mobility estimating metric and derive a novel Green Mobility Estirmtion- based Routing protocol （G-MER） for WSNs. We also set up a full framework to evaluate its per- formance. Simulation results illustrate that G-MER achieves a fairly better perforrmnce in terrm of broadcast times and link failures than AODV. What＇s more, it decreases the mean hops by about 0.25 and reduces energy consumption by about 10% during the whole experiment. All the results show that G-MER can be effectively used in fast- moving and limited resource scenarios.

A High-Elasticity Router Architecture with Software Data Plane and Flow Switching Plane Separation

Routers have traditionally been architected as two elements: forwarding plane and control plane through For CES or other protocols. Each forwarding plane aggregates a fixed amount of computing, memory, and network interface resources to forward packets. Unfortunately, the tight coupling of packet-processing tasks with network interfaces has severely restricted service innovation and hardware upgrade. In this context, we explore the insightful prospect of functional separation in forwarding plane to propose a next-generation router architecture, which, if realized, can provide promises both for various packet-processing tasks and for flexible deployment while solving concerns related to the above problems. Thus, we put forward an alternative construction in which functional resources within a forwarding plane are disaggregated. A forwarding plane is instead separated into two planes: software data plane(SDP) and flow switching plane(FSP), and each plane can be viewed as a collection of "building blocks". SDP is responsible for packet-processing tasks without its expansibility restricted with the amount and kinds of network interfaces. FSP is in charge of packet receiving/transmitting tasks and can incrementally add switching elements, such as general switches, or even specialized switches, to provide network interfaces for SDP. Besides, our proposed router architecture uses network fabrics to achievethe best connectivity among building blocks,which can support for network topology reconfiguration within one device.At last,we make an experiment on our platform in terms of bandwidth utilization rate,configuration delay,system throughput and execution time.

A load-balanced minimum energy routing algorithm for Wireless Ad Hoc Sensor Networks

Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).

Multiple k-hop clusters based routing scheme to preserve source-location privacy in WSNs

Privacy is becoming one of the most notable challenges threatening wireless sensor networks(WSNs).Adversaries may use RF(radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor's location.A multiple k-hop clusters based routing strategy(MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs.Owing to the inherent characteristics of intra-cluster data aggregation,each sensor of the interference clusters is able to act as a fake source to confuse the adversary.Moreover,dummy traffic could be filtered efficiently by the cluster heads during the data aggregation,ensuring no energy consumption be burdened in the hotspot of the network.Through careful analysis and calculation on the distribution and the number of interference clusters,energy efficiency is significantly enhanced without reducing the network lifetime.Finally,the security and delay performance of MHCR scheme are theoretically analyzed.Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly,especially in large-scale WSNs.

Design of buffer structure at core nodes in optical burst switching

Reasonable and effective buffer structures are proposed in core routers /nodes of optical burst switching.Based on the model of burst traffics and their contentions,the basic qualifications for the design of buffer structures are concluded.With these qualifications,buffer and switch integrated structures are proposed;and by conclusion and expansion,the classification rules of buffer structures are also proposed from different angles.The schemes to integrate structures are analyzed and simulated.

Routing with constraint and wavelength assignment based on GMPLS support

To solve the routing and wavelength assignment problem in the optical network, this paper put forward the metric model with sparse wavelength conversion and routing algorithm with pruning （RAP） in order to efficiently realize the resource management in the unified way. Related methods with dynamic and adaptation characters considered the link state conditions and certain heuristic information. They can be applied to current network environments. In particular, the simulation was made according to the selfsimilar traffic and the results showed that the corresponding methods not only provided service differentiation but also reduced the overall average blocking Drobabilitv.

Influence of Crosstalk on Signal Power Based on Arrayed-waveguide Grating as N × N Optical Router

The fact that the signal results in signal―crosstalk is confirmed forarrayed―waveguide grating as NXN optical router, and the relation between the crosstalk and powerpenalty is obtained. The method reveals the random distributions of optical path phase errors in twomultiplexers with channel numbers of 10 and 160. It is shown that the crosstalk must be less than―28 dB for a power penalty below 1 dB at a bit error rate of 1X10^(-9). It is found that when N =100, crosstalk power value is ? 20 dB with compensation power of 2―3 dB, so the compensation poweris not ignored.

DESIGN AND IMPLEMENTATION OF SINGLE-BUFFERED ROUTERS

A Single-Buffered （SB） router is a router where only one stage of shared buffering is sandwiched between two interconnects in comparison of a Combined Input and Output Queued （CIOQ） router where a central switch fabric is sandwiched between two stages of buffering. The notion of SB routers was firstly proposed by the High-Performance Networking Group （HPNG） of Stanford University, along with two promising designs of SB routers： one of which was Parallel Shared Memory （PSM） router and the other was Distributed Shared Memory （DSM） router. Admittedly, the work of HPNG deserved full credit, but all results presented by them appeared to relay on a Centralized Memory Management Algorithm （CMMA） which was essentially impractical because of the high processing and communication complexity. This paper attempts to make a scalable high-speed SB router completely practical by introducing a fully distributed architecture for managing the shared memory of SB routers. The resulting SB router is called as a Virtual Output and Input Queued （VOIQ） router. Furthermore, the scheme of VOIQ routers can not only eliminate the need for the CMMA scheduler, thus allowing a fully distributed implementation with low processing and commu- nication complexity, but also provide QoS guarantees and efficiently support variable-length packets in this paper. In particular, the results of performance testing and the hardware implementation of our VOIQ-based router （NDSC~ SR1880-TTM series） are illustrated at the end of this paper. The proposal of this paper is the first distributed scheme of how to design and implement SB routers publicized till now.

An architecture and algorithm for green router IP lookup

Today,backbone networks deploy a large number of devices and links.This is mainly due to both redundancy purposes for network service reliability,and resource over-dimensioning for maintaining quality of service during rush hours.Unfortunately,current routers do not have power management primitives,and have constant energy consumption independent of their actual workloads.How to implement a low power and multi-stage switch forwarding for IP lookup is a challenge in high-performance green routers design.A forwarding information base multi-stage mapping routing lookup architecture is presented,and the dynamic routing table mapping algorithm is designed to determine the optimal strides for building tree bitmap tries which lead the worst-case power consumption of the IP lookup engine to be minimized.Experimental results show that the application of reallife routing tables demonstrates that the proposed method could reduce power consumption of routing lookup by 30%.

A Novel Active Network Architecture Based on Extensible Services Router

Active networks are a new kind of packet-switched networks in which packets have code fragments that are executed on the intermediary nodes (routers). The code can extend or modify the foundation architecture of a network. In this paper, the authors present a novel active network architecture combined with advantages of two major active networks technology based on extensible services router. The architecture consists of extensible service router, active extensible components server and key distribution center (KDC). Users can write extensible service components with programming interface. At the present time, we have finished the extensible services router prototype system based on Highly Efficient Router Operating System (HEROS), active extensible components server and KDC prototype system based on Linux.