相关论文: Efficient Algorithms to Enhance Recovery Schema in…

The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start…

Most modern communication networks include fast rerouting mechanisms, implemented entirely in the data plane, to quickly recover connectivity after link failures. By relying on local failure information only, these data plane mechanisms…

Fault-tolerant routing allows the selection of alternative routes to the destination after the route being used fails. Fast Reroute (FRR) is a proactive strategy through which the protocol pre-configures backup routes that are activated…

Service discovery requests' messages have a vital role in sharing and locating resources in many of service discovery protocols. Sending more messages than a link can handle may cause congestion and loss of messages which dramatically…

Traffic is essential for many dynamic processes on real networks, such as internet and urban traffic systems. The transport efficiency of the traffic system can be improved by taking full advantage of the resources in the system. In this…

In SDN stateful data planes, switches can execute algorithms to process traffic based on local states. This approach permits to offload decisions from the controller to the switches, thus to reduce the latency to react to network events. We…

In this paper, we study and improve the recovery properties of single and multipath routing strategies when facing network failure situations. In particular, we focus our study on two MANET routing protocols: OLSR and its multipath…

The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. First, each node has to…

From mass extinction to cell death, complex networked systems often exhibit abrupt dynamic transitions between desirable and undesirable states. Such transitions are often caused by topological perturbations, such as node or link removal,…

In this paper, we proposed a fast recovery strategy for a dual link failure in elastic optical network. The elastic optical network is a promising solution to meet the next generation higher bandwidth demand. The survivability of high speed…

Traditional vehicle routing algorithms do not consider the changing nature of traffic. While implementations of Dijkstra's algorithm with varying weights exist, the weights are often changed after the outcome of algorithm is executed, which…

Link state routing protocols such as OSPF or IS-IS currently use only best paths to forward IP packets throughout a domain. The optimality of sub-paths ensures consistency of hop by hop forwarding although paths, calculated using Dijkstra…

Link failures occur frequently in Internet Service Provider (ISP) networks and pose significant challenges for Traffic Engineering (TE). Existing TE schemes either reroute traffic over vulnerable static paths, leading to performance…

After disasters, distribution networks have to be restored by repair, reconfiguration, and power dispatch. During the restoration process, changes can occur in real time that deviate from the situations considered in pre-designed planning…

We propose a combined uplink/downlink opportunistic scheduling algorithm for infrastructure WLANs. In the presence of both uplink and downlink flows, an infrastructure WLAN suffers from the uplink/downlink unfairness problem which severely…

Dynamic Source Routing (DSR) is a well known source routing protocol for ad hoc networks. The algorithm depends on the cooperative participation of the nodes that enables route discovery from a source node to a destination node. However, if…

Reconfigurable optical topologies are emerging as a promising technology to improve the efficiency of datacenter networks. This paper considers the problem of scheduling opportunistic links in such reconfigurable datacenters. We study the…

Distributed resource allocation (DRA) is fundamental to modern networked systems, spanning applications from economic dispatch in smart grids to CPU scheduling in data centers. Conventional DRA approaches require reliable communication, yet…

Finding efficient routes for data packets is an essential task in computer networking. The optimal routes depend greatly on the current network topology, state and traffic demand, and they can change within milliseconds. Reinforcement…

A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally…