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

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

Автор: Grafiati

Опубліковано: 14 березня 2023

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

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

Зміст

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

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

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

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

Статті в журналах з теми "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.

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

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

Wu, 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.

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

Анотація:

To guarantee the QoS of the various traffics and take good advantage of the network resource, the QoS routing protocol based on resource optimization is proposed. By the network state information dynamic update and the QoS routing optimization model design, the QoS routing protocol can provide the optimal path for real-time traffic, broadband traffic and best effort traffic in time with low control message cost. Simulation shown that, compared to the traditional shortest path routing, the QoS routing can satisfy the demand of traffics and can improve the network performance.

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

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 та ін.

Auletta, 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.

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

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

Shastry, 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.

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

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

El 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.

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

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

Key, 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.

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

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

O’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.

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

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

Ben-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.

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

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

Fawcett, 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.

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

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

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

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

Yang, Xinan. "Top-percentile traffic routing problem." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/5883.

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

Анотація:

Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via multiple networks. This connectivity enhances the network reliability and service quality of the ISP. However, using multi-networks may imply multiple costs on the ISP. To make full use of the underlying networks with minimum cost, a routing strategy is requested by ISPs. Of course, this optimal routing strategy depends on the pricing regime used by network providers. In this study we investigate a relatively new pricing regime – top-percentile pricing. Under top-percentile pricing, network providers divide the charging period into several fixed length time intervals and calculate their cost according to the traffic volume that has been shipped during the θ-th highest time interval. Unlike traditional pricing regimes, the network design under top-percentile pricing has not been fully studied. This paper investigates the optimal routing strategy in case where network providers charge ISPs according to top-percentile pricing. We call this problem the Top-percentile Traffic Routing Problem (TpTRP). As the ISP cannot predict next time interval’s traffic volume in real world application, in our setting up the TpTRP is a multi-stage stochastic optimisation problem. Routing decisions should be made at the beginning of every time period before knowing the amount of traffic that is to be sent. The stochastic nature of the TpTRP forms the critical difficulty of this study. In this paper several approaches are investigated in either the modelling or solving steps of the problem. We begin by exploring several simplifications of the original TpTRP to get an insight of the features of the problem. Some of these allow analytical solutions which lead to bounds on the achievable optimal solution. We also establish bounds by investigating several “naive” routing policies. In the second part of this work, we build the multi-stage stochastic programming model of the TpTRP, which is hard to solve due to the integer variables introduced in the calculation of the top-percentile traffic. A lift-and-project based cutting plane method is investigated in solving the SMIP for very small examples of TpTRP. Nevertheless it is too inefficient to be applicable on large sized instances. As an alternative, we explore the solution of the TpTRP as a Stochastic Dynamic Programming (SDP) problem by a discretization of the state space. This SDP model gives us achievable routing policies on small size instances of the TpTRP, which of course improve the naive routing policies. However, the solution approach based on SDP suffers from the curse of dimensionality which restricts its applicability. To overcome this we suggest using Approximate Dynamic Programming (ADP) which largely avoids the curse of dimensionality by exploiting the structure of the problem to construct parameterized approximations of the value function in SDP and train the model iteratively to get a converged set of parameters. The resulting ADP model with discrete parameter for every time interval works well for medium size instances of TpTRP, though it still requires too long to be trained for large size instances. To make the realistically sized TpTRP problem solvable, we improve on the ADP model by using Bezier Curves/Surfaces to do the aggregation over time. This modification accelerates the efficiency of parameter training in the solution of the ADP model, which makes the realistically sized TpTRP tractable.

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

Mazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.

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

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

Guedrez, 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.

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

Анотація:

