Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
A performance comparison of event calendar algorithms: an empirical approach
Software—Practice & Experience
Inside discrete-event simulation software: how it works and why it matters
Proceedings of the 29th conference on Winter simulation
Three phase simulation in Java
Proceedings of the 30th conference on Winter simulation
WSC '88 Proceedings of the 20th conference on Winter simulation
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
A two-list synchronization procedure for discrete event simulation
Communications of the ACM
Proceedings of the 32nd conference on Winter simulation
Mobile Cellular Telecommunications Systems
Mobile Cellular Telecommunications Systems
An improved events list algorithm
WSC '77 Proceedings of the 9th conference on Winter simulation - Volume 2
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Algorithms for improving the performance of optimistic parallel simulation
Algorithms for improving the performance of optimistic parallel simulation
Simulation of large ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
An efficient, unifying approach to simulation using virtual machines
An efficient, unifying approach to simulation using virtual machines
Concurrency: State Models And Java Programs
Concurrency: State Models And Java Programs
JavaTech, an Introduction to Scientific and Technical Computing with Java
JavaTech, an Introduction to Scientific and Technical Computing with Java
Java Threads
MANET simulation studies: the incredibles
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Combinatorial Optimization in Communication Networks (Combinatorial Optimization)
Combinatorial Optimization in Communication Networks (Combinatorial Optimization)
WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
Parallel and distributed simulation: traditional techniques and recent advances
Proceedings of the 38th conference on Winter simulation
Optimizing static calendar queues
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
WSEAS TRANSACTIONS on COMMUNICATIONS
MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Hi-index | 0.00 |
The physical activities of a real wireless network are represented by events which are the main components of a discrete event simulation (DES) system and are produced by its event generator during simulation time. Each network service (e.g. voice, data and video) constitutes an event for a particular mobile user. A critical component within the simulation system, called scheduler, runs by selecting the next earliest event, executing it till completion, and returning to execute the next event. Calendar queue is the state of the art implementation of the scheduler among the most popular networking simulation tools such as ns-2. However, Calendar queue time-stamping mechanism presents drawbacks in the case of complex dynamical systems, like wireless networks, where probability of events concurrency is large. In such a case sequential time-stamping of calendar queue scheduling does not reflect real network events occurrence and generation. It should be remarked that there are very few reports if any in the literature concerning research on events scheduling mechanisms in such real time systems. On the other hand, multi-threading technology offers advanced capabilities for modelling concurrent events. The main goal of this paper is to illustrate that multithreading architectures provide the means for designing efficient schedulers in the simulation of wireless networks resource allocation but, also, several critical issues such as deadlocks, synchronization and scheduling must be effectively faced. In this paper, a stable simulation model is presented based on a novel layered thread architecture and on an alternative network event scheduling mechanism, called the Priority Queue (PQ) - Time Division Multiplexing (TDM) Layered Multithreading mechanism, which supports concurrent events as compared to the state of the art approach which supports only sequential events. Moreover, specific drawbacks of the JVM multi-threading platform such as thread execution unpredictability are also faced and presented.