Увійти

Готові списки джерел за темами / Routing

Добірка наукової літератури з теми "Routing"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 8 червня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Routing".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Routing"

1

Jia, Xiaohua, Niki Pissinou, and Kia Makki. "Modeling and Simulations of Multicast Routing Algorithms for Advanced Network Applications." SIMULATION 68, no. 1 (January 1997): 44–55. http://dx.doi.org/10.1177/003754979706800107.

Повний текст джерела

Анотація:

Multicast has become an important service in modern network applications. Multicast routing is a difficult issue, particularly under delay or bandwidth constraints. This paper discusses Steiner trees in the modeling of multicast routings and various routing constraints required by applications. It also discusses the existing multicast routing algorithms, especially the routings under constraints, such as delay constraint, limited available bandwidth, and traffic load balancing. Extensive simulations have been conducted to reveal the relationships between the network cost of the routing and each of the discussed constraints.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Bobier, Kim, and Marisa Williamson. "Routing." Women & Performance: a journal of feminist theory 30, no. 3 (September 1, 2020): 257–63. http://dx.doi.org/10.1080/0740770x.2020.1907683.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Kumar, B. N. Mohan. "Geographic Routing Protocol Using Vanet Routing." WSEAS TRANSACTIONS ON COMMUNICATIONS 22 (October 5, 2023): 117–24. http://dx.doi.org/10.37394/23204.2023.22.11.

Повний текст джерела

Анотація:

Previously, vehicular ad hoc networks (VANETs) were designed by using several geographic routing schemes. That doesn’t sustaining any routing configurations in the existing geographic routing methods. Vehicular Ad hoc Network is networks which consist of mobile nodes, consequently it is very harsh to make and remain up end-to-end links. The main aim of this research work is widespread inter vehicle distance, high speed of vehicles also support the density of vehicle is altered. The exact real time location information of vehicles is accessed with high reliability via vehicle to vehicle inter connection. Due to frequent link entrapped and rapid topology changes it is not easy to augment well-organized routing etiquettes for VANETs. To find the exact location of stirring vehicles is very difficult and may incur in the existing routing networks. Additionally the position information about stirring vehicle accessible to other vehicles is usually time-lagged as it is always stirring over time. Luckily, we scrutinize that the interim upcoming locations of vehicles can be forecast. Anchored in the significant surveillance, we propose a novel approach for geographic routing. It uses the extrapolative locations of automobiles. The etiquettes anchored in the vehicles' positions also called as geographic routing protocols (GR) were uncovered to be the most adequate to the VANETs because of their sturdiness in making with the dynamic environment changes and the high-ceilinged mobility of the automobiles. The etiquette is incorporated with a multi-hop information delivery virtualization deal that works on the crest of the transportation stratum and gives soaring speed for multi-hop one after the other information broadcasts. We demeanor practical computer imitations to display the recital advantage of the etiquette over additional approaches at the indistinguishable time vigor efficiency will be enhanced.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Panaite, Petrişor. "Routing Permutations on a 2D Grid with One-Way Edges." Parallel Processing Letters 07, no. 03 (September 1997): 225–35. http://dx.doi.org/10.1142/s0129626497000243.

Повний текст джерела

Анотація:

