Fast packet switching

About: Fast packet switching is a research topic. Over the lifetime, 5641 publications have been published within this topic receiving 111603 citations.

Mobile packet data communications system

Abstract: Packet data is routed from a packet data network (18) to a mobile subscriber (10) served by a base station (12) and a base station controller (13) by encapsulating the packet and providing the encapsulated packet with temporary address information for transport of the packet to the mobile subscriber (10) via the base station controller (13).

Layer 4+ switching with QoS support for RTP and HTTP

Abstract: This paper provides an overview over current approaches and applications of layer 4 switching (L4Sw) and outlines a scheme for QoS support based on layer 4 and higher layer information. Today, L4Sw is mainly used for filtering in the context of firewalls. Additionally L4Sw has the potential of introducing per flow QoS support without the need for complex out-of-band signaling. We used traffic measurements on a real router to determine which higher layer protocols generate the most traffic and should therefore be investigated first. From the measurements it is obvious, that HTTP is the most important candidate. Experiments on extracting TCP and HTTP information demonstrated the feasibility of Layer 4+ QoS support with respect to processing power and storage capacity demands of intermediate systems. In addition to the TCP-based HTTP protocol, future investigations will be done for RTP as a key protocol for multimedia traffic.

Balanced gamma network-a new candidate for broadband packet switch architectures

Abstract: The gamma network is enhanced to derive a balanced gamma network with the addition of an additional link. The performance of the proposed network is analyzed in comparison with the existing networks. The performance of replicated networks and of networks with one internal buffer are investigated. These networks are studied using two assumptions: the common assumption that each destination can accept only one packet in a given cycle and the assumption that any number of packets can be accepted by a destination. Balanced gamma networks exhibit good performance, enable simple routing schemes, and are modular. >

A method and apparatus for improving scheduling in packet data networks

Abstract: A method of scheduling packet data delivery by a communication network node uses knowledge of the incoming delays and corresponding delay budgets associated with the packet data to be scheduled. For example, a wireless communication network base station may serve a plurality of users via a time-multiplexed packet data channel, and may schedule the delivery of packet data targeted to individual ones of those users based on determining the allowable scheduling delays for the incoming packet data it receives for those users. The allowable scheduling delays for packet data received on a given data connection may be determined based on the incoming delays associated with that packet data and the corresponding end-to- end delay budget defined for that packet data. The incoming delays may be calculated from packet time information, e.g., timestamps, and/or may be estimated based on call type, network type, network distances/locations, network conditions, etc.

Delay-based adaptive load balancing in MPLS networks

Abstract: In this paper, we propose a new adaptive load balancing mechanism for MPLS networks in that core LSRs are not required to perform traffic engineering. Based on measurements, we obtain the average one-way delay between a pair of label switched routers (LSR), and dynamically distribute traffic load among multiple label switched paths (LSP) according to this average. Simulation results indicate that our approach improves end-to-end throughput and decreases packet loss probability. Our work demonstrates that our algorithm is robust and simple to use.