Статті в журналах: "Traffic Routing"

1

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

2

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

3

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

4

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

5

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

6

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

7

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

8

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

9

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

10

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

11

Paricio, Alvaro, and Miguel A. Lopez-Carmona. "Modeling Driving Experience in Smart Traffic Routing Scenarios: Application to Traffic Multi-Map Routing." IEEE Access 9 (2021): 90170–84. http://dx.doi.org/10.1109/access.2021.3091322.

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

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

12

Muthukumaran V., Vinothkumar V., Rose Bindu Joseph, Meram Munirathanam, and Balajee Jeyakumar. "Improving Network Security Based on Trust-Aware Routing Protocols Using Long Short-Term Memory-Queuing Segment-Routing Algorithms." International Journal of Information Technology Project Management 12, no. 4 (October 2021): 47–60. http://dx.doi.org/10.4018/ijitpm.2021100105.

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

Анотація:

Defending all single connection failures for a particular system, segment routing issue, the switch will focus on the problems of selecting a small subset of trust-aware routing to improve the deep learning (DL). In the end, even if there were multiple path failures, these paths may introduce long-term, unnecessary overload in the proposed long short-term memory networks-based queuing routing segmentation (LSTM-QRS) experience of reducing traffic delays and adjusting traffic length by reducing network bandwidth. The critical factor is a novel traffic repair technique used to create a traffic repair path that switches to software-defined network (SDN) using multiple routing and providing additional flexibility in re-routing using long short-term memory networks (LSTM)-based queuing routing segment (LSTM-QRS) algorithms. It reduces the repair path length and recommends replacing the target-based traffic with the connection-based traffic fault detection router to avoid targeted traffic network congestion.

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

13

ZHOU, TAO. "EFFICIENT ROUTING ON SCALE-FREE NETWORKS." International Journal of Modern Physics B 21, no. 23n24 (September 30, 2007): 4071–75. http://dx.doi.org/10.1142/s0217979207045232.

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

Анотація:

The nodes with the largest degree are very susceptible to traffic congestion, thus an effective way to improve traffic and control congestion can be redistributing traffic load in hub nodes to others. We proposed an efficient routing strategy, which can remarkably enhance the network throughput. In addition, by using detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the 1/f scaling in the power spectrum, which is in accordance with the empirical data.

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

14

Farhan, Mhnd. "Traffic Routing Algorithm for Road Network." Scientific Bulletin 24, no. 2 (December 1, 2019): 131–38. http://dx.doi.org/10.2478/bsaft-2019-0015.

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

Анотація:

Abstract Nobody in this world wants to be held hostage in a traffic jam for hours and hours. The need to have efficient traffic flow in our roads cannot be overemphasized. It is in this understanding that this paper delves into the study and implementation of a suitable algorithm for traffic routing. The implementation is based on graph theory, where a road network map is first converted to a graph with nodes and edges where the edges represent the roads and the nodes represent the various road intersections. The roads are given various weights depending on their distance and traffic density, and the time a motorist would take to move from one point to another is estimated. A suitable routing algorithm, which in this case is the Dijkstra’s algorithm is applied on the weighted graph.

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

15

Meirich, C., and N. Nießen. "Maximizing freight traffic by re-routing." International Journal of Transport Development and Integration 1, no. 3 (January 15, 2017): 392–402. http://dx.doi.org/10.2495/tdi-v1-n3-392-402.

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

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

16

Korkmaz, T., and M. M. Krunz. "Routing multimedia traffic with qos guarantees." IEEE Transactions on Multimedia 5, no. 3 (September 2003): 429–43. http://dx.doi.org/10.1109/tmm.2003.811627.

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

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

17

Pereira, Vitor, Miguel Rocha, and Pedro Sousa. "Traffic Engineering With Three-Segments Routing." IEEE Transactions on Network and Service Management 17, no. 3 (September 2020): 1896–909. http://dx.doi.org/10.1109/tnsm.2020.2993207.

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

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

18