La majorité des grands opérateurs utilise la technologie MPLS pour gérer leur réseau via des protocoles de signalisation et de distributions de labels. Or, ces protocoles sont complexes à déployer, à maintenir et la résolution des pannes est souvent très difficile. L'IETF a initié la standardisation d'une architecture de routage par segments (Segment Routing) s'appuyant sur un plan de contrôle simple, léger, facile à gérer et instanciée sur MPLS ou IPv6. Cette architecture repose sur le concept de routage à la source, dans lequel l'en-tête des paquets transporte les indications du chemin à suivre pour atteindre sa destination. Adapté aux cas d'usages simples et offrant nativement une résistance aux pannes, les cas d'usages plus complexes exigent de résoudre des verrous technologiques pour lesquels nous proposons plusieurs solutions. Dans cette thèse effectuée au sein d'Orange Labs, nous nous sommes intéressés à l'instanciation de l'architecture Segment Routing sur le plan de transfert MPLS et plus particulièrement à l'ingénierie de trafic, notamment avec réservation de ressources. Nous avons proposé des solutions aux problèmes liés à la limitation matérielle des routeurs actuels ne permettant pas l'expression de tous les chemins contraints. Ce travail est divisé en deux parties : (i) la proposition d'algorithmes de calcul et d'encodage de chemins de routage par segment afin de contourner les limitations matérielles. (ii) la définition des exigences architecturales et la construction d'une preuve de concept fonctionnelle. Enfin, cette thèse propose de nouvelles pistes d'études afin de consolider les outils d'ingénierie de trafic pour le routage par segment
Most 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

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

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.

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

Анотація:

In IP networks using the OPSF-principle together with the ECMP-principle, thetraffic is routed in all shortest paths. Weights on links are set by an administrator,not knowing how the resulting routing pattern will become. In this final thesis, I givea heuristic solution to the problem of changing a set of desired routing patterns inan ordered way to make them compatible with each other. An implementation of thealgorithm has been made and some testing with provided data for performance is alsopresented.

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

He, 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.

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

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

Gellman, Michael. "Quality of service routing for real-time traffic." Thesis, Imperial College London, 2007. http://hdl.handle.net/10044/1/12026.

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

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

Tillotson, 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.

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

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

Sengupta, Sudipta 1974. "Efficient and robust routing of highly variable traffic." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/35532.

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

Анотація:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006.
Includes 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.

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

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.

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

Анотація:

Traffic incidents are among the most significant contributory factors to congestion, particularly in metropolitan areas. In this dissertation, we have developed state-of-the-art statistical models to provide in-depth insights into how various incident-specific characteristics and the associated temporal and spatial determinants impact freeway incident durations. Next, we have proposed, developed and tested two novel and computationally efficient System Optimal incident traffic re-routing algorithms that provide optimal traffic flow patterns, for minimized total system travel time. Specifically, a single-destination System Optimal Dynamic Traffic Assignment model and a multi-destination System Optimal Quasi-Dynamic Traffic Assignment model are proposed, developed and demonstrated to improve total system travel times, both under incident-free and incident scenarios.

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

Gao, Ruomei. "Interdomain Traffic Engineering for Multi-homed Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19732.

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

Анотація:

Interdomain traffic engineering (TE) controls the flow of traffic between autonomous systems (ASes) to achieve performance goals under various resource constraints. Interdomain TE can be categorized into ingress TE and egress TE, which aim to control the ingress and egress traffic flow in a network, respectively. Most interdomain TE techniques are based on BGP, which was not designed to support performance based routing. Hence even though some basic interdomain TE techniques are widely deployed, their overall effectiveness and impact on interdomain traffic are not well understood. Furthermore, systematic practices for deploying these techniques have yet to be developed. In this thesis, we explore these open issues for both ingress and egress TE. We first focus on the AS-Path prepending technique in interdomain ingress TE. We design a polynomial algorithm that takes network settings as input and produces the optimal prepending at each ingress link. We also develop methods to measure the inputs of the optimal algorithm by leveraging widely available looking glass severs and evaluate the errors of such measurement. We further propose an algorithm, based on this optimal algorithm, that is robust to input errors. We then focus on Intelligent Routing Control (IRC) systems often used at multihomed networks for egress interdomain TE. To address the possible traffic oscillation problem caused by multiple IRC systems, we design a class of randomized IRC algorithms. Through simulations, we show that the proposed algorithms can effectively mitigate oscillations. We also show that IRC systems using randomized path switching algorithms perform better than those switching path deterministically, when both types of IRC systems co-exist. To further understand the performance impact of IRC systems, we next focus on the performance of applications, such as TCP connections. We study the synergistic and antagonistic interactions between IRC and TCP connections, through a simple dual-feedback model. We first examine the impact of sudden RTT and available bandwidth changes in TCP connection. We then examine the effect of IRC measurement delays on closed loop traffic. We also show the conditions under which IRC is beneficial under various path impairment models.

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

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

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

