Zaloguj się

Gotowe bibliografie tematyczne / Routing / Artykuły w czasopismach

Artykuły w czasopismach na temat „Routing”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Routing.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 8 czerwca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Routing”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Mishra, Priya, Charu Gandhi i Buddha Singh. "Link Quality and Energy Aware Geographical Routing in MANETs using Fuzzy Logics". Journal of Telecommunications and Information Technology, nr 3 (30.09.2016): 5–17. http://dx.doi.org/10.26636/jtit.2016.3.731.

Pełny tekst źródła

Streszczenie:

In literature, varieties of topology and geographical routing protocols have been proposed for routing in the MANETs. It is widely accepted that the geographical routings are a superior decision than topological routings. Majority of geographical routing protocols assume an ideal network model and choose the route that contains minimum number of hops. However, in reality, nodes have limited battery power and wireless links are additionally unreliable, so they may highly affect the routing procedure. Thus, for reliable data transmission, condition of the network such as link quality and residual energy must be considered. This paper aims to propose a novel multi-metric geographical routing protocol that considers both links-quality and energy metric along with progress metric to choose the next optimal node. The progress is determined by utilizing greedy as well as compass routing rather than pure greedy routing schemes. To combine these metrics, fuzzy logics are used to get the optimal result. Further, the protocol deals with “hole” problem and proposes a technique to overcome it. Simulations show that the proposed scheme performs better in terms of the packet delivery ratio, throughput and residual energy than other existing protocols.

Style APA, Harvard, Vancouver, ISO itp.

12

Liu, Yao Lin, You Rong Chen, Ying Zhou i Xue Jiang Gao. "Research on Typical Wireless Hoc Routings for Vehicular Network". Advanced Materials Research 756-759 (wrzesień 2013): 1511–16. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1511.

Pełny tekst źródła

Streszczenie:

In the market, there was only specific software for network simulation or traffic simulation. They were expensive and could not support the routing simulation for vehicular network. In order to solve the problem, typical wireless ad hoc routings for vehicular network was researched in the free network simulation software NS2. The obstacle model and node mobile model were added. The nodes moved in random speed and direction on the road. Then the typical wireless ad hoc routings such as DSR (dynamic source routing), DSDV(destination sequenced distance vector) and AODV (ad hoc on-demand distance vector routing) were researched in the environment. The network packet loss rate and end to end delay time were compared and analyzed under the different situation whether obstacles block the radio. If obstacles did not block the radio and number of nodes was enough, DSDV had higher packet loss rate and the three routings had relatively low delay time. So DSR and AODV were more suitable for vehicular network. If the obstacles blocked the radio, the three routing routings had high packet loss rate. They needed to further advancement. This study provided a routing research idea for vehicular network and laid a foundation for further research.

Style APA, Harvard, Vancouver, ISO itp.

13

Azhari, Muhammad Ikhsan, Tengku Mohd Diansyah i Ari Usman. "PERBANDINGAN ROUTING PROTOCOL EXTERIOR BGP VERSI 4 DENGAN ROUTING INTERIOR EIGRP PADA ALGORITMA LINKSTATE MENGGUNAKAN PARAMETER PACKET LOSS". JURNAL TEKNOLOGI INFORMASI 3, nr 2 (31.12.2019): 185. http://dx.doi.org/10.36294/jurti.v3i2.1071.

Pełny tekst źródła

Streszczenie:

