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

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

筛选
英文 中文
Performance of batch-based digital signatures 基于批处理的数字签名性能
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.1167089
W. Cheng, Cheng-Fu Chou, L. Golubchik
{"title":"Performance of batch-based digital signatures","authors":"W. Cheng, Cheng-Fu Chou, L. Golubchik","doi":"10.1109/MASCOT.2002.1167089","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167089","url":null,"abstract":"A digital signature is an important type of authentication in a public-key (or asymmetric) cryptographic system, and it is in wide use. The performance of an Internet server computing digital signatures online is limited by the high cost of modular arithmetic. One simple way to improve the performance of the server is to reduce the number of computed digital signatures by combining a set of documents into a batch in a smart way and signing each batch only once. This reduces the demand on the CPU but requires extra information to be sent to clients. We investigate the performance characteristics of online digital signature batching schemes. We give a semi-Markov model of a gated batch-based digital signature server and its approximate solution. We validate the solutions of the analytical model through both emulation and simulation. Our study shows that significant computational benefits can be obtained from batching without significant increases in the amount of additional information that needs to be sent to the clients.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"58 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":"115285595","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
Playing with time: on the specification and execution of time-enriched LSCs 玩时间:关于时间丰富的LSCs的规格和执行
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.1167077
D. Harel, R. Marelly
{"title":"Playing with time: on the specification and execution of time-enriched LSCs","authors":"D. Harel, R. Marelly","doi":"10.1109/MASCOT.2002.1167077","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167077","url":null,"abstract":"We extend live sequence charts (LSCs), a highly expressive variant of sequence diagrams, with timing constructs, thus making the language suitable for specifying the behavioral requirements of time-intensive systems. We follow R. Alur and T.A. Henzinger (see Software Tools for Technology Transfer, vol.1, p.86-109, 1997) in basing the extension on a single clock object. We have implemented the extension in full in our play-engine tool, which provides user-friendly ways to play in the timing constraints, together with a powerful mechanism that can execute, or play out, the time-enriched requirements directly, without the need for an intra-object system model. It seems that in addition to many advantages in testing and requirements engineering, for some kinds of systems this could lead to the requirements actually serving as the final implementation.","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":"114653698","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}
引用次数: 86
DFS: a de-fragmented file system DFS:碎片化文件系统
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.1167062
W. Ahn, Kyungbaek Kim, Yongjin Choi, D. Park
{"title":"DFS: a de-fragmented file system","authors":"W. Ahn, Kyungbaek Kim, Yongjin Choi, D. Park","doi":"10.1109/MASCOT.2002.1167062","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167062","url":null,"abstract":"Small file accesses are still limited by disk head movement on modern disk drives with the high disk bandwidth. Small file performance can be improved by grouping and clustering, each of which places multiple files in a directory and places blocks of the same file on disks contiguously. These schemes make it possible for file systems to use large data transfers in accessing small files, reducing disk accesses. However, as file systems become aged, disks become too fragmented to support the grouping and clustering of small files. This fragmentation makes it difficult for file systems to take advantage of large data transfers, increasing disk I/Os. To offer a solution to this problem, we describe a de-fragmented file system (DFS). By using data cached in memory, DFS relocates and clusters data blocks of small fragmented files in a dynamic manner. Besides, DFS clusters related small files in the same directory, at contiguous disk locations. Measurements of DFS implementation show that the techniques alleviate file fragmentation significantly and, in particular performance for small file reads exceeds that of a traditional file system by 78%.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"100 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":"127117379","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}
引用次数: 21
Modeling and analysis of fast handoff algorithms for microcellular 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.1167092
A. Leu, B. L. Mark
{"title":"Modeling and analysis of fast handoff algorithms for microcellular networks","authors":"A. Leu, B. L. Mark","doi":"10.1109/MASCOT.2002.1167092","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167092","url":null,"abstract":"In urban microcellular environments, fast handoff algorithms are needed to react to sudden changes in path loss characteristics that typically occur when the mobile turns around street corners. We introduce a class of fast handoff algorithms based on a local averaging technique that removes only the fast fading component from the received signal strength. By exploiting the fact that local averaging does not substantially alter the path loss characteristics, we are able to develop an efficient and accurate numerical procedure for analyzing the performance of this new class of fast handoff algorithms. Numerical results demonstrate that the use of local averaging significantly reduces handoff delay in the presence of corner effects compared with conventional handoff algorithms. Consequently, the outage probability is reduced for the entire range of mobile speeds. Our analytical approach can be used as a tool for dimensioning fast handoff algorithms that optimize network performance in the presence of both line-of-sight and non-line-of-sight handoffs.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"27 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":"126024665","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}
引用次数: 47
Studying sensitivities of an EJB performance model 研究EJB性能模型的敏感性
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.1167087
Catalina M. Lladó, Johannes Lüthi, P. Harrison
{"title":"Studying sensitivities of an EJB performance model","authors":"Catalina M. Lladó, Johannes Lüthi, P. Harrison","doi":"10.1109/MASCOT.2002.1167087","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167087","url":null,"abstract":"Often, at the time when a performance model is built, some of its input parameters are not known exactly. This can be for a variety of reasons, such as the system itself not having been completed, a benchmarking process not yet having been carried out, or that precise estimates for the parameters are very difficult to obtain. In these situations, interval values can be used to express the uncertainties of the input parameters and sensitivity studies of performance models have the potential to show the influence of input parameter uncertainties on the resulting performance measures. We study the sensitivities of an Enterprise JavaBeans performance model. This model is built using the standard method of model decomposition which gives various submodels. Solutions obtained for these submodels have been adapted to interval parameters and hence interval-based sensitivities are studied in the so-called container submodel and then the whole model. Using these techniques, parameters that require to be characterised more carefully than others can be identified.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"44 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":"123741838","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
An algorithmic and numerical approach to bound the performance of high speed 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.1167098
M. Benmammoun, J. Fourneau, N. Pekergin, Alexis Troubnikoff
{"title":"An algorithmic and numerical approach to bound the performance of high speed networks","authors":"M. Benmammoun, J. Fourneau, N. Pekergin, Alexis Troubnikoff","doi":"10.1109/MASCOT.2002.1167098","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167098","url":null,"abstract":"Stochastic bounds and deterministic bounds (for instance network calculus) are promising methods to analyze QoS requirements for high speed networks. Indeed, it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, stochastic bounds are quite difficult to prove and often require some sample-path proofs. We present a new method based on stochastic ordering, algorithmic derivation of simpler Markov chains, and numerical analysis of these chains. The performance indices defined by reward functions are stochastically bounded by reward functions computed on much simpler or smaller Markov chains. This leads to an important reduction of numerical complexity.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"96 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":"126747637","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
A simulation study of non-cooperative pricing strategies for circuit-switched optical 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.1167085
Bobby M. Ninan, G. Kesidis, M. Devetsikiotis
{"title":"A simulation study of non-cooperative pricing strategies for circuit-switched optical networks","authors":"Bobby M. Ninan, G. Kesidis, M. Devetsikiotis","doi":"10.1109/MASCOT.2002.1167085","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167085","url":null,"abstract":"We consider a non-cooperative community of users that share a number of circuit-switched optical channels. After specifying an example user utility function that corresponds to inelastic bandwidth requirements, we study numerically the existence and nature of Nash equilibrium point(s) reached by the users, for a fixed charge per circuit per unit time imposed by the network for each successfully transmitted packet. Our numerical simulations include several cases of user demand and utility, both symmetric and asymmetric. Finally, we describe how the network could modify its chosen price to steer the users to desired aggregate throughput levels.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"231 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045688","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
nem: a software for network topology analysis and modeling Nem:网络拓扑分析和建模软件
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.1167097
D. Magoni
{"title":"nem: a software for network topology analysis and modeling","authors":"D. Magoni","doi":"10.1109/MASCOT.2002.1167097","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167097","url":null,"abstract":"The design of network protocols is greatly accelerated by the use of simulators, particularly when studying a protocol's behavior in a large internetwork topology. However the accuracy of the simulation results are heavily affected by the input network topology. As taking a real map as an input is not always feasible, artificially created topologies are often used. There are many network topology generators available, but recent discoveries about the topology of the Internet have made most of them obsolete when it comes to modeling a typical part of the Internet. The paper presents a free open source software designed for network topology analysis and modeling called network manipulator (nem). It is capable of creating realistic Internet-like topologies and it can check proof them on the fly by a thorough topology analysis. The paper especially focuses on the architecture and the capabilities of the software.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"35 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":"121347539","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}
引用次数: 51
A performance evaluation of a temporally correct and optimistic concurrency control protocol 对暂时正确且乐观的并发控制协议进行性能评估
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.1167109
A. Boukerche, Terry Tuck, Sungbum Hong
{"title":"A performance evaluation of a temporally correct and optimistic concurrency control protocol","authors":"A. Boukerche, Terry Tuck, Sungbum Hong","doi":"10.1109/MASCOT.2002.1167109","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167109","url":null,"abstract":"In this paper we focus on the temporary return of data values that are incorrect for given transactional semantics and could have catastrophic effects similar to those in parallel and discrete event simulation. In many applications using on-line transaction processing (OLTP) environments, for instance, it is best to delay the response to a transaction's read request until it is either known or unlikely that a write message from an older update transaction will not make the response incorrect. Examples of such applications are those where aberrant behavior is too costly, and those in which precommitted data are visible to some reactive entity. In light of the avoidance of risk in this approach, we propose a risk-free multiversion temporally correct (RFMVTC) concurrency control algorithm. We discuss the algorithm, its implementation and report on the performance results of simulation models using a cluster of workstations.","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":"126212911","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
Cognitive packet networks: QoS and performance 认知分组网络:QoS和性能
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.1167055
E. Gelenbe, R. Lent, A. Montuori, Zhiguang Xu
{"title":"Cognitive packet networks: QoS and performance","authors":"E. Gelenbe, R. Lent, A. Montuori, Zhiguang Xu","doi":"10.1109/MASCOT.2002.1167055","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167055","url":null,"abstract":"Reliability, security, scalability and QoS (quality-of-service) have become key issues as we envision the future Internet. The paper presents the \"cognitive packet network\" (CPN) architecture in which intelligent peer-to-peer routing is carried out with the help of \"smart packets\" based on best-effort QoS goals. Since packetized voice has stringent QoS requirements, we then discuss the choice of a \"goal\" and \"reward\" function for this application and present experiments we have conducted for \"voice over CPN\". Its performance is detailed via several measurements, and the resulting QoS is compared with that of the IP routing protocol under identical conditions showing the gain resulting from the use of CPN.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"40 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":"131481152","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}
引用次数: 116
下一页 尾页
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学术官方微信