Journal articles: 'Point-to-point routing'

1

Rugelj, Jože, and Sandi Klavžar. "Distributed multicast routing in point-to-point networks." Computers & Operations Research 24, no. 6 (June 1997): 521–27. http://dx.doi.org/10.1016/s0305-0548(96)00074-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bell, P., and K. Jabbour. "Evaluation of Point-to-Point Network Routing Algorithms." IEEE Transactions on Communications 35, no. 4 (1987): 470–72. http://dx.doi.org/10.1109/tcom.1987.1096777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bell, P., and K. Jabbour. "Review of point-to-point network routing algorithms." IEEE Communications Magazine 24, no. 1 (January 1986): 34–38. http://dx.doi.org/10.1109/mcom.1986.1092937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

HWANG, F. K., and C. H. LIN. "BROADCASTING IN A THREE-STAGE POINT-TO-POINT NONBLOCKING NETWORK." International Journal of Reliability, Quality and Safety Engineering 02, no. 03 (September 1995): 299–307. http://dx.doi.org/10.1142/s0218539395000228.

Full text

Abstract:

Three-stage networks have been widely studied as a point-to-point network and later, also as a broadcast network. In this paper we consider using such networks for point-to-point calls and broadcasting calls simultaneously. We note that the point-to-point nonblocking property and the broadcast rearrangeable property do not coexist due to different routing strategies. We propose a new routing strategy for broadcast calls which preserves the point-to-point nonblocking property, and keeps the broadcast calls almost rearrangeable when most calls are point-to-point.

APA, Harvard, Vancouver, ISO, and other styles

5

Novak, Roman, Joz̆e Rugelj, and Gorazd Kandus. "A note on distributed multicast routing in point-to-point networks." Computers & Operations Research 28, no. 12 (October 2001): 1149–64. http://dx.doi.org/10.1016/s0305-0548(00)00029-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Leung, Janny M. Y., Thomas L. Magnanti, and Vijay Singhal. "Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics." Transportation Science 24, no. 4 (November 1990): 245–60. http://dx.doi.org/10.1287/trsc.24.4.245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jung, Jiwon, Yunyoung Choi, and Younggoo Kwon. "Location-Aware Point-to-Point RPL in Indoor IR-UWB Networks." Electronics 9, no. 5 (May 22, 2020): 861. http://dx.doi.org/10.3390/electronics9050861.

Full text

Abstract:

Wireless multi-hop ad hoc routing is one of the critical design factors that determine the network performance of various wireless IoT applications. IETF has standardized the point-to-point RPL (P2P-RPL) routing protocol to overcome the inefficient routing overheads of RPL. However, P2P-RPL propagates the route discovery forwarding packets throughout the whole network. P2P-RPL suffers from the high energy consumption and the huge route discovery overhead in low-power and lossy networks (LLNs). In this paper, we propose a novel Location-Aware P2P-RPL (LA P2P-RPL), which achieves the energy-efficient P2P data delivery without reducing the networking reliability. The proposed algorithm introduces the Impulse-Response UWB (IR-UWB) based cooperative multi-hop self localization algorithm and the Location-Aware P2P-RPL algorithm for Indoor IR-UWB based networks. To increase the localization accuracy, smartphone based Inertial Navigation System (INS) with particle filtering is used in indoor multi-hop environments. The performance evaluations for Location-Aware P2P-RPL algorithm are compared with the traditional P2P-RPL and the ER-RPL algorithm to show the significant performance improvements for route discovery overheads and energy consumptions in LLNs.

APA, Harvard, Vancouver, ISO, and other styles

8

Jung, Jaeyoung, R. Jayakrishnan, and Doohee Nam. "High Coverage Point-To-Point Transit: Hybrid evolutionary approach to local vehicle routing." KSCE Journal of Civil Engineering 19, no. 6 (December 29, 2014): 1882–91. http://dx.doi.org/10.1007/s12205-014-0069-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gentile, Guido, Lorenzo Meschini, Daniele Tiddi, Agostino Fiorani, and Alessandro Attanasi. "Fast estimation of point-to-point travel times for real-time vehicle routing." Transportation Research Procedia 47 (2020): 401–8. http://dx.doi.org/10.1016/j.trpro.2020.03.115.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Daniel, S. W., K. G. Shin, and Sang Kyun Yun. "A router architecture for flexible routing and switching in multihop point-to-point networks." IEEE Transactions on Parallel and Distributed Systems 10, no. 1 (1999): 62–75. http://dx.doi.org/10.1109/71.744841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Gong, Wen Tao. "The Design of Multi-Protocol Network Based on Point-to-Point Protocol and Frame Relay." Advanced Materials Research 936 (June 2014): 2293–97. http://dx.doi.org/10.4028/www.scientific.net/amr.936.2293.

Full text

Abstract:

Local area network and wide area network are different network protocols, small and medium enterprises due to the geographical distribution of discrete and interface diversity, leading to its needs to be compatible with different network protocols, it is difficult to use a single network protocol to realize network architecture, and due to the ipv4 address scarcity, making its application or maintenance cost greatly increased, based on this, this paper presents the design of multi-protocol network architecture based on point-to-point protocol and frame relay, and with the advantages of the router is compatible with a variety of interfaces and protocols to connect different network interfaces, the paper also gives the configuration of routing information protocol and static routing through local area network, the paper presents the core information of frame relay and point-to-point protocol among the routers, and the paper gives the realization of the network address translation in the end.

APA, Harvard, Vancouver, ISO, and other styles

