The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Routing algorithms can improve network performance by maximizing routing adaptiveness but can be problematic in the presence of endpoint congestion. Tree-saturation is a well-known behavior caused by endpoint congestion. Adaptive routing can, however, spread the congestion and result in thick branches of the congestion tree — creating Head-of-Line (HoL) blocking and degrading performance. In this...
Finite State Machines (FSM) are widely used computation models for many application domains. These embarrassingly sequential applications with irregular memory access patterns perform poorly on conventional von-Neumann architectures. The Micron Automata Processor (AP) is an in-situ memory-based computational architecture that accelerates non-deterministic finite automata (NFA) processing in hardware...
Due to the rapid growth in scale and complexity of information networks, self-organizing systems have been focused on for realizing new network control architectures that have high scalability, adaptability, and robustness. However, in self-organizing systems, the uncertainty (incompleteness, ambiguity, and dynamicity) of information observable for components in the system can lead to the slow adaptation...
A rapid growth in the internet network technologies claims for a better routing protocol in transmitting data. The network performance is evaluated to compare the two Link State (LS) routing protocols which are the Open Shortest Path First version3 (OSPFv3) and Intermediate System to Intermediate System (IS-IS). The evaluation is done in terms of the performance in the network convergence through...
In this paper, we present a new adaptive multiflow routing algorithm to select end-to-end paths in packetswitched networks. This algorithm provides provable optimality guarantees in the following game theoretic sense: The network configuration converges to a configuration arbitrarily close to a pure Nash equilibrium. In this context, a Nash equilibrium is a configuration in which no flow can improve...
Most of the times Wireless Sensor Networks (WSNs) operate in hostile and unattended network environments, which makes the nodes vulnerable to node misbehaviour attacks. The applicability of conventional security methods, such as authentication, encryption and cryptography, to counter node misbehaviour attacks is debatable due to their incapability and involved cost. Trust aware secure mechanisms provide...
Conventional routing protocols such as RIP, OSPF, EIGRP and BGP have a very rigid and intricate system thus narrowing the adaptability of networks to the ever changing Internet. The emergence of Software Defined Networking (SDN) provides a solution for this problem. Due to the handiness of a centralized controller, SDN has provided an effective method in terms of routing computation and fine control...
Focus on the problem of finding the optimal path in wireless sensor networks(WSN), considering energy saving requirement, a dynamic energy-saving routing strategy based on ant colony optimization(DERS-ACO) is proposed. Our strategy designs the optimization rule of dynamic state transformation, which increases the search probability of the new node, so as to achieve the purpose of searching the global...
In the modern Internet area, the role of routing protocol is the most important. Routing protocols are used to determine the best path to destination. There are two main types of algorithms for IP routing: Distance Vector Routing and Link State Routing. In this work we aimed to analyze the performance of routing protocols (RIP, OSPF, EIGRP, IGRP) for various services (Voice, Video Conferencing and...
Background/Objective: Interior gateway protocols are used for communication between devices in an organizational network. The setup which includes routers, switches and hosts is simulated in GNS3 software to represent a complex real time enterprise level network. Each protocol is implemented in the designed topology. Methods/Statistical analysis: Interior gateway protocols-RIP (Routing Information...
To solve the overlap problem in node selection process in order to fill the existing routing algorithms deficiencies, This paper designs a traditional Gossiping routing algorithm based on SPSO. At the same time, the paper gives the content and design steps of this algorithm. The simulation results show that the algorithm can effectively solve the problem of node selection.
With the growing popularity of big-data applications, Data Center Networks increasingly carry larger and longer traffic flows. As a result of this increased flow granularity, static routing cannot efficiently load-balance traffic, resulting in an increased network contention and a reduced throughput. Unfortunately, while adaptive routing can solve this load-balancing problem, network designers refrain...
Drill path optimization problem is an important problem in holes drilling with computer numerically controlled (CNC) machine. Due to the exponential increase in the number of possible solutions when the number of holes to be drilled increase, the metaheuristic optimization algorithm seems to be a good choice in solving this type of optimization problem. This paper presents a Kalman Filter approach...
Minimizing the impact of network convergence events has been an active area of research and innovation since it usually occurs unexpectedly and triggers (often jolting) alarms in network operations centers. Examination of router logs, network management system information, and router configuration reviews are the standard tools for assessment and often do not lead to satisfactory conclusions. We introduce...
The improvement of the scalability of routing decisions is quite relevant in modern telecommunication networks. In this regard, effective approach is associated with the implementation of hierarchical routing. This involves carrying out a structural and functional decomposition of the network, based on the introduction and supporting of multi-level routing decisions. However, the existing protocol...
In modern telecommunication networks very acute problem is an increasing of scalability. The most effective solution is the usage of hierarchical routing which assumes that decomposition of the network into areas. The paper proposed the method of hierarchical inter-area routing based on the goal coordination principle. The proposed method is based on flow-based model of inter-area routing. In numerical...
This paper proposes route advertisement policies (RAP) for the Border Gateway Protocol (BGP) with provider aggregatable (PA) addressing. The proposed RAP takes the advantage of address aggregation opportunity. If multiple address spaces are allocated to each of autonomous systems (ASes) that are multihomed to multiple upper ASes, reduction of the Forwarding Information Base (FIB) and quick convergence...
Software Defined Networking (SDN) is an emerging paradigm to address the demands for flexible and agile network controllability. The fundamental idea of SDN is the physical separation of the network control plane from the data (forwarding) plane. This migration of control into programmable computing devices enables the underlying network infrastructures to be abstracted for applications and services...
Border Gateway Protocol (BGP) is the only routing protocol for the internet. This protocol suffers from unstable routes. Two major built-in mechanisms have been designed to work against the impact of these unstable routes. One of them is Route Flap Damping (RFD), which is designed to detect and suppress flapping or unstable routes. However, most operators have disabled RFD, which has been found to...
The decoupling of control and data plane in software-defined networking (SDN) has been shown to be promising to improve routing performance in the context of intradomain routing. The applicability of SDN in inter-domain routing, especially with respect to route convergence, has not been properly explored. In this work, we propose a mathematical model to quantify the BGP convergence time for inter-domain...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.