Adhikari, Vijay Kumar, Sourabh Jain, and Zhi-Li Zhang. "From traffic matrix to routing matrix." ACM SIGMETRICS Performance Evaluation Review 38, no. 3 (January 3, 2011): 49–54. http://dx.doi.org/10.1145/1925019.1925029.

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

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

19

Suri, Subhash, Marcel Waldvogel, Daniel Bauer, and Priyank Ramesh Warkhede. "Profile-based routing and traffic engineering." Computer Communications 26, no. 4 (March 2003): 351–65. http://dx.doi.org/10.1016/s0140-3664(02)00154-8.

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

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

20

Yuan, Ruixi. "Traffic pattern based mobile routing scheme." Computer Communications 18, no. 1 (January 1995): 32–36. http://dx.doi.org/10.1016/0140-3664(94)00746-5.

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

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

21

Moreno, Eduardo, Alejandra Beghelli, and Filippo Cugini. "Traffic engineering in segment routing networks." Computer Networks 114 (February 2017): 23–31. http://dx.doi.org/10.1016/j.comnet.2017.01.006.

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

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

22

Blokpoel, R., D. Leistner, and J. Vreeswijk. "Micro-routing using accurate traffic predictions." IET Intelligent Transport Systems 6, no. 4 (December 1, 2012): 380–87. http://dx.doi.org/10.1049/iet-its.2011.0147.

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

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

23

Rauch, H. E., and T. Winarske. "Neural networks for routing communication traffic." IEEE Control Systems Magazine 8, no. 2 (April 1988): 26–31. http://dx.doi.org/10.1109/37.1870.

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

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

24

Ru, Hua Suo, De Pin Peng, Lian Xiong Gao, and Yuan Zhou. "Short-Term Traffic State Forecasting for Dynamic Traffic Routing System." Advanced Engineering Forum 6-7 (September 2012): 506–12. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.506.

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

Анотація:

The paper researches the problem of how to forecast traffic information in one minute interval. A kalman filter algorithm for short-term traffic forecasting based on the construction of dynamic traffic routing system of Nanning city of China was proposed in this paper, and selected National Road as field calibration, which compared with the real traffic conditions, and the error of predicted results is less than 10%. The results demonstrate the effectiveness of the proposed forecasting model in paper, and the research has a significant contribution for data process of Dynamic Traffic Routing System.

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

25

Poluboyina, Lavanya, Mallikarjuna Prasad. A., Sivakumar Reddy. V, and S. V. Maruthi Rao. "Multimedia Traffic Transmission using MAODV and M-MAODV Routing Protocols over Mobile Ad-hoc Networks." International Journal of Computer Network and Information Security 14, no. 3 (June 8, 2022): 47–62. http://dx.doi.org/10.5815/ijcnis.2022.03.04.

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

Анотація:

Many applications of mobile ad-hoc networks like conferencing, handling emergency situations, military operations require the multicast routing. Moreover, in such applications there is a demand for multimedia traffic such as audio/video calls or audio/video conferencing. For mobile ad-hoc environments, it is accepted that the on-demand reactive routing protocol AODV has become default. Moreover, to get the benefits of using a single protocol for both unicast and multicast routing, in this work, the multicast routing protocol MAODV (multicast extension of AODV) has been considered and its performance is observed for CBR, VoIP and video data traffics. Since to accommodate multimedia traffic, a routing protocol demands for stringent QoS requirements in terms of delay, jitter and packet losses; the performance of the protocol is measured in terms of QoS performance metrics such as average delay, average jitter and packet delivery ratio. Further, a modified version of MAODV (called M-MAODV) is taken and its performance is also evaluated for multimedia traffic. A fair comparison of MAODV and M-MAODV protocols is achieved through the use of same network conditions for the evaluation. From the results, the improved values of delay, jitter and packet delivery ratio have been observed for M-MAODV irrespective of node speeds and for all data traffic types.

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

26

Нургалиев and E. Nurgaliev. "SIMULATION OF OPERATIONAL ROUTING BUSES." Alternative energy sources in the transport-technological complex: problems and prospects of rational use of 2, no. 2 (December 17, 2015): 807–12. http://dx.doi.org/10.12737/19568.

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

