scispace - formally typeset
Search or ask a question
Topic

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.


Papers
More filters
Proceedings ArticleDOI
M.A. Henrion1, K.J. Schrodi, D. Boettle, M. De Somer, M. Dieudonne 
28 May 1990
TL;DR: A new ATM based switching architecture for asynchronous communications based on the advantageous combination of a multiple-path self-routing principle with an internal transfer mode using multi-slot cells is described.
Abstract: Being the communication core of future broadband products, the ATM based switching network architecture must comply with a challenging set of future safe requirements and objectives, which are tentatively defined first. After some period of research work, a number of different solutions for fast packet switching or ATM switching are still proposed. It is thus interesting to discuss the respective attributes of key architecture options for asynchronous switch fabrics. As an illustration, the paper then describes a new ATM based switching architecture for asynchronous communications based on the advantageous combination of a multiple-path self-routing principle with an internal transfer mode using multi-slot cells. These principles are the foundation for a flexible and fault tolerant switching network configuration built with two Weis of standard switching components: the Switch Module board equivalent to a 128 x 128 single-stage matrix operating at 150 Mbit/s, and the Integrated Switching Element LSI circuit realizing an elementary, fully featured, 32 x 32 switching matrix.

80 citations

Proceedings ArticleDOI
02 Dec 1991
TL;DR: A conflict-free protocol for packet-switched wavelength division multiaccess networks with the use of a control channel, each station in the network can obtain packet backlog information of all the other stations, and so packet transmission can be scheduled to avoid destination conflicts.
Abstract: A conflict-free protocol for packet-switched wavelength division multiaccess networks is proposed. With the use of a control channel, each station in the network can obtain packet backlog information of all the other stations, and so packet transmission can be scheduled to avoid destination conflicts. A very fast scheduling algorithm is proposed. Simulation results show that a maximum throughput of 1 can be achieved, as compared to a maximum of 0.63 for protocols without transmission scheduling. This high throughput performance is obtained because the transmission, reception and processing of backlog information and the transmission and reception of data packets are all done simultaneously in a pipeline operation and all destination conflicts are avoided in every slot through scheduling. The packet delay is calculated to be only one slot (due to scheduling) larger than those protocols without transmission scheduling at low traffic conditions. >

80 citations

Patent
27 Nov 1990
TL;DR: In this article, a wireless in-building telecommunications system for voice and data communications is disclosed having at least one node (101) arranged for linking to the PSTN (151), and a multiplicity of user modules (103) (UM's) linked to the node via a shared RF communications path (107).
Abstract: A wireless in-building telecommunications system for voice and data communications is disclosed having at least one node (101) arranged for linking to the PSTN (151) and at least one digital information source (153, 155, 157, 159) multiplicity of user modules (103) (UM's) linked to the node via a shared RF communications path (107). Each UM is coupled to a voice telephone instrument (127) and to one or more data terminals (165). The UM's communicate with the node by exchanging fast packets via the common RF path (107). The node also includes a fast-packet-switched mechanism controlled by a bandwidth allocating scheme to prevent collisions of packets as they are transmitted between the various units (101, 103) (nodes and/or user modules) that may be accessing the RF path (107). Also disclosed is a method for allocating the required bandwidth to each of the users of the common communications path in a wireless in-building telephone system. The invention provides for the combination of both voice and data in a single switch using a common packet structure. It allows for the dynamic allocation of bandwidth based on system loading. This includes not only bandwidth within the voice or data areas of the frame, but also between the voice and data portions. It also synchronizes the transfer of the data and the allocation of bus bandwidth.

80 citations

Journal ArticleDOI
TL;DR: The authors model the internal structure of a packet-switching node in a real-time system and characterize the tradeoff between throughput, delay, and packet loss as a function of the buffer size, switching speed, etc.
Abstract: The authors model the internal structure of a packet-switching node in a real-time system and characterize the tradeoff between throughput, delay, and packet loss as a function of the buffer size, switching speed, etc. They assume a simple shared-single-path switch fabric, though the analysis can be generalized to a wider class of switch fabrics. They show that with a small number of buffers the node will provide a guaranteed delay bound for high-priority traffic, a low average delay for low-priority traffic, no loss of packets at the input and low probability of packet loss at output. >

80 citations

Proceedings ArticleDOI
02 Dec 1991
TL;DR: A buffer management policy, called drop on demand, is proposed which yields a greater switch throughput and lower packet loss probability than previously proposed policies for all input traffic rates.
Abstract: An imbalanced traffic model is presented, and the performance of completely shared buffering and output queuing under imbalanced traffic is studied. It is found that shared buffering does not perform as well as than output queuing under this traffic condition. A buffer management policy, called drop on demand, is proposed which yields a greater switch throughput and lower packet loss probability than previously proposed policies for all input traffic rates. The optimal buffer management policy is studied for a class of dynamic allocation schemes with packet purging action. It is found that there exists an optimal stationary policy which can be obtained by solving a linear programming problem. >

80 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
88% related
Wireless network
122.5K papers, 2.1M citations
87% related
Wireless
133.4K papers, 1.9M citations
87% related
Wireless sensor network
142K papers, 2.4M citations
85% related
Wireless ad hoc network
49K papers, 1.1M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
20191
20186
201749
201699
2015159