Óêðà¿íñüêà   Ðóññêèé
DonNTU   Masters' portal

Abstract

Content

Introduction

The current growth rates of the traffic volume of telecommunication multiservice networks impose strict requirements on them. This fact affects both small and regional networks. First of all, the convergence of services within one network requires communication channels to provide Quality of Service parameters.

The advent of multi-protocol label switching (MPLS) technology has made it possible to implement a number of mechanisms and methods for traffic control, including Traffic Engineering (TE), Traffic Engineering DiffServ, etc. Despite the numerous functionalities originally incorporated in these mechanisms, they are not fully implemented. Below is how bypass tunnels work.

Bypass-tunnel on an Autobandwidth

Picture 1 – Bypass-tunnel on an Autobandwidth.(animation: 5 pics, 6 repetitions, 76 kb)

1. Theme urgency

The mathematical models and methods on which the mechanisms for ensuring the quality of service parameters in the formation of TE tunnels are based are imperfect. Taking into account the requirements for the parameters of existing communication channels, it becomes necessary to find a balance between the required parameters of the quality of service and the actual parameters of communication channels.

The topic of the master's work – research and development of a method for improving the quality of service in telecommunication networks – is relevant, since the requirements for bandwidth and quality of service are increasing daily.

2. Goal and tasks of the research

The purpose of the work is to increase the efficiency of the use of network resources while ensuring the specified quality of service parameters by developing method of improving the quality of service in telecommunication networks.

The main objectives of the research:

  1. Analysis of existing mathematical models and methods for ensuring the quality of service in telecommunication networks;
  2. Development of an algorithm for ensuring the quality of service parameter based on forecasting incoming traffic;
  3. Development of a method for improving the quality of service in telecommunication networks;
  4. Evaluation of the effectiveness of the developed method by means of simulation and development of recommendations for its practical use.

Research object: the process of ensuring the quality of service in telecommunication networks.

Research subject: models and methods for ensuring quality of service parameters in telecommunication networks.

Research methods: mathematical modeling, teletraffic theory, mathematical programming, simulation, ant colony optimization methods.

As part of the master's work, it is planned to obtain relevant scientific results in the following areas:

  1. Improving the efficiency of using network resources while ensuring the specified QoS parameters;
  2. Development of a method for improving the quality of service in telecommunication networks;
  3. Improvement of existing methods of increasing efficiency.

3. Analysis of traffic management problems

Modern ICS are complex hardware and software systems that must provide a given quality of service. For these purposes, the ICS control is used, which is a rather complex systemic complex task, which consists of a number of subtasks that are solved at various levels of interaction of open systems.

Assessment of existing technological solutions

MPLS [1] is designed as a combination of two QoS models. This technology implements the basic platform of a set of tools for managing and redistributing traffic flows (TE) [2-4]. A feature of the MPLS architecture is the presence of a short header of a fixed length, a label, which is placed between the bytes of the protocol stack of the second and third levels of the open systems interaction model. Then the packet is transmitted over the MPLS domain according to this label. The binding to labels is carried out in accordance with the transfer class (FEC), which essentially reflects the requirements for quality of service (SLA). FEC can be composed of packets with common inside and outside nodes or combinations of the same class of service and the same inside or outside nodes, etc., implementing a differential service model.

The functions of filtering traffic according to transmission classes, the establishment and maintenance of TE-LSPs, as well as the management of traffic entering the MPLS network are carried out by the MPLS Border Routers (LER) of the domain. The functions of label switching, label insertion, and label removal are performed by label routers (LSRs). The above gives all the grounds for formalizing mechanisms for ensuring QoS parameters in MPLS technology

Conclusion

When moving to the concept of new generation networks, researchers pay special attention to the problems of traffic management. This is due to the need to tighten the provision of quality of service parameters. Traffic Engineering remains the main modern complex for ensuring the quality of service. This complex is implemented in the technology of multi-protocol label switching (MPLS). The analysis of the components of the complex to ensure the specified quality of service showed that the main mechanisms are: support of end-to-end QoS parameters "end-to-end" in the formation of requirements for the parameters of the TE-tunnels.

Tools that provide support for end-to-end QoS parameters include traffic control tools at the boundaries of MPLS domains. Thus, the analysis of queue management tools and queue service schedulers revealed that the most efficient are the latter in general and the schedulers with hybrid queue service, in particular.

At the moment, the Autobandwidth procedure remains the main procedure that forms the estimate of the throughput of the TE-tunnel being established. This procedure is based on traffic prediction.

According to the above, the topic of the master's thesis devoted to solving the problem of research and development of a method for improving the quality of service in telecommunication networks is relevant.

The aim of the work is to increase the efficiency of using network resources while ensuring the specified quality of service parameters by developing a method for improving the quality of service in telecommunication networks.

When writing this essay, the master's work has not yet been completed. The full text of the work and materials on the topic can be obtained from the author or his manager after that date.

