Добірка наукової літератури з теми "Traffic engineering"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Traffic engineering".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Traffic engineering"
Otoshi, Tatsuya, Yuichi Ohsita, Masayuki Murata, Yousuke Takahashi, Keisuke Ishibashi, and Kohei Shiomoto. "Traffic prediction for dynamic traffic engineering." Computer Networks 85 (July 2015): 36–50. http://dx.doi.org/10.1016/j.comnet.2015.05.001.
Повний текст джерелаMarbukh, Vladimir. "Robust traffic engineering." ACM SIGMETRICS Performance Evaluation Review 30, no. 3 (December 2002): 17–19. http://dx.doi.org/10.1145/605521.605529.
Повний текст джерелаHendling, K., G. Franzl, and K. Bengi. "Internet traffic engineering." e & i Elektrotechnik und Informationstechnik 121, no. 6 (June 2004): 239–42. http://dx.doi.org/10.1007/bf03055356.
Повний текст джерелаRoughan, Matthew, Mikkel Thorup, and Yin Zhang. "Performance of estimated traffic matrices in traffic engineering." ACM SIGMETRICS Performance Evaluation Review 31, no. 1 (June 10, 2003): 326–27. http://dx.doi.org/10.1145/885651.781080.
Повний текст джерелаZhang, Dengyin, Zhiyun Tang, and Ruchuan Wang. "Automatic Traffic Balance Algorithm Based on Traffic Engineering." Journal of Network and Systems Management 14, no. 3 (July 22, 2006): 317–25. http://dx.doi.org/10.1007/s10922-006-9034-9.
Повний текст джерелаUhlig, Steve, and Olivier Bonaventure. "Implications of Interdomain Traffic Characteristics on Traffic Engineering." European Transactions on Telecommunications 13, no. 1 (January 2002): 23–32. http://dx.doi.org/10.1002/ett.4460130104.
Повний текст джерелаRetvari, G., and T. Cinkler. "Practical OSPF Traffic Engineering." IEEE Communications Letters 8, no. 11 (November 2004): 689–91. http://dx.doi.org/10.1109/lcomm.2004.837629.
Повний текст джерелаFrank, Benjamin, Ingmar Poese, Georgios Smaragdakis, Steve Uhlig, and Anja Feldmann. "Content-aware traffic engineering." ACM SIGMETRICS Performance Evaluation Review 40, no. 1 (June 7, 2012): 413–14. http://dx.doi.org/10.1145/2318857.2254819.
Повний текст джерелаDasgupta, Sukrit, Jaudelice C. de Oliveira, and J. P. Vasseur. "Dynamic traffic engineering for mixed traffic on international networks." Computer Networks 52, no. 11 (August 2008): 2237–58. http://dx.doi.org/10.1016/j.comnet.2008.04.005.
Повний текст джерелаSingh, Amarpreet, Sandeep Singh, and Alok Aggarwal. "ADAPTIVE TRAFFIC SYSTEM CONTROLLERS IN TRAFFIC ENGINEERING : A SURVEY." Suranaree Journal of Science and Technology 30, no. 3 (December 15, 2023): 010224. http://dx.doi.org/10.55766/sujst-2023-03-e03030.
Повний текст джерелаДисертації з теми "Traffic engineering"
Mortier, Richard Michael. "Internet traffic engineering." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620378.
Повний текст джерелаLin, Gongqi. "Energy aware traffic engineering." Thesis, Curtin University, 2014. http://hdl.handle.net/20.500.11937/292.
Повний текст джерелаFortin, Melanie. "Traffic engineering of narrowband networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0018/MQ57726.pdf.
Повний текст джерелаBagula, Bigomokero Antoine. "Traffic engineering label switched paths." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/53196.
Повний текст джерелаENGLISH ABSTRACT: The Internet is evolving into a commercial platform requiring enhanced protocols and an expanded physical infrastructure allowing a better delivery from IP. Multi-protocol Label Switching (MPLS) is a technology enabling traffic engineering and virtual private network (VPN) provisioning. MPLS achieves traffic engineering by carrying the traffic over virtual connections called Label Switched Paths (LSPs) which are engineered based on QoS requirements such as delay, jitter and packet loss minimization or throughput maximization. This thesis proposes path finding and traffic distribution methods to be deployed in MPLS networks for traffic engineering LSPs. A flow optimization model based on a pre-planned routing approach separating path finding and traffic distribution is presented. This model is augmented by a threshold routing approach which routes the traffic based on thresholds expressing the maximum load level reached by network links. This routing approach moves the traffic away from thresholdmarked links to achieve low-utilized links/paths. The performance and routing capabilities of these methods are evaluated through designed software. A routing architecture implementing a two-layer signalling model for MPLS network is proposed and evaluated through simulation. v
AFRIKAANSE OPSOMMING:Die verandering van die Internet in 'n kommersiele platform met verbeterde protokolle en 'n uitgebreide fisieke infrastruktuur stel die internetprotokol (IP) in staat tot beter lewering. Multiprotokol- etiketskakeling (MPLS), is 'n tegnologie vir die voorsiening van televerkeerbeheer en virtuele privaatnetwerke (VPN). MPLS verskaf televerkeerbeheer deur die verkeer te dra oar virtuele konneksies, wat bekend staan as etiketgeskakelde paaie, waarvan die ontwerp gebaseer is op vereistes vir diensgehalte soos vertraging, ritteling en die minimering van pakketverlies of maksimering van deurvoer. Hierdie tesis stel nuwe padvind- en verkeerdistribusiemetodes voor wat aangewend word in MPLSnetwerke om etiketgeskakelde paaie te beheer. 'n Model vir vloei-optimering-gebaseer op voorafbeplande roetering wat padvinding en verkeerdistribusie skei-word aangebied. Hierdie model word uitgebrei deur 'n benadering van drempelroetering wat die verkeer roeteer en gebaseer is op drempels wat die maksimum ladingsvlak voorstel wat bereik kan word deur netwerkskakels. Hierdie roeteringsbenadering skuif die verkeer weg van drempelgemerkte skakels en bereik daardeur laaggebruikte skakelsjpaaie. Die prestasie en roeteringsvaardigheid van hierdie metodes word gevalueer deur selfontwikkelde programmatuur. 'n Argitektuur vir roetering wat 'n dubbellaagseinmodel implementeer vir 'n MPLS-netwerk, word aangebied en gevalueer met simulasie.
Fortin, Melanie (Melanie Yvette) Carleton University Dissertation Engineering Systems and Computer. "Traffic engineering of narrowband networks." Ottawa, 2000.
Знайти повний текст джерелаWarsama, Ahmed. "Traffic Engineering with SDN : Optimising traffic Load-Balancing with OpenFlow". Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-39385.
Повний текст джерелаRojanarowan, Jerapong. "MPLS-Based Best-Effort Traffic Engineering." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7496.
Повний текст джерелаIkram, Imran. "Traffic Engineering with MPLS and QOS." Thesis, Blekinge Tekniska Högskola, Avdelningen för telekommunikationssystem, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1217.
Повний текст джерелаDahlberg, Anders. "Traffic Engineering in a Bluetooth Piconet." Thesis, Blekinge Tekniska Högskola, Institutionen för telekommunikation och signalbehandling, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5759.
Повний текст джерелаPhone: +46709138850
Botha, Marlene. "Online traffic engineering for MPLS networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/50049.
Повний текст джерелаENGLISH ABSTRACT: The Internet is fast evolving into a commercial platform that carries a mixture of narrow- and broadband applications such as voice, video, and data. Users expect a certain level of guaranteed service from their service providers and consequently the need exists for efficient Internet traffic engineering to enable better Quality of Service (QoS) capabilities. Multi-protocol Label Switching (MPLS) is a label switching protocol that has emerged as an enabling technology to achieve efficient traffic engineering for QoS management in IP networks. The ability of the MPLS protocol to create explicit virtual connections called Label Switched Paths (LSPs) to carry network traffic significantly enhances the traffic engineering capabilities of communication networks. The MPLS protocol supports two options for explicit LSP selection: offline LSP computation using an optimization method and dynamic route selection where a single node makes use of current available network state information in order to compute an explicit LSP online. This thesis investigates various methods for the selection of explicit bandwidth guaranteed LSPs through dynamic route selection. We address the problem of computing a sequence of optimal LSPs where each LSP can carry a specific traffic demand and we assume that no prior information regarding the future traffic demands are available and that the arrival sequence of LSP requests to the network is unknown. Furthermore, we investigate the rerouting abilities of the online LSP selection methods to perform MPLS failure restoration upon link failure. We propose a new online routing framework known as Least Interference Optimization (LIO) that utilizes the current bandwidth availability and traffic flow distribution to achieve efficient traffic engineering. We present the Least Interference Optimization Algorithm (LIOA) that reduces the interference among competing network flows by balancing the number and quantity of flows carried by a link for the setup of bandwidth guaranteed LSPs in MPLS networks. The LIOA routing strategy is evaluated and compared against well-known routing strategies such as the Minimum Hop Algorithm (MHA), Minimum Interference Routing Algorithm (MIRA), Open Shortest Path First (OSPF) and Constraint Shortest Path First (CSPF) by means of simulation. Simulation results revealed that, for the network topologies under consideration, the routing strategies that employed dynamic network state information in their routing decisions (LIOA, CSPF and MIRA) generally outperformed the routing strategies that only rely on static network information (OSPF and MHA). In most simulation experiments the best performance was achieved by the LIOA routing strategy while the MHA performed the worse. Furthermore we observed that the computational complexity of the MIRA routing strategy does not translate into equivalent performance gains. We employed the online routing strategies for MPLS failure recovery upon link failure. In particular we investigated two aspects to determine the efficiency of the routing strategies for MPLS rerouting: the suitability of the LSP configuration that results due to the establishment of LSPs prior to link failure and the ability of the online routing strategy to reroute failed LSPs upon link failure. Simulation results revealed similar rerouting performance for all online routing strategies under investigation, but a LSP configuration most suitable for online rerouting was observed for the LIOA routing strategy.
AFRIKAANSE OPSOMMING:Die Internet is voordurend besig om te evoleer in 'n medium wat 'n wye reeks moderne kommunikasietegnologiee ondersteun, insluitende telefoon, video en data. Internet gebruikers verwag gewaarborgde diens van hul diensverskaffers en daar bestaan dus 'n vraag na doeltreffende televerkeerbeheer vir gewaarborgde Internet diensgehalte. Multiprotokol Etiketskakeling (MPLS) is 'n etiketskakeling protokol wat doeltreffende televerkeerbeheer en diensgehalte moontlik maak deur die eksplisiete seleksie van virtuele konneksies vir die transmissie van netwerkverkeer in Internetprotokol (IP) netwerke. Hierdie virtuele konneksies staan bekend as etiketgeskakelde paaie. Die MPLS protokol ondersteun tans twee moontlikhede vir eksplisiete seleksie van etiketgeskakelde paaie: aflyn padberekening met behulp van optimeringsmetodes en dinamiese aanlyn padseleksie waar 'n gekose node 'n eksplisiete pad bereken deur die huidige stand van die netwerk in ag te neem. In hierdie tesis word verskeie padseleksiemetodes vir die seleksie van eksplisiete bandwydte-gewaarborgde etiketgeskakelde paaie deur mid del van dinamiese padseleksie ondersoek. Die probleem om 'n reeks optimale etiketgeskakelde paaie te bereken wat elk 'n gespesifeerde verkeersaanvraag kan akkommodeer word aangespreek. Daar word aanvaar dat geen informasie in verband met die toekomstige verkeersaanvraag bekend is nie en dat die aankomsvolgorde van etiketgeskakelde pad verso eke onbekend is. Ons ondersoek verder die herroeteringsmoontlikhede van die aanlyn padseleksiemetodes vir MPLS foutrestorasie in die geval van skakelonderbreking. Vir hierdie doel word 'n nuwe aanlyn roeteringsraamwerk naamlik Laagste Inwerking Optimering (LIO) voorgestel. LIO benut die huidige beskikbare bandwydte en verkeersvloeidistribusie van die netwerk om doeltreffende televerkeerbeheer moontlik te maak. Ons beskryf 'n Laagste Inwerking Optimering Algoritme (LIOA) wat die inwerking tussen kompeterende verkeersvloei verminder deur 'n balans te handhaaf tussen die aantal en kwantiteit van die verkeersvloeistrome wat gedra word deur elke netwerkskakel. Die LIOA roeteringstrategie word geevalueer met behulp van simulasie en die resultate word vergelyk met ander bekende roeteringstrategiee insluitende die Minimum Node Algorithme (MHA), die Minimum Inwerking Algoritme (MIRA), die Wydste Kortste Pad Eerste Algoritme (OSPF) en die Beperkte Kortste Pad Eerste Algoritme (CSPF). Die resultate van die simulasie-eksperimente to on dat, vir die netwerk topologiee onder eksperimentasie, die roeteringstratgiee wat roeteringsbesluite op dinamiese netwerk informasie baseer (LIOA, MIRA, CSPF) oor die algemeen beter vaar as die wat slegs staatmaak op statiese netwerkinformasie (MHA, OSPF). In die meeste simulasie-eksperimente vaar die LIOA roeteringstrategie die beste en die MHA roeteringstrategie die slegste. Daar word verder waargeneem dat die komputasiekomplesiteit van die MIRA roeteringstrategie nie noodwendig weerspieel word in die sukses van roeteringsuitkoms nie. In die geval waar die aanlyn roeteringstrategiee aangewend word vir MPLS foutrestorasie, toon die resultate van simulasie-eksperimente dat al die roeteringstrategiee min of meer dieselfde uitkoms lewer ten opsigte van herroetering van onderbreekte verkeersvloei. Die konfigurasie van etiketgeskakelde paaie deur die LIOA roeteringstrategie voor skakelonderbreking is egter die geskikste vir televerkeer herroetering na skakelonderbreking
Книги з теми "Traffic engineering"
S, Prassas Elena, and McShane William R, eds. Traffic engineering. 4th ed. Upper Saddle River: Pearson, 2011.
Знайти повний текст джерелаCallegati, Franco, Walter Cerroni, and Carla Raffaelli. Traffic Engineering. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-09589-4.
Повний текст джерелаSalter, R. J. Traffic Engineering. London: Macmillan Education UK, 1989. http://dx.doi.org/10.1007/978-1-349-10800-8.
Повний текст джерелаS, Prassas Elena, and McShane William R, eds. Traffic engineering. 3rd ed. Upper Saddle River, N.J: Pearson/Prentice Hall, 2004.
Знайти повний текст джерелаP, Roess Roger, ed. Traffic engineering. Englewood Cliffs, N.J: Prentice-Hall, 1990.
Знайти повний текст джерелаP, Roess Roger, and Prassas Elena S, eds. Traffic engineering. 2nd ed. Upper Saddle River, N.J: Prentice Hall, 1998.
Знайти повний текст джерелаL, Pline James, and Institute of Transportation Engineers, eds. Traffic engineering handbook. 4th ed. Englewood Cliffs, N.J: Prentice-Hall, 1992.
Знайти повний текст джерелаTransportation, Montana Dept of. Traffic engineering manual. [Helena, Mont.]: Montana Dept. of Transportation, 2007.
Знайти повний текст джерелаPande, Anurag, and Brian Wolshon. Traffic Engineering Handbook. Hoboken, NJ, USA: John Wiley & Sons, Inc, 2015. http://dx.doi.org/10.1002/9781119174738.
Повний текст джерелаL, Pline James, and Institute of Transportation Engineers, eds. Traffic engineering handbook. 5th ed. [Washington, D.C.]: Institute of Transportation Engineers, 1999.
Знайти повний текст джерелаЧастини книг з теми "Traffic engineering"
Faruque, Saleh. "Traffic Engineering." In SpringerBriefs in Electrical and Computer Engineering, 49–58. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99615-8_5.
Повний текст джерелаGaylord, Richard J., and Kazume Nishidate. "Traffic Engineering." In Modeling Nature, 25–35. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4684-9405-1_3.
Повний текст джерелаWeik, Martin H. "traffic engineering." In Computer Science and Communications Dictionary, 1803. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_19823.
Повний текст джерелаCallegati, Franco, Walter Cerroni, and Carla Raffaelli. "Engineering Packet-Switched Networks." In Traffic Engineering, 141–202. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09589-4_5.
Повний текст джерелаCallegati, Franco, Walter Cerroni, and Carla Raffaelli. "Engineering Circuit-Switched Networks." In Traffic Engineering, 65–139. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09589-4_4.
Повний текст джерелаCallegati, Franco, Walter Cerroni, and Carla Raffaelli. "Introduction to Teletraffic Engineering." In Traffic Engineering, 1–12. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09589-4_1.
Повний текст джерелаMallick, Rajib B., and Tahar El-Korchi. "Traffic." In Pavement Engineering, 97–116. 4th ed. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/b23274-5.
Повний текст джерелаFindley, Daniel J. "Traffic Engineering Studies." In Traffic Engineering Handbook, 109–48. Hoboken, NJ, USA: John Wiley & Sons, Inc, 2016. http://dx.doi.org/10.1002/9781119174738.ch4.
Повний текст джерелаVan Dung, Pham, Marat Zhanikeev, and Yoshiaki Tanaka. "Traffic Trace Engineering." In Management Enabling the Future Internet for Changing Business and New Computing Services, 1–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04492-2_1.
Повний текст джерелаBonaventure, O., P. Trimintzios, G. Pavlou, B. Quoitin, A. Azcorra, M. Bagnulo, P. Flegkas, et al. "Internet Traffic Engineering." In Quality of Future Internet Services, 118–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45190-7_4.
Повний текст джерелаТези доповідей конференцій з теми "Traffic engineering"
Singh, Rachee, Nikolaj Bjørner, and Umesh Krishnaswamy. "Traffic engineering." In SOSR '22: The ACM SIGCOMM Symposium on SDN Research. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3563647.3563652.
Повний текст джерелаChiun Lin Lim and Ao Tang. "Traffic engineering with elastic traffic." In 2013 IEEE Global Communications Conference (GLOBECOM 2013). IEEE, 2013. http://dx.doi.org/10.1109/glocom.2013.6831547.
Повний текст джерелаRoughan, Matthew, Mikkel Thorup, and Yin Zhang. "Traffic engineering with estimated traffic matrices." In the 2003 ACM SIGCOMM conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/948205.948237.
Повний текст джерелаAgrawal, Himanshu, Andrew Jennings, and Mark Gregory. "Robust traffic engineering." In 2008 2nd International Symposium on Advanced Networks and Telecommunication Systems (ANTS). IEEE, 2008. http://dx.doi.org/10.1109/ants.2008.4937808.
Повний текст джерелаOtoshi, Tatsuya, Yuichi Ohsita, Masayuki Murata, Yousuke Takahashi, Keisuke Ishibashi, and Kohei Shiomoto. "Traffic prediction for dynamic traffic engineering considering traffic variation." In 2013 IEEE Global Communications Conference (GLOBECOM 2013). IEEE, 2013. http://dx.doi.org/10.1109/glocom.2013.6831297.
Повний текст джерелаZheng, Anny Xijia, Jianan Zhang, Rui Wang, and Leon Poutievski. "(Invited) How Traffic Analytics Shapes Traffic Engineering, Topology Engineering, and Capacity Planning of Jupiter." In Optical Fiber Communication Conference. Washington, D.C.: Optica Publishing Group, 2023. http://dx.doi.org/10.1364/ofc.2023.w3a.2.
Повний текст джерелаCurtis, Eddie. "Lessons Learned from ASCT and Systems Engineering." In Automated Traffic Signal Performance Measure Workshop. Purdue University, 2016. http://dx.doi.org/10.5703/1288284316019.
Повний текст джерелаKatoh, Masafumi, Izuru Sato, and Naotoshi Watanabe. "Traffic engineering for IoT." In 2016 International Conference on Information Networking (ICOIN). IEEE, 2016. http://dx.doi.org/10.1109/icoin.2016.7427113.
Повний текст джерелаLai, Wai Sum. "Traffic engineering for MPLS." In ITCom 2002: The Convergence of Information Technologies and Communications, edited by Robert D. van der Mei and Frank Huebner. SPIE, 2002. http://dx.doi.org/10.1117/12.473396.
Повний текст джерелаSadler, Jonathan. "Mutli-Layer Traffic Engineering." In National Fiber Optic Engineers Conference. Washington, D.C.: OSA, 2010. http://dx.doi.org/10.1364/nfoec.2010.nthe1.
Повний текст джерелаЗвіти організацій з теми "Traffic engineering"
Ould-Brahim, H., D. Fedyk, and Y. Rekhter. BGP Traffic Engineering Attribute. RFC Editor, May 2009. http://dx.doi.org/10.17487/rfc5543.
Повний текст джерелаKompella, K. A Traffic Engineering (TE) MIB. RFC Editor, January 2005. http://dx.doi.org/10.17487/rfc3970.
Повний текст джерелаMeyer, M., ed. MPLS Traffic Engineering Soft Preemption. RFC Editor, January 2010. http://dx.doi.org/10.17487/rfc5712.
Повний текст джерелаAyyangar, A. Inter-Domain MPLS and GMPLS Traffic Engineering -- Resource Reservation Protocol-Traffic Engineering (RSVP-TE) Extensions. Edited by A. Farrel. RFC Editor, February 2008. http://dx.doi.org/10.17487/rfc5151.
Повний текст джерелаAwduche, D., J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus. Requirements for Traffic Engineering Over MPLS. RFC Editor, September 1999. http://dx.doi.org/10.17487/rfc2702.
Повний текст джерелаDubuc, M., T. Nadeau, and J. Lang. Traffic Engineering Link Management Information Base. RFC Editor, November 2005. http://dx.doi.org/10.17487/rfc4220.
Повний текст джерелаLi, T., and H. Smit. IS-IS Extensions for Traffic Engineering. RFC Editor, October 2008. http://dx.doi.org/10.17487/rfc5305.
Повний текст джерелаHarrison, J., J. Berger, and M. Bartlett. IPv6 Traffic Engineering in IS-IS. RFC Editor, February 2011. http://dx.doi.org/10.17487/rfc6119.
Повний текст джерелаGiacalone, S., D. Ward, J. Drake, A. Atlas, and S. Previdi. OSPF Traffic Engineering (TE) Metric Extensions. RFC Editor, March 2015. http://dx.doi.org/10.17487/rfc7471.
Повний текст джерелаAwduche, D., A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao. Overview and Principles of Internet Traffic Engineering. RFC Editor, May 2002. http://dx.doi.org/10.17487/rfc3272.
Повний текст джерела