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.
Dual decomposition coupled with the subgradient method has found application to optimal resource management in communication networks, as it can lead to distributed and scalable algorithms. Network entities—nodes or functional layers—exchange Lagrange multipliers and primal minimizers of the Lagrangian function towards optimizing a network-wide performance metric. It is of interest to study the performance...
With internal networks growing larger, dynamic routing protocols are becoming more prevalent in autonomous systems. Due to the importance of computers and network resources, many organizations implement redundant links to allow failover in the event of a link failure. When this failover occurs, the network must converge before traffic will be able to pass to and from the network segment that incurred...
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...
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...
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...
A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distributed algorithms that build routing tables directly. Motivating their algorithms, the proposals make a perfunctory claim that the standard join protocols are not designed to handle the huge number of concurrent join requests involved...
In order to reduce the number of BGP updates that routers need to process, it is common to rate-limit such updates using a timer that specifies the minimum time between two consecutive updates for a given destination prefix. Rate-limiting plays an important role in determining the number of routing updates that are generated after a routing event, and the time it takes before the network converges...
RFD and MRAI are the only two built-in mechanisms in BGP router against unstable routes, they can however negatively impact the convergence. In this paper, we propose a churn aggregation approach CAGG to stabilize BGP routing without harming convergence. CAGG is based on the observation that AS PATH change is the dominant cause for BGP updates and only a small number of AS PATHs are explored by each...
In Shared Path Protection, backup resources can be shared by multiple backup lightpaths as long as their respective working lightpaths are not affected by the same (single) failure event. This property is known as backup sharing among existing backup paths. The goal of this work is to experimentally evaluate the impact of the traffic dynamics when the control information on resource sharing is either...
Several routing protocols have been proposed to take advantage of the dynamic metrics on links such as link delays, queueing lengths, and available link bandwidths.Wardrop routing, QOS routing are few such example routing protocols. Even when these protocols can be shown to offer convergence properties without oscillations, the protocols have not been widely adopted for a number of reasons. The expected...
In DTNs, due to the unique characteristic of frequent partitioning, multicasting is a considerably different and challenging problem. Moreover, the single data multicast is different from multiple data multicast. In this paper, The mathematics model of multiple data multicast for DTNs is established, and the ant colony optimization algorithm introduce to solve the multiple data multicast problem....
Multicast transmission corresponds to send data to several destinations, often involving requirements of Quality of Service (QoS) and Traffic Engineering (TE). These multiple requirements lead to the need of optimizing a set of conflicting objectives subject to constraints. Starting from the well-known evolutionary algorithm SPEA2, two formulations for the Routing problem were considered, minimizing...
With the objective to better understand how the global Internet should achieve an availability in the order of five nines, i.e. be available 0.99999 of the time, active measurements were performed between Norway and China through the Global Research Network. End-to-end downtime statistics was continuously collected during a 3-month period up to mid February 2010. In addition to periodically sending...
In wireless mesh networks, scheduling is the bottleneck of the cross-layer design approach. Thus, it is surprising that CSMA is utility-optimal if it is used traffic-adaptive. However, the price to pay is short-term fairness and thus end-to-end delay. In this paper, we propose a step size adaptation algorithm that combines the advantages of small and large step sizes in a way that the convergence...
In this work, a multiobjective genetic algorithm-based model for multicast flow routing with QoS and Traffic Engineering requirements is discussed. Two heuristics for subtree reconnection are investigated, applicable in crossover and mutation operators. Experiments with three multiobjective evolutionary algorithms (NSGA-II, SPEA and SPEA2) and the proposed heuristics are carried on, whose results...
The paper deals with a conceptual modification on the learning phase of AntNet routing algorithm through nonlinear reinforcement. Since the learning structure of AntNet consists of colonies of learning automata, the proposed approach replaces the previously defined linear learning automata structure with nonlinear learning automata, which modifies the reinforcement process without imposing overhead...
Multicast transmission corresponds to send data to several destinations often involving requirements of Quality of Service (QoS) and Traffic Engineering (TE). This work investigates new evolutionary models to tackle Multicast Flow Routing in a Pareto multiobjective perspective. Two multiobjective evolutionary algorithms (SPEA and SPEA2) were applied as the underlying search of such models. QoS and...
The poor scalability is one of the most serious problems restricting the development of the Internet. In the series of solutions, identifier/locator separation technology is a great prospect and has been the mainstream of designs. However, how to design a system to distribute and update identifier-to-locator mapping information effectively in scope of the whole Internet is also a key issue not solved...
In this work we deal with the problem of dynamic decentralized self-optimization of forwarding protocols in delay-tolerant networks. We consider the two-hop forwarding protocol and we model the routing problem as an optimization one. We describe, under mild assumptions on the contact process among mobile nodes, the connection between the number of copies of a message and the cumulative probability...
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.