A Network Calculus Approach for the Analysis of Packet-switching Networks

Network calculus is an evolving new methodology for backlog and delay analysis of packet-switching networks. With network calculus we are able to compute tight bounds on delays,backlogs,and effective bandwidths in a lossless setting applicable to packet-switching networks and better understand some physical properties of networks. In this paper,the basic network calculus concepts of arrival curves and service curves are introduced.Then we provide the approach for modeling leaky-bucket,generic cell rate algorithm(GCRA),constant bit rate(CBR)flow, variable bit rate(VBR) flow with arrival curve.It is shown that all rate-based packet schedulers can be by a simple rate latency service curve.And by applying these fundamental rules of network calculus,bounds on delay, buffer,effective bandwidth for leaky bucket,GCRA,CBR and VBR can be derived and some practical examples are given.Finally,we compare all the results obtained and conclude this paper.

ZTE Partners with KPN Group Belgium to Deploy Packet-Switched Core Network

27 August 2012--ZTE Corporation has signed a deal on a packet-switched core network （CN） for KPN Group Belgium （KPNGB）. KPNGB will deploy ZTE＇s packet-switched CN equipment, which supports unified radio access. The contract is the second of its kind between ZTE and KPNfollows from a construction project with KPN Germany （E-Plus） that was completed in September 2010.

Coping with handover effects in video streaming over cellular networks

The 3rd generation partnership project (3GPP) has defined the protocols and codecs for implementing media streaming services over packet-switched 3G mobile networks. The specification is based on IETF RFCs on audio/video transport.It also adds new features to achieve better adaptation to the mobile network environment. In this paper, we propose an algorithm for handover detection and fast buffer refill that is based on the existing feedback and signaling mechanisms. The proposed algorithm refills the receiver buffer at a faster pace during a limited time frame after a hard handover is detected in order to achieve higher video quality.

Proposal of PAPR Reduction Method for OFDM Signal by Re-Ordering of Clusters in Frequency Domain

One of the limitations of using OFDM technique is its higher PAPR in the time domain signal. The higher PAPR OFDM signal would cause the fatal degradation of BER performance and undesirable spectrum regrowth in the nonlinear channel. One of the promising PAPR reduction methods for OFDM signal is the Partial Transmit Sequence (PTS) method which can achieve better PAPR performance with reasonable computation complexity. However the PTS method is required to inform the phase coefficients of PTS as the side information to the receiver for the correct demodulation of data information through the data or separate channels. To simplify the transceiver of OFDM system with the PTS method, the phase coefficients of PTS are usually embedded in the data information. However since the phase coefficients of PTS are obtained after the PTS processing only for the data information at each OFDM symbol, it is hard to embed the phase coefficients of PTS in the data information separately without degradation of PAPR performance. To solve this problem, this paper proposes a new PAPR reduction method based on the packet-switched transmission systems in which all the clusters within the certain number of OFDM symbols have the sequential cluster ID numbers embedded in the header of each cluster. The salient features of the proposed method are to reduce the PAPR performance by re-ordering of clusters (ROC) in the frequency domain at the transmitter and to reconstruct the original ordering of clusters by using the cluster ID number demodulated from each cluster at the receiver. This paper also proposes a reduction technique of computation complexity for the proposed ROC method by using the feature of IFFT processing. This paper presents various computer simulation results to verify the effectiveness of the proposed ROC method with the reduction technique of computation complexity.

Rendezvous Facilities in a Distributed Computer System

The distributed computer system described in this paper is a set of computernodes interconnected in an interconnection network via packet-switching interfaces.The nodes communicate with each other by means of message-passing protocols. Thispaper presents the implementation of rendezvous facilities as highlevel prhoitives provided by a parallel programming language to support interprocess cornmunication andsynchronisation.