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 published on a yearly basis
Papers
More filters
TL;DR: A useful framework for the cross-layer design and analysis of wireless networks where ARQ and AMC schemes are employed, which tries to satisfy the required packet loss probability by each user and minimize the average packet transmission error rate.
Abstract: In this paper, we propose a useful framework for the cross-layer design and analysis of wireless networks where ARQ (automatic repeat reQuest) and AMC (adaptive modulation and coding) schemes are employed. To capture the joint effect of the packet transmission error rate at the PHY layer and the packet loss probability at the MAC layer, we introduce the effective bandwidth function of the packet service process. Base on queueing analysis with this effective bandwidth function, our cross-layer design tries to satisfy the required packet loss probability by each user and minimize the average packet transmission error rate. Numerical examples are provided to show the usefulness and characteristics of our framework.
29 citations
Patent•
14 Jan 1999TL;DR: In this paper, a contention resolution process for a packet-based data transmission system is proposed, where the repeater has a receiving port associated with a buffer whereby packets received at the port are temporarily stored before they are onwardly transmitted.
Abstract: A method of operating a repeater for a packet-based data transmission system wherein the repeater has a receiving port associated with a buffer whereby packets received at the port are temporarily stored before they are onwardly transmitted and wherein the repeater performs a contention resolution process such that if an attempted onward transmission of a packet is prevented by virtue of contention with a prior or an existing transmission, a subsequent attempt at transmission of that packet is delayed for a time which is likely to be substantially greater than a selected minimum time. The method includes examining a received packet to determine whether the packet is a multi-media packet, and giving the packet a higher priority in the contention resolution process such that if the packet is not transmitted onwardly owing to contention with a prior transmission, a fresh attempt at transmission of the packet is made on the expiry of the selected minimum time.
28 citations
TL;DR: This paper proposes a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements, and considers an orthogonal frequency division multiple access (OFDMA) system.
Abstract: In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.
28 citations
Patent•
14 Dec 1999TL;DR: In this article, the authors proposed a packet ID generator for attaching unique identifiers to each data packet in the first stream of data packets and attaching the same unique identifier to each corresponding data packet associated with the secondary packet router.
Abstract: There is disclosed, for use in a packet switched network, a redundant switch comprising 1) a primary packet router for routing a first stream of data packets from an input interface to an output interface of the redundant switch; 2) a secondary packet router for routing a second stream of data packets corresponding to the first stream of data packets from the input interface to the output interface; 3) a packet ID generator for attaching a unique identifier to each data packet in the first stream of data packets and attaching the same unique identifier to each corresponding data packet in the second stream of data packets; and 4) a comparator for comparing a first unique identifier associated with a first data packet processed by the primary packet router with a second unique identifier associated with a second data packet associated with the secondary packet router. The comparator, in response to a determination that the first and second unique identifiers match, causes the second data packet associated with the secondary packet router to be deleted.
28 citations
Patent•
IBM1
TL;DR: Work packet granule as mentioned in this paper is a hardware thread that is selectively forced to single-step the execution of software instructions from a work granule, which is called a single step thread.
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.
28 citations