We deal with the permutation routing problem on the m × n grid with one-register vertices and one-way edges. We give a routing algrithm of O(m + n) steps which is local, that is, the routing decision of every vertex depends on the states of vertices O(1) apart. Previous work investigated either local routings on two-way edges or non local routings on one-way edges.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Choi, Ick-Sung, Gwang-Hoon Kwark, and Geun-Hyung Kim. "A Routing Algorithm with Small Routing Traffic." KIPS Transactions:PartC 18C, no. 4 (August 31, 2011): 279–86. http://dx.doi.org/10.3745/kipstc.2011.18c.4.279.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Patel, A. M., N. L. Soong, and R. K. Korn. "Hierarchical VLSI Routing--An Approximate Routing Procedure." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 4, no. 2 (April 1985): 121–26. http://dx.doi.org/10.1109/tcad.1985.1270104.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Xianhui, Yang, Ren Honge, and Jing Weipeng. "Predictive Routing For Mobile Sink Routing Algorithm." International Journal of Grid and Distributed Computing 7, no. 3 (June 30, 2014): 143–54. http://dx.doi.org/10.14257/ijgdc.2014.7.3.14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Luccio, F. "Masked Interval Routing: A New Routing Scheme." Computer Journal 43, no. 2 (February 1, 2000): 121–29. http://dx.doi.org/10.1093/comjnl/43.2.121.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Oppen, Johan, and Arne Løkketangen. "Arc routing in a node routing environment." Computers & Operations Research 33, no. 4 (April 2006): 1033–55. http://dx.doi.org/10.1016/j.cor.2004.09.004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Pearn, Wen-Lea, Arjang Assad, and Bruce L. Golden. "Transforming arc routing into node routing problems." Computers & Operations Research 14, no. 4 (January 1987): 285–88. http://dx.doi.org/10.1016/0305-0548(87)90065-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Routing"

1

Mühlbauer, Wolfgang. "Inter domain routing under scrutiny : routing models and alternative routing architectures /." kostenfrei, 2009. http://opus.kobv.de/tuberlin/volltexte/2010/2514/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Bereketli, Alper. "On Qos Multicast Routing Routing Protocols." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606446/index.pdf.

Повний текст джерела

Анотація:

Multicasting is a technique used for distributing data packets from one or more sources to a set of receivers on interconnected networks. Currently developing network applications bring specific quality of service (QoS) requirements like bounded delay, minimum bandwidth, and maximum data loss rate. Providing the required quality of service addresses routing and resource reservation concepts. In this study, a literature survey is carried out on traditional and QoS multicast routing protocols, and the need for QoS routing protocols is investigated. QoS multicast routing protocols are classified and compared according to their multicast tree construction and resource reservation approaches. Two QoS protocols, QROUTE and QMBF, are selected, and their performances are experimentally compared using the network simulation tool Network Simulator-2 (ns-2). The objective of the simulations is to compare the QoS routing algorithms and their tree construction efficiencies. The first contribution of the thesis is the survey and classification of traditional and QoS multicast routing protocols. Another contribution is the ns-2 implementation of two QoS multicast routing protocols. The final contribution of the thesis is the performance evaluation of the recent protocols from a different perspective.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Mourgaya, Virapatrin Magalie. "The periodic vehicle routing problem : planning before routing." Bordeaux 1, 2004. http://www.theses.fr/2004BOR12843.

Повний текст джерела

Анотація:

Le problème de tournées de véhicules multipériodiques consisté à planifier des visites client sur un horizon de temps donné en les affectant à des tournées de véhicule. Les fréquences de visites ou espacement entre elles sont prescrits. Ces contraintes peuvent prendre la forme de scénarios de visites admissibles. Nous étudions les différentes variantes de ce problème et proposons une classification. Nous présentons ensuite un algorithme heuristique pour un modèle de planification tactique qui optimise la répartition de la charge et la régionalisation des tournées. L'objectif traditionnel de minimisation des distances parcourues est reporté au niveau des décisions opérationnelles. Cette approche nous a permis d'obtenir des solutions pratiques pour un problème industriel avec 16658 visites à planifier sur un horizon de 20 jours. Nous proposons enfin un heuristique d'arrondi basé sur la méthode de génération de colonnes. Cette méthode basée sur l'optimisation globale permet d'obtenir des solutions de meilleure qualité pour les problèmes de planification à court terme avec de l'ordre de 50 clients.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Roughgarden, Tim. "Selfish routing." online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?3050436.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Andersson, Johan, and Marcus Kleihs. "Routing Interior." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-21647.

Повний текст джерела

Анотація:

