No abstract

No abstract

No abstract

No abstract

This paper considers the problem of handoff management in an ht egrated Services Packet Network supporting mobfle hosts. h such a network, bks may become overloaded due to a high concentration of mobde hosts tithin a given ce~. As a restit. the required Qufity of Service guarantees cannot be provided to~flows in that cd. However. there Asts adaptive apphcations which can operate over a wide range of atiable bandwidth. Thus, it may be possible to overcome the %k overload condition by reducing the bandwidth of iudividurd flows, which we cd rate adaptation The two most important properties of a rate adaptation scheme are its network overhead and its fairness property. fite adaptation schemes which ensure certain fairness properties, such as m-in optirnrdity criteria, have very high network overhead. Therefore, these schemes are not suitable for a higtiy mobde environment where rate adaptation may have to be invoked frequently.k this paper, we investigate the tradeoff between the network overhead and the fairness property of rate adap tation in a mobde environment. We first characterize the fairness property of rate adaptation by severrd measurable parameters. We then describe two rate adaptation schemes, one of which h~~very low network overhead but is 'unfair', w~e the other scheme is 'fair' but has very high network overhead. Fmdy we propose a new rate adaptation scheme which recondes the two confecting properties. Resrdts of sirndation =periments comparing the performances of the three rate adaptation schemes are presented. 'This research work w= supported in part by DAWA rmder contract nnmbers DAAHOA95-1-0596and DAAG55-97-1-0322, NSF want numbersCCR 95-09620,IMS 95-09S16and Sponsorsof WI~AB.