V. K. Garg, K. F. Smolik, and J. E. Wilkes, Applications of CDMA in Wireless / Personal Communications, Prentice-Hall PTR, NJ, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
BLUE: A New Class of Active Queue Management Algorithms - Feng, Kandlur, Saha, Shin (1999) (79 citations) (Correct)
....into at least one unpolluted bin. Note that this technique effectively creates virtual bins across time just as the multiple levels of bins in the original algorithm creates virtual bins across space. In many ways the effect of using moving hash functions is analogous to channel hopping in CDMA [16, 28] systems. It essentially reduces the likelihood of a responsive connection being continually penalized due to erroneous assignment into polluted bins. To show the effectiveness of this approach, the idea of moving hash functions was applied to the exper20 Flow Number 0.00 0.05 0.10 0.15 ....
V. K. Garg and K. Smolik and J. E. Wilkes. Applications Of CDMA In Wireless/Personal Communications. Prentice Hall Professional Technical Reference, October 1996.
The BLUE Active Queue Management Algorithms - Feng, Shin, Kandlur, Saha (2002) (5 citations) (Correct)
....into at least one unpolluted bin. Note that this technique effectively creates virtual bins across time just as the multiple levels of bins in the original algorithm creates virtual bins across space. In many ways the effect of using moving hash functions is analogous to channel hopping in CDMA [18, 33] systems. It essentially reduces the likelihood of a responsive connection being continually penalized due to erroneous assignment into polluted bins. To show the effectiveness of this approach, the idea of moving hash functions was applied to the experiment in Figure 18(b) In this experiment, 8 ....
V. K. Garg and K. Smolik and J. E. Wilkes. Applications Of CDMA In Wireless/Personal Communications. Prentice Hall Professional Technical Reference, October 1996.
Stochastic Fair Blue: A Queue Management - Algorithm For Enforcing (Correct)
....into at least one unpolluted bin. Note that this technique effectively creates virtual bins across time just as the multiple levels of bins in the original algorithm creates virtual bins across space. In many ways the effect of using moving hash functions is analogous to channel hopping in CDMA [17] systems. It essentially reduces the likelihood of a responsive connection being continually penalized due to erroneous assignment into polluted bins. To show the effectiveness of this approach, the idea of moving hash functions was applied to the experiment in Figure 5(b) In this experiment, 8 ....
V. K. Garg and K. Smolik and J. E. Wilkes. Applications Of CDMA In Wireless/Personal Communications. Prentice Hall Professional Technical Reference, October 1996.
Comparing Soft and Hard Handoffs - Lin, Pang (1997) (3 citations) (Correct)
....[2] utilize soft handoff where a handset may communicate with the outside world using multiple radio links through different BSs at the same time. During handoff, the signaling and voice information from multiple base stations are typically combined (or bridged) at the Mobile Switching Center [9]. Similarly, voice and signaling information must be sent to multiple base stations, and the mobile station must combine the results. In some soft handoff systems, a handset may connect up to 3 or 4 radio links at the same time. Thus, within the overlay area of cells, a handset can connect to ....
Garg, V.K., Smolik, K.F., and Wilkes, J.E., Applications of CDMA in Wireless/Personal Communications, Prentice-Hall, 1997.
Stochastic Fair Blue: A Queue Management Algorithm for.. - Feng, Kandlur, Saha.. (2001) (34 citations) (Correct)
....into at least one unpolluted bin. Note that this technique effectively creates virtual bins across time just as the multiple levels of bins in the original algorithm creates virtual bins across space. In many ways the effect of using moving hash functions is analogous to channel hopping in CDMA [17] systems. It essentially reduces the likelihood of a responsive connection being continually penalized due to erroneous assignment into polluted bins. Packet Loss (Mbs) 10 30s 30 50s 50 70s TCP Flows 0.402 0.358 0.260 Non responsive 4.866 4.849 4.898 Oscillating 4.871 0.025 4.845 Total 10.139 ....
V. K. Garg and K. Smolik and J. E. Wilkes. Applications Of CDMA In Wireless/Personal Communications. Prentice Hall Professional Technical Reference, October 1996.
Smart Base Station Antenna Performance for Several Scenarios - an.. - Kim (2002) (Correct)
No context found.
V. K. Garg, K. F. Smolik, and J. E. Wilkes, Applications of CDMA in Wireless / Personal Communications, Prentice-Hall PTR, NJ, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC