{"title":"Reducing Performance Evaluation Sensitivity and Variability by Input Shaking","authors":"Dan Tsafrir, Keren Ouaknine, D. Feitelson","doi":"10.1109/MASCOTS.2007.58","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.58","url":null,"abstract":"Simulations sometimes lead to observed sensitivity to configuration parameters as well as inconsistent performance results. The question is then what is the true effect and what is a coincidental artifact of the evaluation. The shaking methodology answers this by executing multiple simulations under small perturbations to the input workload, and calculating the average performance result; if the effect persists we can be more confident that it is real, whereas if it disappears it was an artifact. We present several examples where the sensitivity that appears in results based on a single evaluation is eliminated or considerably reduced by the shaking methodology. While our examples come from evaluations of scheduling algorithms for supercomputers, we believe the method has wider applicability.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Uncovering the Effect of System Performance on User Behavior from Traces of Parallel Systems","authors":"Edi Shmueli, D. Feitelson","doi":"10.1109/MASCOTS.2007.67","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.67","url":null,"abstract":"Intuitively, it seems that understanding how the performance of a system affects its users requires research in psychology and the conducting of live experiments. We demonstrate that it is possible to uncover the effect from traces of the system. In particular, we found that the behavior of users of parallel systems is correlated with the response time of their jobs, not the slowdown as was previously assumed. We show that response times affect the decision of users to continue or abort their interactive session with the system, and that this may relate to expectations the users develop. Although this research was conducted in the context of parallel systems, we believe our results are more general and may pertain to other types of systems as well.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117105110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Oto Pobiecky, I. Kotuliak, D. Popa, T. Atmaca, G. Hébuterne
{"title":"LOCOMOTIVE: A Hybrid Access Protocol for Bus-Based Passive Optical Networks","authors":"Oto Pobiecky, I. Kotuliak, D. Popa, T. Atmaca, G. Hébuterne","doi":"10.1109/MASCOTS.2007.31","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.31","url":null,"abstract":"A major challenge in the optical networking in the metropolitan area is the design of a robust and simple access scheme for building a flexible metro network. In this regard, we consider the bus-based approach of the Passive Optical Networks (PON) with the asynchronous CSMA/CA protocol. We present an enhancement of the CSMA/CA scheme, called LOCOMOTIVE, which takes benefit from the transparent nodes and unidirectional transmission of data signal on optical channel. Idea of the LOCOMOTIVE consists in creating trains of packets, where packets are glued one after another. As illustrated in this paper on simulation based results, the LOCOMOTIVE increases substantially the access protocol performance and achieves efficient utilization of network resources by minimizing the bandwidth fragmentation phenomenon. Index Terms-- Asynchronous optical CSMA/CA, variable length packet, shared bus, bandwidth fragmentation performance.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128698292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Markov Chain Modelling of Asynchronous Optical CSMA/CA Protocol","authors":"D. Popa, J. Tomasik","doi":"10.1109/MASCOTS.2007.44","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.44","url":null,"abstract":"This paper presents a novel model to analyze the performance of the asynchronous optical CSMA/CA protocol with variable packet sizes. The model combines Continuous Time Markov Chain (CTMC) approach and probabilistic approximation for FIFO scheduling. Realistic simulation models were developed in order to identify the difficulties in modelling CSMA/CA scheme and to show the errors introduced by the probabilistic service discipline. Although the service discipline is approximate, the proposed model includes all factors felt to be important in dimensioning the memory size at access points so as to meet access delay and throughput criteria.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130318905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Queue Length Distribution and Loss probability of Generalized Processor Sharing Systems under Multi-Class Self-Similar Traffic","authors":"X. Jin, G. Min","doi":"10.1109/MASCOTS.2007.55","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.55","url":null,"abstract":"Performance modelling of generalized processor sharing (GPS) systems in the presence of self-similar traffic has attracted significant research efforts. To simplify the interdependent relationships between traffic flows in GPS systems, most existing studies have been confined to the unrealistic scenarios where only two traffic flows are taken into account. This paper develops an analytical model for investigating both queue length distributions and loss probabilities of GPS systems subject to multi-class self-similar traffic. To this end, we present an efficient approach to decompose the complicated system based on the notion of feasible ordering of GPS systems and the empty buffer approximation. Through extensive comparisons between analytical and simulation results, we investigate the correctness of the decomposition approach and validate the accuracy of the analytical performance results.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121674723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhancing The Performance of Nonuniformly Deployed Sensor Network by Locating Bottleneck Areas for Partial Redeployment","authors":"R. Kosar, Cem Ersoy","doi":"10.1109/MASCOTS.2007.24","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.24","url":null,"abstract":"The distribution of the sensor locations may be nonuniform under some terrain imposed physical constraints or different sensing quality requirements in different parts of a wireless sensor network. Given such a nonuniformly deployed sensor network, some bottleneck areas will form soon after the network becomes operational. Those areas will severely decrease the lifetime of the network. We propose an algorithm to locate those areas prior to operation. The algorithm progressively tries to form compact clusters whose borders do not intersect. We show, using different scenarios, that by means of small redeployments over the areas that separate these clusters, we increase the lifetime considerably.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132328034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Trend-based Load Balancer for a Multi-tier Distributed System","authors":"M. Andreolini, S. Casolari, M. Colajanni","doi":"10.1109/MASCOTS.2007.66","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.66","url":null,"abstract":"The unexpected and continuous changes of the workload reaching any Internet-based service make really difficult to guarantee a balanced utilization of the server resources. In this paper, we propose a novel class of state-aware dispatching algorithms that take into account not only the present resource load but also the behavioral trend of the server load, that is, whether it is increasing, decreasing or oscillating. We apply one algorithm of this class to a multitier Web-based system and demonstrate that it is able to improve load balancing of the most critical server resources.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129490723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of Core-Assisted Routing in Opportunistic Networks","authors":"Muhammad Abdulla, R. Simon","doi":"10.1109/MASCOTS.2007.9","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.9","url":null,"abstract":"Opportunistic networks (ONs) are a newly emerging type of delay tolerant network ( DTN) systems that opportunistically exploit unplanned contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path from the source to destination may only exist for a brief and unpredictable period of time. Such network conditions present unique challenges to message routing. In this paper, we present the design and performance analysis of a novel core-based routing protocol for ON routing. Under the assumption that messages will have a delivery time constraint, we then provide a set of analytical results for rapid modeling and performance evaluation for the basic performance metrics of message delay, message delivery ratio, and buffer occupancy. We have implemented our protocol in ns-2, and our simulation results show that our protocol is quite effective and our analysis is accurate.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Simulation of Optical Ring Networks with Intermittent Transceiver Faults","authors":"P. Heegaard, W. Sandmann","doi":"10.1109/MASCOTS.2007.22","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.22","url":null,"abstract":"Failures in the optical transmission equipment degrade the quality of service (QoS) provided by networks. In this paper, we consider intermittent faults and their impact on transceivers in optical network nodes. Our focus is on the service unavailability, i.e. the probability that the average capacity is below a specified guaranteed level. Since appropriate network models become huge and the unavailability should be very small, conventional analysis methodologies are usually not suitable. Here, we present an efficient adaptive importance sampling simulation technique. The change of measure which is crucial for the successful application of importance sampling is obtained using the ant colony optimization metaheuristic inspired by the foraging behavior of ants. That way, all necessary change-of-measure parameters automatically adapt to the model without requiring in-depth knowledge and pre-analyses which thus overcomes a major drawback in non-adaptive importance sampling. Numerical results demonstrate the accuracy and efficiency of the simulation technique.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130566504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Autonomic Admission Control Policy for Distributed Web Systems","authors":"N. Bartolini, G. Bongiovanni, S. Silvestri","doi":"10.1109/MASCOTS.2007.8","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.8","url":null,"abstract":"This paper tackles the problem of autonomic admission control for web clusters. The main contribution of this work is the proposal of a new session admission algorithm that self-configures a dynamic constraint on the rate of incoming new sessions to guarantee the respect of Service Level Agreements (SLA). Unlike other approaches, our policy does not need any prior information on the incoming traffic, nor any assumption on the probability distribution of request inter-arrival or service time. Furthermore, it does not require any manual configuration or parameter tuning. We performed extensive simulations under a range of operating conditions and compared our algorithm to other previously proposed approaches. The simulations show that our policy rapidly adapts to the given traffic profile and improves service throughput while respecting the response time constraints imposed by the SLAs. It also improves service quality by reducing the oscillations of response time and number of active clients common to other policies.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121359197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}