12

Miyagi, Toshifumi, Masataka Iizuka, and Masahiro Morikura. "A Novel Routing Protocol for Wireless Ad-hoc Network employing Point to Multi-Point communication." IEEJ Transactions on Electronics, Information and Systems 120, no. 10 (2000): 1388–94. http://dx.doi.org/10.1541/ieejeiss1987.120.10_1388.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Kuscu, Murat, and Ozgur B. Akan. "FRET-Based Nanoscale Point-to-Point and Broadcast Communications With Multi-Exciton Transmission and Channel Routing." IEEE Transactions on NanoBioscience 13, no. 3 (September 2014): 315–26. http://dx.doi.org/10.1109/tnb.2014.2342712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Hui, Zihao Zhang, Peng Chen, Xiangzhong Luo, Shiqing Li, and Weichen Liu. "MARCO: A High-performance Task M apping a nd R outing Co -optimization Framework for Point-to-Point NoC-based Heterogeneous Computing Systems." ACM Transactions on Embedded Computing Systems 20, no. 5s (October 31, 2021): 1–21. http://dx.doi.org/10.1145/3476985.

Full text

Abstract:

Heterogeneous computing systems (HCSs), which consist of various processing elements (PEs) that vary in their processing ability, are usually facilitated by the network-on-chip (NoC) to interconnect its components. The emerging point-to-point NoCs which support single-cycle-multi-hop transmission, reduce or eliminate the latency dependence on distance, addressing the scalability concern raised by high latency for long-distance transmission and enlarging the design space of the routing algorithm to search the non-shortest paths. For such point-to-point NoC-based HCSs, resource management strategies which are managed by compilers, scheduler, or controllers, e.g., mapping and routing, are complicated for the following reasons: (i) Due to the heterogeneity, mapping and routing need to optimize computation and communication concurrently (for homogeneous computing systems, only communication). (ii) Conducting mapping and routing consecutively cannot minimize the schedule length in most cases since the PEs with high processing ability may locate in the crowded area and suffer from high resource contention overhead. (iii) Since changing the mapping selection of one task will reconstruct the whole routing design space, the exploration of mapping and routing design space is challenging. Therefore, in this work, we propose MARCO, the m apping a nd r outing co -optimization framework, to decrease the schedule length of applications on point-to-point NoC-based HCSs. Specifically, we revise the tabu search to explore the design space and evaluate the quality of mapping and routing. The advanced reinforcement learning (RL)algorithm, i.e., advantage actor-critic, is adopted to efficiently compute paths. We perform extensive experiments on various real applications, which demonstrates that the MARCO achieves a remarkable performance improvement in terms of schedule length (+44.94% ∼ +50.18%) when compared with the state-of-the-art mapping and routing co-optimization algorithm for homogeneous computing systems. We also compare MARCO with different combinations of state-of-the-art mapping and routing approaches.

APA, Harvard, Vancouver, ISO, and other styles

15

Zhou, Fen, Miklós Molnár, and Bernard Cousin. "All-optical multipoint-to-point routing in WDM mesh networks." annals of telecommunications - annales des télécommunications 66, no. 1-2 (October 1, 2010): 91–101. http://dx.doi.org/10.1007/s12243-010-0203-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Sharma, Vivek, Bashir Alam, and M. N. Doja. "A-OLSR: ANFIS based OLSR to select Multi point relay." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 1 (February 1, 2019): 646. http://dx.doi.org/10.11591/ijece.v9i1.pp646-651.

Full text

Abstract:

<span lang="EN-IN">The characteristics like dynamic topology, power consumption, mobility etc. may leads to affect the routing process of packet as it progresses from one node to another node. The energy of each node is very limited in MANET’s due to which it becomes an important parameter to be considered while selecting the route. The ‘Optimized Link State Routing Protocol’ (OLSR) does not consider node energy during Multipoint relay (MPR) selection process. This paper proposes an improvement of OLSR routing protocol named as A-OLSR protocol using node energy during its MPR process. The improvement is based on adaptive neuro fuzzy inference system (ANFIS). The network simulator NS2.35 is used for the simulation, random way point model for mobility and constant bit rate (CBR) for traffic process. The performance of proposed A-OLSR protocol is evaluated using the packet delivery ratio (PDR) and end to end delay metrices. The simulation results prove the superiority of the proposed protocol in terms of PDR.</span>

APA, Harvard, Vancouver, ISO, and other styles

17

Stachowiak, Krzysztof, and Piotr Zwierzykowski. "Rendezvous point based approach to the multi-constrained multicast routing problem." AEU - International Journal of Electronics and Communications 68, no. 6 (June 2014): 561–64. http://dx.doi.org/10.1016/j.aeue.2014.01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Chentsov, Alexander G., and Pavel A. Chentsov. "ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION." Ural Mathematical Journal 6, no. 2 (December 26, 2020): 44. http://dx.doi.org/10.15826/umj.2020.2.005.

Full text

Abstract:

One problem focused on engineering applications is considered. It is assumed that sequential visits to megacities have been implemented. After all visits have been made, it is required to return to the starting point (a more complex dependence on the starting point is also considered). But the last requirement is not strict: some weakening of the return condition is acceptable. Under these assumptions, it is required to optimize the choice of starting point, route, and specific trajectory. The well-known dynamic programming (DP) is used for the solution. But when using DP, significant difficulties arise associated with the dependence of the terminal component of the criterion on the starting point. Starting point enumeration is required. We consider the possibility of reducing the enumeration associated with applied variants of universal (relative to the starting point) dynamic programming. Of course, this approach requires some transformation of the problem.

