Showing papers on "Fast packet switching published in 2016"

Reduced-Packet-Delay Generalized Buffer-Aided Relaying Protocol: Simultaneous Activation of Multiple Source-to-Relay Links

Abstract: Motivated by the recent buffer-aided relaying protocol that selects the best available link at each time slot, we herein introduce an additional degree of freedom to the protocol by simultaneously exploiting multiple links between the source node and the multiple buffer-aided relay nodes, which is enabled owing to the broadcast nature of wireless channels. More specifically, the proposed schemes are designed to allow multiple relay nodes to receive a source packet through source-to-relay broadcast channels, resulting in multiple copies of the source packet, which are stored in relay node buffers. As the explicit benefits of its increased design degree of freedom, the proposed protocols attain a significantly lower end-to-end packet delay than the conventional buffer-aided relaying protocols, which is achieved without imposing any substantial penalty on the achievable outage probability. Furthermore, the proposed protocol is capable of reducing the overhead required for monitoring the available links and buffer statuses of the relay nodes. Based on the Markov chain model, we derive the theoretical bounds of the outage probabilities of the proposed protocols.

Low-Power Optical Packet Switching for 100-Gb/s Burst Optical Packets With a Label Processor and 8 × 8 Optical Switch

Abstract: We demonstrate error-free 100-Gb/s optical packet switching with low power consumption by using a combination of a label processor and 8 × 8 broadcast-and-select (B&S) optical switch. To achieve energy-efficient label processing, an optical-trigger-pulse generator that consumes energy only for a very short duration is realized, whereas the optoelectronic serial-to-parallel converter used to interface the fast label bits to a slow CMOS processor has been improved to operate with a reduced trigger pulse energy of 0.35 pJ. Moreover, the electro-absorption-modulator-based B&S optical switch is significantly enhanced by introducing a surface ground electrode for eliminating electrical crosstalk and integrated spot-size converters with easy fabrication process. The total power consumption of the full 8 × 8 optical packet switch is estimated to be as low as 27.3 W or 3.4 W/100-Gb/s port.

Many-Field Packet Classification for Software-Defined Networking Switches

Abstract: Packet classification is a core problem for OpenFlow-based software-defined networking switches, which required 38 packet header fields per flow to be examined against thousands of rules in a ruleset. With the trend of continue growing number of fields in a rule and the number of rules in rule set, it will be a great challenge to design a high performance packet classification solution with the capability to easy update new rule and fields. In this paper, we present a scalable many-field packet classification algorithm with varying rulesets and its prototype implementation on a graphics processing unit. The proposed algorithm constructs multiple lookup tables and merges partial lookup results for a small ruleset to accelerate the overall packet classification process by using effective bit positions in a ruleset with three selecting metrics: wildcard ratio, independence index, and diversity index. Those lookup tables made with effective bit positions are flat with a low rule replication ratio. Besides, they are adjustable to meet different implementation environments for a good performance scalability between different ruleset sizes. Our prototype on a single NVIDIA K20C GPU achieves 198 MPPS, 186 MPPS, 163 MPPS throughput for 1K, 32K, and 100K 15-field ruleset.

Software-based packet broker

Abstract: Techniques for implementing a software-based packet broker in a visibility network are provided. According to one embodiment, the software-based packet broker can comprise a network device and a cluster of one or more processing nodes. The network device can receive a control or data packet replicated from a core network and forward the control or data packet to the cluster of one or more processing nodes. At least one processing node in the cluster can then execute, in software, one or more packet processing functions on the control or data packet, where the one or more packet processing functions are operable to determine an egress port of the network device through which the control or data packet should be forwarded to a probe/tool of the visibility network for analysis.

Packet tunneling method, switching device, and control device

Abstract: A packet tunneling method, a switching device, and a control device are provided. The method includes: a switching device receives a tunnel flow table entry delivered by the control device, where the tunnel flow table entry is used to determine a to-be-tunneled packet and indicate a tunneling operation to be performed on the to-be-tunneled packet; determines according to the tunnel flow table entry, whether the received first packet is the to-be-tunneled packet; and when the first packet is the to-be-tunneled packet, and tunnels the first packet according to the tunnel flow table entry. Because the switching device supports a tunnel flow table, when a packet is transmitted in a mobile packet network by using the OpenFlow protocol, tunnel encapsulation or decapsulation can be performed on the packet by using the tunnel flow table entry delivered by the control device, thereby enhancing a packet processing capability in the mobile packet network.