Conte, Marco. Dynamic Routing in Broadband Networks. Boston, MA: Springer US, 2003.

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

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

Dynamic routing in broadband networks. Boston: Kluwer Academic Publishers, 2003.

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

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

Conte, Marco. Dynamic routing in broadband networks. Boston, MA: Kluwer Academic, 2002.

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

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

Ash, Gerald R. Dynamic routing in telecommunications networks. New York: McGraw Hill, 1998.

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

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

Ash, Gerald R. Dynamic routing in telecommunications networks. London: McGraw-Hill, 1997.

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

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

Bhandari, Ramesh. Survivable networks: Algorithms for diverse routing. Boston: Kluwer Academic Publishers, 1999.

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

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

Reiman, Martin I. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. [Cambridge, Mass: Sloan School of Management, Massachusetts Institute of Technology], 1996.

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

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

National 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.

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

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

Deepankar, Medhi, ed. Routing, flow, and capacity design in communication and computer networks. Amsterdam: Elsevier/Morgan Kaufmann, 2004.

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

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

Zwaneveld, 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.

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

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

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

Частини книг з теми "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.

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

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

Morse, 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.

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

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

Long, 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.

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

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

Chalkia, 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.

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

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

Mouftah, 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.

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

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

Rakha, 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.

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

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

Wenning, 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.

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

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

Chen, 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.

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

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

Rakha, 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.

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

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

Rexford, 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.

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

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

Тези доповідей конференцій з теми "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.

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

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

Zhang, 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.

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

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

Wei, 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.

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

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

Luckie, 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.

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

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

Basso, 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.

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

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

Wickenden, 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.

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

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

Larroca, 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.

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

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

Jia, 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.

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

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

Mikoshi, 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.

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

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

Souza, 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.

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

Анотація:

Vehicular traffic re-routing is the key to provide better vehicular mobility. However, considering just traffic-related information to recommend better routes for each vehicle is far from achieving the desired requirements of a good Traffic Management System (TMS), which intends to improve mobility, driving experience, and safety of drivers and passengers. In this scenario, context-aware and multi-objective re-routing approaches will play an important role in traffic management, considering different urban aspects that might affect path planning decisions such as mobility, distance, fuel consumption, scenery, and safety. There are at least three issues that need to be handled to provide an efficient TMS, including: (i) scalability; (ii) re-routing efficiency; and (iii) reliability. In this way, this thesis contributes to efficient and reliable solutions to meet future TMSs. The proposed solutions were widely compared with other related works on different performance evaluation metrics. The evaluation results show that the proposed solutions are efficient, scalable, and cost-effective, pushing forward state-of-the-art traffic management systems.

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

Звіти організацій з теми "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.

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

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

Martins, 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.

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

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

Vasseur, 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.

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

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

Michail, 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.

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

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

Day, 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.

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

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

Yasukawa, 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.

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

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

She, 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.

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

Анотація:

Recent development of autonomous and connected trucks (ACT) has provided the freight industry with the option of using truck platooning to improve fuel efficiency, traffic throughput, and safety. However, closely spaced and longitudinally aligned trucks impose frequent and concentrated loading on pavements, which often accelerates pavement deterioration and increases the life cycle costs for the highway agency. Also, effectiveness of truck platooning can be maximized only in dedicated lanes; and its benefits and costs need to be properly balanced between stakeholders. This paper proposes a network-design model to optimize (i) placement of dedicated truck-platoon lanes and toll price in a highway network, (ii) pooling and routing of ACT traffic from multiple origins and destinations to utilize these lanes, and (iii) configuration of truck platoons within these lanes (e.g., lateral displacements and vehicle separations). The problem is formulated as an integrated bi-level optimization model. The upper level makes decisions on converting existing highway lanes into dedicated platoon lanes, as well as setting user fees. The lower-level decisions are made by independent shippers regarding the choice of routes and use of platoon lanes vs. regular lanes; and they collectively determine truck traffic in all lanes. Link-cost functions for platoon lanes are obtained by simultaneously optimizing, through dynamic programming, pavement-rehabilitation activities and platoon configuration in the pavement's life cycle. A numerical case study is used to demonstrate the applicability and performance of the proposed model framework over the Illinois freeway system. It is shown that the freight traffic is effectively channelized on a few corridors of platoon lanes and, by setting proper user fees to cover pavement-rehabilitation costs, systemwide improvements for both freight shippers and highway agencies can be achieved.

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