References

  1. Rosen E., RFC 3031 - Multiprotocol Label Switching Architecture [Ýëåêòðîííûé ðåñóðñ] /E. Rosen, A. Viswanathan, R. Callon. - Ðåæèì äîñòóïà: http://www.rfc-editor.org/rfc....
  2. Awduche D. RFC 2702 - Requirements for Traffic Engineering Over MPLS [Ýëåêòðîííûé ðåñóðñ]/ D. Awduche, J. Malcolm J. Agogbua M. O'Dell J. McManus. - Standards Track, 1999. - Ðåæèì äîñòóïà: http://www.rfc-editor.org/rfc... .
  3. RFC 3210 - RSVP-TE: Extensions to RSVP for LSP Tunnels [Ýëåêòðîííûé ðåñóðñ] / D. Awduche, D. Berger, T. Gan, V. Li, Srinivasan G. Swallow. - Standards Track, 2001. - Ðåæèì äîñòóïà: http://www.rfc-editor.org/rfc....
  4. Boyle J., RFC 3346 - Applicability Statement for Traffic Engineering with MPLS [Ýëåêòðîííûé ðåñóðñ] / J. Boyle, V. Gill, A. Hannan, D. Cooper, D. Awduche, B. Christian, W.S. Lai. - Ðåæèì äîñòóïà: ftp://ftp.rfc-editor.org/in....
  5. Þøêîâ Òàðàñ. Îïèñàíèå ïðîòîêîëà Label Distribution Protocol (LDP) [Ýëåêòðîííûé ðåñóðñ] / Òàðàñ Þøêîâ. - ïðîåêò mpls-exp.ru, 2005. - Ðåæèì äîñòóïà: http://www.opennet.ru/docs/....
  6. Daneshi Maryam, Towards an Ef?cient Reservation Algorithm for Distributed Reservation Protocols [Ýëåêòðîííûé ðåñóðñ] / Maryam Daneshi, Jianping Pan Sudhakar Ganti.- Ðåæèì äîñòóïà: http://grp.pan.uvic.ca/~m....
  7. Delgrossi Luca, Reservation Protocols for Internetworks: A Comparison of ST-II and RSVP [Ýëåêòðîííûé ðåñóðñ] / Luca Delgrossi, Ralf Guido Herrtwic, Carsten Vogt, Lars C. Wolf. - NOSSDAV '93 Proceedings of the 4th International Workshop on Network and Operating System Support for Digital Audio and Video, 1994. – pp.195-203.
  8. Shreedhar M., Efficient fair queueing using deficit round-robin / M. Shreedhar, George Varghese // ACM Transactions on networking. – IEEE:1996 – Vol.4, ¹3. – pp. 375- 385.
  9. Braden R., RFC 2309. Recommendations on queue management and congestion avoidance in the Internet [Ýëåêòðîííûé ðåñóðñ]/ D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L.Peterson, K. Ramakrishnan, S.Shenker, J. Wroclawski, and L. Zhang. – Ðåæèì äîñòóïà: http://tools.ietf.org/....
  10. Feng Lu, Weighted Fair Queuing with Differential Dropping [Ýëåêòðîííûé ðåñóðñ]/ Lu Feng, Geoffrey M. Voelker, Alex C. Snoeren. – Ðåæèì äîñòóïà: http://cseweb.ucsd.edu/~....
  11. Parekh À., A generalized processor sharing approach to flow control-The single node case / À. Parekh, R. Gallager // Proc. IEEE InfoCom. – IEEE, 1992. - pp. 915-924
  12. Hartmann Dennis, Cisco QoS - LLQ / CBWFQ and MQC Processing queuing [Ýëåêòðîííûé ðåñóðñ] / Dennis Hartmann. - Ðåæèì äîñòóïà: http://www.networkworld.com/ar....
  13. Klampfer Sasa, Influences of Classical and Hybrid Queuing Mechanisms on VoIP’s QoS Properties / Sasa Klampfer, Amor Chowdhury, Joze Mohorko, Zarko Cucej. - Ðåæèì äîñòóïà: http://cdn.intechopen.com/p...
  14. Su L. An active queue management scheme for Internet congestion control and its application to differentiated services / L. Su, J.C. Hou, The Ohio State University, Columbus, OH, January 2000. – 25 p.
  15. Ãëóøêîâ Â.Ì. Ñèíòåç öèôðîâûõ àâòîìàòîâ / Â.Ì. Ãëóøêîâ. – Ì.: Ãîñóäàðñòâåííîå èçäàòåëüñòâî ôèçèêî-ìàòåìàòè÷åñêîé ëèòåðàòóðû, 1962. – 476 ñ.
  16. Avedillo M.J. New approach to the state reduction in incompletely specified sequential machines / M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of IEEE International Symposium on Circuits and Systems. – New Orleans, 1990. – pp. 440-443.
  17. Avedillo M.J. SMAS: a program for the concurrent state reduction and state assignment of finite state machines / M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of IEEE International Symposium on Circuits and Systems. – 1991. – vol. 3. – pp. 1781-1784.
  18. Champarnaud J.-M. Split and minimizing: Brzozowski's algorithm / J.-M. Champarnaud, A. Khorsi, T. Paranthoen // Prague Stringology Conference. – Prague, 2002. – pp. 96-104.
  19. Goren S. CHESMIN: a heuristic for state reduction in incompletely specified finite state machines / S. Goren, F. Ferguson // Proceedings of the Conference on Design, Automation and Test in Europe. – 2002. – pp. 248-254.
  20. Higuchi H. A fast state reduction algorithm for incompletely specified finite state machines / H. Higuchi, Y. Matsunaga // 33rd Annual Conference of Design Automation. – Las Vegas, 1996. – pp. 463-466.
  21. Hu H. HSM2: a new heuristic state minimization algorithm for finite state machine / H. Hu, H.-X. Xue, J.-N. Bian // Journal of Computer Science and Technology. – 2004. – ¹ 19 (5). – pp. 729-733.