Traffic deduplication in a visibility network

Abstract: Techniques for implementing traffic deduplication in a visibility network are provided. According to one embodiment, a packet broker of the visibility network can receive a control or data packet replicated from a core network. The packet broker can then apply a first stage deduplication process in which the packet broker attempts to deduplicate the control or data packet based on one or more interfaces of the core network from which the control or data packet originated, and apply a second stage deduplication process in which the packet broker attempts to deduplicate the control or data packet based on the content (e.g., payload) of the control or data packet.

Network-based computational accelerator

Abstract: A data processing device includes a first packet communication interface for communication with at least one host processor via a network interface controller (NIC) and a second packet communication interface for communication with a packet data network. A memory holds a flow state table containing context information with respect to multiple packet flows conveyed between the host processor and the network via the first and second interfaces packet communication interfaces. Acceleration logic, coupled between the first and second packet communication interfaces, performs computational operations on payloads of packets in the multiple packet flows using the context information in the flow state table.

A high-performance OpenFlow software switch

Abstract: Software switches offer flexibility to service providers but potentially suffer from low performance. A software switch called Lagopus was implemented using Intel's Data Plane Development Kit (DPDK), which offers libraries for high-performance packet handling. Prior work on software switches focused on characterizing packet forwarding throughput. In this work, we evaluated the impact of certain parameters and settings in Lagopus on application performance and studied packet drop rates. The importance of receive-thread packet classification for load balancing and to send delay-sensitive flows to a different worker thread from high-throughput flows was first demonstrated. Next, we showed that a loop-count variable used to control packet batching should be kept small in case link utilization is low. Finally, we showed that packet drop rate could be non-zero when the OpenFlow table size is large and packet arrival rate is high, and interestingly, the packet drop rate was higher with four worker threads than with a single worker thread. This implies a need for careful calibration and planning of the parameters of parallelization.

Reduced Switching Connectivity for Power-Efficient Large Scale Antenna Selection.

Abstract: In this paper, we explore reduced-connectivity radio frequency (RF) switching networks for reducing the analog hardware complexity and switching power losses in antenna selection (AS) systems. In particular, we analyze different hardware architectures for implementing the RF switching matrices required in AS designs with a reduced number of RF chains. We explicitly show that fully-flexible switching matrices, which facilitate the selection of any possible subset of antennas and attain the maximum theoretical sum rates of AS, present numerous drawbacks such as the introduction of significant insertion losses, particularly pronounced in massive multiple-input multiple-output (MIMO) systems. Since these disadvantages make fully-flexible switching suboptimal in the energy efficiency sense, we further consider partially-connected switching networks as an alternative switching architecture with reduced hardware complexity, which we characterize in this work. In this context, we also analyze the impact of reduced switching connectivity on the analog hardware and digital signal processing of AS schemes that rely on channel power information. Overall, the analytical and simulation results shown in this paper demonstrate that partially-connected switching maximizes the energy efficiency of massive MIMO systems for a reduced number of RF chains, while fully-flexible switching offers sub-optimal energy efficiency benefits due to its significant switching power losses.

Systems and methods to enhance radio link performance in a multi-carrier environment

Abstract: Described herein are systems and methods to enhance radio link performance in a multi-carrier environment. A method may comprise sending, by an upper level layer of a wireless device, user data in a packet for transmission, wherein the packet includes an indication of a level of priority of the packet, receiving, by a media access control (“MAC”) layer of the wireless device, the packet for transmission including the indication of the level of priority provided by the upper level layer, identifying, by the MAC layer, a reliability of each of a plurality of component carriers, and selecting, by the MAC layer, one of the component carriers on which to transmit the packet, wherein the selecting is based on the level of priority of the packet and the reliability of the one of the component carriers.

Combining forward error correction and network coding in bufferless networks: A case study for optical packet switching

Abstract: Bufferless network operation is favorable in many application domains such as industrial networks, on-chip networks and optical packet switching (OPS). The main challenge with zero buffers is the avoidance or handling of contention; indeed, many domain-specific contention resolution techniques have been proposed in the literature. In this paper, we propose a generic combined forward error correction (FEC) and network coding (NC) scheme, which mitigates the negative impact of contentions at the network layer. Specifically, we present a case study for OPS utilizing FEC at the ingress node and NC at an intermediary optical packet switch to reduce packet loss due to contention. Our analysis shows that if used in a smart way, our mechanism can reduce decoding error and packet loss with multiple orders of magnitude while adhering to buffering limitations and meeting delay requirements. We believe that such a combined coding scheme has the potential to be utilized both in OPS (data center and core networks) and other networks where (near-)zero buffers are required.

