- Tytuł:
- PFS scheme for forcing better service in best effort IP network
- Autorzy:
-
Fudała, M.
Burakowski, W. - Powiązania:
- https://bibliotekanauki.pl/articles/308195.pdf
- Data publikacji:
- 2004
- Wydawca:
- Instytut Łączności - Państwowy Instytut Badawczy
- Tematy:
-
IP-based network
better than best effort service
priority forcing scheme - Opis:
- 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.
- Źródło:
-
Journal of Telecommunications and Information Technology; 2004, 2; 23-28
1509-4553
1899-8852 - Pojawia się w:
- Journal of Telecommunications and Information Technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł