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.

An atm switching system based on a distributed control architecture

Abstract: An ATM switching system architecture is presented which employs distributed control to cope with diversified requirements. ATM switching system is expected to efficiently and flexibly handle multimedia traffic, therefore traffic control architecture is one of the most crucial issues for ATM switching systems. The requirements, architectural concept and construction scheme of two important technologies, self-routing switches and quality control of statistical switching, are discussed. A switch fabric, which provides a unified inter-module inter face, switches and distributes cells between modules. It gives very stable switching performance under an arbitrary flow environment without centralized resource management. A three-layerd traffic control model is also presented which consists of cell transfer level, call control level and network control level. Control functions of each level and the interfaces among them are considered, then cell transfer level control schemes and their performances are discussed, including marking scheme for policing control and the effect of burstiness. Laboratory experiment system is designed and implemented to confirm the feasibility of the ATM switching system architecture concept. The system employs a VLSI memory switch with dynamic link speed control as an element of the self-routing switch fabric, achieving the capacity of 256 I55Mb/s lines. It also realizes efficient statistical switching functions such as policing control, multiplexing and quality control for multiple transport quality classes.

An adaptive ARQ scheme with packet combining for time varying channels

Abstract: The dependence of the efficiency of hybrid type-II ARQ schemes on the packet size in the context of a simple packet combining scheme is discussed. A simple algorithm for adopting the optimum packet size according to the channel bit error rate (BER) is presented. Also, a very simple method of estimating the channel BER is provided.

Unlicensed mobile access network (UMAN) system and method

Abstract: Some embodiments provide a system [300] for handling communications between an unlicensed mobile access (UMA) [105] network controller (UNC) [315] and a licensed wireless communication system. The system of these embodiments include a serving general packet radio service support node (SGSN) [350] or a mobile switching center (MSC) [360] that is communicatively coupled to the UNC. In such systems the UNC and the SGSN communicate utilizing a subset of a protocol standard message set. The protocol standard message set includes message for handing discovery and registration, circuit switching domain and packet switching domain signaling, and circuit switching based data and packet switching based data. The subset for the SGSN is for handling packet switching domain signals and packet switching based data. The subset for the MSC is for handling circuit switching domain and circuit switching based data.

CONGESTION CONTROL SYSTEM FOR VoIP NETWORK

Abstract: A system according to this invention executes congestion control for monitoring a packet flow which passes through a relay router in a VoIP network and in which a packet is transferred with a predetermined priority, and for, when congestion is generated by generation of a new packet flow, maintaining a transfer state of a packet of a packet flow established before the new packet flow is generated and transferred with the predetermined priority.

Feedback control of congestion in packet switching networks: the case of multiple congested nodes

Abstract: In this paper, an analytical method for the design of a congestion control scheme in packet switching networks is presented. This scheme is particularly suitable for implementation in ATM switches, for the support of the available bit rate (ABR) service in ATM networks. The control architecture is rate-based with a local feedback controller associated with each switching node. The controller itself is a generalization of the standard proportional-plus-derivative controller, with the difference that extra higher-order derivative terms are involved to accommodate the delay present in high-speed networks. It is shown that, under the specific service discipline introduced here, there exists a set of control gains that result in asymptotic stability of the linearized network model. A method for calculating these gains is given. In addition, it is shown that the resulting steady state rate allocation possesses the so-called max-min fairness property. The theoretical results are illustrated by a simulation example, where it is shown that the controller designed, using the methods developed here, works well for both the service discipline introduced in this paper and for the standard FCFS scheme. © 1997 John Wiley & Sons, Ltd.