Package extension for wireless communication

Abstract: There will be described for processing a wirelessly received packet, while still the "legacy" -SIFS time-constraint is complied with methods, systems and devices for providing additional processing time for one or more device (s). The additional processing time can be achieved by means of a device that transmits the packet, a padding and / or a packet extension is added to the last symbol of the packet. The for the device (s) provided, additional processing time advantageously reduces the amount of additional hardware that would normally added to meet the SIFS time constraint. The scope of the to be added to the last symbol filling and / or package expansion is compensated in order to minimize the complexity of the device (s) with respect to the reduction of the system efficiency, which suffer the device (s).

Fine-grained all-optical switching based on optical time slice switching for hybrid packet-OCS intra-data center networks

Abstract: We propose a hybrid packet-OCS intra-datacenter network architecture with bufferless sub-wavelength all-optical time slice switching enabled by high-precision time synchronization. We experimentally demonstrate flex-capacity sub-wavelength circuit establishment among the ToR switches without buffers and contention.

Recent advances in optical and hybrid packet switching

Abstract: The future of Internet depends on meeting ever-increasing capacity needs while curbing the energy consumption's uncontrolled growth in data networks, especially in switching. Optics has a tremendous potential to solve these challenges, but the lack of practical optical buffers leaves optical packet switches vulnerable to contention, hindering their use even at moderate network loads. Recent developments in optical switching devices (InP- and silicon-based), hybrid packet switching (using electronic buffers in optical switches) and network architectures (where upper layers could tolerate some loss in the optical packet layer) show a possibility that optical packet switches are poised to make a comeback in practical networks.

Network Packet Filtering and Deep Packet Inspection Hybrid Mechanism for IDS Early Packet Matching

Abstract: Modern network packet processing applications such as Intrusion Detection System (IDS) perform packet filtering and deep packet inspection (DPI), also known as packet content inspection. Fundamentally, for packet filtering, these applications attempt to use the contents of some header fields of the network, transport and application layers of the packets. While for DPI, these applications use attack signature rules to search for predefined patterns in the packet application header fields or payload data. This paper discusses a hybrid mechanism based on the use of splay tree filters and pattern-matching algorithms to enhance IDS packet filtering and DPI performance, respectively. The proposed mechanism uses network traffic statistics to dynamically optimize the order of the splay tree filters, allowing early acceptance and rejection of network packets. In addition, DPI signature rules are reordered according to their matching frequencies, allowing early packets acceptance. We demonstrate the merit of our mechanism through simulations performed on Snort's string set.

Method and apparatus for forwarding packet

Abstract: A method and an apparatus for forwarding a packet, where a first network virtualization edge (NVE) receives a first packet sent by a first tenant end system (TES), where a destination Internet Protocol (IP) address of the first packet is an IP address of a second TES, a destination media access control (MAC) address of the first packet is a gateway MAC address corresponding to the first NVE. The first NVE acquires an access virtual network identifier (VN ID) and a layer 3 virtual private network (VPN) instance identifier of the first TES, and searches a routing and forwarding table, to obtain an entry corresponding to the IP address of the second TES. Then the first NVE encapsulates the first packet into a network virtualization overlays (NVO3) packet according to the entry, and forwards the NVO3 packet to a second NVE to forward to the second TES.

Packet routing and frame length optimization in wireless mesh networks with multicast communications

Abstract: The paper considers multi-hop wireless mesh networks that serve multicast periodic packet traffic. The packets from each packet stream are generated at the stream's source node and traverse a number of wireless nodes in order to reach their multiple destination nodes. Packet periodicity means that a common repeatable frame of time slots is defined and that the packets to be transmitted arrive at the source of each packet stream at the beginning of each consecutive frame. The novel element is that the packet transmitted by the node is simultaneously received by multiple listening nodes. The particular problem dealt with in the paper consists in minimization of the frame length (which is equivalent to packet throughput maximization) together with optimization of the multicast trees to be used by the packet streams. For that, we develop an integer-programming optimization model and the related near-optimal algorithm whose (very good) effectiveness is illustrated with numerical results.