Abstract - Computer networks very influential on the speed of transferring data from one computer to another computer by using a PC or server, in this case, the routing configuration is very influential. The best routing route selection is the solution to determine the most rapid and efficient routing, and as the best routing consideration, the researcher has examined two routings, namely BGP (Border Gateway Protocol) routing and EIGRP (Enhanced Interior Gateway Routing Protocol) using the Cisco Paket Traccer application. After the researcher was done an experiment, the researcher gets the result of the average EIGRP delay that is 54.619 and the packet loss result between EIGRP and BGP is not available (successful packet delivery). Keywords - BGP Routing Protocol Exterior, EIGRP Interior Routing, Algorithm Link state, Packet loss Abstrak - Jaringan komputer sangat berpengaruh pada kecepatan transfer data antar satu komputer ke komputer lain baik itu pc maupun server, dalam hal ini konfigurasi routing sangat berpengaruh. Pemilihan jalur routing terbaik merupakan solusi untuk menentukan routing yang paling cepat dan efisien, dan sebagai bahan pertimbangan routing terbaik penulis meneliti dua routing yakni routing BGP (Border Gateway Protocol) dan routing EIGRP (Enhanced Interior Gateway Routing Protocol) mengguanakan aplikasi Cisco Packet Traccer. Setelah dilakukannya percobaan yang penulis perbuat, maka didapatkan hasil dari rata-rata delay EIGRP yaitu 54,619 dan hasil dari packetloss antara EIGRP dan BGP tidak ada (pengiriman paket sukses). Kata Kunci - Routing Protocol Exterior BGP, Routing Interior EIGRP, Algoritma Link state, Packet loss.

Style APA, Harvard, Vancouver, ISO itp.

14

SHINJO, K., S. SHIMOGAWA, J. YAMADA i K. OIDA. "A STRATEGY OF DESIGNING ROUTING ALGORITHMS BASED ON IDEAL ROUTINGS". International Journal of Modern Physics C 10, nr 01 (luty 1999): 63–94. http://dx.doi.org/10.1142/s012918319900005x.

Pełny tekst źródła

Streszczenie:

