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.

Optical packet switching in core networks: between vision and reality

Abstract: The research on optical packet switching (OPS) has witnessed considerable progress in the 1990s. We examine the future potential of OPS in the core network by discussing this switching approach and the current status of a number of its enabling technologies. Many of these technologies are still in the stage of research and experimentation. We see that optical packet switching may be deployed in the long-term future subject to satisfaction of three main conditions/developments. First, additional technological developments have to take place to overcome remaining implementation challenges while making OPS cost-effective to deploy. Second, a rational migration scenario of the network toward gradual deployment of packet-based optical switching approaches should exist. Finally, carriers have to become more interested in packet-based optical switching solutions.

Dynamic packet scheduling performance in UTRA Long Term Evolution downlink

Abstract: In this paper we evaluate the performance of dynamic Packet Scheduling (PS) of 3GPP UTRAN Long Term Evolution (LTE) Downlink. Packet scheduling is of utmost importance in 3G LTE, because all traffic types with different Quality of Service requirements are competing of the resources. We present a decoupled time and frequency domain packet scheduling framework for LTE downlink. Simulation results with three basic packet scheduler combinations with different amount of fairness are presented in four different 3GPP macro simulation cases to show the both extremes in tradeoff between fairness and spectral efficiency. In addition, the effect of multiuser diversity on packet scheduling performance is studied. It is shown that by dividing the packet scheduler into a time domain and a frequency domain and utilizing different algorithms in both domains, the throughput fairness between users can be effectively controlled.

Method and apparatus for packet communications signaling

Abstract: A packet format for accurately transporting signaling information in a packet network is described. The packet format comprises a burst count, a sequence number, a burst time, and a signaling status bit. The burst count is for indicating a burst to which the packet belongs. The sequence number is for identifying a first packet of the burst. The burst time is for selectably indicating (1) a time delay from onset to a packet node bus for the first packet of the burst and (2) a time interval between successive signaling bit transitions.

TSVC: timed efficient and secure vehicular communications with privacy preserving

Abstract: In this paper, we propose a timed efficient and secure vehicular communication (TSVC) scheme with privacy preservation, which aims at minimizing the packet overhead in terms of signature overhead and signature verification latency without compromising the security and privacy requirements. Compared with currently existing public key based packet authentication schemes for security and privacy, the communication and computation overhead of TSVC can be significantly reduced due to the short message authentication code (MAC) tag attached in each packet for the packet authentication, by which only a fast hash operation is required to verify each packet. Simulation results demonstrate that TSVC maintains acceptable packet latency with much less packet overhead, while significantly reducing the packet loss ratio compared with that of the existing public key infrastructure (PKI) based schemes, especially when the road traffic is heavy.

Packet Loss Recovery for Streaming Video

Abstract: While there is an increasing demand for streaming video applications on the Internet, various network characteristics make the deployment of these applications more challenging than traditional TCP-based applications like email and the Web. Packet loss can be detrimental to compressed video with interdependent frames because errors potentially propagate across many frames. While latency requirements do not permit retransmission of all lost data, we leverage the characteristics of MPEG-4 to selectively retransmit only the most important data in the bitstream. When latency constraints do not permit retransmission, we propose a mechanism for recovering this data using postprocessing techniques at the receiver. We quantify the effects of packet loss on the quality of MPEG-4 video, develop an analytical model to explain these effects, present a system to adaptively deliver MPEG-4 video in the face of packet loss and variable Internet conditions, and evaluate the effectiveness of the system under various network conditions.