Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Rocznik
Tom
Strony
23--28
Opis fizyczny
Bibliogr. 11 poz., tab., rys.
Twórcy
autor
- Institute of Telecommunications, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw
autor
- Institute of Telecommunications, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw
Bibliografia
- [1] A. Bąk, W. Burakowski, F. Ricciato, S. Salsano, and H. Tarasiuk, „Traffic handling in AQUILA QoS IP network", in Proc. Quality of Future Internet Services, QoFIS 2001, Lecture Notes in Computer Science. Springer, 2001, vol. 2156.
- [2] A. Bąk et al., „AQUILA network architecture: first trial experiments", J. Telecommun. Inform. Technol., no. 2, 2002, p. 3-13.
- [3] Y. Bernet et al., „Differentiated services", Internet Draft, Feb. 1999, draft-ietf-di_serv-framework-0.2.txt
- [4] S. Blake et al., „An architecture for differentiated services", Internet RFC 2475, Dec. 1998.
- [5] R. Braden, D. Clark, and S. Shenker, „Integrated services in the Internet architecture: an overview", RFC 1633, June 1994.
- [6] W. Burakowski and M. Fudała, „Priority forcing scheme: a new strategy for getting better than best effort service in IP-based network", in Internet Technol., Appl. Soc. Imp. Kluwer, 2002.
- [7] Broadband Network Teletraffc. Performance Evaluation and Design of Broadband Multiservice Networks. Final Report of Action COST 242, J. Roberts, U. Mocci, and J. Virtamo, Eds., Lecture Notes in Computer Science. Heidelberg: Springer, 1996, vol. 1155.
- [8] D. Gross and C. Harris, Fundamentals of Queuing Theory, 3 rd. ed., Series in Probability and Statistics. Boston: Wiley, 1998.
- [9] P. Hurley, J. Y. Le Boudec, P. Thiran, and M. Kara, „ABE: providing a low-delay service within best effort", IEEE Network, no. 3, pp. 60-69, 2001.
- [10] S. Keshav, An Engineering Approach to Computer Networking. Addison-Wesley, 1997, Chap. 9.
- [11] D. Wu et al., „Streaming video over the Internet: approaches and directions", IEEE Trans. Circ. Syst. Video Technol., March 2001.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPS2-0027-0046
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.