A Generic Optimized Time Management Algorithms (OTMA) Framework for Simulating Large-Scale Overlay Networks

被引:0
|
作者
Rizvi, Syed S. [1 ]
Elleithy, Khaled M. [1 ]
机构
[1] Univ Bridgeport, Dept Comp Sci, Bridgeport, CT 06604 USA
关键词
Distributed algorithms; discrete-event simulation; overlay networks; synchronization algorithms;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recent evolutions in wireless networks will require more efficient use of the underlying parallel discrete-event simulation (PDES) synchronization protocols to accommodate the demand for large-scale network simulation. In this paper, we investigate underlying synchronization protocols to improve the performance of large-scale network simulators operating over PDES systems. We begin by proposing a generic optimized time management algorithms (OTMA) framework that combines the improved forms of synchronization protocols on a single platform. Particularly, for the proposed OTMA framework, we use the layered architecture approach to combine the optimized forms of conservative and optimistic time management algorithms. To support the implementation of the OTMA framework, a new m-LP (logical process) simulation model is proposed along with the varying parameters network topology that can show the implementation of different components of discrete-event simulation (DES).
引用
收藏
页码:27 / 34
页数:8
相关论文
共 50 条
  • [1] OnRipple: A distributed overlay framework for targeted immunization in large-scale networks
    Yang, Sirui
    Jin, Hai
    Liao, Xiaofei
    Yao, Hong
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 911 - +
  • [2] Very large-scale neighborhood search algorithms for the design of service overlay networks
    Elias, Jocelyne
    Martignon, Fabio
    Carello, Giuliana
    TELECOMMUNICATION SYSTEMS, 2012, 49 (04) : 391 - 408
  • [3] Very large-scale neighborhood search algorithms for the design of service overlay networks
    Jocelyne Elias
    Fabio Martignon
    Giuliana Carello
    Telecommunication Systems, 2012, 49 : 391 - 408
  • [4] Decentralized Ranking in Large-Scale Overlay Networks
    Montresor, Alberto
    Jelasity, Mark
    Babaoglu, Ozalp
    SASOW 2008: SECOND IEEE INTERNATIONAL CONFERENCE ON SELF-ADAPTIVE AND SELF-ORGANIZING SYSTEMS WORKSHOPS, PROCEEDINGS, 2008, : 208 - +
  • [5] Network-aware service placement and selection algorithms on large-scale overlay networks
    Famaey, J.
    Wauters, T.
    De Turck, F.
    Dhoedt, B.
    Demeester, P.
    COMPUTER COMMUNICATIONS, 2011, 34 (15) : 1777 - 1787
  • [6] Robust aggregation protocols for large-scale overlay networks
    Montresor, A
    Jelasity, M
    Babaoglu, O
    2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 19 - 28
  • [7] Ordered slicing of very large-scale overlay networks
    Jelasity, Mark
    Kermarrec, Anne-Marie
    SIXTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2006, : 117 - +
  • [8] Fighting erosion in dynamic large-scale overlay networks
    Baldoni, R.
    Bonomi, S.
    Querzoni, L.
    Rippa, A.
    Piergiovanni, S. Tucci
    Virgillito, A.
    21ST INTERNATIONAL CONFERENCE ON ADVANCED NETWORKING AND APPLICATIONS, PROCEEDINGS, 2007, : 110 - +
  • [9] Simulating large-scale networks with analytical models
    Scheidegger, M
    Baumgartner, F
    Braun, T
    ASMTA 2004: 11TH INTERNATIONAL CONFERENCE ON ANALYTICAL AND STOCHASTIC MODELLING TECHNIQUESAND APPLICATIONS, PROCEEDINGS, 2004, : 215 - 220
  • [10] Optimized Routing for Large-Scale InfiniB and Networks
    Hoefler, Torsten
    Schneider, Timo
    Lumsdaine, Andrew
    2009 17TH IEEE SYMPOSIUM ON HIGH-PERFORMANCE INTERCONNECTS (HOTI 2009), 2009, : 103 - 111