183 research outputs found

    Cost-Efficient Data Backup for Data Center Networks against {\epsilon}-Time Early Warning Disaster

    Full text link
    Data backup in data center networks (DCNs) is critical to minimize the data loss under disaster. This paper considers the cost-efficient data backup for DCNs against a disaster with ε\varepsilon early warning time. Given geo-distributed DCNs and such a ε\varepsilon-time early warning disaster, we investigate the issue of how to back up the data in DCN nodes under risk to other safe DCN nodes within the ε\varepsilon early warning time constraint, which is significant because it is an emergency data protection scheme against a predictable disaster and also help DCN operators to build a complete backup scheme, i.e., regular backup and emergency backup. Specifically, an Integer Linear Program (ILP)-based theoretical framework is proposed to identify the optimal selections of backup DCN nodes and data transmission paths, such that the overall data backup cost is minimized. Extensive numerical results are also provided to illustrate the proposed framework for DCN data backup

    Non-blocking conditions for egs networks

    Get PDF
    Abstract-A class of multistage interconnection networks, known as extended generalized shuffle (EGS) network, is here considered; it is built with arrays of elementary switching elements, interconnected by shuffle patterns, and external splitters and combiners. New results are given here that reduce the splitter fanout required to make the network strictly non-blocking

    Availability Formulations for Segment Protection

    Get PDF
    Abstract-Segment Protection (SP) is an efficient scheme for protection in WDM optical networks. This letter provides algebraic formulations to evaluate SP availability both in the dedicated and shared backup case. The availability models are applied to numerical examples and significant relations between SP availability and relevant connection parameters are identified

    Techno-Economic Evaluation of CDN Deployments in Metropolitan Area Networks

    Get PDF
    open4noopenAyoub, Omran; Musumeci, Francesco; Tornatore, Massimo; Pattavina, AchilleAyoub, Omran; Musumeci, Francesco; Tornatore, Massimo; Pattavina, Achill

    Blocking Probability of f -Cast Optical Banyan Networks on Vertical Stacking

    Get PDF
    Abstract-Vertical stacking of banyan networks has been an attractive architecture to construct optical switching networks due to its small depth, absolute signal loss uniformity and good fault tolerance property. Recently, F.K.Hwang extended the study of banyan-based networks to the general f -cast case, which covers the unicast (f = 1) and multicast (f = N ) as special cases. In this paper, we study the blocking probability of f -cast optical banyan networks under crosstalk-free constraint. It is expected that the proposed probability model can be used to dimension such an f -cast network and achieve a graceful tradeoff between hardware cost and blocking probability

    Power consumption evaluation of circuit-switched versus packet-switched optical backbone networks

    Get PDF
    While telecommunication networks have historically been dominated by a circuit-switched paradigm, the last decades have seen a clear trend towards packet-switched networks. In this paper we evaluate how both paradigms perform in optical backbone networks from a power consumption point of view, and whether the general agreement of circuit switching being more power-efficient holds. We consider artificially generated topologies of various sizes, mesh degrees and not yet previously explored in this context transport linerates. We cross-validate our findings with a number of realistic topologies. Our results show that, as a generalization, packet switching can become preferable when the traffic demands are lower than half the transport linerate. We find that an increase in the network node count does not consistently increase the energy savings of circuit switching over packet switching, but is heavily influenced by the mesh degree and (to a minor extent) by the average link length
    • …
    corecore