Optical versus electronic packet switching in delay-sensitive 5G networks: myths versus advantages

Abstract: We show that optical packet switching (OPS) 5G networks without buffers in their switches are expected to offer applications that require reliable packet delivery [e.g., zero losses via transmission control protocol (TCP)] the following improvements, compared to what is offered by the state-of-the-art in electronic packet switching (EPS) networks: lower flow completion times, and thus higher throughputs (useful for most Internet applications); lower probability ofmissing hard per-packet end-to-end deadlines (useful for real-time applications); and higher numbers of packets that outrun their counterparts that use an EPS network (useful for winner-takes-it-all applications like latency-sensitive trading algorithms).We also show that this superior performance of OPS over EPS increases asymptotically in favor of OPS as network loads grow. We show how this counterintuitive result seems to stemfromthe lowaverage and low variance of end-to-end packet delays caused by the lack of queues in bufferlessOPS switches,which, in turn, allow end-to-end congestion control algorithms (e.g., inside TCP) to react and compensate packet losses swiftly.

CirKet: A Performance Efficient Hybrid Switching Mechanism for NoC Architectures

Abstract: In this paper, we propose and evaluate a hybrid switching mechanism for Network-on-Chips (NoCs) We propose the use of pseudo circuit-switching along with packet-switching in NoC routers To do this, packets traversing NoC channels are categorized into high and low priority packets which are routed using pseudo circuit and packet switching respectively Each output port of NoC routers are equipped with a one-bit flag register indicating that the traversing packet is either of low or high priority packet Using pseudo circuit switching, high priority packets reserve the intermediate routers till the tail flit passes the router The proposed switching mechanism offers its highest efficiency for applications in which the traffic is dominated by streams We have used Booksim2 which is a cycle accurate NoC simulator to evaluate the proposed switching technique Results show that the proposed switching mechanism 1) offers at least 10% improvement in overall flit latency in all tested scenarios as compared with a packet-switched NoC, 2) reduces the power dissipation in the router logic by at least 4%, and 3) imposes a negligible area overhead to NoC router circuitry

Power packet dispatching with features on safety

Abstract: This paper investigates and proposes one advantageous function of a power packet dispatching system, which has been proposed by authors’ group with being apart from the conventional power distribution system. Here is focused on the feature on safety of power packet dispatching which covers two aspects: information safety (protect the information of packet from attackers) and power safety (keep loads safe regarding supplied power from packet). For the purpose of achieving the information safety and the power safety, we introduce simple modulations of power packets before sending them. In particular, in order to protect the information of packets, partial packet modulation is proposed first, i.e., modulating partial information tags of packets. Modulation scheme based on chaotic signal is one possibility for this purpose and we adopt the differential chaos shift keying (DCSK) scheme in this paper. Next, the power safety can be achieved by applying pulse width modulation (PWM) to the payload of packets. Meanwhile, considering the effect of the noise on the packet dispatching, further modulation of the payload using the DCSK scheme is proposed, which can spread the spectrum of the noise. Consequently, we introduce the concept of whole packet modulation, in which PWM is applied to the payload of packets first, and then modulation using the DCSK scheme is applied throughout the whole packet. In this manner, both the information safety and the power safety can be achieved and the spectrum of noise is spread as well. Additionally, it is worth mentioning that the rigorous examination of the modulation method is not the target in this moment.

Method and apparatus for data packet switching, access switch and switching system

Abstract: The present invention provides a method and an apparatus for data packet switching, and an access switch and a switching system, so as to satisfy requirements of a datacenter for a switching bandwidth and a switching granularity. The method includes: receiving MAC frame control information; determining an interface used for forwarding an MAC frame according to the MAC frame control information and through performing a query on a MAC address forwarding table, where the interface used for forwarding the MAC frame includes a downlink interface, an uplink electrical packet switching network interface and/or an uplink optical packet switching network interface; transmitting a control signal to an electrical packet switching unit, so that the MAC frame is forwarded to the determined interface. According to the method provided in the present invention, the utilization rate of each interface can be improved.

System and method for handling uplink transmissions

