Showing papers on "Fast packet switching published in 2009"

Packet switch and switching method for switching variable length packets

Abstract: A packet switch for switching variable length packets. Each output port interface of the packet switch includes a buffer memory, a transmission priority controller, and a packet readout controller. The buffer memory stores transmission packets. The transmission priority controller classifies, based on a predetermined algorithm, transmission packets passed from a packet switching unit into a plurality of queue groups to which individual bandwidths are assigned respectively, and queues the transmission packets in the buffer memory so as to form a plurality of queues according to transmission priority in each of the queue groups. The packet readout controller reads the transmission packets from each of the queue groups in the buffer memory according to the order of transmission priority of the packets while guaranteeing the bandwidth assigned to the queue group.

Methods and apparatus for shared layer 3 application card in multi-service router

Abstract: An apparatus and method for enhancing packet transfer in a network using duplicated copy of data packets are disclosed. Upon classifying a data packet in accordance with a set of predefined packet identifiers, the method for enhancing packet transfer, in one embodiment, generates a replicated packet which is substantially similar to the data packet in response to the result of classification of the data packet. The replicated packet is subsequently forwarded to an application component via a route of non-bearer traffic for facilitating parallel processing.

Multiprocessing computing with distributed embedded switching

Abstract: A first one of multiple embedded processing elements (12-14) in a computer (10) receives a delivery packet (124) that is formatted in accordance with a delivery protocol and includes (i) an encapsulated payload packet (136) that is formatted in accordance with a payload protocol and (ii) a delivery packet header (134) including routing information. In response to a determination that it is not the destination for the delivery packet (124), the first processing element (14) sends the delivery packet (124) from the first processing element (14) to a second one of the processing elements based on the routing information. In response to a determination that it is the destination for the delivery packet (124), the first processing element (14) decapsulates the payload packet (136) from the delivery packet (124) and processes the decapsulated payload packet (136).

Traffic control device, packet-based network and method for controlling traffic in a packet-based network

Abstract: A traffic control device (50) for a Quality of Service-aware packet-based network (10) comprises detection means (52) for detecting packet flows in a packet stream (46) by preferably repeatedly performing a data packet inspection on the packet stream (46), the data packet inspection being neither based on signaling information nor on application awareness, determining means (54) for determining a flow parameter, in particular a flow rate, of at least one of the detected packet flows, assignment means (56) for generating assignment information assigning a resource of the packet-based network (10) to the at least one detected packet flow in dependence of the detected flow parameter, and sending means (58) for sending the assignment information to a resource control device (44) for causing the resource control device (44) to allocate the assigned resource. In such a way, reliable and cost-efficient quality of service management in a packet-based network (10) is facilitated.

Establishing Network Quality of Service for a Virtual Machine

Abstract: A system and method for implementing a VM to identify a data packet for transmission, the data packet including a QoS the data packet is to receive as compared to another QoS that another data packet is to receive The system and method further includes a SNIC to pull the data packet from the VM based upon the QoS the data packet is to receive The system and method may also include a link scheduler module to transmit the data packet based upon the QoS the data packet is to receive The system and method may also include a receiver to receive a management instruction from a network management device, the management instruction to dictate the QoS the data packet is to receive based upon a SLA

Timing over packet performance

Abstract: The invention is directed to a method and apparatus for providing improved packet over timing clock synchronization in a packet switching network using Operations, Administration, and Maintenance (OAM) tools to compensate for asymmetrical characteristics between forward and reverse data paths

Dynamic buffering and synchronization of related media streams in packet networks

Abstract: Mechanisms are disclosed for using two or more buffers, at a common receiving node, to reduce the effects of jitter, packet loss, and/or packet latency and/or synchronize different types of packets. Specifically, the two or more buffers can be used to temporarily store packets from different media streams that have a common timestamp and/or sequence number. Characteristics of the two or more buffers can then be independently controlled to accommodate the different media streams.

