Survivability in Time-varying Networks

Time-varying graphs are a useful model for networks with dynamic connectivity such as vehicular networks, yet, despite their great modeling power, many important features of time-varying graphs are still poorly understood. In this paper, we study the survivability properties of time-varying networks against unpredictable interruptions. We first show that the traditional definition of survivability is not effective in time-varying networks, and propose a new survivability framework. To evaluate the survivability of time-varying networks under the new framework, we propose two metrics that are analogous to MaxFlow and MinCut in static networks. We show that some fundamental survivability-related results such as Menger's Theorem only conditionally hold in time-varying networks. Then we analyze the complexity of computing the proposed metrics and develop several approximation algorithms. Finally, we conduct trace-driven simulations to demonstrate the application of our survivability framework to the robust design of a real-world bus communication network

PREVENTING PERVASIVE THREATS TO NETWORK WITH POWER LAW

Research have studied numerous means of compute size adware and spyware and spyware and adware and spyware and adware and adware and spyware which studies will indicate that size bot nets can transform from millions to volume of thousands and you will find no leading concepts to create apparent these variation. Within our work we inspect how adware and spyware and spyware and adware and spyware and adware and adware and spyware propagate within systems from global perspective and rigorous two layer epidemic representation for adware and spyware and spyware and adware and spyware and adware and adware and spyware distribution from network to network.  Based on forecasted representation, our analysis indicate that distribution of provided adware and spyware and spyware and adware and spyware and adware and adware and spyware follows exponential distribution, the distribution of power law acquiring a short exponential tail, additionally to power law distribution at its initial, late additionally to final stages, correspondingly. The suggested type of two layer adware and spyware and spyware and adware and spyware and adware and adware and spyware propagation explains development of specified adware and spyware and spyware and adware and spyware and adware and adware and spyware at Internet level applying this two layer representation, we determine entire volume of compromised hosts additionally for distribution concerning systems

An Efficient Patch Dissemination Strategy for Mobile Networks

Mobile phones and personal digital assistants are becoming increasingly important in our daily life since they enable us to access a large variety of ubiquitous services. Mobile networks, formed by the connection of mobile devices following some relationships among mobile users, provide good platforms for mobile virus spread. Quick and efficient security patch dissemination strategy is necessary for the update of antivirus software so that it can detect mobile virus, especially the new virus under the wireless mobile network environment with limited bandwidth which is also large scale, decentralized, dynamically evolving, and of unknown network topology. In this paper, we propose an efficient semi autonomy-oriented computing (SAOC) based patch dissemination strategy to restrain the mobile virus. In this strategy, some entities are deployed in a mobile network to search for mobile devices according to some specific rules and with the assistance of a center. Through experiments involving both real-world networks and dynamically evolving networks, we demonstrate that the proposed strategy can effectively send security patches to as many mobile devices as possible at a considerable speed and lower cost in the mobile network. It is a reasonable, effective, and secure method to reduce the damages mobile viruses may cause