Анотація:

Of all the methods available and the most appropriate modeling tools that meet their stated objectives for the study of traffic flows is a simulation. This article describes two methods for rapid routing traffic minibuses. For the method based on the analysis of the complete set of traffic situa-tions, developed a simulation model of municipal passenger transport. As a result of simulation ob-tained by the implementation of a process that allows after treatment to determine the value of sta-tistical criteria for defining the transport proce

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

27

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

28

JIANG, ZHONG-YUAN, MAN-GUI LIANG, JIAN-LING HUANG, and QIAN LI. "AN EFFICIENT WEIGHTED ROUTING STRATEGY FOR SCALE-FREE NETWORKS." Modern Physics Letters B 26, no. 29 (October 16, 2012): 1250195. http://dx.doi.org/10.1142/s0217984912501953.

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

Анотація:

Considering the link congestion based traffic model, which can more accurately model the traffic diffusing process of many real complex systems such as the Internet, we propose an efficient weighted routing strategy in which each link's weight is assigned with the edge betweenness of the original un-weighted network with a tunable parameter α. As the links with the highest edge betweenness are susceptible to traffic congestion, our routing strategy efficiently redistribute the heavy traffic load from central links to noncentral links. The highest traffic capacity under this new routing strategy is achieved when compared with the shortest path routing strategy and the efficient routing strategy. Moreover, the average path length of our routing strategy is much smaller than that of the efficient routing strategy. Therefore, our weighted routing strategy is preferable to other routing strategies and can be easily implemented through software method.

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

29

Agnestisya, Wury. "Analisis Perbandingan Kinerja Routing Statis dan Dinamis dengan Teknik RIP Pada Topologi Ring Dalam Jaringan LAN." Digital Transformation Technology 2, no. 2 (October 13, 2022): 31–34. http://dx.doi.org/10.47709/digitech.v2i2.1801.

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

Анотація:

Aktivitas masyarakat tidak terlepas dari peran teknologi. Internet selalu berkembang dan sudah dapat diakses oleh seluruh orang, hampir seluruh pekerjaan menggunakan internet untuk mengakses apapun. Dengan internet kita dapat saling terhubung antar perangkat dan bisa mengakses secara luas, seperti antar gedung yang saling terhubung dengan pembagian ip dalam sebuah jaringan.Terdapat dua teknik peroutingan yang akan dibandingkan, yaitu secara statis dan dinamis dengan teknik RIP (Routing Information Protocol) dan menggunakan topologi ring untuk pertukaran data nya. Kedua routing akan dibandingkan untuk mengetahui troughput, delay, dan packet loss dengan keadaan sibuk dan tidak sibuk, tujuannya adalah ntuk mengetahui kinerja routing statis dan dinamis dengan teknik RIP (Routing Information Protocol). FTP (File Transfer Protocol) bisa digunakan untuk mengunduh atau mengunggah file dari pc ke server, mempunyai besaran sendiri dan bisa digunakan unuk mengakses troughput. Untuk mendapatkan hasil FTP bisa melalui traffic generator pada comand prompt. Hasil yang diperoleh untuk delay pada kedua routing bagus, karena rerata <150 ms. Routing static pada traffic tidak sibuk lebih rendah nilai delay, sedangkan pada routing static lebih rendah nilai delay pada traffic sibuk. Pada traffic sibuk dalam pada kedua router tidak memiliki nilai packetloss, sedangkan pada traffic tidak sibuk, routing dynamic dengan teknik rip mempunyai nilai packetloss lebih rendah dibanding routing static. Nilai throughput pada traffic tidak sibuk routing dynamic dengan teknik RIP lebih tinggi dibanding dengan routing static, sedangkan routing static mempunyai rerata nilai throughput pada traffic sibuk lebih tinggi dibanding routing rip

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

30

