{"title":"Performance modelling and evaluation of k-ary n-cube networks in the presence of bursty traffic","authors":"G. Min, M. Ould-Khaoua","doi":"10.1109/MASCOT.2002.1167099","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167099","url":null,"abstract":"The paper presents a more realistic performance model for k-ary n-cube networks under bursty traffic. The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments of the actual systems. The proposed model is then used to investigate the implications of bursty traffic on network performance. The results reveal that the performance of k-ary n-cubes degrades considerably in the presence of bursty traffic, stressing the great need for new network architectures that can efficiently support this type of traffic. This study also shows that increasing the number of virtual channels can reduce the impact of bursty traffic and thus improve network performance.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130907065","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":"Gap-based modeling of packet losses over the Internet","authors":"Hyungkeun Lee, P. Varshney","doi":"10.1109/MASCOT.2002.1167113","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167113","url":null,"abstract":"In packet-switching networks such as the Internet, packet losses occur due to temporary overload situations of shared resources. An accurate model of the packet loss behavior is required to design effective schemes for packet loss recovery. In this paper, we propose the employment of a Markov gap model to model the packet loss process. The results indicate that the Markov gap model is more accurate than other Markov chain models.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131903901","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":"A tool based methodology for development of automatically scalable and reusable parallel code","authors":"V. Murthi, D. Levine, B. Shirazi, J. Marquis","doi":"10.1109/MASCOT.2002.1167094","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167094","url":null,"abstract":"Program performance may be improved by efficiently programming some key sections of the software. We present a methodology for converting selected portions of source code into automatically scalable multithreaded routines, without forcing programmers to concentrate on parallel programming issues. These developed routines can be reused across various projects, operating systems and system architectures. To support this methodology two separate but tightly coupled tools have been developed -PARSA/sup (TM)/ software development environment (SDE) and the ThreadMan/sup (TM)/ thread manager. The SDE addresses programming issues by allowing a graphical object based approach to develop multithreaded routines that abstracts the users from parallel programming. ThreadMan manages the software developed using SDE. ThreadMan is a user-level thread manager that automatically spawns and schedules threads at runtime. Two examples have been developed using this methodology to demonstrate that there is virtually no degradation in performance when compared to sequential code, in a single processor system and scalability is achieved as the number of processors is increased.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115339639","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":"Understanding the object retrieval dependence of Web page access","authors":"Chi-Hung Chi, Xiang Li, Kwok-Yan Lam","doi":"10.1109/MASCOT.2002.1167102","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167102","url":null,"abstract":"We propose a chunk-level client's latency dependence model (C-LDM) to describe the effect of network protocol, streaming data transfer mechanism, and Web page structure on the latency perceived by a Web client. Object retrieval latency is made up of four components: (i) definition - finding the definition of embedded objects in a page; (ii) queuing - waiting for object request dissemination into the network once its existence is defined; (iii) connection - setting up a network connection for data transfer; (iv) chunk transfer - transferring actual data from server to client once the connection is setup. We show that for typical network connectivity, a user's perceived page latency is mainly due to the definition and queuing of embedded object requests inside a Web page, which are related to the content structure of a Web page and the parallelism width of the browser for object fetching. Such understanding is important because it opens opportunities to improve the retrieval speed of Web surfing through the minimization of data chunk dependence.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116244074","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":"A model of TCP in wide area networks","authors":"Sophie Fortin, B. Sericola","doi":"10.1109/MASCOT.2002.1167107","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167107","url":null,"abstract":"This paper presents a discrete-time Markov chain model for the Reno version of TCP the transmission control protocol for reliable transport on the Internet. The purpose is the evaluation of stationary TCP flows behavior using performance measures such as the mean throughput. The model is based on previous works which are generalized by taking into account the slow start phases that appear after each time-out recovery, the importance of which is discussed.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129475004","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":"eModel: addressing the need for a flexible modeling framework in autonomic computing","authors":"Catherine H. Crawford, A. Dan","doi":"10.1109/MASCOT.2002.1167078","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167078","url":null,"abstract":"The paper describes a novel, flexible framework, eModel, designed to address the runtime requirements of autonomic computing: on-line workload measurement, analysis, and prediction. The eModel architecture has been developed using platform independent technology (XML and Java) to allow for maximum portability while also allowing for ease-of-integration with existing measurement and system management tools. The eModel toolkit consists of a GUI based model builder tool, a data base deployment tool, a runtime tool, and an analysis tool. In addition to the toolkit, the eModel design provides a runtime architecture which can be deployed directly without using any interaction with the GUI. The architecture is flexible enough to allow for incorporation with models of various complexity, including modeling techniques that require a hierarchical approach to attain reasonable accuracy based upon on-line, measured data. We present examples that illustrate eModel as a capacity planning tool as well as an augmentation to autonomic system management in an effort to highlight the technological gaps that the eModel framework is capable of bridging.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128985422","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 interference in a wireless link with frequency hopping","authors":"B. Kraimeche, C. Mantelis","doi":"10.1109/MASCOT.2002.1167090","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167090","url":null,"abstract":"We analyze the effect of interference on traffic performance in a fixed wireless access system that uses frequency hopping (FH). The system consists of an access device that buffers traffic for transmission over N FH channels. The N FH channels are subject to random interference, hence characterized by different bit error rates (BERs). We show that, compared to a purely random FH, an adaptive FH that adjusts its hopping probabilities according to the interference condition of the target channel, can improve significantly the performance of the system, when this latter is subject to random interference. In addition, we develop an approximation methodology to model FH when interference is uniform or non-uniform throughout the N channels. By comparison to an exact analysis, the approximate models are shown to be quite accurate in evaluating system performance.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130633278","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":"Evaluating advanced routing algorithms for content-based publish/subscribe systems","authors":"Gero Mühl, Ludger Fiege, F. Freiling, A. Buchmann","doi":"10.1109/MASCOT.2002.1167074","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167074","url":null,"abstract":"We present an evaluation of advanced routing algorithms for content-based publish/subscribe systems that focuses on the inherent characteristics of routing algorithms (routing table sizes and filter forwarding overhead) instead of system-specific parameters (CPU load etc.). The evaluation is based on a working prototype instead of simulations and compares several routing algorithms to each other. Moreover, the effects of locality among the interests of the consumers are investigated. The results offer new insights into the behavior of content-based routing algorithms. Firstly, advanced routing algorithms can be considered mandatory in large-scale publish/subscribe systems. Secondly, the use of advertisements considerably improves scalability. Thirdly, advanced routing algorithms operate efficiently in more dynamic environments than was previously thought. Finally, the good behavior of the algorithms improves even if the interests of the consumers are not evenly distributed, which can be expected in practice.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126030931","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":"Statistical service assurances for applications in utility grid environments","authors":"J. Rolia, Xiaoyun Zhu, M. Arlitt, A. Andrzejak","doi":"10.1109/MASCOT.2002.1167084","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167084","url":null,"abstract":"We focus on techniques to support admission control and advance resource reservation for applications acquiring information technology (IT) resources from utility grid environments. Utility grid environments offer programmatic access to resources for complex multi-tier applications. In particular we consider business applications which require resources continuously but that have resource demands that change regularly based on factors such as time of day and day of week. We present a statistical demand profile approach for characterizing time varying application resource requirements along with a method that provides statistical assurances regarding the number of resources needed to satisfy the combined requirements of many applications over time. We illustrate the feasibility of our approach with a case study that uses resource utilization information from 48 data center servers. Simulation experiments explore the sensitivity of the assurances to correlations between application resource demands and the precision of the demand profiles.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133621814","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":"Distributed simulation of dynamic channel access protocols","authors":"C. Cismasu, C. Tropper","doi":"10.1109/MASCOT.2002.1167093","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167093","url":null,"abstract":"We make use of time warp for the distributed simulation of a dynamic channel allocation scheme known as channel segregation. Channel segregation requires that signal strength computation be made continuously, imposing a heavy load on the simulation. We compare the performance of the channel segregation algorithm to a fixed channel allocation algorithm. The main objective of our experiments was to determine limitations on our ability to make use of distributed simulation for wireless networks.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115295058","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}