När datatrafik färdas genom ett nätverk så passerar det routrar och switcharsamtidigt som dessa enheter visar åt vilket håll paketet ska skickas. Detta kallas förrouting. För att paketen ska hitta rätt väg så använder man sig av routingprotokoll,som vägleder trafiken dit de ska, och olika protokoll har olika fördelar samtidigtsom de används vid olika tillfällen. Målet var att skapa ett stort enhetligt nätverksom tål höga belastningar, har en hög uppkopplingsprocent samtidigt som det skavara lätt att expandera i framtiden. Det största problemet var hur trafiken färdasmellan varje kontor, men problem som hur användarna ska vara uppkopplade tillInternet tas upp i rapporten. Nätverket använder sig av OSPF som routingprotokoll.Varje kontor delas in i områden, totallystubby area, vilket kortar nedroutingtabellen i Stockholm. Resultatet blir att snabba beslut tas när paket skaskickas inom ett kontor och när det ska utanför ett kontor så används en defaultroute. Samtidigt som kontoren är lätta att bygga ut då totallystubby area har endefault route till Stockholm.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Campbell, Ann Melissa. "Inventory routing." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/25530.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Chaudhray, Kamal. "VLSI routing." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359367.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Madapatha, Samira Anupama. "Energy efficient hierarchical wireless routing protocol (EEHW routing protocol)." Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1597778.

Повний текст джерела

Анотація:

The areas of WSNs (Wireless Sensor Networks) and Internet of Things (IoT) are considered to be the highly embryonic and most emerging arenas in research in the industrial or technical world now. This has brought about the inevitability of introducing or developing highly reliable, highly efficient, low cost, and low power sensor nodes to the market. Primary emphasis of wireless sensor network routing protocol is now on the coup of power preservation. Most of the modern publications have exposed so many protocols primarily intended to mineralize the energy consumption in wireless sensor networks. This thesis work recommends an enhancement to the gradient base hierarchical routing protocol technique introduced by Dr. Mozumdar in 2011. Proposed method introduces active/ idle mode for end devices with time division multiplexing to cut down the energy usage of battery powered sensor nodes. At the same time data aggregation at the access point and also backup route has been introduced to end devices to send data back to the base station when the parent node fails to communicate. It is easy to perceive from simulation results that the enhanced protocol has higher lifetime compared to the original protocol. As a closing section, boosted energy efficient hieratical routing protocol (EEHW protocol) is implemented in Contiki OS.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

BANTAN, NOUMAN. "A ROUTING PROTOCOL AND ROUTING ALGORITHM FOR SPACE COMMUNICATION." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1172099125.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Rincon, Garcia Nicolas. "Freight transport, routing software and time-dependent vehicle routing models." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/397141/.

Повний текст джерела

Анотація:

Routing and scheduling software is part of the Information and Technology systems available to support the transport industry, and uses complex algorithms along with geographical representations of the road network to allow better planning of daily collection and delivery schedules. This research reviews the evolution of routing and scheduling software, the algorithms used along with reported barriers to wider take-up and potential industry driven improvements that could be made. A survey of transport companies in the United Kingdom was conducted in order to validate and prioritize the software capabilities that require the most development according to the new challenges that the industry is facing. Responses suggested that companies required improved route optimization to tackle congestion based on time-dependent data and models, and greater accuracy in the representation of the road network. Not considering congestion leads to the underestimation of travel times and the production of inaccurate schedules. Literature shows that operational research techniques are available to solve problems that represent real world conditions, but research into the relative merits of using time-dependent models needs to be undertaken. Although exact methods have been developed to solve the Vehicle Routing Problem, they cannot cope with large instances and rich variants that are required by the industry. Therefore, metaheuristic algorithms are usually implemented in routing software. A reported barrier in metaheuristic algorithms is the lack of accuracy (the difference between optimal or best-known values and the result of the proposed algorithm). In this research an algorithm was developed using elements of Large Neighbourhood Search that is capable to substantially improve the state of the art for the time-dependent Vehicle Routing Problem. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time. A variant that considers the Rules on Drivers’ hours required in the scheduling of vehicles over 3.5 tons in the European Union and the UK is also introduced. Analysis of results show result improvements in number of vehicles (19.0%), travel distance (17.7%) and route duration (4.4%) compared to previous implementations.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Routing"

1

Toth, Paolo, and Daniele Vigo, eds. Vehicle Routing. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973594.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Corberán, Ángel, and Gilbert Laporte, eds. Arc Routing. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611973679.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Misra, Sudip, and Sumit Goswami. Network Routing. Chichester, UK: John Wiley & Sons, Ltd, 2017. http://dx.doi.org/10.1002/9781119114864.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Dror, Moshe, ed. Arc Routing. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

