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.
The most important problem in multicast routing is Steiner tree problem, which has been proved to be NP-complete. This article proposed an algorithm based on Artificial Bee Colony Optimization (ABC). In this algorithm, we optimize the Steiner tree directly. It is not the same as traditional methods that find paths and integrate them to generate a Steiner tree. This algorithm use the characteristic...
Open Shortest Path First (OSPF), a link state routing protocol, is a popular interior gateway protocol (IGP) in the Internet. Wide spread deployment and years of experience running the protocol have motivated continuous improvements in its operation as the nature and demands of the routing infrastructures have changed. Modern routing domains need to maintain a very high level of service availability...
Upon topology changes, routing protocols typically undergo convergence process to prepare new shortest routes needed for packet delivery. Real-time applications (e.g. VoIP) nowadays require routing protocol to have quick convergence time. This paper presents a new routing table calculation scheduling scheme for OSPF routing protocol to better serve real-time applications. The proposed scheme focuses...
Collective foraging in ant colonies is as remarkable in that ants are solving a distributed control and optimization task that is still not fully untravelled. Ants deposit pheromone as they travel, and paths with more pheromone are preferred by succeeding ants. Without any direct communication amongst themselves, ants quickly abandon other trails to concentrate on the shortest one. If the food source...
Topology changes trigger routing protocol to undergo convergence process which prepares new shortest routes needed for packet delivery. Real-time applications (e.g. VoIP) nowadays require routing protocol to have a quick convergence time. This paper presents a new routing table calculation scheme for OSPF routing protocol to better serve real-time applications. The proposed scheme focus on speeding...
Synchronization in a wireless mesh communication network can be achieved by sending messages among nodes that include information regarding the time of the node and its accuracy. The nodes that receive such messages may adjust their time according to the received messages. This paper proposes a robust algorithm with two stages: acquisition and tracking, and applicability to any network architecture.
Network mobility at continental scales requires transitioning between a collection of provider networks to maintain connectivity while traveling. Ideally, the transitions between networks occur transparently to end users therefore placing the burden of redirecting traffic on the inter-domain routing infrastructure. Performing inter-domain routing in mobile scenarios has been discouraged since BGP...
With the significant increase in the Internet traffic, the uncoordinated routing practices across border gateways are limiting the Internet growth. It is becoming urgent to rethink the principles underlying the Internet infrastructure as well as the design of its major protocols, especially those related to Internet routing and traffic engineering. In its support, an appropriate characterization of...
Power consumption is a serious consideration in Network-on-Chip (NoC) mapping research area. Most NoC mapping approaches use heuristic algorithms to solve this NP-Complete problem. In this paper, a new swarm intelligence optimization named artificial bee colony algorithm (ABC) with chaos mechanism is proposed. Use the disorder and ergodicity features of chaos mechanism, we can solve the problem that...
The Border Gateway Protocol (BGP) is the de facto Internet routing protocol. Various aspects of the BGP protocol have been analyzed using mathematical and experimental approaches. Formal verification of BGP specification validates whether or not a specific set of requirements is satisfied. In resent years, the probabilistic behavior of BGP has been explored. The size of routing tables has been modeled...
In this study, we propose an ACS with flip-flop search strategy to find the route from source node to destination node in an Ad hoc network topology. A flip-flop search strategy is to alternate the search direction towards either high pheromone area or low pheromone area iteratively in the evolution process. The proposed Flip-Flop search strategy effectively solves the pheromone-excess problem in...
Intradomain IP routing protocols like OSPF or IS-IS are robust against failures. New fast reroute mechanisms can minimize packet loss directly after an outage by temporarily detouring packets around the failed network element. This buys time for a loop-free convergence, which brings the topology to a new stable path layout without causing temporary micro-loops. We analyze the link utilizations during...
Current trends in network routing point to dynamic routing which provides flexible and efficient routing selections. The usage of dynamic routing protocols significantly promotes the rapid development of Internet. In reality, centralized routing and distributed routing techniques are critical methods to realize dynamic routing in modern communication network. In this paper, we mainly analyze the principles...
BGP, the de-facto inter-domain routing protocol, is well-known for its complexity in configuring correct behaviour. This stems from the fact that the protocol is policy-based. Despite best practice and guidelines, it is not uncommon to have policy conflicts in a real network. Currently, there is a lack of tools to verify that required properties, especailly, the convergence property, holds in a set...
BGP (Border Gateway Protocol) as a kind of mature routing protocols, has been widely applied in all kinds of largescale network. With regard to routing protocol, the important problem is the convergence time, which is an important index to evaluate the availability and robustness of network. This paper analyzes the network convergence problem, elaborates the method of accelerating network convergence...
To solve anycast routing problem with multiple QoS constraints, a improved anycast routing algorithm based on simplified particle swarm optimization algorithm and diversity strategy is presented. Firstly, the algorithm simplified the complexity of standard PSO algorithm and improved the convergence velocity extraordinarily by dynamically changing the inertia weight. Then, a mutation operator and diversity...
Although possible security threats were taken into consideration when IPv6 was formulated, attacks, especially distributed denial-of-service (DDoS), still exist in IPv6 network. This makes IP trace back schemes very relevant to the security of IPv6 network. As many current IP trace back schemes are designed according to IPv4, they can not be directly used in IPv6 network. A modified Deterministic...
Henan agricultural informatization center, which is a part of Henan agricultural university campus network and contains nearly 800 host machines, had realized complete coverage of IPv4 network. Considering the long-term transition process from IPv4 to IPv6 and reserving current IPv4 application, the CNGI Customer Premise Network (CPN) in the center was constructed based on IPv6 / IPv4 double protocol...
Refering to single area crawler model based on p2p-chord network, designed and implemented a multi-area crawler model based on own design Skipnet-YL network which based on Skipnet protocol. It use better performance router protocol Skipnet-YL and the idea of SuperNodes and OSPF. Sequentially, it can solve the problem of low performance and the large of communication traffic during increasing nodes...
In this paper we show data plane restoration measurements for restoration under backbone link failures for a large network with IP/MPLS OSPF routing and also for the same backbone with Traffic Engineering (TE) and Fast Reroute (FRR) deployed. Our study is unique as we analyzed a significant quantity of measurements obtained from a production network over a 14-month period encompassing many link failures...
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.