APA, Harvard, Vancouver, ISO, and other styles

19

Warman, Indra, and Ahmad Hanafi. "ANALISA PERBANDINGAN KINERJA GENERIC ROUTING ENCAPSULATION (GRE) TUNNEL DENGAN POINT TO POINT PROTOCOL OVER ETHERNET (PPPoE) TUNNEL MIKROTIK ROUTEROS." Jurnal TeknoIf 7, no. 1 (April 1, 2019): 58. http://dx.doi.org/10.21063/jtif.2019.v7.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Warman, Indra, and Ahmad Hanafi. "ANALISA PERBANDINGAN KINERJA GENERIC ROUTING ENCAPSULATION (GRE) TUNNEL DENGAN POINT TO POINT PROTOCOL OVER ETHERNET (PPPoE) TUNNEL MIKROTIK ROUTEROS." Jurnal TeknoIf 7, no. 1 (April 1, 2019): 58. http://dx.doi.org/10.21063/jtif.2019.v7.1.58-66.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Wang, Jinpeng, Gérard Chalhoub, and Michel Misson. "Adaptive Downward/Upward Routing Protocol for Mobile-Sensor Networks." Future Internet 11, no. 1 (January 15, 2019): 18. http://dx.doi.org/10.3390/fi11010018.

Full text

Abstract:

Recently, mobility support has become an important requirement in various Wireless Sensor Networks (WSNs). Low-power and Lossy Networks (LLNs) are a special type of WSNs that tolerate a certain degree of packet loss. However, due to the strict resource constraints in the computation, energy, and memory of LLNs, most routing protocols only support static network topologies. Data collection and data dissemination are two basic traffic modes in LLNs. Unlike data collection, data dissemination is less investigated in LLNs. There are two sorts of data-dissemination methods: point-to-multipoint and point-to-point. In this paper, we focus on the point-to-point method, which requires the source node to build routes to reach the destination node. We propose an adaptive routing protocol that integrates together point-to-point traffic and data-collection traffic, and supports highly mobile scenarios. This protocol quickly reacts to the movement of nodes to make faster decisions for the next-hop selection in data collection and dynamically build routes for point-to-point traffic. Results obtained through simulation show that our work outperforms two generic ad hoc routing protocols AODV and flooding on different performance metrics. Results also show the efficiency of our work in highly mobile scenarios with multiple traffic patterns.

APA, Harvard, Vancouver, ISO, and other styles

22

Szymkiewicz, R. "Numerical stability of implicit four-point scheme applied to inverse linear flow routing." Journal of Hydrology 176, no. 1-4 (March 1996): 13–23. http://dx.doi.org/10.1016/0022-1694(95)02785-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Dutta, Joydeep, Partha Sarathi Barma, Samarjit Kar, and Tanmay De. "A Modified Kruskal's Algorithm to Improve Genetic Search for Open Vehicle Routing Problem." International Journal of Business Analytics 6, no. 1 (January 2019): 55–76. http://dx.doi.org/10.4018/ijban.2019010104.

Full text

Abstract:

This article has proposed a modified Kruskal's method to increase the efficiency of a genetic algorithm to determine the path of least distance starting from a central point to solve the open vehicle routing problem. In a vehicle routing problem, vehicles start from a central point and several customers placed in different locations to serve their demands and return to the central point. In the case of the open vehicle routing problem, the vehicles do not go back to the central point after serving the customers. The challenge is to reduce the number of vehicles used and the distance travelled simultaneously. The proposed method applies genetic algorithms to find the set of customers those are covered by a particular vehicle and the authors have applied the proposed modified Kruskal's method for local routing optimization. The results of the new method are analyzed in comparison with some of the evolutionary methods.

APA, Harvard, Vancouver, ISO, and other styles

24

Jabbari, Masoud, and Mozafar Sharifian Dorcheh. "Resonant Multi-input/Multi-output/Bidirectional ZCS Step-Down DC--DC Converter With Systematic Synthesis for Point-to-Point Power Routing." IEEE Transactions on Power Electronics 33, no. 7 (July 2018): 6024–32. http://dx.doi.org/10.1109/tpel.2017.2749326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kelly, F. P. "Fixed point models of loss networks." Journal of the Australian Mathematical Society. Series B. Applied Mathematics 31, no. 2 (October 1989): 204–18. http://dx.doi.org/10.1017/s0334270000006597.

Full text

Abstract:

AbstractIn this paper we review a simple class of fixed point models for loss networks. We illustrate how these models can readily deal with heterogeneous call types and with simple dynamic routing strategies, and we outline some of the recent mathematical advances in the study of such models. We describe how fixed point models lead to a natural and tractable definition of the implied cost of carrying a call, and how this concept is related to issues of routing and capacity expansion in loss networks.

APA, Harvard, Vancouver, ISO, and other styles

26

Chentsov, A. G., and P. A. Chentsov. "To the question of optimization of the starting point in the routing problem with restrictions." Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta 55 (May 2020): 135–54. http://dx.doi.org/10.35634/2226-3594-2020-55-09.

Full text

Abstract:

