Premium
Achieving proportional DiffServ per‐hop behaviour with PLQF
Author(s) -
Li JungShian,
Lai HsingChien,
Lin YiTing
Publication year - 2003
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.614
Subject(s) - differentiated services , computer science , quality of service , computer network , queue , probabilistic logic , scheme (mathematics) , the internet , hop (telecommunications) , retard , mathematics , psychology , mathematical analysis , artificial intelligence , psychiatry , world wide web
We propose a novel scheme that can provide both delay and loss proportional DiffServ per‐hop behaviour. DiffServ is a framework that can provide different QoS levels to different groups of network users, and eliminate the shortcoming of the best‐effort delivery in today's Internet. The scheme employs probabilistic longest queue first (PLQF) as its forwarding and dropping mechanism. PLQF mainly reacts immediately to the queue‐length fluctuation of each service class, and then decides the probability for each QoS class, which determines the forwarding or dropping behaviour. We couple delay and loss differentiated services in one scheme. The proposed scheme is proven to achieve proportional differentiated services after detailed evaluations. Furthermore, the implementation cost of PLQF is much less than that of the previously proposed schemes, such as WTP and PLR. Copyright © 2003 John Wiley & Sons, Ltd.