O, Ball M., ed. Network routing. Amsterdam: Elsevier, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Rails routing. Boston, Mass: Addison-Wesley Professional, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

1950-, Ball M. O., and Institute for Operations Research and the Management Sciences., eds. Network routing. Amsterdam: North-Holland, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Books, Time-Life, ed. Advanced routing. Alexandria, Va: Time-Life Books, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

IP routing. Sebastopol, CA: O'Reilly, 2002.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

James, Macfarlane. Network routing basics: Understanding IP routing in Cisco systems. Indianapolis, IN: Wiley Pub., 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Routing"

1

Eiselt, H. A., and Gilbert Laporte. "A Historical Perspective on Arc Routing." In Arc Routing, 1–16. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Campbell, James F., and André Langevin. "Roadway Snow and Ice Control." In Arc Routing, 389–418. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Bodin, Lawrence, and Laurence Levy. "Scheduling of Local Delivery Carrier Routes for the United States Postal Service." In Arc Routing, 419–42. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Dror, Moshe, Janny M. Y. Leung, and Paul A. Mullaseril. "Livestock Feed Distribution and Arc Traversal Problems." In Arc Routing, 443–64. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Fleischner, Herbert. "Traversing Graphs: The Eulerian and Hamiltonian Theme." In Arc Routing, 19–87. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Derigs, Ulrich. "Matching: Arc Routing and the Solution Connection." In Arc Routing, 89–132. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Dror, Moshe. "Arc Routing: Complexity and Approximability." In Arc Routing, 133–69. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Johnson, Ellis L. "Chinese Postman and Euler Tour Problems in Bi-Directed Graphs." In Arc Routing, 171–96. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Eglese, Richard W., and Adam N. Letchford. "Polyhedral Theory for Arc Routing Problems." In Arc Routing, 199–230. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Benavent, E., A. Corberán, and J. M. Sanchis. "Linear Programming Based Methods for Solving Arc Routing Problems." In Arc Routing, 231–75. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Routing"

1

Mahalingam, Vijay Kumar. "A Simulation Study of Flexible Manufacturing System Using Dynamic Scheduling Approach." In ASME 2014 12th Biennial Conference on Engineering Systems Design and Analysis. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/esda2014-20484.

Повний текст джерела

Анотація:

This paper presents a simulation study aimed at evaluating the performances of a typical Flexible manufacturing system (FMS) problems in terms of make span, average flow time, average delay time at local buffers and average machine utilization, subject to different control strategies which include routing flexibilities and dispatching rules. The routing strategies under evaluation are ‘No Alternative Routings (NAR)’; ‘Alternative Routings Dynamic (ARD)’; and ‘Alternative Routings Planned (ARP)’. The ARP rule was introduced into the FMS and coded with C++ program. The above routing strategies are combined with five dispatching rules and studied in different production volumes. Since an FMS usually deals with a variety of products, effects of changing the part mix ratio are also discussed. Simulation study was performed by using ARENA software. Finally results indicate that the ‘alternative routings planned’ strategy outperforms other routing strategies in general.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Moreira, Waldir, Paulo Mendes, and Susana Sargento. "Opportunistic routing based on daily routines." In 2012 IEEE Thirteenth International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM). IEEE, 2012. http://dx.doi.org/10.1109/wowmom.2012.6263749.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Wu, Wenfei, Yoshio Turner, and Mike Schlansker. "Routing Optimization for Ensemble Routing." In 2011 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS). IEEE, 2011. http://dx.doi.org/10.1109/ancs.2011.26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Bilal, Sardar M., Muhammad Naveed Dilber, and Atta Rehman Khan. "Routing proposals for multipath interdomain routing." In 2012 15th International Multitopic Conference (INMIC 2012). IEEE, 2012. http://dx.doi.org/10.1109/inmic.2012.6511507.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Hansen, Shawn, Ted Wilcox, and Dan Stanzione. "InfiniBand routing---InfiniBand routing and switching." In the 2006 ACM/IEEE conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1188455.1188468.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Gordon, Gary A., and Richard R. Young. "Hazmat Routing: Alternate Routing Risk Analysis." In 2016 Joint Rail Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/jrc2016-5729.