We consider the extreme routing problem with an additive criterion, the terminal component of which depends on the starting point. This dependence may be associated, in particular, with the requirement to return to the starting point region after completing the final system of tasks that need to be ordered. The work assumes that the tasks to be performed are related with visiting non-empty finite sets called megacities. In turn, the mentioned visits are associated with the performance of works, the costs of which are involved in the formation of the criterion. Finally, the costs of external movements (between megacities) supplement the formation of an additive criterion to be minimized. It is required to find a global extremum and a solution that includes a starting point, the order of visits to megacities and a specific trajectory of the process. The solution uses widely understood dynamic programming (DP). It is significant that procedures based on DP use starting point. Therefore, enumeration of mentioned points is required. The article proposes an approach to solving the problem of reducing this enumeration through the use of auxiliary DP that are universal with respect to the choice of a starting point. The optimal algorithm was built and implemented on a PC using the aforementioned approach.

APA, Harvard, Vancouver, ISO, and other styles

27

De Genaro Chiroli, Daiane Maria, Sérgio Fernando Mayerle, and João Neiva de Figueiredo. "Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints." Journal of Heuristics 28, no. 1 (January 10, 2022): 23–59. http://dx.doi.org/10.1007/s10732-021-09489-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

KAUFMANN, MICHAEL, HEIKO SCHRÖDER, and JOP F. SIBEYN. "ROUTING AND SORTING ON RECONFIGURABLE MESHES." Parallel Processing Letters 05, no. 01 (March 1995): 81–95. http://dx.doi.org/10.1142/s0129626495000084.

Full text

Abstract:

We consider routing and sorting problems on mesh connected processor arrays under a very weak model of reconfiguration: we allow only uni-directional row or column buses, point-to-point communication, one-port-at-the-time serve by each processor. We present a scheme which is asymptoticly optimal for k-k sorting, for any arbitrary k > 0. It works optimally on meshes of arbitrary dimensions d, from the linear array to hypercubic networks with d < n1/3. The algorithm can also be used to perform k-k routing in the same time bound. We give an alternative scheme for permutation routing, which is asymptoticly slower, but has much better performance for realistic problem sizes.

APA, Harvard, Vancouver, ISO, and other styles

29

Guezouli, Lyamine, Kamel Barka, Souheila Bouam, and Abdelmadjid Zidani. "A variant of random way point mobility model to improve routing in wireless sensor networks." International Journal of Information and Communication Technology 13, no. 4 (2018): 407. http://dx.doi.org/10.1504/ijict.2018.095036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Farooq, Muhammad, and Dirk Pesch. "Reduced Overhead Routing in Short-Range Low-Power and Lossy Wireless Networks." Sensors 19, no. 5 (March 12, 2019): 1240. http://dx.doi.org/10.3390/s19051240.

Full text

Abstract:

In this paper we present enhanced routing protocol for low-lower and lossy networks (ERPL), a reduced overhead routing protocol for short-range low-power and lossy wireless networks, based on RPL. ERPL enhances peer-to-peer (P2P) route construction and data packet forwarding in RPL’s storing and non-storing modes of operation (MoPs). In order to minimize source routing overhead, it encodes routing paths in Bloom Filters (BF). The salient features of ERPL include the following: (i) optimized P2P routing and data forwarding; (ii) no additional control messages; and (iii) minimized source routing overhead. We extensively evaluated ERPL against RPL using emulation, simulation, and physical test-bed based experiments. Our results demonstrate that ERPL outperforms standard RPL in P2P communication and its optimized P2P route construction and data forwarding algorithms also positively impact the protocol’s performance in multi-point to point (MP2P) and point to multi-point (P2MP) communications. Our results demonstrate that the BF-based approach towards compressed source routing information is feasible for the kinds of networks considered in this paper. The BF-based approach results in 65% lower source routing control overhead compared to RPL. Our results also provide new insights into the performance of MP2P, P2MP, and P2P communications relative to RPL’s destination-oriented directed a-cyclic graph (DODAG) depth, i.e., a deeper DODAG negatively impacts the performance of MP2P and P2MP communications, however it positively impacts P2P communication, while the reverse holds true for a relatively shallow DODAG.

APA, Harvard, Vancouver, ISO, and other styles

31

Goudreau, Mark W., and C. Lee Giles. "ROUTING IN RANDOM MULTISTAGE INTERCONNECTIONS NETWORKS: COMPARING EXHAUSTIVE SEARCH, GREEDY AND NEURAL NETWORK APPROACHES." International Journal of Neural Systems 03, no. 02 (January 1992): 125–42. http://dx.doi.org/10.1142/s0129065792000115.

Full text

Abstract:

The problem of establishing point-to-point communication routes in a random multistage interconnection network (RMIN) is addressed. A neural network routing scheme is presented. This routing scheme is compared to two more traditional routing techniques—namely, exhaustive search routing and greedy routing. The main criterion that is examined is the ability of each routing methodology to solve routing problems. Results are obtained through simulation of the routing methodologies for three different RMINs. The sample RMINs are relatively small since the neural network router in its present form will only be competitive for small RMINs. The simulations show that the three routing schemes perform similarly for the three sample RMINs. Other criteria that will be touched upon are the speed and the resource utilization of each routing methodology and the pros and cons of each approach will be discussed. The results suggest that neural network routers may be appropriate for some communication applications involving RMINs.

APA, Harvard, Vancouver, ISO, and other styles

32

Nikoohemat, Shayan, Abdoulaye A. Diakité, Sisi Zlatanova, and George Vosselman. "Indoor 3D reconstruction from point clouds for optimal routing in complex buildings to support disaster management." Automation in Construction 113 (May 2020): 103109. http://dx.doi.org/10.1016/j.autcon.2020.103109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Omer Farooq, Muhammad. "RIoT: A Routing Protocol for the Internet of Things†." Computer Journal 63, no. 6 (March 17, 2020): 958–73. http://dx.doi.org/10.1093/comjnl/bxaa012.

