发布求助
文献互助 智能选刊 最新文献

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems最新文献

筛选
英文 中文
Workload characterization in Web caching hierarchies Web缓存层次结构中的工作负载表征
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167056
Guangwei Bai, C. Williamson
{"title":"Workload characterization in Web caching hierarchies","authors":"Guangwei Bai, C. Williamson","doi":"10.1109/MASCOT.2002.1167056","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167056","url":null,"abstract":"The paper uses trace-driven simulation and synthetic Web workloads to study the request arrival process at each level of a simple Web proxy caching hierarchy. The simulation results show that a Web cache reduces both the peak and the mean request arrival rate for Web traffic workloads. However, the variability of the request arrival process may either increase, decrease, or remain the same after the cache, depending on the input arrival process and the configuration of the cache. If the input request arrival process is self-similar, then the filtered request arrival process remains self-similar, though with reduced mean. Furthermore, the superposition of Web request streams from multiple child caches results in a bursty aggregate request stream. Finally, we find that a gamma distribution provides a flexible means of modeling the request arrival count distribution in hierarchical Web caching architectures.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"37 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":"123668942","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}
引用次数: 16
A discrete-time model of TCP Reno with background traffic interference 考虑背景交通干扰的TCP Reno离散时间模型
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167106
A. Kamal
{"title":"A discrete-time model of TCP Reno with background traffic interference","authors":"A. Kamal","doi":"10.1109/MASCOT.2002.1167106","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167106","url":null,"abstract":"This paper introduces a discrete-time model which captures the essential protocol features of the congestion control mechanism used by the TCP Reno protocol, subject to interference from other sources. Under this model, a single target session is modeled according to the TCP Reno mechanism, including fast retransmit and fast recovery. At the same time, other sources are modeled as a background process using a modified discrete batch Markov arrival process. In order to capture all the TCP Reno protocol features, two levels of Markov process modeling are used: a microscopic level, at the packet transmission time boundaries, and a macroscopic one, at the start of the new transmission windows. Several performance measures are derived, and numerical examples which demonstrate the protocol features are presented.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"6 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":"123922880","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}
引用次数: 3
Shaman: a distributed simulator for shared memory multiprocessors Shaman:用于共享内存多处理器的分布式模拟器
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167095
H. Matsuo, Shigeru Imafuku, K. Ohno, H. Nakashima
{"title":"Shaman: a distributed simulator for shared memory multiprocessors","authors":"H. Matsuo, Shigeru Imafuku, K. Ohno, H. Nakashima","doi":"10.1109/MASCOT.2002.1167095","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167095","url":null,"abstract":"The paper describes Shaman, our distributed architectural simulator of shared memory multiprocessors (SMP). The simulator runs on a PC cluster that consists of multiple front-end nodes to simulate the instruction level behavior of a target multiprocessor in parallel and a back-end node to simulate the target memory system. The front-end also simulates the logical behavior of the shared memory using a software DSM (distributed shared memory) technique and generates memory references to drive the back-end. A remarkable feature of our simulator is reference filtering to reduce the amount of the references transferred from the front-end to the back-end utilizing the DSM mechanism and coherent cache simulation on the front-end. This technique and our sophisticated DSM implementation give an extraordinary performance to the Shaman simulator. We achieved 335 million and 392 million simulation clock per second for LU decomposition and FFT in SPLASH-2 kernel benchmarks respectively, when we used 16 front-end nodes to simulate a 16-way target SMP.","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":"130742394","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}
引用次数: 6
A self-sizing framework for adaptive resource allocation in label-switched networks 标签交换网络中自适应资源分配的自调整框架
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167111
W. Shen, M. Devetsikiotis
{"title":"A self-sizing framework for adaptive resource allocation in label-switched networks","authors":"W. Shen, M. Devetsikiotis","doi":"10.1109/MASCOT.2002.1167111","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167111","url":null,"abstract":"For adaptive resource allocation to maintain its crucial timing requirements in large-scale networks, fast analysis and synthesis algorithms are required in order to process freshly collected traffic data. In this paper we build on previous work to introduce a general measurement-based self-sizing framework for resource allocation in label-switched networks. Furthermore, we study the scaling behavior of the simulated annealing variant used in the analysis and synthesis algorithm. We propose a hierarchical approach to improve adaptation performance for large networks and include extensive simulation results indicating significant improvement in performance as networks get larger.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"10 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":"116936232","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}
引用次数: 9
Cone clustering principles for parallel logic simulation 并行逻辑仿真的锥体聚类原理
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167064
K. Hering, R. Reilein, S. Trautmann
{"title":"Cone clustering principles for parallel logic simulation","authors":"K. Hering, R. Reilein, S. Trautmann","doi":"10.1109/MASCOT.2002.1167064","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167064","url":null,"abstract":"Parallelization following the replicated worker principle can significantly accelerate functional logic simulation of microprocessor structures. Successful application of this method strongly depends on circuit model partitioning. We have developed a hierarchical partitioning strategy with prepartitioning and main partitioning as core phases that appear as bottom-up cone clustering. Cones can be seen as special areas of combinational logic which have the ability to directly influence storing or output elements of a circuit model under consideration. We describe and compare three of our cone clustering techniques which are based on a formal model of parallel logic simulation. Experimental results are given with respect to IBM processor structures ranging in their size from several hundred thousand to several million basic elements at a mixture of register-transfer- and gate level.","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":"122819096","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}
引用次数: 4
Queueing analysis of delays in Bluetooth slave/slave bridge 蓝牙从/从网桥延迟的排队分析
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167072
V. Mišić, J. Misic
{"title":"Queueing analysis of delays in Bluetooth slave/slave bridge","authors":"V. Mišić, J. Misic","doi":"10.1109/MASCOT.2002.1167072","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167072","url":null,"abstract":"The performance of a Bluetooth scatternet with a slave/slave bridge is analyzed using queueing theory tools and through simulations. The exhaustive service discipline is found to provide lower values for all delay variables, over a wide range of parameter values. All analytical results have been confirmed through simulations.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"248 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":"123031084","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}
引用次数: 6
Analyzing the short-term fairness of IEEE 802.11 in wireless multi-hop radio networks IEEE 802.11标准在无线多跳网络中的短期公平性分析
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167070
C. Barrett, M. Marathe, D. C. Engelhart, A. Sivasubramaniam
{"title":"Analyzing the short-term fairness of IEEE 802.11 in wireless multi-hop radio networks","authors":"C. Barrett, M. Marathe, D. C. Engelhart, A. Sivasubramaniam","doi":"10.1109/MASCOT.2002.1167070","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167070","url":null,"abstract":"We extensively analyze the short (and long) term fairness performance of wireless ad hoc networks. Recently the fairness of the MAC layer of such systems has been studied. The primary goal of our study is to investigate how multi-hop routing in an ad hoc network affects the fairness of the MAC layer. We demonstrate that higher-level protocols must also be considered when studying fairness. We analyze the behavior of a network using DSR (dynamic source routing) and DSDV as ad hoc routing protocols. The MAC layer used is IEEE 802.11. The study is carried out for a wide range of independent parameters. These include: (i) network topology; (ii) the number of connections and their spatial location; (iii) the injection rate and burstiness of individual connections. We also study the correlation between fairness and reception ratio.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"36 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":"114856540","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}
引用次数: 53
WebTraff: a GUI for Web proxy cache workload modeling and analysis WebTraff:一个用于Web代理缓存工作负载建模和分析的GUI
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167096
Nayden Markatchev, C. Williamson
{"title":"WebTraff: a GUI for Web proxy cache workload modeling and analysis","authors":"Nayden Markatchev, C. Williamson","doi":"10.1109/MASCOT.2002.1167096","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167096","url":null,"abstract":"The paper describes an interactive graphical user interface (GUI) that can be used for the modeling and analysis of Web proxy workloads. The WebTraff GUI has three main components. First, the WebTraff tool provides a visual front-end to ProWGen, a Web proxy workload generation tool developed in prior work (see Busari, M. and Williamson, C., Computer Networks, vol.38, no.6, p.779-94, 2002), which can be used for generating synthetic Web proxy workloads of arbitrary length, with user-specified statistical properties. Second, the WebTraff GUI provides tools for the analysis of Web proxy workload characteristics, including document size distribution, document popularity profile, and temporal locality properties. Third, the GUI provides a front-end to a simple Web proxy cache simulation program, which can be used in studies of Web proxy cache performance and cache filter effects.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"39 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":"127131273","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}
引用次数: 50
A new mechanism for supporting differentiated services in cluster-based network servers 在基于集群的网络服务器中支持差异化服务的新机制
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167104
Jian Zhang, T. Hämäläinen, J. Joutsensalo
{"title":"A new mechanism for supporting differentiated services in cluster-based network servers","authors":"Jian Zhang, T. Hämäläinen, J. Joutsensalo","doi":"10.1109/MASCOT.2002.1167104","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167104","url":null,"abstract":"As the Web is becoming a medium widely used as a preferential channel for critical information exchange, business, and e-commerce, it is necessary to enable differentiated service (DiffServ) mechanisms not only at the network but also at the Web server level. We present a new service differentiation mechanism (arrival-related dynamic partitioning) for cluster-based network servers. We demonstrate by simulation that it can guarantee that customers with higher priority classes receive better service than ones with lower priority classes and achieve the basic goals with service differentiation, especially when the system is heavily loaded with not enough server resources to allocate. An admission control mechanism is also provided to prevent a Web site from being overwhelmed by excessive user requests.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"17 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131752157","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}
引用次数: 14
Variable heavy tailed durations in Internet traffic. Part I. Understanding heavy tails 互联网流量的可变重尾持续时间。第一部分理解重尾
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167059
Félix Hernández-Campos, J. Marron, F. D. Smith, G. Samorodnitsky
{"title":"Variable heavy tailed durations in Internet traffic. Part I. Understanding heavy tails","authors":"Félix Hernández-Campos, J. Marron, F. D. Smith, G. Samorodnitsky","doi":"10.1109/MASCOT.2002.1167059","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167059","url":null,"abstract":"The paper is part of a larger paper (see Hernandez-Campos, F. et al., http://www.cs.unc.edu/Research/dirt/proj/marron/VarHeavyTails, 2002) that studies the tails of the duration distribution of Internet data flows, and their \"heaviness\". Data analysis motivates the concepts of moderate, far and extreme tails for understanding the richness of information available in the data. The analysis also motivates a notion of \"variable tail index\", which leads to a generalization of existing theory for heavy tail durations leading to long range dependence. The emphasis here is on understanding heavy tails.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"80 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":"126910050","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}
引用次数: 33
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信