IEE Proceedings - Communications

Issue 4 • Aug 2002

Filter Results

Displaying Results 1 - 9 of 9
  • Least load dispatching algorithm for parallel Web server nodes

    Publication Year: 2002, Page(s):223 - 226
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (364 KB)

    A least load dispatching algorithm for distributing requests to parallel Web server nodes is described. In this algorithm, the load offered to a node by a request is estimated based on the expected transfer time of the corresponding reply through the Internet. This loading information is then used by the algorithm to identify the least load node of the Web site. By using this algorithm, each reque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel TCP congestion control scheme and its performance evaluation

    Publication Year: 2002, Page(s):217 - 222
    Cited by:  Papers (7)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (414 KB)

    A novel self-tuning proportional and derivative (ST-PD) control based TCP congestion control scheme is proposed. The new scheme approaches the congestion control problem from a control-theoretical perspective and overcomes several Important limitations associated with existing TCP congestion control schemes, which are heuristic based. In the proposed scheme, a PD controller is employed to keep the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault recovery for zoned VP-based ATM networks

    Publication Year: 2002, Page(s):211 - 215
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (402 KB)

    The virtual path simplifies cell processing in ATM networks, while a good resource management strategy enables virtual channel connection to be established quickly and efficiently. Methods of constructing VP and the strategies of managing and allocating resources greatly affect the system performance. The paper proposes an architecture called 'zoned architecture', and the corresponding method of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear complexity of polyphase power residue sequences

    Publication Year: 2002, Page(s):195 - 201
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (420 KB)

    The well known family of binary Legendre or quadratic residue sequences can be generalised to the multiple-valued case by employing a polyphase representation. These p-phase sequences, with p prime, also have prime length L, and can be constructed from the index sequence of length L or, equivalently, from the cosets of pth power residues and non-residues modulo-L. The linear complexity of these po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed channel allocation scheme performance enhancement for cellular mobile systems

    Publication Year: 2002, Page(s):232 - 236
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (433 KB)

    An optimisation technique for fixed channel allocation (FCA) schemes proposed. This mechanism can respond to the variations in traffic to reassign channels to cells. Traffic variability can be automatically adapted after applying this mechanism to FCA schemes. It is unnecessary to handoff a call when its allocated channel is reassigned to other cells. Moreover, freedom from deadlock and starvation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalised Berlekamp-Massey algorithm

    Publication Year: 2002, Page(s):207 - 210
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (299 KB)

    The Berlekamp-Massey algorithm is revisited and proven again by using the matrix representation. This approach makes the derivation and proof of the algorithm straightforward, simple and easily understood. It further enables the presentation of a generalised Berlekamp-Massey algorithm, including the conventional algorithm and the inversion-free algorithm as two special cases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concatenated wavelet-based ring-TCM

    Publication Year: 2002, Page(s):189 - 194
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (457 KB)

    A new coded modulation technique for signal sets designed combining wavelet functions and M-quadrature amplitude modulation (MQAM) is presented. Trellis-coded modulation (TCM) is implemented using the ring of integers modulo-Q as the algebraic structure of the multilevel convolutional encoder. These schemes are suitable for adaptive time-frequency unequal error protection, multiple-access and mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified branch metric for turbo codes using PSA technique in Rician fading channels

    Publication Year: 2002, Page(s):227 - 231
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (403 KB)

    The authors study a log-maximum a posteriori (MAP) algorithm for use with turbo-coded systems incorporated with pilot-symbol-aided (PSA) transmission in the satellite mobile channels. The channel probability used in a conventional log-MAP algorithm assumes the channel is memoryless white Gaussian noise. If this same channel probability is used in the log-MAP algorithm for decoding turbo-coded sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the decoding process of T-codes

    Publication Year: 2002, Page(s):202 - 206
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (406 KB)

    T-codes are variable-length codes (VLC) generated by an iterative construction algorithm known as T-augmentation. All T-codes possess strong self-synchronising properties by virtue of T-augmentation, which spreads synchronisation information throughout the code construction. A number of applications have been reported that reference the T-codes for their desirable properties. However, further theo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.