Full text

Abstract:

Abstract The routing protocol for low-power and lossy networks (RPL) is a standard routing framework for Internet of Things (IoT). It supports multipoint-to-point (MP-to-P), point-to-point (P-to-P) and point-to-multipoint (P-to-MP) communications. It is known that RPL’s control overhead can result in the protocol’s poor performance in P-to-P and P-to-MP communications especially in its non-storing mode of operation. Here, we present a routing protocol for the Internet of Things (RIoT) that supports MP-to-P, P-to-P and P-to-MP communications. The protocol can construct P-to-P and P-to-MP routes with relatively lower control overhead. Another salient feature of RIoT is that it supports multiple gateways in the same network with an aim to reduce memory requirement for storing a forwarding table. Furthermore, RIoT is also capable of handling mobility-based IoT use cases. To facilitate communication among nodes connected to different gateways in the same network, here we also present an inter-gateway communication mechanism. We implemented RIoT in the Contiki operating system, and it is extensively evaluated using emulation and real testbed-based experiments. We analyzed the impact of the number of gateways, radio duty cycling (RDC) and mobility on the routing protocols’ performance. Our results demonstrate that either with or without RDC RIoT demonstrates statistically significantly better packet delivery ratio, per-packet end-to-end delay and control overhead compared to the RPL-based protocol. RIoT’s multi-gateway communication architecture substantially reduces the memory requirement to store a forwarding table. Our results also demonstrate that multiple gateways in a network reduce the network partitioning problem in mobile scenarios. Hence, RIoT also demonstrates better performance in mobile scenarios compared to the RPL-based protocol.

APA, Harvard, Vancouver, ISO, and other styles

34

Brown, Stephen, Muhammad Khellah, and Guy Lemieux. "Segmented Routing for Speed-Performance and Routability in Field-Programmable Gate Arrays." VLSI Design 4, no. 4 (January 1, 1996): 275–91. http://dx.doi.org/10.1155/1996/45983.

Full text

Abstract:

This paper addresses several issues involved for routing in Field-Programmable Gate Arrays (FPGAs) that have both horizontal and vertical routing channels, with wire segments of various lengths. Routing is studied by using CAD routing tools to map a set of benchmark circuits into FPGAs, and measuring the effects that various parameters of the CAD tools have on the implementation of the circuits. A two-stage routing strategy of global followed by detailed routing is used, and the effects of both of these CAD stages are discussed, with emphasis on detailed routing. We present a new detailed routing algorithm designed specifically for the types of routing structures found in the most recent generation of FPGAs, and show that the new algorithm achieves significantly better results than previously published FPGA routers with respect to the speed-performance of implemented circuits.The experiments presented in this paper address both of the key metrics for FPGA routing tools, namely the effective utilization of available interconnect resources in an FPGA, and the speed-performance of implemented circuits. The major contributions of this research include the following: 1) we illustrate the effect of a global router on both area-utilization and speed-performance of implemented circuits, 2) experiments quantify the impact of the detailed router cost functions on area-utilization and speed-performance, 3) we show the effect on circuit implementation of dividing multi-point nets in a circuit being routed into point-to-point connections, and 4) the paper illustrates that CAD routing tools should account for both routability and speed-performance at the same time, not just focus on one goal.

APA, Harvard, Vancouver, ISO, and other styles

35

WAN, Bi-le, Wen-xing HE, and Chang-yu CHEN. "Research on Interactive Routing of Cable in Virtual Environment." MATEC Web of Conferences 179 (2018): 01011. http://dx.doi.org/10.1051/matecconf/201817901011.

Full text

Abstract:

On the basis of analyzing the defects of existing design methods of cable wiring, the feasibility of interactive cabling design in virtual environment is pointed out. Based on the discrete control point, the geometric shape modeling method and the topological structure matrix modeling method based on the wire unit are presented. Adopt the method of real-time interactive cable modeling and wiring, explains the wiring process and control point positioning technology, and through the stratified multistage collision interference detection technology improve the authenticity of the wiring process and results. After the wiring design is completed, the statistical summary of the model information is compiled to generate various inventory reports to guide the actual production.

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Yong, Qiang Dou, Wei Peng, and Zheng Hu Gong. "DTN Routing Performance Evaluation under Random Waypoint with Base Point Mobility Model." Applied Mechanics and Materials 411-414 (September 2013): 676–79. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.676.

Full text

Abstract:

Mobility models are drawing increasing attention since it plays an indispensable role in delay tolerant networks performance evaluation (e.g., routing performance evaluation). Random Waypoint with Base Point (RWPBP) mobility model aims to model the movement characteristics in catastrophe rescue scenario. RWPBP mobility model can represent different movement styles according to different parameters. In this paper, we consider the traffic scenario that all the data generated by the nodes need to be sent to the base point, and evaluate the performance of the five DTN routing protocols (i.e., DirectDelivery, Epidemic, PROPHET, SpayAndWait and FirstContact) under the RWPBP mobility model with different parameters. Epidemic performs best in our experiment, since the traffic is not heavy in catastrophe rescue scenario.

APA, Harvard, Vancouver, ISO, and other styles

37