Deng, 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.

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

Анотація:

Permanent capacity expansion, such as adding new lanes, is no longer a viable strategy to address traffic congestion in California; hence, ITS (Intelligent Transportation System) strategies, such as part-time use of the shoulder as a travel lane, need to be explored. The use of the shoulder as a travel lane during peak traffic hours has limited applications in the US, and most use the right shoulder as a part-time travel lane even though either the right or left shoulder (but not both) may be used. Caltrans District 5 is exploring the use of Left Shoulder as a Part-time Travel Lane (LSPTTL) as a piece of the larger project, titled Five Cities Multimodal Transportation Network Enhancement Project (FCMTNEP), aimed at congestion relief near Pismo Beach, CA. Construction is expected to begin in Winter 2025 with a Winter 2027 completion date. Given that this would be the first instance of LSPTTL in California, it is a Project of Division Interest (PoDI) for the California division of Federal Highway Administration (FHWA), and the District 5 experience may guide similar future installations of the shoulder as travel lane projects in the state. This research uses a microsimulation-based approach to evaluate design alternatives being explored by Caltrans District 5. This approach allows for evaluating the operational and safety effects of each of the alternatives. Furthermore, a Transportation Management Center (TMC) operator training framework has also been developed to ensure that the local TMC personnel can effectively deploy the LSPTTL during routine operations and emergencies. Based on the operational evaluation, the study found no significant difference in travel times associated with the three design alternatives. Alternative 2, which involves the longest segment with LSPTTL among the alternatives, was found to be the safest based on a surrogate safety measure-based evaluation. This framework for evaluating design alternatives for operations and safety effectiveness may be used for future projects that involve the use of the shoulder as a travel lane. For TMC operator training, this report documents key learning objectives. A hands-on training program that involves operators executing the opening and closing of the shoulder for routine and emergency conditions was developed. As the project nears implementation, there is some scope for improvement in the training modules through replication of the exact features of the LSPTTL design and introducing more realism in the TMC simulator training exercises.

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

Gupta, 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.

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

Анотація:

Resilient modulus (MR) is a key factor in the Mechanistic Empirical Pavement Design Guide (MEPDG) which was adopted by INDOT in January 2009. The resilient modulus can be determined in new pavement projects from subgrade soil samples collected at the site. However, for a pavement rehabilitation project, it becomes difficult to obtain soil information, and coring for samples may not be feasible because of traffic. The literature is rich with correlations between the MR of the subgrade obtained in the laboratory with that estimated from FWD tests in the field. However, the review conducted shows very contradictory and inconsistent findings, thus existing correlations seem to apply only to the cases investigated, i.e., they are ad hoc correlations and cannot be generalized. To improve the interpretation of the FWD data and enhance the reliability of the results in Indiana, FWD and GPR tests were performed at five different road construction projects at the same locations where soil samples were collected and tested in the laboratory for resilient modulus. The selected sites included roads with rigid pavement and treated subgrade and flexible pavement with untreated subgrade. The study showed that (1) FWD backcalculation is greatly affected by pavement thickness; (2) GPR can provide actual thicknesses and can identify discrepancies between as-built and design pavement thickness; (3) for flexible pavements, a one-to-one correlation exists between FWD modulus and laboratory resilient modulus values for untreated subgrade soils; (4) MODTAG or ELMOD codes can both be used to estimate the resilient modulus of the subgrade in flexible pavements; (5) for rigid pavements, results of FWD backcalculation analysis using ELMOD or MODTAG greatly overestimate the resilient modulus of the soil, with backcalculated moduli 1.3 to 6 times higher than laboratory results; (6) ELMOD is recommended for routine analysis of FWD data, while MODTAG is recommended for research or to evaluate the quality of the data, when needed.

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

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