Academic literature on the topic 'Traffic Routing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Traffic 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 "Traffic Routing"
Csercsik, Dávid, and Balázs Sziklai. "Traffic routing oligopoly." Central European Journal of Operations Research 23, no. 4 (July 4, 2013): 743–62. http://dx.doi.org/10.1007/s10100-013-0316-5.
Full textWu, Wei Qiang, Bing Ni Luo, Pei Pei Chen, and Qin Yu Zhang. "QoS Routing Protocol Based on Resource Optimization for Aerospace Networks." Applied Mechanics and Materials 596 (July 2014): 856–60. http://dx.doi.org/10.4028/www.scientific.net/amm.596.856.
Full textChoi, 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.
Full textAuletta, Vincenzo, Roberto De Prisco, Paolo Penna, and Giuseppe Persiano. "Routing selfish unsplittable traffic." ACM Transactions on Algorithms 3, no. 4 (November 2007): 52. http://dx.doi.org/10.1145/1290672.1290689.
Full textShastry, Swathi, and T. R. Naveenkumar. "Routing of Traffic Sensors in Intelligent Transportation System." Bonfring International Journal of Software Engineering and Soft Computing 6, Special Issue (October 31, 2016): 98–103. http://dx.doi.org/10.9756/bijsesc.8252.
Full textEl Azouzi, R., and E. Altman. "Constrained traffic equilibrium in routing." IEEE Transactions on Automatic Control 48, no. 9 (September 2003): 1656–60. http://dx.doi.org/10.1109/tac.2003.817011.
Full textKey, Peter, and Alexandre Proutiere. "Routing games with elastic traffic." ACM SIGMETRICS Performance Evaluation Review 37, no. 2 (October 16, 2009): 63–64. http://dx.doi.org/10.1145/1639562.1639587.
Full textO’Kelly, Morton E. "Routing Traffic at Hub Facilities." Networks and Spatial Economics 10, no. 2 (April 22, 2008): 173–91. http://dx.doi.org/10.1007/s11067-008-9061-z.
Full textBen-Ameur, Walid, and Hervé Kerivin. "Routing of Uncertain Traffic Demands." Optimization and Engineering 6, no. 3 (September 2005): 283–313. http://dx.doi.org/10.1007/s11081-005-1741-7.
Full textFawcett, J., and P. Robinson. "Adaptive routing for road traffic." IEEE Computer Graphics and Applications 20, no. 3 (2000): 46–53. http://dx.doi.org/10.1109/38.844372.
Full textDissertations / Theses on the topic "Traffic Routing"
Yang, Xinan. "Top-percentile traffic routing problem." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/5883.
Full textMazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.
Full textGuedrez, Rabah. "Enabling traffic engineering over segment routing." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2018. http://www.theses.fr/2018IMTA0116/document.
Full textMost major operators use MPLS technology to manage their network via signalling and label distribution protocols. However, these protocols are complex to deploy, maintain and troubleshooting is often very difficult. The IETF has initiated the standardization of a segment routing architecture based on a simple control plane, lightweight, easyto-manage and instantiated on MPLS or IPv6. This architecture is based on the concept of source routing, in which the packet header carries the indications of the path to follow to reach its destination. Suitable for simple use cases and natively resistant to failure, more complex use cases require the resolution of technological issues for which we offer several solutions.In this thesis carried out within Orange Labs, we were interested in the instantiation of the Segment Routing architecture on the MPLS transfer plan and more particularly in traffic engineering, particularly with resource reservation. We have proposed solutions to the problems related to the hardware limitation of current routers that do not allow the expression of all constrained paths. This work is divided into two parts : (i) the proposal of algorithms for computing and encoding segment routing paths in order to bypass hardware limitations. (ii) the definition of architectural requirements and the construction of a functional proof of concept. Finally, this thesis proposes new research issues to consolidate traffic engineering tools for segment routing
Lindblad, Andreas. "Routing of traffic in an IP-network using combined routing patterns." Thesis, Linköpings universitet, Optimeringslära, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119973.
Full textHe, Jenny Jing. "Optical flow routing : a routing and switching paradigm for the core optical networks." Thesis, University of Essex, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248654.
Full textGellman, Michael. "Quality of service routing for real-time traffic." Thesis, Imperial College London, 2007. http://hdl.handle.net/10044/1/12026.
Full textTillotson, Peter J. "Multi-agent learning for TCP/IP traffic routing." Thesis, University of Liverpool, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399051.
Full textSengupta, Sudipta 1974. "Efficient and robust routing of highly variable traffic." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/35532.
Full textIncludes bibliographical references (p. 316-324).
Many emerging applications for the Internet are characterized by highly variable traffic behavior over time that is difficult to predict. Classical approaches to network design rely on a model in which a single traffic matrix is estimated. When actual traffic does not conform to such assumptions, desired bandwidth guarantees cannot be provided to the carried traffic. Currently, Internet Service Providers (ISPs) use gross capacity over-provisioning and manual routing adaptation to avoid network congestion caused by unpredictable traffic. These lead to increased network equipment and operational costs. Development of routing infrastructures that optimize network resources while accommodating extreme traffic unpredictability in a robust and efficient manner will be one of the defining themes in the next phase of expansion of the Internet. This thesis proposes two-phase routing as a capacity efficient and robust strategy for handling highly variable traffic. The scheme allows preconfiguration of the network such that all traffic patterns permissible within the network's natural ingress-egress capacity constraints can be routed with bandwidth guarantees without requiring detection of traffic changes in real-time or reconfiguring the network in response to it.
(cont.) The scheme routes traffic in two phases -- traffic entering the network is sent from the source to a set of intermediate nodes in predetermined split ratios that depend on the intermediate nodes, and then from the intermediate nodes to the final destination. The scheme has the desirable properties of supporting static optical layer provisioning in IP-over-Optical networks and indirection in specialized service overlay models unlike previous approaches -- like direct source-destination path routing - for handling variable traffic. This thesis represents the first comprehensive study, problem formulation, and algorithm design for many aspects of two-phase routing. Our contributions can be grouped into three broad parts. First, we consider the problems of minimum cost network design and maximum throughput network routing for the scheme. We give a simple solution for minimum cost network design. For maximum throughput network routing. we design linear program.ling based and combinatorial algorithms. We show how the algorithms can handle a total cost constraint for maximum throughput two-phase routing. This can be used to solve the link capacitate version of minimum cost two-phase routing.
(cont.) We establish theoretical bounds on the resource requirements of two-phase routing under throughput and cost models with respect to the optimal scheme that is allowed to make the routing dynamically dependent on the current traffic matrix. We also generalize the traffic split ratios to depend not only on the intermediate nodes but also on source and destination of traffic and solve the corresponding optimization problems. Second, we consider making two-phase routing resilient to network failures. Two-phase routing in IP-over-Optical networks can be protected against router node failures through redistribution of traffic split ratio for the failed router node to other intermediate nodes. We propose two different schemes for provisioning the optical layer to handle router node failures. We develop linear programming formulations for both schemes and a fast combinatorial algorithm for the second scheme so as to maximize network throughput. Two-phase routing can be made resilient against link failures by protecting the first and second phase paths using pre-provisioned restoration mechanisms. We consider three such restoration mechanisms - local (link/span) restoration, K-route path restoration, and shared backup path restoration.
(cont.) We provide linear programming formulations and combinatorial algorithms for maximum throughput two-phase routing with local restoration and K-route path restoration. We show that the problem of maximum throughput two-phase routing with shared backup path restoration is JVP-hard. Assuming an approximation oracle for a certain disjoint paths problem (which we also show to be AP-hard), we design a combinatorial algorithm with provable guarantees. Third, we consider the application of two-phase routing to multi-hop Wireless Mesh Networks (WMNs). These networks have recently been of much research interest due to their lowered need for wired infrastructure support and due to envisaged new applications like community wireless networks. We extend our optimization framework for maximum throughput two-phase routing in wired networks to handle routing and scheduling constraints that are peculiar to WMNs and arise from the requirement to handle radio transmit/receive diversity and the phenomenon of wireless link interference. We evaluate various aspects of two-phase routing on actual ISP topologies using the developed algorithms. For the WMN application, we use randomly generated WMN topologies for the evaluations.
by Sudipta Sengupta.
Ph.D.
Tajtehranifard, Hasti. "Incident duration modelling and system optimal traffic re-routing." Thesis, Queensland University of Technology, 2017. https://eprints.qut.edu.au/110525/1/Hasti_Tajtehranifard_Thesis.pdf.
Full textGao, Ruomei. "Interdomain Traffic Engineering for Multi-homed Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19732.
Full textBooks on the topic "Traffic Routing"
Conte, Marco. Dynamic Routing in Broadband Networks. Boston, MA: Springer US, 2003.
Find full textDynamic routing in broadband networks. Boston: Kluwer Academic Publishers, 2003.
Find full textConte, Marco. Dynamic routing in broadband networks. Boston, MA: Kluwer Academic, 2002.
Find full textAsh, Gerald R. Dynamic routing in telecommunications networks. New York: McGraw Hill, 1998.
Find full textAsh, Gerald R. Dynamic routing in telecommunications networks. London: McGraw-Hill, 1997.
Find full textBhandari, Ramesh. Survivable networks: Algorithms for diverse routing. Boston: Kluwer Academic Publishers, 1999.
Find full textReiman, Martin I. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. [Cambridge, Mass: Sloan School of Management, Massachusetts Institute of Technology], 1996.
Find full textNational Research Council (U.S.). Transportation Research Board., ed. Vehicle routing, traveler ADIS, network modeling, and advanced control systems. Washington, D.C: National Academy Press, 1992.
Find full textDeepankar, Medhi, ed. Routing, flow, and capacity design in communication and computer networks. Amsterdam: Elsevier/Morgan Kaufmann, 2004.
Find full textZwaneveld, Peter J. Railway planning: Routing of trains and allocation of passenger lines = Spoorwegplanning : het routeren van treinen en het alloceren van passagierslijnen. Delft: Eburon, 1997.
Find full textBook chapters on the topic "Traffic Routing"
Zyryanov, Vladimir, and Anastasia Feofilova. "Evaluation Parameters of Re-routing Strategy." In Traffic Management, 203–16. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2016. http://dx.doi.org/10.1002/9781119307822.ch14.
Full textMorse, Leon Wm. "Freight Routing." In Practical Handbook of Industrial Traffic Management, 167–206. Boston, MA: Springer US, 1987. http://dx.doi.org/10.1007/978-1-4613-1977-1_6.
Full textLong, Fei. "Satellite Network Traffic Engineering." In Satellite Network Robust QoS-aware Routing, 75–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54353-1_4.
Full textChalkia, Eleni, Josep Maria Salanova Grau, Evangelos Bekiaris, Georgia Ayfandopoulou, Chiara Ferarini, and Evangelos Mitsakis. "Safety Bus Routing for the Transportation of Pupils to School." In Traffic Safety, 283–99. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2016. http://dx.doi.org/10.1002/9781119307853.ch18.
Full textMouftah, Hussein T., and Pin-Han Ho. "Survivable Routing with Dynamic Traffic." In Optical Networks, 211–45. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-1169-4_8.
Full textRakha, Hesham, and Aly Tawfik. "Traffic Networks: Dynamic Traffic Routing, Assignment, and Assessment." In Encyclopedia of Complexity and Systems Science, 9429–70. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-30440-3_562.
Full textWenning, Bernd-Ludwig. "Analytical Examination of Route Discovery Traffic." In Context-Based Routing in Dynamic Networks, 57–76. Wiesbaden: Vieweg+Teubner, 2010. http://dx.doi.org/10.1007/978-3-8348-9709-1_5.
Full textChen, Liang, Xingang Shi, and Dah Ming Chiu. "From ISP Address Announcement Patterns to Routing Scalability." In Traffic Monitoring and Analysis, 43–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28534-9_4.
Full textRakha, Hesham, and Aly Tawfik. "Dynamic Traffic Routing, Assignment, and Assessment of Traffic Networks." In Complex Dynamics of Traffic Management, 79–129. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8763-4_562.
Full textRexford, Jennifer, and Kang G. Shin. "Support for multiple classes of traffic in multicomputer routers." In Parallel Computer Routing and Communication, 116–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58429-3_32.
Full textConference papers on the topic "Traffic Routing"
Protschky, Valentin, Sebastian Feld, and Michael Walischmiller. "Traffic Signal Adaptive Routing." In 2015 IEEE 18th International Conference on Intelligent Transportation Systems - (ITSC 2015). IEEE, 2015. http://dx.doi.org/10.1109/itsc.2015.81.
Full textZhang, Lei, Tae-Hyun Kim, Chunlei Liu, Min-Te Sun, and Alvin Lim. "TART: Traffic-Aware Routing Tree for Geographic Routing." In 2008 IEEE Wireless Communications and Networking Conference. IEEE, 2008. http://dx.doi.org/10.1109/wcnc.2008.458.
Full textWei, Peng, Jit-Tat Chen, Dominick Andrisani, and Dengfeng Sun. "Routing Flexible Traffic into Metroplex." In AIAA Guidance, Navigation, and Control Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2011. http://dx.doi.org/10.2514/6.2011-6365.
Full textLuckie, Matthew. "Session details: Traffic and Routing." In IMC '15: Internet Measurement Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/3260497.
Full textBasso, Rafael, Peter Lindroth, Balazs Kulcsar, and Bo Egardt. "Traffic aware electric vehicle routing." In 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). IEEE, 2016. http://dx.doi.org/10.1109/itsc.2016.7795588.
Full textWickenden, S. "Interconnect routing and traffic routes." In IEE Colloquium on How to Compete and Connect: Understanding the Engineering of Telecommunications Network Interconnection. IEE, 1997. http://dx.doi.org/10.1049/ic:19970962.
Full textLarroca, F., and J. L. Rougier. "Routing Games for Traffic Engineering." In ICC 2009 - 2009 IEEE International Conference on Communications. IEEE, 2009. http://dx.doi.org/10.1109/icc.2009.5199427.
Full textJia, Ru, Wei Su, and Hongke Zhang. "Traffic Matrix-Based Routing Optimization." In 2015 International Conference on Computer Science and Intelligent Communication. Paris, France: Atlantis Press, 2015. http://dx.doi.org/10.2991/csic-15.2015.104.
Full textMikoshi, Taiju, Toyofumi Takenaka, Takayuki Fujiwara, Akeo Masuda, and Kohei Shiomoto. "Improvement of maximum admissible QoS traffic by traffic observations." In 2011 IEEE 12th International Conference on High Performance Switching and Routing (HPSR). IEEE, 2011. http://dx.doi.org/10.1109/hpsr.2011.5986020.
Full textSouza, Allan M. de, Leandro A. Villas, and Torsten Braun. "Towards a Personalized Multi-objective Vehicular Traffic Re-routing System." In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/ctd.2022.222391.
Full textReports on the topic "Traffic Routing"
Smirnov, A., A. Retana, and M. Barnes. OSPF Routing with Cross-Address Family Traffic Engineering Tunnels. RFC Editor, November 2019. http://dx.doi.org/10.17487/rfc8687.
Full textMartins, Luiz F., and Harold J. Kushner. Routing and Singular Control for Queueing Networks in Heavy Traffic. Fort Belvoir, VA: Defense Technical Information Center, April 1989. http://dx.doi.org/10.21236/ada208568.
Full textVasseur, J. P., and J. L. Le Roux, eds. IGP Routing Protocol Extensions for Discovery of Traffic Engineering Node Capabilities. RFC Editor, December 2007. http://dx.doi.org/10.17487/rfc5073.
Full textMichail, Anastassios, and Anthony Ephremides. Energy-Efficient Routing for Connection-Oriented Traffic in Wireless Ad-hoc Networks. Fort Belvoir, VA: Defense Technical Information Center, January 2001. http://dx.doi.org/10.21236/ada441033.
Full textDay, Christopher, Steven Lavrenz, Howell Li, and Darcy Bullock. Traffic Performance of Arterial Highways and Driver Routing Characteristics during a Freeway Detour. Purdue University, December 2017. http://dx.doi.org/10.5703/1288284316564.
Full textYasukawa, S., S. Previdi, P. Psenak, and P. Mabbey. Routing Extensions for Discovery of Multiprotocol (MPLS) Label Switch Router (LSR) Traffic Engineering (TE) Mesh Membership. RFC Editor, July 2007. http://dx.doi.org/10.17487/rfc4972.
Full textShe, Ruifeng, and Yanfeng Ouyang. Generalized Link-Cost Function and Network Design for Dedicated Truck-Platoon Lanes to Improve Energy, Pavement Sustainability, and Traffic Efficiency. Illinois Center for Transportation, November 2021. http://dx.doi.org/10.36501/0197-9191/21-037.
Full textDeng, Zhuohang, Zhiliang Luo, Neil Hockaday, Ahmed Farid, and Anurag Pande. Evaluation of Left Shoulder as Part-Time Travel Lane Design Alternatives and Transportation Management Center Staff Training Module Development. Mineta Transportation Institute, January 2023. http://dx.doi.org/10.31979/mti.2023.2153.
Full textGupta, Kanika, Sung Soo Park, Antonio Bobet, and Tommy Nantung. Improved Reliability of FWD Test Results and Correlations with Resilient Modulus. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317370.
Full text