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

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

筛选
英文 中文
Performance models for computer and telecommunications systems: maximizing the benefits 计算机和电信系统的性能模型:效益最大化
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.1167081
C. U. Smith
{"title":"Performance models for computer and telecommunications systems: maximizing the benefits","authors":"C. U. Smith","doi":"10.1109/MASCOT.2002.1167081","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167081","url":null,"abstract":"Summary form only given. Telecommunications systems were among the first to use modeling and analysis to improve designs. Since those early days, researchers have made many advances in the technology and tools. Performance models have been successfully applied to a variety of other computer systems design problems. When we consider the current state of the art and state of the practice, are we satisfied with the results? What areas need improvement? We explore these questions by first considering some of the important research issues of the past. Which have been resolved and which need further work? Have advances in technology mitigated some of the issues while exacerbating others? Next we consider the proactive application of performance models during system design to resolve problems before they occur. How extensive is this practice? How successful is it? What are the barriers to more widespread use and what can we do about it?.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"57 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":"122687921","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}
引用次数: 0
You can run, but you can't hide: an effective methodology to traceback DDoS attackers 你可以跑，但你不能隐藏:一个有效的方法来追踪DDoS攻击者
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.1167105
K. Law, John C.S. Lui, David K. Y. Yau
{"title":"You can run, but you can't hide: an effective methodology to traceback DDoS attackers","authors":"K. Law, John C.S. Lui, David K. Y. Yau","doi":"10.1109/MASCOT.2002.1167105","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167105","url":null,"abstract":"With the increase of sophistication and severity of DDoS (distributed denial of service) attack, it is important for a victim site to quickly identify the potential attackers and eliminate their traffic. Our work is based on the probabilistic marking algorithm by Savage et al. (2000) in which an attack graph can be constructed by a victim site. We extend the concept further such that we can deduce the local traffic rate of each router in the attack graph based on the received marked packets. Given the intensities of these local traffic rates, we can eliminate these attackers from sending high volumes of traffic to a victim site. More importantly, we propose a theoretical method to determine the minimum stable time t/sub min/, which is the minimum time it takes to accurately determine the local traffic rate of every participating router in the attack graph.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"42 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":"124116618","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}
引用次数: 15
Network level capacity planning with efficiently computable global optimum 具有高效可计算全局最优的网络级容量规划
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.1167082
A. Faragó
{"title":"Network level capacity planning with efficiently computable global optimum","authors":"A. Faragó","doi":"10.1109/MASCOT.2002.1167082","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167082","url":null,"abstract":"A novel, network level capacity planning model is presented with the following key properties. (1) The link level traffic and blocking model is very general. It allows multiclass traffic and the individual bandwidth demands may aggregate in complex, nonlinear ways. The conventional assumptions, such as Poisson arrivals or exponential holding times, are not required, thus allowing non-standard behaviour patterns, including self-similarity. (2) On the network level, the stochastic behavior of the links is not required to be independent. Thus, we drop the traditional link independence assumption, because it is questionable in a number of modern networking situations. (3) Surprisingly, despite the very general setting, the model yields a convex optimization problem, in which the global optimum of the capacity assignment under end-to-end blocking constraints can be found efficiently (in polynomial time).","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":"126820782","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}
引用次数: 1
Two-level iterative queuing modeling of software contention 软件争用的两级迭代排队建模
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.1167086
D. Menascé
{"title":"Two-level iterative queuing modeling of software contention","authors":"D. Menascé","doi":"10.1109/MASCOT.2002.1167086","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167086","url":null,"abstract":"Being able to model contention for software resources (e.g., a critical section or database lock) is paramount to building performance models that capture all aspects of the delay encountered by a process as it executes. Several methods have been offered for dealing with software contention and with message blocking in client-server systems. This paper presents a general, straightforward, easy to understand and implement, approach to modeling software contention using queuing networks. The approach, called SQN-HQN, consists of a two-level iterative process. Two queuing networks are considered: one represents software resources (SQN) and the other hardware resources (HQN). Multiclass models are allowed and any solution technique exact or approximate - can be used at any of the levels. This technique falls in the general category of fixed-point approximate models and is similar in nature to other approaches. The main difference lies in its simplicity. The process converges very fast in the examples examined. The results were validated against global balance equation solutions and are very accurate.","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":"126939572","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}
引用次数: 44
A self-tuning page cleaner for DB2 用于DB2的自调优页面清理器
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.1167063
Wenguang Wang, R. Bunt
{"title":"A self-tuning page cleaner for DB2","authors":"Wenguang Wang, R. Bunt","doi":"10.1109/MASCOT.2002.1167063","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167063","url":null,"abstract":"The buffer pool in a DBMS is used to cache the disk pages of the database. Because typical database workloads are I/O-bound, the effectiveness of the buffer pool management algorithm is a crucial factor in the performance of the DBMS. In IBM's DB2 buffer pool, the page cleaning algorithm is used to write changed pages to disks before they are selected for replacement. We conducted a detailed study of page cleaning in DB2 version 7.1.0 for Windows by both trace-driven simulation and measurements. Our results show that system throughput can be increased by 19% when the page cleaning algorithm is carefully tuned. In practice, however the manual tuning of this algorithm is difficult. A self-tuning algorithm for page cleaning is proposed posed in this paper to automate this tuning task. Simulation results show that the self-tuning algorithm can achieve performance comparable to the best manually tuned system.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"152 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":"126199498","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}
引用次数: 5
Global caching mechanisms in clusters of Web servers 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.1167103
M. E. Poleggi, B. Ciciani, M. Colajanni
{"title":"Global caching mechanisms in clusters of Web servers","authors":"M. E. Poleggi, B. Ciciani, M. Colajanni","doi":"10.1109/MASCOT.2002.1167103","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167103","url":null,"abstract":"We investigate how to improve Web cluster performance through cooperation protocols for a shared use of the main memories of the server nodes (global caching). Many popular schemes to locate requested documents are based upon locality information sharing (namely, informed cooperation); we also propose a novel approach for document lookup through a query broadcasting mechanism (namely, on-demand cooperation). Moreover, we consider the migration and handoff mechanisms to retrieve successfully located documents. The experimental results show that, in a static Web scenario, the on-demand with handoff scheme performs similarly to the informed with handoff scheme, whereas the on-demand with migration scheme outperforms the informed with migration scheme. On the other hand, in a scenario with some dynamic requests, on-demand cooperation experiences a significant performance degradation with respect to informed cooperation.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"52 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":"126506290","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}
引用次数: 0
A mixed abstraction level simulation model of large-scale Internet worm infestations 大规模网络蠕虫入侵的混合抽象级仿真模型
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.1167067
M. Liljenstam, Yougu Yuan, B. Premore, D. Nicol
{"title":"A mixed abstraction level simulation model of large-scale Internet worm infestations","authors":"M. Liljenstam, Yougu Yuan, B. Premore, D. Nicol","doi":"10.1109/MASCOT.2002.1167067","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167067","url":null,"abstract":"Large-scale worm infestations, such as last year's Code Red, Code Red II, and Nimda, have led to increased interest in modeling these events to assess threat levels, evaluate countermeasures and investigate possible influence on the Internet infrastructure. However the inherently large scale of these phenomena pose significant challenges for models that include infrastructure detail. We explore the use of selective abstraction through epidemiological models in conjunction with detailed protocol models as a means to scale up simulations to a point where we can ask meaningful questions regarding a hypothesized link between worms and inter-domain routing instability. We find that this approach shows significant promise, in contrast to some of our early attempts using all-out packet level models. We also describe some approaches we are taking to collect the underlying data for our models.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"67 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114123324","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}
引用次数: 109
A case study in performance, modifiability and extensibility analysis of a telecommunication system software architecture 一个电信系统软件体系结构的性能、可修改性和可扩展性分析案例研究
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.1167088
M. Castaldi, P. Inverardi, Sharareh Afsharian
{"title":"A case study in performance, modifiability and extensibility analysis of a telecommunication system software architecture","authors":"M. Castaldi, P. Inverardi, Sharareh Afsharian","doi":"10.1109/MASCOT.2002.1167088","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167088","url":null,"abstract":"We present a case study in architecture analysis. The analysis was conducted on a real system, the Ericsson product \"GSM On the Net\", in order to evaluate two alternative software architectures with respect to a set of attributes required by the customer namely extensibility, performance and modifiability. The two architectures differ because of the use of different internal protocols, session initiation protocol (SIP) versus H323, that deeply influence the structure of the system architecture.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"19 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":"123539520","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}
引用次数: 5
Performance analysis using coloured Petri nets 使用彩色Petri网进行性能分析
Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-08-01 DOI: 10.1109/MASCOT.2002.1167080
L. Wells
{"title":"Performance analysis using coloured Petri nets","authors":"L. Wells","doi":"10.1109/MASCOT.2002.1167080","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167080","url":null,"abstract":"This paper provides an overview of improved facilities for performance analysis using coloured Petri nets. Coloured Petri nets is a formal method that is well suited for modeling and analyzing large and complex systems. The paper describes steps that have been taken to make a distinction between modeling the behavior of a system and observing the behavior of a model. Performance-related facilities are discussed, including facilities for collecting data, running multiple simulations, generating statistically reliable simulation output, and comparing alternative system configurations.","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-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126291609","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}
引用次数: 62
首页 上一页
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学术官方微信