Network relay apparatus and packet distribution method

Abstract: The present invention provides a network relay apparatus capable of assuring the prevention of occurrence of order reversion of packets within flows and shifting a packet distribution destination according to load information. The network relay apparatus includes: a packet distribution processor for distributing input packets to thereby achieve load dispersion of packet processing; a statistical information collector for regularly collecting load conditions of respective packet processors; and a distribution information holder for retaining information for specifying the packet distribution destinations upon distribution of the packets. Information about the load conditions of the respective packet processors are compiled and distributed to the packet processor smallest in load. Timing provided to change the packet distribution destination is assumed to be given when a processing waiting queue does not include a packet corresponding to its flow.

Single step mode in a software pipeline within a highly threaded network on a chip microprocessor

Abstract: A hardware thread is selectively forced to single step the execution of software instructions from a work packet granule. A “single step” packet is associated with a work packet granule. The work packet granule, with the associated “single step” packet, is dispatched as an appended work packet granule to a preselected hardware thread in a processor core, which, in one embodiment, is located at a node in a Network On a Chip (NOC). The work packet granule then executes in a single step mode until completion.

Hierarchical packet process apparatus and method

Abstract: Provided is a hierarchical packet processing apparatus and method. In one general aspect, a packet is analyzed, divided into an upper layer and a lower layer. It is determined whether a property of the packet to be analyzed has been already analyzed or has to be re-analyzed with respect to each of the upper and lower layers of the packet. Therefore, deep packet inspection is performed only when it is required, and thus assurance of quality of service (QoS) during packet processing can be achieved, as well as reduced waste of resources.

Method and apparatus for processing packet

Abstract: Provided is a packet processing apparatus and method for audio/video (AV) data transmission, in which a simple protocol optimized for AV data transmission is used. Information distinguishing a data packet from a control packet may be included in a data link layer packet header, so that a data packet and a control packet may be distinguished from each other and thereby may be processed according to different procedures.

Packet Router Having Improved Packet Classification

Abstract: A computer-implemented method for classifying received packets using a hardware cache of evolving rules and a software cache having an original rule set. The method including receiving a packet, processing the received packet through a hardware-based packet classifier having at least one evolving rule to identify at least one cache miss packet, and processing the cache miss packet through a software based packet classifier including an original rule set. Processing the cache miss packet includes determining whether to expand at least one of the at least one evolving rules in the hardware-based packet classifier based on the cache miss packet. The determination includes determining whether an evolving rule has both the same action and lies entirely within one of the rule of the original rule set.

Selecting a path for a packet

Abstract: Various example embodiments are disclosed. According to an example embodiment, a network device may include a memory management unit. The memory management unit may be configured to populate a count field based on a number of equal cost paths for each Internet Protocol (IP) route for a packet, randomly choose one of the equal cost paths for the packet, and send the packet out of the network device, the packet including route information for the chosen equal cost path.

Method and apparatus for providing quality-of service in radio access networks

Abstract: The invention includes a method and apparatus adapted for providing quality-of-service to a packet flow within a Radio Access Network (RAN). In one embodiment, a method includes receiving packets of a packet flow at a first network element of the RAN, where the packet flow is associated with an application normally served in a best effort service class of the RAN and each packet of the packet flow comprises an indication of a quality-of-service policy to be applied to the packet flow within the RAN, and, applying the indicated quality-of-service policy to the packet flow within the RAN. The quality-of- service policy to be applied to the packet flow within the RAN is based on at least one characteristic of the packet flow, which may be determined in any manner, such as using information included in the packet headers, using deep packet inspection techniques, and the like. The indication of the quality-of- service policy to be applied to the packet flow within the RAN may be set either inside the RAN or outside the RAN.

Method and apparatus for monitoring packet networks