Zhang, Xue-Jun, Yan-Bo Zhu, and Xiang-Min Guan. "Hybrid routing for interconnected BA scale-free networks." Modern Physics Letters B 29, no. 33 (December 10, 2015): 1550212. http://dx.doi.org/10.1142/s0217984915502127.

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

Анотація:

Interconnections between networks make the traffic condition in interconnected networks more complicated than that in an isolated network. They make the load and capacity of nodes mismatch and restrict the traffic performance accordingly. To improve the performance, in this paper, we propose a hybrid routing strategy, which distinguishes the traffic within each individual network and the traffic across multiple networks and uses different routing rules for these two types of traffic. Simulation results show that this routing strategy can achieve better traffic performance than traditional strategies when networks are coupled by a small number of interconnected links, which is the case in most of real-world interconnected networks. Therefore, the proposed hybrid routing strategy can find applications in the planning and optimization of practical interconnected networks.

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

31

SUN, H. J., J. J. WU, and Z. Y. GAO. "DYNAMICS OF ROUTING MECHANISMS ON TRAFFIC NETWORKS." International Journal of Modern Physics C 18, no. 11 (November 2007): 1775–82. http://dx.doi.org/10.1142/s012918310701173x.

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

Анотація:

In this paper, we propose a simple betweenness-driven model to capture the dynamics of traffic routing choice behaviors. By comparing with two other models (degree-driven and cost-driven), it is shown that the cost-driven routing strategy is more complex and sensitive to traffic congestion. Another result indicates that the load distributions are determined by the connectivity distribution and route choice behaviors of the traffic network. The model thus provides useful insight for the design of traffic networks.

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

32

Kim, Kwangsoo, Minseok Kwon, Jaegeun Park, and Yongsoon Eun. "Dynamic Vehicular Route Guidance Using Traffic Prediction Information." Mobile Information Systems 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/3727865.

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

Анотація:

We propose a dynamic vehicular routing algorithm with traffic prediction for improved routing performance. The primary idea of our algorithm is to use real-time as well as predictive traffic information provided by a central routing controller. In order to evaluate the performance, we develop a microtraffic simulator that provides road networks created from real maps, routing algorithms, and vehicles that travel from origins to destinations depending on traffic conditions. The performance is evaluated by newly defined metric that reveals travel time distributions more accurately than a commonly used metric of mean travel time. Our simulation results show that our dynamic routing algorithm with prediction outperforms both Static and Dynamic without prediction routing algorithms under various traffic conditions and road configurations. We also include traffic scenarios where not all vehicles comply with our dynamic routing with prediction strategy, and the results suggest that more than half the benefit of the new routing algorithm is realized even when only 30% of the vehicles comply.

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

33

Parsa, Ali, and Neda Moghim. "QoS-aware routing and traffic management in multi-flow opportunistic routing." Computers & Electrical Engineering 94 (September 2021): 107330. http://dx.doi.org/10.1016/j.compeleceng.2021.107330.

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

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

34

Polverini, Marco, Antonio Cianfrani, Marco Listanti, and Andrea Baiocchi. "Routing Perturbation for Traffic Matrix Evaluation in a Segment Routing Network." IEEE Transactions on Network and Service Management 15, no. 4 (December 2018): 1645–60. http://dx.doi.org/10.1109/tnsm.2018.2862423.

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

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

35

Keimer, Alexander, and Alexandre Bayen. "Routing on Traffic Networks Incorporating Past Memory up to Real-Time Information on the Network State." Annual Review of Control, Robotics, and Autonomous Systems 3, no. 1 (May 3, 2020): 151–72. http://dx.doi.org/10.1146/annurev-control-091319-125444.

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

Анотація:

In this review, we discuss routing algorithms for the dynamic traffic assignment (DTA) problem that assigns traffic flow in a given road network as realistically as possible. We present a new class of so-called routing operators that route traffic flow at intersections based on either real-time information about the status of the network or historical data. These routing operators thus cover the distribution of traffic flow at all possible intersections. To model traffic flow on the links, we use a well-known macroscopic ordinary delay differential equation. We prove the existence and uniqueness of the solutions of the resulting DTA for a broad class of routing operators. This new routing approach is required and justified by the increased usage of real-time information on the network provided by map services, changing the laws of routing significantly. Because these map and routing services have a huge impact on the infrastructure of cities, a more precise mathematical description of the emerging new traffic patterns and effects becomes crucial for understanding and improving road and city conditions.

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

