Subscribe

Issue No.01 - Jan. (2013 vol.12)

pp: 105-117

Salvatore Scellato , University of Cambridge, Cambridge

Ilias Leontiadis , University of Cambridge, Cambridge

Cecilia Mascolo , University of Cambridge, Cambridge

Prithwish Basu , Raytheon BBN Technologies, Boston

Murtaza Zafer , IBM T.J. Watson Research, Hawthorne

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.248

ABSTRACT

The application of complex network models to communication systems has led to several important results: nonetheless, previous research has often neglected to take into account their temporal properties, which in many real scenarios play a pivotal role. At the same time, network robustness has come extensively under scrutiny. Understanding whether networked systems can undergo structural damage and yet perform efficiently is crucial to both their protection against failures and to the design of new applications. In spite of this, it is still unclear what type of resilience we may expect in a network which continuously changes over time. In this work, we present the first attempt to define the concept of temporal network robustness: we describe a measure of network robustness for time-varying networks and we show how it performs on different classes of random models by means of analytical and numerical evaluation. Finally, we report a case study on a real-world scenario, an opportunistic vehicular system of about 500 taxicabs, highlighting the importance of time in the evaluation of robustness. Particularly, we show how static approximation can wrongly indicate high robustness of fragile networks when adopted in mobile time-varying networks, while a temporal approach captures more accurately the system performance.

INDEX TERMS

Robustness, Peer to peer computing, Measurement, Mobile computing, Computational modeling, Mobile communication, Probability distribution, network robustness, Mobile networks, temporal networks

CITATION

Salvatore Scellato, Ilias Leontiadis, Cecilia Mascolo, Prithwish Basu, Murtaza Zafer, "Evaluating Temporal Robustness of Mobile Networks",

*IEEE Transactions on Mobile Computing*, vol.12, no. 1, pp. 105-117, Jan. 2013, doi:10.1109/TMC.2011.248REFERENCES

- [1] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, "Complex Networks: Structure and Dynamics,"
Physics Reports, vol. 424, nos. 4/5, pp. 175-308, Feb. 2006.- [2] P. Erdős and A. Rényi, "On the Evolution of Random Graphs,"
Publications of the Math. Inst. of the Hungarian Academy of Sciences, vol. 5, pp. 17-61, 1960.- [3] R. Albert and A.-L. Barabasi, "Statistical Mechanics of Complex Networks,"
Rev. of Modern Physics, vol. 74, pp. 47-97, 2002.- [4] B.A. Huberman and L.A. Adamic, "Growth Dynamics of the World-Wide Web,"
Nature, vol. 401, no. 6749, p. 131, 1999.- [5] M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On Power-Law Relationships of the Internet Topology,"
Proc. Conf. Special Interest Group on Data Comm. (SIGCOMM), pp. 251-262, 1999.- [6] V. Kostakos, "Temporal Graphs,"
Physica A, vol. 388, no. 6, pp. 1007-1023, Mar. 2009.- [7] D. Kempe, J. Kleinberg, and A. Kumar, "Connectivity and Inference Problems for Temporal Networks,"
J. Computer and Systems Science, vol. 64, pp. 820-842, 2002.- [8] A. Clauset and N. Eagle, "Persistence and Periodicity in a Dynamic Proximity Network,"
Proc. DIMACS Workshop Computational Methods for Dynamic Interaction Networks, Sept. 2007.- [9] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of Human Mobility on Opportunistic Forwarding Algorithms,"
IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606-620, June 2007.- [10] J. Tang, M. Musolesi, C. Mascolo, and V. Latora, "Temporal Distance Metrics for Social Network Analysis,"
Proc. Second ACM Workshop Online Social Networks (WOSN '09), Aug. 2009.- [11] J. Tang, S. Scellato, M. Musolesi, C. Mascolo, and V. Latora, "Small-World Behavior in Time-Varying Graphs,"
Physical Rev. E, vol. 81, no. 5, p. 055101, May 2010.- [12] R. Albert, H. Jeong, and A.-L. Barabási, "Error and Attack Tolerance of Complex Networks,"
Nature, vol. 406, no. 6794, pp. 378-382, July 2000.- [13] D.S. Callaway, M.E.J. Newman, S.H. Strogatz, and D.J. Watts, "Network Robustness and Fragility: Percolation on Random Graphs,"
Physical Rev. Letters, vol. 85, no. 25, pp. 5468-5471, Dec. 2000.- [14] P. Holme, B.J. Kim, C.N. Yoon, and S.K. Han, "Attack Vulnerability of Complex Networks,"
Physical Rev. E, vol. 65, no. 5, May 2002.- [15] P. Crucitti, V. Latora, M. Marchiori, and A. Rapisarda, "Error and Attack Tolerance of Complex Networks,"
Physica A, vol. 340, pp. 388-394, 2004.- [16] V. Latora and M. Marchiori, "Efficient Behavior of Small-World Networks,"
Physical Rev. Letters, vol. 87, no. 19, Oct. 2001.- [17] P. Eugster, R. Guerraoui, A.M. Kermarrec, and L. Massoulie, "From Epidemics to Distributed Computing,"
Computer, vol. 37, no. 5, pp. 60-67, May 2004.- [18] M. Musolesi and C. Mascolo, "Controlled Epidemic-Style Dissemination Middleware for Mobile Ad Hoc Networks,"
Proc. Third Ann. Int'l Conf. Mobile and Ubiquitous Systems: Networks and Services (MOBIQUITOUS '06), July 2006.- [19] A.E.F. Clementi and C. Macci, and A. Monti, and F. Pasquale, and R. Silvestri, "Flooding Time in Edge-Markovian Dynamic Graphs,"
Proc. 27th ACM Symp. Principles of Distributed Computing (PODC '08), Aug. 2008.- [20] S. Hwang and D. Kim, "Markov Model of Link Connectivity in Mobile Ad Hoc Networks,"
Telecomm. Systems, vol. 34, no. 1, pp. 51-58, 2007.- [21] A. Medina, G. Gursun, P. Basu, and I. Matta, "On the Universal Generation of Mobility Models,"
Proc. IEEE/ACM Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS '10), Aug. 2010.- [22] M. Piorkowski, N. Sarafijanovic-Djukic, and M. Grossglauser, "CRAWDAD Data Set Epfl/Mobility (v. 2009-02-24)," http://crawdad.cs.dartmouth.edu/epflmobility , Feb. 2009.
- [23] A. Chaintreau, J.Y. Le Boudec, and N. Ristanovic, "The Age of Gossip: Spatial Mean Field Regime,"
Proc. 11th Int'l Joint Conf. Measurement and Modeling of Computer Systems (SIGMETRICS 2009), pp. 109-120, 2009.- [24] L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System,"
Comm. ACM, vol. 21, no. 7, pp. 558-565, 1978. |