Wei, Yun Kai, Wei Qiao Li, Yu Ming Mao, Su Peng Leng, and Qin Yu. "Fermat Point Based Joint Routing in Dual-Aggregation-Points Inter-Backup M2M Communications." Advanced Materials Research 546-547 (July 2012): 1205–10. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1205.

Full text

Abstract:

Machine-to-machine (M2M) communications can be widely used in military probing, disasters monitoring, etc., where have rigorous environment and require reliable communications. In order to provide enough reliability, M2M subnet can be deployed with two inter-backup aggregation points. This paper proposed a novel routing algorithm named Fermat Point based Joint Routing (FPJR) for such dual-aggregation-points inter-backup M2M Communications. Taking nodes on Fermat Points as route anchors, FPJR forms joint routes which can decrease energy cost and improve communication efficiency greatly. Further, considering the probability is quite little that there is exactly a node deployed on an appointed Fermat Point, we proposed a new terminology ‘ -Fermat Region’, which denotes the circle area with the Fermat Point as center and as radius. Based on -Fermat Region and through the FPJR interaction protocol, FPJR can act not only separately but also as the aid of other routing algorithms, without any compatibility problem. The simulation results show that FPJR can greatly decrease packet lost ratio, energy cost and packet delay.

APA, Harvard, Vancouver, ISO, and other styles

38

Et.al, Mrs Swetha M. S. "Strong Secure Anonymous Location Based Routing (S2ALBR) method for MANET." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 11, 2021): 4349–56. http://dx.doi.org/10.17762/turcomat.v12i3.1726.

Full text

Abstract:

Mobile Ad Hoc Networks (MANETs) utilize confounding planning shows that spread community point characters similarly as courses from outside onlookers so as to give obscurity security. MANET contains different little gadgets conceding suddenly over the air. The topology of the system is changing an incredible piece of the time in light of the advantageous idea of its inside focuses. The security challenges ascend taking into account self-game-plan and self-reinforce limits. By the by, existing mysterious organizing shows depending upon either ricochet by-skip encryption or excess traffic either produce imperative expense or can't give full namelessness security to information sources, targets, and courses. The imperative expense raises the trademark asset limitation issue in MANETs particularly in natural media remote applications. To offer high absence of definition assurance expecting for all intents and purposes no effort, we strong secure anonymous location based routing (S2ALBR) protocol for MANET utilizing optimal partitioning and trust inference model. In S2ALBR appear, first segments a system into zones utilizing optimal tug of war partition (OTW) algorithm. By at that point, figure the trustiness of each reduced focus point utilizing the imprisonments got signal quality, versatility, way debacle and joint exertion rate. The arrangement of trust calculation is advanced by the optimal decided trust inference (ODTI) model, which gives the trustiness of each adaptable. By then picks the most basic trust ensured focus point in each zone as generally engaging trade habitats for information transmission, which structure a non-unquestionable bewildering course. The introduction of proposed S2ALBR show is examined by various testing conditions with Network Simulator (NS2) instrument.

APA, Harvard, Vancouver, ISO, and other styles

39

Kim, Dongwon, Jiwon Jung, and Younggoo Kwon. "3D Void Handling Geographic P2P-RPL for Indoor Multi-Hop IR-UWB Networks." Electronics 11, no. 4 (February 17, 2022): 625. http://dx.doi.org/10.3390/electronics11040625.

Full text

Abstract:

IETF has standardized the point-to-point RPL (P2P-RPL) to ensure reliable and optimal P2P route discovery for low-power and lossy networks (LLNs). P2P-RPL propagates route discovery packets to all nodes in the network, which results in high routing communication overheads. Recently, other RPL-based P2P routing algorithms have been proposed to reduce such overheads, but still, quite an amount of overheads occur due to their flooding-based approach. In real life 3D environments, a larger number of nodes should be deployed to guarantee the full network connectivity, and thus the flooding strategy incurs higher overheads. In effort to alleviate high overheads, geographic routing is an attractive solution that exploits the nodes’ geographic locations in its next-hop routing selection. However, geographic routing inherently suffers from the local minimum (void) problem following greedy next-hop selection. Local minima occur more often in 3D space, and therefore, a reliable 3D void handling technique is required. In this paper, we propose greedy forwarding and void handling point-to-point RPL with adaptive trickle timer (GVA-P2P-RPL), which is a novel RPL-based P2P routing protocol that quickly discovers energy-efficient and reliable P2P routes in 3D networks. In GVA-P2P-RPL, P2P-RPL is modified to greedily forward routing packets when it is possible. IR-UWB-based 3D multi-hop self-positioning is conducted in advance to obtain the geographical location of each node. When local minima are encountered, routing packets are temporarily broadcast just like in the traditional P2P-RPL. A new trickle algorithm called adaptive trickle timer (ATT) is also presented to reduce route discovery time and provide better collision avoidance effects. The performance of GVA-P2P-RPL is compared with that of P2P-RPL, partial flooding-based P2P-RPL (PF-P2P-RPL) and ER-RPL. It shows significant improvements in route discovery overheads and route discovery time against these state-of-the-art RPL-based P2P routing methods in 3D environments. Performance evaluation in the special network case where a huge 3D void volume exists in the center is also presented to show the strong void recovery capability of the proposed GVA-P2P-RPL in 3D environments.

APA, Harvard, Vancouver, ISO, and other styles

40

Cabrera, Juan Pablo Orejuela, Milton Alexander Londoño, and Vivian Lorena Chud Pantoja. "School bus routing problem considering affinity among children." Decision Science Letters 10, no. 4 (2021): 535–48. http://dx.doi.org/10.5267/j.dsl.2021.5.002.

