Title: PFS scheme for forcing better service in best effort IP network, Journal of Telecommunications and Information Technology, 2004, nr 2


The paper presents recent results corresponding to a new strategy for source traffic generating, named priority forcing scheme (PFS), allowing Internet users for getting better than best effort service in IP network. The concept of PFS assumes that an application, called PFS application, sends to the network a volume of additional traffic for the purpose of making the reservations for the data traffic in the overloaded router queues along the packet path in the IP network. The emitted redundant packets, named R-packets, should be rather of small size comparing to the data packets, named D-packets. The PFS scheme assumes that the R-packets waiting in a queue can be replaced by the arriving D-packets and belonging to the same flow. In this way, the D-packets can experience a prioritised service comparing to the packets produced by a non-PFS application. Notice that the proposed solution does not require any quality of service (QoS) mechanisms implemented in the network, like scheduler, dropping, marking etc., except R- and D-packets identification and replacing. We discuss the PFS efficiency for forcing priority in the overloaded conditions. Moreover simple system analysis is also presented. Finally, the profits of using PFS scheme are illustrated by examples corresponding to FTP (TCP controlled traffic) and VoIP (UDP streaming traffic) applications.


Instytut Łączności - Państwowy Instytut Badawczy, Warszawa



Resource Identifier:

ISSN 1509-4553, on-line: ISSN 1899-8852 ; oai:bc.itl.waw.pl:523


Journal of Telecommunications and Information Technology



Rights Management:

Biblioteka Naukowa Instytutu Łączności

Object collections:

Last modified:

Mar 11, 2010

In our library since:

Mar 11, 2010

Number of object content hits:


All available object's versions:


Show description in RDF format:


Show description in OAI-PMH format:


Objects Similar



Citation style:

This page uses 'cookies'. More information