Abstract: In one example embodiment, a method (1300) by a wireless device (710A-C) includes attempting to transmit (1302) a first data packet (1114) during a first transmission time interval (1110). During a second transmission time interval (1112) that is subsequent to the first transmission time interval (1110), a second data packet (1116) is transmitted if the transmission of the first data packet (1114) during the first transmission time interval (1110) was successful. The second data packet (1116) includes data that is exclusive of the data of the first data packet (1114). Alternatively, if the transmission of the first data packet (1114) during the first transmission time interval (1110) was not successful, a third data packet (1118) is transmitted. The third data packet (1110) includes data that includes at least a portion of the data of the first data packet (1114).

Analysis on Decode-and-Forward Two-Path Relay Networks: When and How to Cooperate

Abstract: Two-path relay networks can be deployed to achieve full-rate transmissions. In this paper, we introduce stable throughput analysis into decode-and-forward (DF) two-path relay networks. We establish the queueing model and take outage probabilities into consideration to characterize the packet-level cooperation and derive the closed-form stable throughput region. Based on the stable throughput region, we also propose a power-allocation scheme between the source node and relays to maximize the achievable packet rate. The maximal achievable packet rate determines the admission control of certain cooperation (i.e., when to cooperate) under a specific interrelay interference (IRI) cancellation technique. The power allocation is utilized to illustrate how to cooperate between the source node and relays. Three IRI responses are considered, and the system behaviors under various circumstances are presented through simulations.

Spatially, spectrally, temporally flexible optical network with spatial and spectral super-channel optical packet switching system

Abstract: A novel SDM-WDM optical packet switching (OPS) network is proposed for multi-granularity and efficient resource utilization. To simplify the configuration of the network switching nodes, a spatial-spectral super-channel OPS system is proposed and experimentally demonstrated.

Packet relay device, and copy function distribution method of packet relay device

Abstract: An apparatus includes a plurality of first circuits that duplicate and transmit a packet, a memory that store the packet correspond to one of the plurality of first circuit, and a second circuit that select one of the plurality of first circuits, using cumulative remaining copy amount correspond to each of the plurality of first circuits that are calculated based on the packet accumulation in the memory.

Protection switching systems and methods in a packet network based on signal degrade

Abstract: A method of protection switching in a packet network based on signal/service degrade includes monitoring a packet network connection; detecting the packet network connection has a signal/service degrade including a condition where the packet network connection is operational, but experiencing errors below a threshold; and responsive to detection of the signal/service degrade one or more of notifying nodes in the packet network and performing a protection switch based on the signal/service degrade. The signal/service degrade is detected through one or more of i) determining a Frame Error Rate imputed from one or more of Bit Error Rate, frame events, and frame losses; ii) frame delay measurements; and iii) a combination thereof.

BLOC: A generic resource allocation framework for hybrid packet/circuit-switched networks

Abstract: In the current Internet, large flows co-exist with small flows and often consume a significant proportion of the network bandwidth. This imposes a challenge on network resource management. Various hybrid switching architectures have been proposed in recent years, aiming to address this challenge and improve energy efficiency and resource utilization. However, there is still a need for means for the design and dimensioning of resources in multiple switching planes and understanding the system behavior under different traffic patterns. In this paper, we propose a framework that we call the blocking-loss curve (BLOC) to address the resource allocation problem in hybrid switching systems. BLOC can capture the behavior of hybrid switching systems under different resource allocation solutions considering packet loss and request blocking. This framework also allows us to identify the feasible region for resource allocation, which can satisfy both the packet loss and request blocking requirements. An optimal resource allocation strategy may be found based on this feasible region. We also study the application of BLOC to a specific hybrid switching system, where packet switching comprises TCP flows with active queue management, and circuit switching is single granular, e.g., lightpath switching. Numerical results demonstrate how the flow characteristics and system parameters may affect the feasible region and the optimal allocation of resources.

Packet or passive optical network system with protection switching capabilities

Abstract: A packet or passive optical network system with packet-based protection switching capabilities is provided. The system performs comprehensive protection switching against failures in all segments of a passive optical network (PON), thereby implementing lossless protection switching against failures in any segment in a packet network and against failures in any segment of the PON that consists of optical line terminals (OLTs), optical cables, optical network units (ONUs) of a PON system.

All optical contention detection and resolution for asynchronous variable length optical packets switching

Abstract: We proposed a novel 2×2 all optical packet switching router architecture supporting asynchronous, labelled and variablelength packet. A proof of concept through Matlab Simulink simulation is validated. Then we discussed the three possible scenarios to demonstrate the contention resolution technique based on deflection routing. We have showing that the contending packet is detected and forwarded according FIFO (First In First Out) strategy to another output.