13 August 2014 in IEEE/ACM Transactions on Networking
Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges-which are crucial for any scalable multicast scheme to be successful-by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.
6 January 2011 in IEEE/ACM Transactions on Networking
Being reported as the most general monitoring structure for out-of-band failure localization approach, the monitoring trail (m-trail) framework has been witnessed with great efficiency and promises to serve in the future Internet backbone with all-optical mesh wavelength division multiplex (WDM) networks. Motivated by its potential and significance, this paper investigates failure localization in all-optical mesh networks using m-trails. By considering shared risk link groups (SRLGs) with up to all adjacent links of any node in the network, a novel algorithm of m-trail allocation for achieving unambiguous failure localization (UFL) of any single SRLG failure is developed. The proposed algorithm aims to minimize the number of required m-trails and can achieve superb performance with respect to the computation efficiency. We claim that among all the previously reported counterparts, this paper has considered one of the most applicable scenarios to the design of network backbone, and the proposed method can be easily extended to the case of node failure localization. Extensive simulation is conducted to verify the proposed algorithm in comparison to its existing counterparts.
11 January 2021 in IEEE Access
This paper focuses on how to increase the availability of a backbone network with minimal cost. In particular, the new framework focuses on resilience against natural disasters and is an evolution of the FRADIR/FRADIR-II framework. It targets three different directions, namely: network planning, failure modeling, and survivable routing. The steady state network planning is tackled by upgrading a sub-network (a set of links termed the spine) to achieve the targeted availability threshold. A new two-stage approach is proposed: a heuristic algorithm combined with a mixed-integer linear problem to optimize the availability upgrade cost. To tackle the disaster-resilient network planning problem, a new integer linear program is presented for the optimal link intensity tolerance upgrades together with an efficient heuristic scheme to reduce the running time. Failure modeling is improved by considering more realistic disasters. In particular, we focus on earthquakes using the historical data of the epicenters and the moment magnitudes. The joint failure probabilities of the multi-link failures are estimated, and the set of shared risk link groups is defined. The survivable routing aims to improve the network’s connectivity during these shared risk link group failures. Here, a generalized dedicated protection algorithm is used to protect against all the listed failures. Finally, the experimental results demonstrate the benefits of the refined eFRADIR framework in the event of disasters by guaranteeing low disconnection probabilities even during large-scale natural disasters.
28 March 2011 in Journal of Lightwave Technology
This paper considers the problem of out-of-band failure localization in all-optical mesh networks using bidirectional monitoring trails (bm-trails), where every possible link set with up to d arbitrary links is considered as a shared risk link group (SRLG). With the SRLG scenario, the bm-trail allocation problem is firstly formulated, which includes the phases of code assignment and bm-trail formation. In the first phase, each SRLG is uniquely coded by assigning each link with a nonadaptive d̅-separable combinatorial group testing code. Then, the second phase manipulates a sophisticated yet efficient bm-trail formation process through a novel greedy code-swapping mechanism, such that any SRLG failure can be unambiguously localized by collecting the alarms of the interrupted bm-trails. The algorithm prototype can be found in . Extensive simulation is conducted on hundreds of randomly generated planar topologies to verify the proposed approach in terms of the number of required bm-trails and the computational efficiency. Our approach is compared with previously reported counterparts, by which its merits are further demonstrated.
11 April 2013 in Computer Networks