Abstract: A packet probe for a packet network accurately generates and monitors packets within the network. The packet probe supports packet generation and packet transmission. When a packet is ready for transmission, a hardware-based time stamp unit affixes a time stamp to the packet reflecting an actual transmission time. The packet probe also supports receiving, filtering, and time stamping received packets. When a packet is received, a packet filter determines whether the received packet should be stored in memory along with a time stamp reflecting an actual reception time.

Channel-Assignment and Scheduling in Wireless Mesh Networks Considering Switching Overhead

Abstract: This paper considers the channel-assignment and scheduling in wireless mesh networks that employ multiple radios and multiple channels. In contrast to the various algorithms available in the literature, we explicitly model the delay overhead that is incurred during channel switching, and use that delay in the design of algorithms. We prove that the well known Greedy Maximal Scheduling (GMS) algorithm does not have any provable efficiency ratio when the switching overhead is considered. We present a centralized algorithm (CGSSO), and a dynamic algorithm (DMSSO), both of which consider switching overhead. Simulation results show that the proposed algorithms significantly outperform other algorithms in packet throughput and average packet delay metrics. Results also show that the improvements in performance become more pronounced as the switching delay increases.

Live Botmaster Traceback

Abstract: Embodiments locate a botmaster on a network. A honeynet host is configured to join a botnet and generate a watermarked packet flow by applying a watermark to an outgoing packet flow in response to commands from the botmaster. The watermark is applied to the outgoing packet flow by: choosing distinct packets from the outgoing packet flow; forming packet pair(s) from the distinct packets, that include a reference packet and an encoding packet; and encoding bits in the watermark to the packet pair(s) by increasing the length of the encoding packet when watermark bits have a predetermined value. The cooperating node(s) are configured to: inspect passing packet flows for the watermarked packet flow and generate tracking information related to detection of the watermarked packet flow. The path determination processor is configured to analyze the tracking information to locate a path taken by the watermarked packet flow.

Method and device for transmitting packets

Abstract: A method for transmitting a packet including a packet data fragment and packet information with a transmission device, the method includes determining a concatenated quantity of packets based on size of the packet data fragment, generating a concatenated packet including packet data fragments corresponding to a plurality of first packets, wherein a number of the packet data fragments is determined based on the concatenated quantity, and packet information corresponding to the first packets, and transmitting the concatenated packet in any one of a plurality of communication cycles.

Traffic-load dependent power reduction in high-speed packet switching systems

Abstract: The invention relates to a method and devices for a packet switching system for traffic-load dependent power reduction in packet switching systems. In order to reduce the power consumption of a packet switching system, it is proposed that the method comprises the steps of determining a traffic rate for incoming data packets at the upstream packet processing device; processing the incoming data packets; transmitting an indication of the determined traffic rate from the upstream packet processing device to the downstream packet processing device at a time prior to the time that the processed data packets for which the traffic rate has been determined are transmitted to the downstream packet processing device; and adjusting available packet processing resources at the downstream packet processing device based on the received traffic rate indication.

Cross-Layer-Optimized User Grouping Strategy in Downlink Multiuser MIMO Systems

Abstract: This paper proposes a cross-layer-optimized user selection and packet transmission technique for the downlink multi-user (MU) multiple-input multiple-output (MIMO) system in IEEE 802.11 wireless LAN (WLAN). In IEEE 802.11 WLAN, packet duration is decided by a data size and a selected transmission mode (modulation and coding scheme, MCS), and therefore, in general, the packet duration of each user varies according to the channel conditions and the applications. If multiple users whose packet durations are considerably different are selected as the target of the downlink MU-MIMO transmission, then the efficiency of spatial multiplexing degrades and the network throughput cannot be enhanced. When selecting users as the target of the downlink MU-MIMO transmission, the degree of spatial channel correlation among users (from the viewpoint of the physical layer) and the packet waiting times in a queue (from the viewpoint of the MAC layer) have to be considered. In addition to these criteria, in IEEE 802.11 WLAN, uniformity of the packet durations among users has to be considered as a criterion. In the proposed method, data size is adjusted in order to make the packet durations of the users uniform after selecting the users based on the spatial compatibility and the packet waiting times. This means that the proposed downlink MU- MIMO transmission is optimized in 3 dimensions by the cross- layer approach: the spatial channel correlations, packet waiting times and the uniformity of the packet durations. Computer simulations are performed and the results show the effectiveness of the proposed method.