36

Ma, Jinlong, Huiling Wang, Zhuxi Zhang, Yi Zhang, Congwen Duan, Zhaohui Qi, and Yu Liu. "An efficient routing strategy for traffic dynamics on two-layer complex networks." International Journal of Modern Physics B 32, no. 13 (May 11, 2018): 1850155. http://dx.doi.org/10.1142/s0217979218501552.

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

Анотація:

In order to alleviate traffic congestion on multilayer networks, designing an efficient routing strategy is one of the most important ways. In this paper, a novel routing strategy is proposed to reduce traffic congestion on two-layer networks. In the proposed strategy, the optimal paths in the physical layer are chosen by comprehensively considering the roles of nodes’ degrees of the two layers. Both numerical and analytical results indicate that our routing strategy can reasonably redistribute the traffic load of the physical layer, and thus the traffic capacity of two-layer complex networks are significantly enhanced compared with the shortest path routing (SPR) and the global awareness routing (GAR) strategies. This study may shed some light on the optimization of networked traffic dynamics.

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

37

Jiang, Zhong-Yuan. "An incremental optimal routing strategy for scale-free networks." International Journal of Modern Physics C 25, no. 09 (August 26, 2014): 1450044. http://dx.doi.org/10.1142/s0129183114500442.

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

Анотація:

The link congestion based traffic model can more accurately reveal the traffic dynamics of many real complex networks such as the Internet, and heuristically optimizing each link's weight for the shortest path routing strategy can strongly improve the traffic capacity of network. In this work, we propose an optimal routing strategy in which the weight of each link is regulated incrementally to enhance the network traffic capacity by minimizing the maximum link betweenness of any link in the network. We also estimate more suitable value of the tunable parameter β for the efficient routing strategy under the link congestion based traffic model. The traffic load of network can be significantly balanced at the expense of increasing a bit average path length or average traffic load.

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

38

Cockcroft, A. N. "Development of Routing in Coastal Waters." Journal of Navigation 38, no. 1 (January 1, 1985): 76–80. http://dx.doi.org/10.1017/s0373463300038182.

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

Анотація:

Traffic separation schemes and other routing measures have now been established in the coastal waters of many countries and new schemes are being introduced each year. Traffic separation was originally intended to reduce the risk of collision between ships proceeding in opposite directions but this paper explains how routing measures are now being used mainly for coastal protection. Improvements in navigational aids may lead to more extensive routing schemes in the future with increasing restriction on the movement of shipping.The first traffic separation schemes adopted by IMCO (now IMO) in 1965 and 1968 were based on proposals made by the Institutes of Navigation of France, the Federal German Republic and the United Kingdom. In the report submitted to the Organisation by the Institutes in 1964 it was stated that ‘the object of any form of routing is to ease the congestion and lessen the likelihood of end-on encounters by separating opposing streams of traffic …’.

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

39

JIANG, ZHONG-YUAN, and MAN-GUI LIANG. "IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS." International Journal of Modern Physics C 23, no. 02 (February 2012): 1250016. http://dx.doi.org/10.1142/s0129183112500167.

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

Анотація:

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási–Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

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

40

Simanjuntak, Yohanes Panangian. "Analisis Perbandingan Routing Dinamis Dengan Teknik EIGRP dan OSPF Pada Topologi Mesh dalam Jaringan LAN." Digital Transformation Technology 2, no. 2 (October 12, 2022): 27–30. http://dx.doi.org/10.47709/digitech.v2i2.1800.

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

Анотація:

