Academic literature on the topic 'To Routing'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'To Routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "To Routing"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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 eac
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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 (1985): 121–26. http://dx.doi.org/10.1109/tcad.1985.1270104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
Abstract:
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, and other styles
10

Liu, Jun Jian, Jiu Lei Jiang, and Jiao Zhang. "Multipath Routing." Applied Mechanics and Materials 519-520 (February 2014): 288–93. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.288.

Full text
Abstract:
Multipath routing can be effectively used for maximum utilization of network resources. It gives the node a choice of next hops for the same destination. We present two tree based algorithms, which we call MSPT and MBFT that can help a node to find multiple next hops for a destination. Both of them are distributed algorithm, allowing the traffic to switch off the shortest path and fully exploiting the path diversity of the network. MSPT has lower cost, while MBFT has less hops between the source and destination, end system can select next hop according to the application requirements. The simu
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "To Routing"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
Abstract:
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 mi
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
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 pr
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
<p>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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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/.

Full text
Abstract:
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 softwar
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "To Routing"

1

Rails routing. Addison-Wesley Professional, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

IP routing. O'Reilly, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

IP routing primer. Macmillan Technical Pub., 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Techniques of routing. 2nd ed. Building Trades Journal, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Danny, McPherson, and Cisco Systems Inc, eds. Internet routing architectures. 2nd ed. Cisco, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

John, Perkins, ed. Modern routing techniques. Unwin Hyman, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "To Routing"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dror, Moshe, and André Langevin. "Transformations and Exact Node Routing Solutions by Column Generation." In Arc Routing. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hertz, Alain, and Michel Mittaz. "Heuristic Algorithms." In Arc Routing. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4495-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "To 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.

Full text
Abstract:
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 a
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, look
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liao, Haiguang, Qingyi Dong, Xuliang Dong, et al. "Attention Routing: Track-Assignment Detailed Routing Using Attention-Based Reinforcement Learning." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22219.

Full text
Abstract:
Abstract In the physical design of integrated circuits, global and detailed routing are critical stages involving the determination of the interconnected paths of each net on a circuit while satisfying the design constraints. Existing actual routers as well as routability predictors either have to resort to expensive approaches that lead to high computational times, or use heuristics that do not generalize well. Even though new, learning-based routing methods have been proposed to address this need, requirements on labelled data and difficulties in addressing complex design rule constraints ha
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Frederickson, Greg N., and Ravi Janardan. "Optimal message routing without complete routing tables." In the fifth annual ACM symposium. ACM Press, 1986. http://dx.doi.org/10.1145/10590.10598.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "To Routing"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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, 1995. http://dx.doi.org/10.17487/rfc1786.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!