Packet access control method, forwarding engine, and communication apparatus

Abstract: A packet access control method includes: setting a first bandwidth parameter, and judging whether a received packet needs to be forwarded according to information on the received packet; querying the ACL according to the information on the packet if the packet does not need to be forwarded; performing a corresponding action if the packet hits an ACL rule, or sending the packet to the control plane by applying the first bandwidth parameter if the packet hits no ACL rule. Moreover, a packet forwarding engine and communication apparatus is provided. Through the method, packet forwarding engine and communication apparatus under the present invention, both precise control and service operation stability are implemented, thus improving stability of the apparatus and availability of the whole network.

Demonstration of 10 Gbit Ethernet/Optical-Packet Converter for IP Over Optical Packet Switching Network

Abstract: We developed novel network interfaces, for example 10 Gbit Ethernet to 80 Gbit/s optical-packet (10 GbitE-80 GbitOP) or 80 Gbit/s optical-packet to 10 Gbit Ethernet (80 GbitOP-10 GbitE) converters (collectively called as 10 GbitE/80 GbitOP converters), to connect optical packet switching (OPS) networks with IP technology-based networks. By using newly developed arrayed burst-mode optical packet transmitters/receivers together, the 10 GbitE-80 GbitOP converter at the ingress edge node of the OPS network encapsulates an IP packet into an 80(8lambdat10)nGbit/s dense wavelength division multiplexing (DWDM)-based optical packets and generates an optical label based on a lookup table and the destination addresses of the IP packet. The 80 GbitOP-10 GbitE converter at the egress edge node decapsulates the IP packet from the optical packet and generates a 10 GbitE frame accommodating the IP packet according to a lookup table. By using these network interface devices and OPS system based on multiple optical label processing, we achieved, for the first time, 74-km single-mode fiber transmission, switching, and buffering of 80(8lambdat10)nGbit/s DWDM-based optical packets encapsulating almost 10 Gbit/s IP packets with error-free operation (IP packet loss rate < 10-6).

Deactivating a Packet Tunnel Based On At Least One Performance Characteristic

Abstract: Network operating methods provide a first packet switch coupled to a second packet switch via a primary packet tunnel having an active status and one or more inactive backup packet tunnels having an inactive status. The methods access data describing at least one performance characteristic of the primary packet tunnel and, based at least on the data, deactivate the primary packet tunnel while still operational and activate one of the backup packet tunnels. Network operating methods provide a first device coupled to a second device via an active primary packet tunnel and one or more inactive backup packet tunnels, access data describing performance characteristics of the one or more backup packet tunnels, and, based at least on the data, deactivate the primary packet tunnel and activate one of the backup packet tunnels.

Wavelength-multiplexed optical packet switching using InP phased-array switch.

Abstract: A monolithically integrated InP/InGaAsP 1×5 optical phased-array switch is demonstrated for broadband wavelength-division multiplexed (WDM) optical packet switching (OPS) application. Using the wide optical bandwidth of the switch, we achieve error-free forwarding of 320-Gbps (40-Gbps × 8 channel) WDM signal with less than 1.3-dB penalty. Since the switch consists of only phase-modulating section, it is free from nonlinear signal distortion and inter-channel crosstalks, allowing large dynamic range of input power. The application to WDM-OPS testbed is demonstrated successfully, where 320-Gbps WDM payloads are routed synchronously to the optical label.

Performance analysis of Optical Packet Switches enhanced with electronic buffering