Full text

Abstract:

School bus routing problem is widely studied, however, social elements such as the interaction between children traveling on the same route have not been considered so far. In this way, this article has as its main objective to propose a methodology to solve the school bus routing problem, including affinity as a strategy to increase positive interrelationships between children, and with this, support in bullying situations during school trips. The methodology includes two stages, assigning children to vehicles considering affinities and defining vehicle routes. The main contribution is the consideration of affinity in the process of forming the groups of children that will be taken on the bus, evidencing a balance in the affinity of the groups. Additionally, from the methodological point of view, the integration of a modified group technology algorithm and a new assignment model are proposed that simplify the classic quadratic assignment problem. Consideration of affinity in school bus routing generates benefits from a social point of view.

APA, Harvard, Vancouver, ISO, and other styles

41

Zulfin, Muhammad, S. Suherman, Rahmad Fauzi, M. Razali, and Maksum Pinem. "Cross-Point Comparison of Multistage Non-Blocking Technologies." International Journal of Engineering & Technology 7, no. 3.2 (June 20, 2018): 703. http://dx.doi.org/10.14419/ijet.v7i3.2.15348.

Full text

Abstract:

Multistage switching networks play important role in communication and computer network. They make communication nodes connect to each other. In computer hardware switches connect processors and memories. Initially, switches are arranged as one stage interconnection. As clients are growing, multistage is a must. The finding Clos multistage switching initiated multistage technologies. Benes improves Clos by reducing number of cross-points by using a 2 x 2 switch element and call re-routing. Batcher improves the technology by other way which is sorting destination address. Banyan is then joined to Batcher to simplify routing control. This paper analyses the number of cross-point required in Clos, Benes and Batcher Banyan to accomplish multistage switching architecture of 16, 64, 256, 1024 and 2048 input/output ports. As results, Clos cross-point is in averages 495.24% higher than Benes and 160.30% higher than Batcher Banyan. Clos blocking probabilities are closed to zero. Benes blocking probabilities are conditionally zero. Batcher Banyan blocking probabilities are zero.

APA, Harvard, Vancouver, ISO, and other styles

42

Perumal, Madhumathy, and Sivakumar Dhandapani. "Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks." Scientific World Journal 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/495945.

Full text

Abstract:

Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a “splitting tree” technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the “Biased Random Walk” model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.

APA, Harvard, Vancouver, ISO, and other styles

43

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.

Full text

Abstract:

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, and other styles

44

Rasoul, Lubna Najah, and Wijdan Rasheed Abd Al- Hussain. "New Algorithm to Handle Routing with Load Balancing in Wireless Networks Using EERNN." Journal of advanced Sciences and Engineering Technologies 1, no. 1 (April 29, 2018): 11–16. http://dx.doi.org/10.32441/jaset.v1i1.59.

Full text

Abstract:

In this paper, static wireless network load balance algorithm is proposed, that use only optimal paths from point-to-point to achieve good load balance. This algorithm based on Enhanced version of Elman Recurrent Neural Network (EERNN) to make load balance decision depended on two metrics (traffic load on node and probability of link failure). This algorithm make good work in terms of both metrics simultaneously. Also, this algorithm use only local information. The execution of the proposed algorithm is compared with ERNN based on traffic load on node and probability of link failure. © 2018 JASET, International Scholars and Researchers Association Author Biographies Lubna Najah Rasoul Mazaya University Collage Wijdan Rasheed Abd Al-Hussain University of Thi-Qar

APA, Harvard, Vancouver, ISO, and other styles

45

R, Anala M., Amit N. Subrahmanya, and Allbright D’Souza. "Performance Analysis of Mesh-based NoC’s on Routing Algorithms." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 5 (October 1, 2018): 3368. http://dx.doi.org/10.11591/ijece.v8i5.pp3368-3373.

Full text

Abstract:

The advent of System-on-Chip (SoCs), has brought about a need to increase the scale of multi-core chip networks. Bus Based communications have proved to be limited in terms of performance and ease of scalability, the solution to both bus – based and Point-to-Point (P2P) communication systems is to use a communication infrastructure called Network-on-Chip (NoC). Performance of NoC depends on various factors such as network topology, routing strategy and switching technique and traffic patterns. In this paper, we have taken the initiative to compile together a comparative analysis of different Network on Chip infrastructures based on the classification of routing algorithm, switching technique, and traffic patterns. The goal is to show how varied combinations of the three factors perform differently based on the size of the mesh network, using NOXIM, an open source SystemC Simulator of mesh-based NoC. The analysis has shown tenable evidence highlighting the novelty of XY routing algorithm.

APA, Harvard, Vancouver, ISO, and other styles

46

Stachowiak, Krzysztof, and Piotr Zwierzykowski. "Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm." International Journal of Electronics and Telecommunications 58, no. 4 (December 1, 2012): 307–14. http://dx.doi.org/10.2478/v10177-012-0042-2.

Full text

Abstract:

Abstract Due to the process of network convergence, the variety of types of traffic transmitted over a single medium increases steeply. This phenomenon can be handled by the existing networking structure although the protocols that are used and, especially, the underlying routing protocols need to be improved. The problem of finding the shortest path on the Internet can no longer be easily defined as there is an increasing number of different characteristics to describe a point-to-point link. The definition of the shortest path may differ for different traffic types. Therefore, in the mathematical models used to solve the modern routing problems multiple criteria must be taken into account. One of the interesting classes of the optimization problem is the problem of finding the solution that is minimized against one of the criteria under certain constraints with regard to the others. In this paper, two algorithms solving this kind of problems are presented and compared with a new solution proposed by the authors.

