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

筛选
英文 中文
TCP performance analysis of CDMA systems with RLP and MAC layer retransmissions 具有RLP和MAC层重传的CDMA系统的TCP性能分析
Haitao Lin, Sajal K. Das
{"title":"TCP performance analysis of CDMA systems with RLP and MAC layer retransmissions","authors":"Haitao Lin, Sajal K. Das","doi":"10.1109/MASCOT.2002.1167091","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167091","url":null,"abstract":"Providing Internet services is very important in 3G networks. TCP is the transport layer protocol used by the majority of the applications on the Internet. We studied the performance of TCP when utilizing link layer retransmission (e.g. RLP in IS95 and IS2000) and MAC layer retransmission in CDMA system. There is not much work on how retransmissions in these layers can work together and how the performance of TCP with RLP and MAC retransmissions would be. We propose an analytical model for RLP performance when MAC retransmission is presented in this architecture. We also studied the performance of TCP based on RLP and MAC with extensive simulation experiments. We study in detail the interactions between different layers and characterize the performance using delay distributions and throughput. Our results show significant improvement in TCP performance with MAC layer retransmission. For example, for a packet loss rate of 0.1, the TCP packet delay is reduced by 20.94%, and the throughput is increased by 39.57%.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"12 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":"114419598","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
Faster network design with scenario pre-filtering 更快的网络设计与场景预滤波
Debojyoti Dutta, Ashish Goel, J. Heidemann
{"title":"Faster network design with scenario pre-filtering","authors":"Debojyoti Dutta, Ashish Goel, J. Heidemann","doi":"10.1109/MASCOT.2002.1167083","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167083","url":null,"abstract":"The design and engineering of networks requires the consideration of many possible configurations (different network topologies, bandwidths, traffic and policies). Network engineers may use network simulation to evaluate changes in network configuration; but detailed, packet-level simulation of many alternatives would be extremely time consuming. This paper introduces the concept of scenario pre-filtering - rather than perform detailed simulation of each scenario, we propose to quickly evaluate (pre-filter) all scenarios in order to select only the relevant scenarios, and discard those that are clearly too over- or under-provisioned. To rapidly evaluate scenarios, we have developed several new analytical techniques to quickly determine the steady-state behavior of the network with both bulk and short term TCP flows. These techniques apply to arbitrary topologies and routers that use both drop-tail and RED queuing policies. Since we are only interested in selecting the interesting scenarios for detailed simulation, the answers need only be approximate. However we show that the accuracy is typically within 10% of detailed simulation. More importantly, these techniques are 10-300/spl times/ faster than detailed simulation, and, hence, pre-filtering is a promising technique to reduce the total simulation time when many scenarios must be considered.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"23 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":"127740817","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
Analytical modeling of optical burst switching with fiber delay lines 光纤延迟线光突发交换的解析建模
Xiaomin Lu, B. L. Mark
{"title":"Analytical modeling of optical burst switching with fiber delay lines","authors":"Xiaomin Lu, B. L. Mark","doi":"10.1109/MASCOT.2002.1167112","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167112","url":null,"abstract":"We develop a performance model for an optical burst switch employing fiber delay lines (FDLs) to enhance system performance. An M/M/k queueing model with balking is derived to predict the system behavior for both classless and prioritized traffic. Simple closed-form expressions are obtained for the burst loss probability of classless traffic. Using a conservation relation, the balking model is extended to model the performance of prioritized traffic classes. A discrete event-driven simulator is constructed to verify the accuracy of the proposed models. Numerical results show that the classless model fits simulation results very well. The model for prioritized traffic provides an accurate fit for the performance of the highest traffic class and lower bounds for the other traffic classes that are tighter than earlier known results.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"25 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":"134035577","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}
引用次数: 13
An architectural infrastructure and topological optimization for end system multicast 端系统组播的体系结构和拓扑优化
Starsky H. Y. Wong, John C.S. Lui
{"title":"An architectural infrastructure and topological optimization for end system multicast","authors":"Starsky H. Y. Wong, John C.S. Lui","doi":"10.1109/MASCOT.2002.1167110","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167110","url":null,"abstract":"Although IP-multicast has been proposed and investigated for the some time, there are major problems inherent in the IP-multicasting technique, for example, scalability problems, difficulty to allocate a globally unique multicast address, complexity to support higher level features such as reliable data transfer congestion/flow control and security, and more importantly, deployment problem due to architectural changes to core routers. Recently, end-system multicast (ESM) has been proposed as an alternative solution so that multicasting services can be quickly deployed. In this paper we consider the \"architectural\" and \"optimization \" issues on designing an ESM-tree. Specifically, we present a distributed algorithm on how to create and maintain an ESM-tree. We also propose a distributed algorithm to perform a tree optimization (TO) so that an ESM-tree can dynamically adapt to the changing network condition (e.g., drop in transfer bandwidth) so that nodes can receive the multicast data more efficiently. The propose distributed algorithm has the theoretical properties that at all times, a tree-topology can be maintained and that any node joining, leaving, as well as any tree optimization operation will not \"partition\" an ESM-tree. Therefore, our work can be used to provide an efficient architectural infrastructure for ESM services. We have implemented a prototype ESM system and carried out experiments to illustrate the effectiveness and performance of our ESM optimization protocol.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"258 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":"133137979","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
Generation of high bandwidth network traffic traces 生成高带宽网络流量轨迹
P. Kamath, Kun-Chan Lan, J. Heidemann, J. Bannister, J. Touch
{"title":"Generation of high bandwidth network traffic traces","authors":"P. Kamath, Kun-Chan Lan, J. Heidemann, J. Bannister, J. Touch","doi":"10.1109/MASCOT.2002.1167101","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167101","url":null,"abstract":"High bandwidth network traffic traces are needed to understand the behavior of high speed networks (such as the Internet backbone). However, the implementation of a mechanism to collect such traces is difficult in practice. In the absence of real traces, tools to generate high bandwidth traces would aid the study of high speed network behavior. We describe three methods of generating high bandwidth network traces: scaling low bandwidth network traffic traces; merging multiple low bandwidth traces; generating traces through simulation by scaling a structural model of real world traces. We evaluate the generated traces and discuss the advantages and disadvantages of each method. We also discuss some of the issues involved in generating traces by the structural model method.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"36 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":"123217663","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}
引用次数: 31
Integrated fluid and packet network simulations 集成流体和分组网络模拟
G. Riley, Talal M. Jaafar, R. Fujimoto
{"title":"Integrated fluid and packet network simulations","authors":"G. Riley, Talal M. Jaafar, R. Fujimoto","doi":"10.1109/MASCOT.2002.1167114","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167114","url":null,"abstract":"A number of methods exist that can be used to create simulation models for measuring the performance of computer networks. The most commonly used method is packet level simulation, which models the detailed behavior of every packet in the network, and results in a highly accurate picture of overall network behavior. A less frequently used, but sometimes more computationally efficient, method is the fluid model approach. In this method, aggregations of flows are modeled as fluid flowing through pipes, and queues are modeled as fixed capacity buckets. The buckets are connected via pipes, where the maximum allowable flow rate of fluid in the pipes represents the bandwidth of the communication links being modeled. Fluid models generally result in a less accurate picture of the network's behavior since they rely on aggregation of flows and ignore actions specific to individual flows. We introduce a new hybrid simulation environment that leverages the strong points of each of these two modeling methods. Our hybrid method uses fluid models to represent aggregations of flows for which less detail is required, and packet models to represent individual flows for which more detail is needed. The result is a computationally efficient simulation model that results in a high level of accuracy and detail in some of the flows, while abstracting away details of other flows. We show a computational speedup of more than twenty in some cases, with little reduction in accuracy of the simulation results.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"41 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":"127327390","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}
引用次数: 29
Modeling and evaluation of control flow prediction schemes using complete system simulation and Java workloads 使用完整的系统仿真和Java工作负载对控制流预测方案进行建模和评估
Tao Li, L. John, R. Bell
{"title":"Modeling and evaluation of control flow prediction schemes using complete system simulation and Java workloads","authors":"Tao Li, L. John, R. Bell","doi":"10.1109/MASCOT.2002.1167100","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167100","url":null,"abstract":"Program control flow transfer (branch) prediction is considered to be a performance hurdle and a key design issue for current and future microprocessors. Branch prediction schemes with high prediction accuracy have been proposed to support longer processor pipelines with higher frequency clocks. In the previously published literature, the design and evaluation of branch predictors have been based heavily on the simulation of only user instructions from scientific and commercial workloads written in programming languages such as C or C++. To complement the existing research, the paper presents a case study of the modeling and evaluation of advanced branch predictors using full-system simulation of Java workloads running on a commercial operating system. The contributions of the paper are: (1) the presentation of a full system simulation framework to model, simulate and evaluate the performance of a set of advanced prediction schemes on emerging Java workloads; (2) an analysis of the performance and design complexity of advanced branch predictors in the presence of full system code; (3) an accurate modeling of user/kernel branch aliasing on a wide range of branch predictors.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"34 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":"130666564","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
Workload service requirements analysis: a queueing network optimization approach 工作负载服务需求分析:一种排队网络优化方法
Li Zhang, Cathy H. Xia, M. Squillante, W. N. Mills
{"title":"Workload service requirements analysis: a queueing network optimization approach","authors":"Li Zhang, Cathy H. Xia, M. Squillante, W. N. Mills","doi":"10.1109/MASCOT.2002.1167057","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167057","url":null,"abstract":"The answers to many important performance related questions with multiclass queueing models depends upon having estimates for the service times of different classes of jobs. We present a general approach to infer the per-class service times at different servers in an environment where only server throughput, utilization and per-class response time measurements are available. The per-class service times are solutions to an optimization problem with queueing-theoretic formulas in the objective and constraints. We further study the impact of the variance of service times on the variance of response times. A few case studies are presented to demonstrate the power of our approach.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"4 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":"128243627","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}
引用次数: 45
Evaluation of gossip to build scalable and reliable multicast protocols 评估八卦,以建立可扩展和可靠的多播协议
Soontaree Tanaraksiritavorn, Shivakant Mishra
{"title":"Evaluation of gossip to build scalable and reliable multicast protocols","authors":"Soontaree Tanaraksiritavorn, Shivakant Mishra","doi":"10.1109/MASCOT.2002.1167108","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167108","url":null,"abstract":"This paper provides an extensive experimental evaluation of the gossip technique that has been proposed to construct scalable and reliable multicast protocols. This evaluation has been done by simulating several gossip and non gossip-based multicast protocols in a network simulator NS2. The evaluation comprises of three parts: (1) a comparison of the gossip technique with other traditional message loss detection and recovery, techniques, (2) an extensive performance evaluation of the gossip technique under several different computing environments, and (3) an evaluation of how the performance of a gossip-based multicast protocol is affected by varying various gossip parameters. The main conclusion of the paper is that the gossip technique is certainly a useful technique for constructing scalable and reliable multicast protocols. However it performs poorly under some specific operating conditions, and its performance is affected by, the selection criteria used to select a gossip subgroup and gossip period.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"33 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":"134368083","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}
引用次数: 10
Power conservation strategies for MEMS-based storage devices 基于mems的存储设备的节能策略
Ying Lin, S. Brandt, D. Long, E. L. Miller
{"title":"Power conservation strategies for MEMS-based storage devices","authors":"Ying Lin, S. Brandt, D. Long, E. L. Miller","doi":"10.1109/MASCOT.2002.1167060","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167060","url":null,"abstract":"Power dissipation by storage systems in mobile computers accounts for a large percentage of the power consumed by the entire system. Reducing the power used by the storage device is crucial for reducing overall power consumption. A new class of secondary storage devices based on microelectromechanical systems (MEMS) promises to consume an order of magnitude less power with 10-20 times shorter latency and 10 times greater storage densities. We describe three strategies to reduce power consumption: aggressive spin-down; sequential request merging; sub-sector accesses. We show that aggressive spin-down can save up to 50% of the total energy consumed by the device at the cost of increased response time. Merging of sequential requests can save up to 18% of the servicing energy and reduce response time by about 20%. Transferring less data for small requests such as those for metadata can save 40% of the servicing energy. Finally, we show that by applying all three power management strategies simultaneously the total power consumption of MEMS-based storage devices can be reduced by about 54% with no impact on I/O performance.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"30 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":"117034703","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}
引用次数: 18
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学术官方微信