Teknologi jaringan komputer adalah teknologi yang masih banyak digunakan oleh manusia untuk berinteraksi dengan mengirim berbagai data dalam jarak dekat dan jauh dalam waktu singkat. Tujuan penelitian ini adalah untuk Mengetahui perbandingan routing dinamis Enhanced Interior Gateway Routing Protocol (EIGRP) dan Open Shortest Path First (OSPF). Delay dan Packet loss digunakan untuk mengetahui kinerja Routing pada pengiriman paket ICMP, sedangkan Throughput digunakan untuk mengetahui kinerja routing pada pengiriman HTTP dan FTP. Hasil pengujian telah menunjukan bahwa simulasi dan pengujian EIGRP memiliki nilai rata-rata delay terendah dibandingkan OSPF. Hasil pengujian packet loss yang dikonfigurasikan menggunakann EIGRP dan OSPF pada topologi mesh yaitu 0% atau tidak terjadi packet loss. Hasil pengujian parameter throughput traffic tidak sibuk routing EIGRP memiliki hasil throughput lebih besar dibandingkan routing OSPF, sedangkan pada throughput traffic sibuk routing OSPF memiliki hasil throughput lebih besar dibandingkan routing EIGRP. Sehingga EIGRP memiliki kinerja terbaik berdasarkan parameter delay dan parameter throughput traffic tidak sibuk dan routing OSPF memiliki kinerja terbaik berdasarkan parameter throughput traffic sibuk.

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

41

Panjaitan, Suci Dina Meilani. "Prototype Pengendalian Lampu Jarak Jauh dengan Jaringan Internet Berbasis Internet of Things(IoT) Menggunakan Rasberry Pi 3." Jurnal Pendidikan Sains dan Komputer 2, no. 02 (October 13, 2022): 361–65. http://dx.doi.org/10.47709/jpsk.v2i02.1748.

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

Анотація:

Teknologi jaringan komputer adalah teknologi yang masih banyak digunakan oleh manusia untuk berinteraksi dengan mengirim berbagai data dalam jarak dekat dan jauh dalam waktu singkat. Tujuan penelitian ini adalah untuk Mengetahui perbandingan routing dinamis Enhanced Interior Gateway Routing Protocol (EIGRP) dan Open Shortest Path First (OSPF). Delay dan Packet loss digunakan untuk mengetahui kinerja Routing pada pengiriman paket ICMP, sedangkan Throughput digunakan untuk mengetahui kinerja routing pada pengiriman HTTP dan FTP. Hasil pengujian telah menunjukan bahwa simulasi dan pengujian EIGRP memiliki nilai rata-rata delay terendah dibandingkan OSPF. Hasil pengujian packet loss yang dikonfigurasikan menggunakann EIGRP dan OSPF pada topologi mesh yaitu 0% atau tidak terjadi packet loss. Hasil pengujian parameter throughput traffic tidak sibuk routing EIGRP memiliki hasil throughput lebih besar dibandingkan routing OSPF, sedangkan pada throughput traffic sibuk routing OSPF memiliki hasil throughput lebih besar dibandingkan routing EIGRP. Sehingga EIGRP memiliki kinerja terbaik berdasarkan parameter delay dan parameter throughput traffic tidak sibuk dan routing OSPF memiliki kinerja terbaik berdasarkan parameter throughput traffic sibuk.

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

42

Scheffler, Robert, Martin Strehler, and Laura Vargas Koch. "Routing Games with Edge Priorities." ACM Transactions on Economics and Computation 10, no. 1 (March 31, 2022): 1–27. http://dx.doi.org/10.1145/3488268.

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

Анотація:

Routing games over time are widely studied due to various applications, e.g., transportation, road and air traffic control, logistic in production systems, communication networks like the internet, and financial flows. In this article, we present a new competitive packet routing game with edge priorities motivated by traffic and transportation. In this model a set of selfishly acting players travels through the network over time. If the number of players who want to enter an edge at the same time exceeds the inflow capacity of this edge, then edge priorities with respect to the preceding edge are used to resolve these conflicts, which is similar to right-of-way rules in traffic. We analyze the efficiency of pure Nash equilibria, present an efficient algorithm for computing equilibria in symmetric games, and show that it is NP -hard to decide whether a Nash equilibrium exists in an asymmetric game. Furthermore, we address the problem of constructing optimal priorities.

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