APA, Harvard, Vancouver, ISO, and other styles

47

Shin, Soo Young, and Ika Dewi binti Saiful Bahri. "A New Approach of Routing Algorithms in Nanonetwork for Molecular Communication." Applied Mechanics and Materials 556-562 (May 2014): 3670–73. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.3670.

Full text

Abstract:

Nanotechnology is an emerging field of science devoted to provide new opportunities in a vast range of areas. The main alternative for communication in the nanoscale is molecular communication. This paper describes how the molecules travel from one point to other point in the computational environment in two different approaches. In the first approach, the ant of the artificial colony are finding the routes by consider acceleration and force of molecule arrive close with the target. On the other hand, in the second approach, the density of molecule around the target will determines the routes of ant. As the performance measures, the arrival time and the number of contacts with molecules from the target to the source are evaluated

APA, Harvard, Vancouver, ISO, and other styles

48

Redi, Anak Agung Ngurah Perwira, Bertha Maya Sopha, Anna Maria Sri Asih, and Rahmad Inca Liperda. "Collaborative Hybrid Aerial and Ground Vehicle Routing for Post-Disaster Assessment." Sustainability 13, no. 22 (November 19, 2021): 12841. http://dx.doi.org/10.3390/su132212841.

Full text

Abstract:

Hybrid aerial and ground vehicles are seen as a promising option for deployment in a post-disaster assessment due to the risk of infrastructure damage that may hinder the assessment operation. The efficient operation of the hybrid aerial and ground vehicle, particularly routings, remains a challenge. The present study proposed a collaborative hybrid aerial and ground vehicle to support the operation of post-disaster assessment. The study developed two models, i.e., the Two-Echelon Vehicle Routing Problem combined with Assignment (2EVRPA) and the Two-Echelon Collaborative Vehicle Routing Problem (2ECoVRP) to evaluate optimal routings for both aerial and ground vehicles. The difference lies in the second echelon in which the 2EVRPA uses a single point-to-point assignment, whereas the 2ECoVRP considers the collaborative routings between the ground vehicle and the aerial vehicle. To demonstrate its applicability, the developed models were applied to solve the post-disaster assessment for the Mount Merapi eruption in Yogyakarta, Indonesia. Sets of numerical experiments based on the empirical case were conducted. The findings indicate that the 2ECoVRP performs better than 2EVRPA in terms of the total operation time. The tabu search algorithm was found to be a promising method to solve the models due to its good quality solution and computational efficiency. The deployment of eight drones appears to be optimum for the given network configuration of the studied case. Flight altitude and battery capacity were found to be influential to the operation time, hence requiring further exploration. Other potential avenues for future research are also discussed.

APA, Harvard, Vancouver, ISO, and other styles

49

Poikonen, Stefan, and Bruce Golden. "The Mothership and Drone Routing Problem." INFORMS Journal on Computing 32, no. 2 (April 2020): 249–62. http://dx.doi.org/10.1287/ijoc.2018.0879.

Full text

Abstract:

The mothership and drone routing problem (MDRP) considers the routing of a two-vehicle tandem. The larger vehicle, which may be a ship or an airplane, is called the mothership; the smaller vehicle, which may be a small boat or unmanned aerial vehicle, is called the drone. We assume that there exists a set of target locations T. For each t in T, the drone must launch from the mothership, visit t, and then return to the mothership to refuel. The drone has a limited range of R time units. In the MDRP, we assume that both mothership and drone operate in the “open seas” (i.e., using the Euclidean metric). We also introduce the mothership and infinite-capacity drone routing problem (MDRP-IC), where a drone launches from the mothership and visits one or more targets consecutively before returning to the mothership. Our exact approach uses branch and bound, where each node of the branch-and-bound tree corresponds to a potential subsequence of the order of target visits. A lower bound at each node is given by solving a second-order cone program, which optimally chooses a launch point and landing point for each target in the subsequence. A set of heuristics that also uses a second-order cone program as an embedded procedure is presented. We show that our schemes are flexible to accommodate a variety of additional constraints and/or objective functions. Computational results and interesting variants of the MDRP and MDRP-IC are also presented.

APA, Harvard, Vancouver, ISO, and other styles

50

Wang, Hong-Bo, Xiao-Gang Li, Peng-Fei Li, Evgeny I. Veremey, and Margarita V. Sotnikova. "Application of Real-Coded Genetic Algorithm in Ship Weather Routing." Journal of Navigation 71, no. 4 (April 25, 2018): 989–1010. http://dx.doi.org/10.1017/s0373463318000048.

Full text

Abstract:

Solving the problem of ship weather routing has been always a goal of nautical navigation research and has been investigated by many scientists. The operation schedule of an oceangoing ship can be influenced by wave or wind disturbances, which complicate route planning. In this paper, we present a real-coded genetic algorithm to determine the minimum voyage route time for point-to-point problems in a dynamic environment. A fitness assignment method based on an individual's position in the sorted population is presented, which greatly simplifies the calculation of fitness value. A hybrid mutation operator is proposed to enhance the search for the optimal solution and maintain population diversity. Multi-population techniques and an elite retention strategy are employed to increase population diversity and accelerate convergence rates. The effectiveness of the algorithm is demonstrated by numerical simulation experiments.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Point-to-point routing'

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