This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms; [B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings; [C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with a maximum degree of performance attainment are realized. By "degree of performance attainment", we mean that we can see how much room is left for the improvement of algorithms. We develop [A] and [B] with the performance measures of throughput and average packet delay and the M/M/1 queuing network. We decide ideal static routings and their performance limits from [A]. We obtain a new simple algorithm from [B] based on the notion of the ideal routings in implementation conditions. The designed algorithm improves the throughput and the average delay, which are comparable to those from ideal static routings. This improvement is contrasted to the adaptive and distributed OSPF (Open Shortest Path First), a standard Internet routing protocol.

Style APA, Harvard, Vancouver, ISO itp.

15

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

Pełny tekst źródła

Streszczenie:

Multipath routing can be effectively used for maximum utilization of network resources. It gives the node a choice of next hops for the same destination. We present two tree based algorithms, which we call MSPT and MBFT that can help a node to find multiple next hops for a destination. Both of them are distributed algorithm, allowing the traffic to switch off the shortest path and fully exploiting the path diversity of the network. MSPT has lower cost, while MBFT has less hops between the source and destination, end system can select next hop according to the application requirements. The simulation show that our algorithms can find more selectable next hops and have good reliability and fast recovery performance. In the process of simulation, we discovery that MSPT and MBFT have more disjoint paths, therefore we provide an Algorithm 2 to combine the MSPT and MBFT, the performance of Algorithm 2 is obviously superior than independently employs

Style APA, Harvard, Vancouver, ISO itp.

16

Meinzer, Nina. "Reconfigurable routing". Nature Physics 15, nr 11 (listopad 2019): 1105. http://dx.doi.org/10.1038/s41567-019-0718-y.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Lin, Y. L., Y. C. Hsu i F. S. Tsai. "Hybrid routing". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9, nr 2 (1990): 151–57. http://dx.doi.org/10.1109/43.46781.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Van Leeuwen, J. "Interval Routing". Computer Journal 30, nr 4 (1.04.1987): 298–307. http://dx.doi.org/10.1093/comjnl/30.4.298.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Pelley, Steven, David Meisner, Pooya Zandevakili, Thomas F. Wenisch i Jack Underwood. "Power routing". ACM SIGARCH Computer Architecture News 38, nr 1 (5.03.2010): 231–42. http://dx.doi.org/10.1145/1735970.1736047.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Pelley, Steven, David Meisner, Pooya Zandevakili, Thomas F. Wenisch i Jack Underwood. "Power routing". ACM SIGPLAN Notices 45, nr 3 (5.03.2010): 231–42. http://dx.doi.org/10.1145/1735971.1736047.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Goldschlag, David, Michael Reed i Paul Syverson. "Onion routing". Communications of the ACM 42, nr 2 (luty 1999): 39–41. http://dx.doi.org/10.1145/293411.293443.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Kim, J. H., Z. Liu i A. A. Chien. "Compressionless routing". ACM SIGARCH Computer Architecture News 22, nr 2 (kwiecień 1994): 289–300. http://dx.doi.org/10.1145/192007.192050.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Loo, Boon Thau, Joseph M. Hellerstein, Ion Stoica i Raghu Ramakrishnan. "Declarative routing". ACM SIGCOMM Computer Communication Review 35, nr 4 (październik 2005): 289–300. http://dx.doi.org/10.1145/1090191.1080126.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Godfrey, P. Brighten, Igor Ganichev, Scott Shenker i Ion Stoica. "Pathlet routing". ACM SIGCOMM Computer Communication Review 39, nr 4 (16.08.2009): 111–22. http://dx.doi.org/10.1145/1594977.1592583.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Narten, T. "Internet routing". ACM SIGCOMM Computer Communication Review 19, nr 4 (sierpień 1989): 271–82. http://dx.doi.org/10.1145/75247.75273.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Roscoe, Timothy, Steve Hand, Rebecca Isaacs, Richard Mortier i Paul Jardetzky. "Predicate routing". ACM SIGCOMM Computer Communication Review 33, nr 1 (styczeń 2003): 65–70. http://dx.doi.org/10.1145/774763.774773.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Hughes, Larry, Omid Banyasad i Evan Hughes. "Cartesian routing". Computer Networks 34, nr 3 (wrzesień 2000): 455–66. http://dx.doi.org/10.1016/s1389-1286(00)00130-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Arnold, Wolfgang, Hans Hellendoorn, Rudolf Seising, Christoph Thomas i Andreas Weitzel. "Fuzzy routing". Fuzzy Sets and Systems 85, nr 2 (styczeń 1997): 131–53. http://dx.doi.org/10.1016/0165-0114(95)00357-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Levin, Dave, Youndo Lee, Luke Valenta, Zhihao Li, Victoria Lai, Cristian Lumezanu, Neil Spring i Bobby Bhattacharjee. "Alibi Routing". ACM SIGCOMM Computer Communication Review 45, nr 4 (22.09.2015): 611–24. http://dx.doi.org/10.1145/2829988.2787509.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

FENTON, JOHN D. "Reservoir routing". Hydrological Sciences Journal 37, nr 3 (czerwiec 1992): 233–46. http://dx.doi.org/10.1080/02626669209492584.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Maxemchuk, N. F., i S. H. Low. "Active routing". IEEE Journal on Selected Areas in Communications 19, nr 3 (marzec 2001): 552–65. http://dx.doi.org/10.1109/49.917714.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Kaje, Ram Sudhakarrao. "Review of Different Routing Protocols and Routing Techniques". International Journal for Research in Applied Science and Engineering Technology 10, nr 6 (30.06.2022): 3540–42. http://dx.doi.org/10.22214/ijraset.2022.44679.

Pełny tekst źródła

Streszczenie:

Abstract: Mobile Ad- hoc Network could be a dynamic network that works with the characteristic of wireless Communication Network. It doesn't have a centralized server or an arbiter. it's a system that works separately connecting with wireless links using mobile routers. because of the infrastructure less network each mobile node moves freely with the absolute direction with no warranted path. Routing in Manet could be a challenge because of the quality of Nodes and lack of server. thus a routing protocol is important to own an economical communication between nodes in numerous network things that are heavily loaded at some purpose. This paper presents a review based on Manet and Manet rooting Protocols.

Style APA, Harvard, Vancouver, ISO itp.

33

Wang, Fan, Yan Yang, Kunpeng Wang, Xiaopeng Hu i Ning Zhang. "Efficient Clustering Routing Algorithm Based on Opportunistic Routing". International Journal of Communications, Network and System Sciences 09, nr 05 (2016): 198–208. http://dx.doi.org/10.4236/ijcns.2016.95019.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Nelakuditi, S., Zhi-Li Zhang, R. P. Tsang i D. H. C. Du. "Adaptive proportional routing: a localized QoS routing approach". IEEE/ACM Transactions on Networking 10, nr 6 (grudzień 2002): 790–804. http://dx.doi.org/10.1109/tnet.2002.804832.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Phuong Thanh, Cao Thai, Ha Hai Nam i Tran Cong Hung. "Solving Bandwidth-Guaranteed Routing Problem Using Routing Data". International journal of Computer Networks & Communications 6, nr 6 (30.11.2014): 97–108. http://dx.doi.org/10.5121/ijcnc.2014.6607.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Chen, Si, Bruce Golden, Richard Wong i Hongsheng Zhong. "Arc-Routing Models for Small-Package Local Routing". Transportation Science 43, nr 1 (luty 2009): 43–55. http://dx.doi.org/10.1287/trsc.1080.0255.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Hamamreh, Rushdi. "Routing path authentication in link-state routing protocols". Network Security 2012, nr 5 (maj 2012): 14–20. http://dx.doi.org/10.1016/s1353-4858(12)70037-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Rekersbrink, Henning, Thomas Makuschewitz i Bernd Scholz-Reiter. "A distributed routing concept for vehicle routing problems". Logistics Research 1, nr 1 (4.11.2008): 45–52. http://dx.doi.org/10.1007/s12159-008-0003-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Reddy, P. C. "New Routing Metrics for ADHOC Network Routing Protocols". Journal of The Institution of Engineers (India): Series B 95, nr 4 (2.07.2014): 351–61. http://dx.doi.org/10.1007/s40031-014-0116-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Ben-Ameur, Walid, i Mateusz Żotkiewicz. "Multipolar routing: where dynamic and static routing meet". Electronic Notes in Discrete Mathematics 41 (czerwiec 2013): 61–68. http://dx.doi.org/10.1016/j.endm.2013.05.076.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Putra R.R, Aqmal, Abdul Rohman i Wibisono Iwan Setiawan. "Pembuatan Jaringan Local Area Network Menggunakan Protokol Routing OSPF di SMK NU Ungaran". Jurnal Mahasiswa Teknik Informatika 1, nr 1 (25.11.2021): 29–35. http://dx.doi.org/10.35473/.v1i1.1282.

Pełny tekst źródła

Streszczenie:

The purpose of this research is to determine the efficiency of the access speed of the routing protocol itself, the implementation of this research at SMK NU Ungaran, using the ospf (Open Short Path First) routing protocol can at least reduce the risk of link-state on the network, this study uses a single method. area routin ospf protocol which is implemented using 3 routers with type 1814 which are implemented using Cisco packet tracer software. The results of the trials that have been carried out with the OSPF routing protocol are to maximize the best roting path. so that in developing the network can still be bigger and reduce link-state failures.AbstrakAqmal Putra Rahmatullah Rohim 2021.,Pembuatan Jaringan Local Area Network Menggunakan Protokol Routing OSPF..Skripsi Program Studi Teknik Informatika.Fakultas Komputer dan Pendidikan.Universitas Ngudi Waluyo Tujuan dari penelitia ini adalah untuk mengetahui efisiensi kecepatan akses dari routing protokol itu sendiri, pelaksanaan penelitian ini di SMK NU Ungaran,dengan menggunakan prtokol routing ospfÂ (Open Short Path First) setidaknya bisa mengurangi resiko link-state pada jaringan,penelitian ini menggunakan metode single area routin protokol ospfÂ yang penerapannya mengunakan 3 buah router dengan tipe 1814 yang di implementasikan mengunakan software cisco packet tracer.Hasil dari uji coba yang telah dilakukan dengan protokol routing ospf ini adalah memaksimalkan jalur roting yang terbaik.Â sehingga dalam mengembangkan jaringannya masih bisa lebih besar serta mengurangi kegagalan link-State.

Style APA, Harvard, Vancouver, ISO itp.

42

Hung Le, Phu. "A Source Routing Interference-Aware Multi-Path Routing Protocol for Mobile Ad Hoc Networks". International Journal of Future Computer and Communication 3, nr 5 (październik 2014): 304–8. http://dx.doi.org/10.7763/ijfcc.2014.v3.316.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Serhani, Abdellatif, Najib Naja i Abdellah Jamali. "AQ-Routing: mobility-, stability-aware adaptive routing protocol for data routing in MANET–IoT systems". Cluster Computing 23, nr 1 (10.05.2019): 13–27. http://dx.doi.org/10.1007/s10586-019-02937-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

P.Pingat, S., i A. A. Deshmukh. "IS-IS Routing Protocol A Better Routing Mechanism Approach". International Journal of Computer Applications 69, nr 16 (17.05.2013): 8–12. http://dx.doi.org/10.5120/12044-8071.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Susanto, Irwan, i Dwi Retno Aryanti. "Simulasi Pengumpulan Routing Table Menggunakan Routing Information Protocol (RIP)". JURNAL INFOTEL - Informatika Telekomunikasi Elektronika 1, nr 1 (10.05.2009): 71. http://dx.doi.org/10.20895/infotel.v1i1.64.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

MASUDA, Akeo, Cristel PELSSER i Kohei SHIOMOTO. "SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables". IEICE Transactions on Communications E94-B, nr 1 (2011): 64–76. http://dx.doi.org/10.1587/transcom.e94.b.64.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Macha, Tomas, Radko Krkos i Vit Novotny. "Proposal of Load Aware Routing for OSPF Routing Protocol". Communications - Scientific letters of the University of Zilina 15, nr 2A (31.07.2013): 139–44. http://dx.doi.org/10.26552/com.c.2013.2a.139-144.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

D, GANESH, i ARUNACHALAM K. "IMPROVING ROUTING MECHANISM IN MANETS USING DISCOVERY ROUTING PROTOCOLS". i-manager's Journal on Mobile Applications and Technologies 2, nr 4 (2016): 1. http://dx.doi.org/10.26634/jmt.2.4.6046.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Wang, Pi-Chung, Chia-Tai Chan i Yaw-Chung Chen. "An efficient IP routing lookup by using routing interval". Journal of Communications and Networks 3, nr 4 (grudzień 2001): 374–82. http://dx.doi.org/10.1109/jcn.2001.6596969.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Zhao, Dan, Chun Qing Wu, Xiao Feng Hu i Hong Jun Liu. "Virtual Area Routing: a Scalable Intra-Domain Routing Scheme". Advanced Engineering Forum 1 (wrzesień 2011): 320–24. http://dx.doi.org/10.4028/www.scientific.net/aef.1.320.

Pełny tekst źródła

Streszczenie:

As a distributed link state protocol, OSPF shows poor scalability when dealing with intra-domain routing in large networks. In this paper we present a new routing scheme called Virtual Area Routing (VAR) aimed to overcome the scalability problems of OSPF. The control plane is separated from data plane and is undertaken by dedicated elements in VAR. We show that VAR can simplify network configuration and management as well as avoid unnecessary route computation. Finally we conduct experiments in real topology and the result shows VAR can reduce control overhead and improve network performance.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!