43

He, Xuan, Kai Niu, Zhiqiang He, Jiaru Lin, Hui Zhang, and Zhong-Yuan Jiang. "Efficient packet navigation method on scale-free networks with finite and diversiform node delivery capacity." International Journal of Modern Physics C 27, no. 09 (August 2016): 1650098. http://dx.doi.org/10.1142/s0129183116500984.

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

Анотація:

Routing strategy is essential for high transport efficiency on realistic networked complex systems. Beginning from the consideration of finite and diversiform node delivery capacity distributions, a general node capacity allocation mechanism with a tunable parameter [Formula: see text] is presented. A node capacity, based routing strategy is proposed to improve the network traffic capacity. Compared with the traditional shortest path routing (SPR) and the efficient routing (ER) methods, it suggests that routing strategy should be chosen heuristically according to the limited capacity resource distribution, instead of using one certain method for all cases. With proper range of parameter [Formula: see text], the new routing strategy achieves the highest traffic capacity and other preferable measure metrics including network diameter, average path length, efficient betweenness, average packet travel time and average traffic load. The theoretical analysis for traffic capacity has a good correspondence to the simulation results. This work studies routing mechanisms from a very practical perspective, and helps network researchers to understand the traffic dynamics on complex networks comprehensively.

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

44

Prydybaylo, O. B., and R. V. Prydybaylo. "Traffic routing using the Istio managed platform." Connectivity 143, no. 1 (2020): 36–39. http://dx.doi.org/10.31673/2412-9070.2020.063639.

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

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

45

Isa, Norulhidayah. "Traffic Routing Optimization using Ant Colony Optimization." International Journal of Advanced Trends in Computer Science and Engineering 8, no. 1.5 (November 15, 2019): 81–86. http://dx.doi.org/10.30534/ijatcse/2019/1781.52019.

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

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

46

Lai, Yung-Cheng (Rex), Mark H. Dingler, Chung-En Hsu, and Pei-Chun Chiang. "Optimizing Train Network Routing with Heterogeneous Traffic." Transportation Research Record: Journal of the Transportation Research Board 2159, no. 1 (January 2010): 69–76. http://dx.doi.org/10.3141/2159-09.

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

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

47

Rajeswari, S., and Y. Venkataramani. "Traffic Performance Analysis of MANET Routing Protocol." International Journal of Distributed and Parallel systems 2, no. 3 (May 31, 2011): 63–74. http://dx.doi.org/10.5121/ijdps.2011.2306.

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

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

48

Mohammadzadeh, Hekmat, and Shapour Joudi Bigdello. "UTCARP: Urban Traffic Control Aware Routing Protocol." International Journal on AdHoc Networking Systems 3, no. 1 (January 31, 2013): 1–13. http://dx.doi.org/10.5121/ijans.2013.3101.

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

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

49

Poltavskaya, Yuliya. "ROUTING CARGO TRAFFIC IN MULTIMODAL TRANSPORT NETWORKS." Modern Technologies and Scientific and Technological Progress 2022, no. 1 (May 16, 2022): 195–96. http://dx.doi.org/10.36629/2686-9896-2022-1-195-196.

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

Анотація:

Multimodal transportation is widely used for trade between different regions and countries. The cost of international logistics is approximately 30-50% of all production costs of enterprises. Reducing transport costs allows you to increase profits and maintain the competitiveness of transport companies in the global market. Thus, optimization of routes in a multimodal transport network is an actual direction for research. An analytical review of the problem of planning routes for multimodal freight transportation is presented from the point of view of formulating a model

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

50

HONG, Ki Sup, Sang Hoon LEE, and Lynn CHOI. "Traffic Adaptive Routing for Mobile Sensor Networks." IEICE Transactions on Communications E96.B, no. 5 (2013): 1097–111. http://dx.doi.org/10.1587/transcom.e96.b.1097.

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

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

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

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