Повний текст джерела

Анотація:

The railroad industry is challenged by the complexity and cost of performing the alternate route analysis as required by the Federal Railroad Administration’s (FRA) hazmat routing regulation. This is especially problematic to the regional and short line railroads for several reasons, including the unavailability of alternate routes and, as with the Class I railroads, it is a matter of cost and complexity of analysis. This research paper will look at developing a simplified risk model so as to reduce the cost and complexity of the analysis. This will be accomplished by, among other things, looking at the input parameters to the model for commonality so as to reduce the number (of input parameters) and look at three operating conditions for the analysis. They are: 1) the premise that there are available alternate routes, 2) that alternate routes may not be feasible operationally or economically and 3) that there are no alternate routes. This research and analysis will result in a model that is less complex and costly to run and address the concerns and challenges of the short line and regional railroads.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Chunduri, Uma, Alexander Clemm, and Richard Li. "Preferred Path Routing - A Next-Generation Routing Framework beyond Segment Routing." In GLOBECOM 2018 - 2018 IEEE Global Communications Conference. IEEE, 2018. http://dx.doi.org/10.1109/glocom.2018.8647410.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Changfan, Chieh, Yu-Chin Hsu, and Fur-Shing Tsai. "Post-routing timing optimization with routing characterization." In the 1999 international symposium. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/299996.300013.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Reimann, Tiago J., Glauco B. V. Santos, and Ricardo A. L. Reis. "Routing algorithms performance in different routing scopes." In 2010 17th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icecs.2010.5724594.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Dong, Fang, Junbiao Liu, and Shenyi Dai. "Identity Routing Symmetry Metrics for Routing Behavior." In 2016 4th International Conference on Machinery, Materials and Computing Technology. Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icmmct-16.2016.368.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Routing"

1

Oppenheimer, A. Appletalk Update-Based Routing Protocol: Enhanced Appletalk Routing. RFC Editor, August 1993. http://dx.doi.org/10.17487/rfc1504.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Blunk, L., M. Karir, and C. Labovitz. Multi-Threaded Routing Toolkit (MRT) Routing Information Export Format. RFC Editor, October 2011. http://dx.doi.org/10.17487/rfc6396.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

COLUMBIA UNIV NEW YORK. Analytical Analysis of Vehicle Routing and Inventory Routing Problems. Fort Belvoir, VA: Defense Technical Information Center, December 1998. http://dx.doi.org/10.21236/ada358629.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Hedrick, C. L. Routing Information Protocol. RFC Editor, June 1988. http://dx.doi.org/10.17487/rfc1058.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Braun, H. W. NSFNET routing architecture. RFC Editor, February 1989. http://dx.doi.org/10.17487/rfc1093.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Durand, A., and B. Buclin. 6Bone Routing Practice. RFC Editor, March 1999. http://dx.doi.org/10.17487/rfc2546.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Ginsberg, L., B. Decraene, S. Litkowski, and R. Shakir. Segment Routing Architecture. Edited by C. Filsfils and S. Previdi. RFC Editor, July 2018. http://dx.doi.org/10.17487/rfc8402.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

McPherson, D., S. Amante, E. Osterweil, L. Blunk, and D. Mitchell. Considerations for Internet Routing Registries (IRRs) and Routing Policy Configuration. RFC Editor, December 2015. http://dx.doi.org/10.17487/rfc7682.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Bates, T., E. Gerich, L. Joncheray, D. Karrenberg, M. Terpstra, and J. Yu. Representation of IP Routing Policies in a Routing Registry (ripe-81++). RFC Editor, March 1995. http://dx.doi.org/10.17487/rfc1786.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Papadimitriou, D. OSPFv2 Routing Protocols Extensions for Automatically Switched Optical Network (ASON) Routing. RFC Editor, March 2010. http://dx.doi.org/10.17487/rfc5787.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!