Log in

Relevant bibliographies by topics / Routing / Journal articles

To see the other types of publications on this topic, follow the link: Routing.

Journal articles on the topic 'Routing'

Author: Grafiati

Published: 4 June 2021

Last updated: 29 March 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Routing.'

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

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

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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.

Full text

Abstract:

Multicast has become an important service in modern network applications. Multicast routing is a difficult issue, particularly under delay or bandwidth constraints. This paper discusses Steiner trees in the modeling of multicast routings and various routing constraints required by applications. It also discusses the existing multicast routing algorithms, especially the routings under constraints, such as delay constraint, limited available bandwidth, and traffic load balancing. Extensive simulations have been conducted to reveal the relationships between the network cost of the routing and each of the discussed constraints.

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

5

Phonekhamma, Chitnavanh. "Performance Analysis of Routing Protocols for Urban VANET Based on SUMO and NS2.35." Souphanouvong University Journal Multidisciplinary Research and Development 8, no. 2 (September 8, 2024): 303–12. http://dx.doi.org/10.69692/sujmrd0802303.

Full text

Abstract:

To make the dream of intelligent transportation systems come true, the development of the autonomous cars is considered as a tremendous disruptive innovation in the coming years. Vehicular ad hoc networks (VANETs) are being used as a tool for improving road safety by alarming the drivers about accidents occurred ahead of them or for providing internet access via gateways along the road. Due to highly dynamic nature of nodes in VANETs, designing a routing protocol for VANET is quite challenging compared to other networks environment. Researchers have suggested several routing algorithms for VANETs. Few routing algorithms are based on topology based whereas others have considered position based etc. As no standard scheme is available for choosing a routing protocol in VANETs, this paper gives an insight on how to choose a routing protocol depends on varying condition of traffic such as number of nodes on the roads and maximum speed of nodes. The popular protocols of Topology Based Routings and Position Based Routing have been chosen for analysis on varying traffic environment. All the protocols have been critically tested for different metrics such as packet delivery ratio and average end-to-end delay during the simulation. Simulation is carried out with the help of SUMO traffic simulator and open-source simulation tools NS2.35 network simulator. Simulation result show that Position Based Routing is performing better at low average end-to-end delay than Topology Based Routings, but Position Based Routing has the lowest possible performance in packet delivery ratio than Topology Based Routings.

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

7

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

16

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

Full text

Abstract:

Multipath routing can be effectively used for maximum utilization of network resources. It gives the node a choice of next hops for the same destination. We present two tree based algorithms, which we call MSPT and MBFT that can help a node to find multiple next hops for a destination. Both of them are distributed algorithm, allowing the traffic to switch off the shortest path and fully exploiting the path diversity of the network. MSPT has lower cost, while MBFT has less hops between the source and destination, end system can select next hop according to the application requirements. The 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

APA, Harvard, Vancouver, ISO, and other styles

17

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

34

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

43

Kumar, Rohit. "IMPLEMENTING POWER OPTIMIZATION IN WSN USING A PRAGMATIC APPROACH." International Journal of Engineering Science and Humanities 14, no. 1 (June 30, 2024): 15–27. http://dx.doi.org/10.62904/qqnddg76.

Full text

Abstract:

Routing involves transferring data from one point to another within a network of interconnected devices. During the transmission of data, there is at least one middle nodethat is encountered in the network. Essentially, this concept includes two main tasks: findingthebest routing paths and sending packets across a network. The process of moving packets across an internetwork is known as packet switching, and while it is direct, determiningthepath can be quite complicated. Routing protocols utilize various metrics as a standardtodetermine the best path for routing packets to their destination, which may includethenumber of hops used by the routing algorithm to find the most efficient path to the packet'sdestination. Routing algorithms are responsible for discovering and managing routingtables, which store all the necessary route details for the packet in the path determination process. The details of the route differ depending on the specific routing algorithm. The routingtablescontain entries that include the IP address prefix and the corresponding next hop. Therearetwo main classifications of routing: static routing and dynamic routing. Static routingis whenthe routing scheme is set manually in the router, rather than dynamically. Static routinginvolves the creation of a routing table typically established by a network administrator. Dynamic routing is when an interior or exterior routing protocol is learning the routingstrategy. The routing is mainly determined by the network's condition, meaning the routingtable is influenced by how active the destination is.

APA, Harvard, Vancouver, ISO, and other styles

44

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Vistro, Daniel Mago, Ishtiaque Mahmood, Attique Ur Rehman, and Farwa Javed. "Review and Comparative Analysis of Routing Protocols in Network." International Journal of Data Science and Advanced Analytics 4 (June 19, 2023): 171–76. http://dx.doi.org/10.69511/ijdsaa.v4i0.160.

Full text

Abstract:

In network correspondence, directing is the way toward moving information across network between various end gadgets. In the network of Local and Wide Area communication is an important aspect. Routings is considered as a significant interaction in network correspondence Router works with routing protocols. Different router used different routing protocols that is used for data communication. Various conventions have various qualities that makes them fit to accomplish efficient communication. According to this different routing protocol is used. The information gets across various organization geographies and various conventions working inside and outside a self-sufficient framework handles this information. Different types of protocols are used in routing procedure. The paper purpose is the give a comprehensive analysis on different types of routing protocols. In this paper, OSPF, RIP, BGP are concerned to be discussed.

APA, Harvard, Vancouver, ISO, and other styles

46

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, no. 5 (October 2014): 304–8. http://dx.doi.org/10.7763/ijfcc.2014.v3.316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!