Abstract: Optical networks with Wavelength Division Multiplexing (WDM), especially Optical Packet Switching (OPS) networks, have attracted much attention in recent years. However, OPS is still not yet ready for deployment, which is mainly because of its high packet loss ratio at the switching nodes. Since it is very difficult to reduce the loss ratio to an acceptable level by only using all-optical methods, in this paper, we propose a new type of optical switching scheme for OPS which combines optical switching with electronic buffering. In the proposed scheme, the arrived packets that do not cause contentions are switched to the output fibers directly; other packets are switched to shared receivers and converted to electronic signals and will be stored in the buffer until being sent out by shared transmitters. We focus on performance analysis of the switch, and with both analytical models and simulations, we show that to dramatically improve the performance of the switch, for example, reducing the packet loss ratio from 10−2 to close to 10−6, very few receivers and transmitters are needed to be added to the switch. Therefore, we believe that the proposed switching scheme can greatly improve the practicability of OPS networks.

Packet relay apparatus

Abstract: In a packet relay apparatus equipped with a hierarchical bandwidth control function, a queuing unit of a bandwidth controller for controlling a bandwidth of a packet to be transmitted recognizes user information for identifying a user from VLAN ID of a received Tag-VLAN packet, acquires queue information representative of a queue position by referring to a priority mapping table by using a user priority order in the packet, and queues the packet to the queue identified by the user information and queue information. Bandwidth control can therefore be performed without searching a QoS information management table.

Capacity/cost tradeoffs in optical switching fabrics for terabit packet switches

Abstract: Future Internet packet switches and routers will have to overcome intrinsic limitations of current electronic switching fabrics, related to the extremely high amount and density of the information to be internally processed, and the consequent very large number of interconnections, and very high power consumption and dissipation. Motivated by this observation, we consider different architectures of optical switching fabrics, capable to interconnect the linecards of a packet switch with an overall switching capacity in the order of Tb/s, using both Wavelength Division Multiplexing (WDM) and space diversity. The physical-layer feasibility and the cost of the considered architectures are studied and compared using realistic models taken from commercially available optoelectronic devices.

Method and apparatus for measuring packet transmission quality

Abstract: Packet transmission quality in a communication network is measured by transmitting a measurement packet from a packet transmission node to a packet reception node. The packet transmission node is provided with a transmission counter counting the number of packets transmitted from a packet transmission node to a packet reception node, and a measurement packet counter counting the number of measurement packets transmitted from the packet transmission node to the packet reception mode. The packet reception node is provided with a reception counter counting the number of packets received from the packet transmission node. The packet transmission node transmits a measurement packet including a transmission counter value and a measurement packet counter value, to the packet reception node which calculates the number of lost packets or a loss rate of packets on the basis of the transmission counter value, the measurement packet counter value, and a reception counter value.

Router, information processing device having said router, and packet routing method

Abstract: A router includes: a flit arrival time management section that records flit arrival time which is the time at which the packet is received for the first time, transmission interval of the packet which are acquired from a control packet transmitted prior to the first transmission of a packet and input and output channels of the control packet and requires a crossbar section for an output channel from which the packet is supposed to be output before the flit arrival time; a switch assignment section that performs arbitration on the output channel request and performs input/output connection relationship setting processing; and a switch assignment verification section that verifies whether a result of the input/output connection relationship setting processing coincides with the actual routing of the packet. The cross bar section performs switching of the arriving packet using a result of the input/output connection relationship processing.

Mitigating Low-Rate Denial-of-Service Attacks in Packet-Switched Networks

Abstract: A method includes determining, at a network routing device, an average packet drop rate for a plurality of aggregations of packet flows. The method also determines a threshold packet drop rate based on the average packet drop rate, a current packet drop rate for a select aggregation of the plurality of aggregations, and whether at least one packet flow of the select aggregation is potentially subject to a denial-of-service attack based on a comparison of the current packet drop rate to the threshold packet drop rate.