Supporting rate guarantee and fair access for bursty data traffic in W-CDMA

This paper presents a new protocol for statistical multiplexing of bursty data traffic in the forward (base-to-mobile) link of a wireless wideband code division multiple access (W-CDMA) system using orthogonal variable spreading factor (OVSF) codes. At the heart of the protocol is an efficient scheduling algorithm that dynamically assigns an OVSF code to a mobile user on a timeslot-by-timeslot basis and allows many users with bursty traffic to share a limited set of OVSF codes. An important feature of our protocol is that it can provide a heterogeneous data rate guarantee to each mobile user and fully utilize the system capacity. Moreover, the unreserved bandwidth of the network can be shared fairly among competing mobile users.

[1]  Erik Dahlman,et al.  UMTS/IMT-2000 based on wideband CDMA , 1998, IEEE Commun. Mag..

[2]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[3]  J. L. Massey,et al.  Information theory aspects of spread-spectrum communications , 1994, Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94).

[4]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[5]  Kai-Yeung Siu,et al.  Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[6]  Kai-Yeung Siu,et al.  Linear-complexity algorithms for QoS support in input-queued switches with no speedup , 1999, IEEE J. Sel. Areas Commun..

[7]  A. Viterbi.  CDMA: Principles of Spread Spectrum Communication , 1995 .

[8]  Fumiyuki Adachi,et al.  Wideband DS-CDMA for next-generation mobile communications systems , 1998, IEEE Commun. Mag..

[9]  L. B. Milstein,et al.  Theory of Spread-Spectrum Communications - A Tutorial , 1982, IEEE Transactions on Communications.

[10]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[12]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[13]  Marvin K. Simon,et al.  Spread Spectrum Communications Handbook , 1994 .

[14]  Kai-Yeung Siu,et al.  A cell switching WDM broadcast LAN with bandwidth guarantee and fair access , 1998 .

[15]  John G. Proakis,et al.  Digital Communications , 1983 .

[16]  K. Siu,et al.  Toward best-effort services over WDM networks with fair access and minimum bandwidth guarantee , 1998, IEEE J. Sel. Areas Commun..

[17]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[18]  Fumiyuki Adachi,et al.  Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio , 1997 .

[19]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .