11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.最新文献_第3页

Small-world characteristics of the Internet and multicast scaling Internet的小世界特性与组播扩展

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240670

Shudong Jin, Azer Bestavros

{"title":"Small-world characteristics of the Internet and multicast scaling","authors":"Shudong Jin, Azer Bestavros","doi":"10.1109/MASCOT.2003.1240670","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240670","url":null,"abstract":"Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Internet topologies, but also for the proper evaluation of network algorithms and protocols. Along this line, this paper tries to answer how small-world behavior arises in the Internet topologies and how it impacts the performance of multicast techniques. First, we attribute small-world behavior to two possible causes: the variability of vertex degree and the preference of vertices to have local connections. We found that both factors contribute with different relative degrees to the small-world behavior of the AS-level and router-level Internet topologies. For the AS-level topology, we have observed that extremely high variability of vertex degree is sufficient to cause small-world behavior, but for the router-level topology, preference for local connectivity plays a more important role. Second, we propose simple models to generate more realistic small-world Internet topologies. Our models consider both causes of small-world behavior. Third, we demonstrate the significance of our work by studying the scaling behavior of IP multicast tree size. We show that if topology generators capture only the variability of vertex degree, they are likely to underestimate the efficacy of multicast techniques.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119440","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}

引用次数: 7

SPEK: a storage performance evaluation kernel module for block level storage systems SPEK:用于块级存储系统的存储性能评估内核模块

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240646

Ming Zhang, Qing Yang, Xubin He

{"title":"SPEK: a storage performance evaluation kernel module for block level storage systems","authors":"Ming Zhang, Qing Yang, Xubin He","doi":"10.1109/MASCOT.2003.1240646","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240646","url":null,"abstract":"In this paper we introduce SPEK (storage performance evaluation kernel module), a benchmarking tool for measuring and characterizing raw performance of data storage systems at block level. It can be used for both DAS (direct attached storage) and block level networked storage systems. Each SPEK tool consists of a controller, several workers, and one or more probers. Each worker is a kernel module generating I/O requests to lower level SCSI layer directly. Compared to traditional file system I/O and disk I/O benchmarking tools, SPEK is highly accurate and efficient since it runs at kernel level and eliminates file system overheads. It is specially suitable for accurately measuring raw performance of data storages at block level without influence of file system cache or buffer cache. Using SPEK, a user can easily simulate realistic workloads and produce detailed profiling data for networked storage as well as DAS. We have built a prototype on Linux and our experiments have demonstrated its accuracy and efficiency in measuring block level storage systems.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316096","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

Modelling differentiated services in UMTS networks 模拟UMTS网络中的差异化服务

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240653

K. Al-Begain, I. Awan

{"title":"Modelling differentiated services in UMTS networks","authors":"K. Al-Begain, I. Awan","doi":"10.1109/MASCOT.2003.1240653","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240653","url":null,"abstract":"One of the main features of the third generation (3G) mobile networks is their capability to provide different classes of services; especially multimedia and real-time services in addition to the traditional telephony and data services. These new services, however, will require higher quality of service (QoS) constraints on the network mainly regarding delay, delay variation and packet loss. Additionally, the overall traffic profile in both the air interface and inside the network will be rather different than used to be in today's mobile networks. Therefore, providing QoS for the new services will require more than what a call admission control algorithm can achieve at the border of the network. Continuous buffer control in both the wireless and the fixed part of the network ensures that higher priority traffic is treated in the proper way. This paper proposes and analytically evaluates a buffer management scheme that is based on multilevel priority and partial buffer sharing (PBS) policy for all buffers at the border and inside the wireless network. The analytical model is based on the G/G/1/N censored queue with single server and R (R /spl ges/ 2) priority classes under the head of line (HOL) service rule for the PBS scheme. The traffic is modelled using the generalised exponential distribution. The paper presents an analytical solution based on the approximation using the maximum entropy (ME) principle. The numerical results show the capability of the space prioritised buffer management scheme to provide higher QoS for the higher priority service classes.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128100720","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}

引用次数: 2

Twotowers 3.0: enhancing usability 双塔3.0:增强可用性

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240656

M. Bernardo

引用次数: 11

Minimizing packet loss by optimizing OSPF weights using online simulation 通过在线模拟优化OSPF的权重，使丢包最小化

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240645

H. T. Kaur, Tao Ye, S. Kalyanaraman, K. Vastola

{"title":"Minimizing packet loss by optimizing OSPF weights using online simulation","authors":"H. T. Kaur, Tao Ye, S. Kalyanaraman, K. Vastola","doi":"10.1109/MASCOT.2003.1240645","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240645","url":null,"abstract":"In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using online simulation. We have chosen packet loss rate in the network as the optimization metric as it is a good indicator of congestion and impacts the performance of the underlying applications. We have formulated packet loss rate in the network in terms of the link parameters, such as bandwidth and buffer space, and the parameters of the traffic demands. A GI/M/1/K queuing model has been used to compute the packet drop probability on a given link. The problem of optimizing OSPF weights is known to be NP-hard even for the case of a linear objective function Bernard Fortz and Mikkel Thorup (2000), We use online simulation (OLS) framework T. Ye et al. (2001) to search for a good link weight setting and as a tool for automatic network management. OLS uses fast, scalable recursive random search (RRS) algorithm to search the parameter space. Our results demonstrate that the RRS takes 50-90% fewer function evaluations as compared to the local search heuristic Bernard Fortz and Mikkel Thorup (2000) of to find a \"good\" link weight setting. The amount of improvement depends on the network topology, traffic conditions and optimization metric. We have simulated the proposed OSPF optimization scheme using ns and our results demonstrate improvements of the order of 30-60% in the total packet drop rate for the traffic and topologies considered.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122640318","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}

引用次数: 23

Optimal mobility-aware admission control in content delivery networks 内容传送网络中最优移动性感知准入控制

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240664

N. Bartolini, E. Casalicchio, Salvatore Tucci

引用次数: 6

On modeling and analyzing cache hierarchies using CASPER 基于CASPER的缓存层次结构建模与分析

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240655

R. Iyer

{"title":"On modeling and analyzing cache hierarchies using CASPER","authors":"R. Iyer","doi":"10.1109/MASCOT.2003.1240655","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240655","url":null,"abstract":"The efficient use of cache hierarchies is crucial to the performance of uni-processor (desktop) and multiprocessor (enterprise) platforms. A plethora of research exists on the various structures and protocols that are of interest when considering caches. To enable the performance analysis of various cache hierarchies and associated allocation/coherence protocols, we developed a trace-driven simulation framework called CASPER - cache architecture simulation & performance exploration using refstreams. The CASPER simulation framework provides a rich set of features to model various cache organization alternatives, coherence protocols & optimizations, allocation/replacement policies, prefetching and partitioning techniques. In this paper, we describe the methodology behind CASPER, its detailed design and currently supported set of functionalities. CASPER has been used extensively for various research studies; a brief overview of some of these CASPER-based evaluation studies and their salient results will also be discussed. Based on its wide-ranging applicability, we believe CASPER is a useful addition to the performance analysis community for evaluating cache structures and hierarchies of various kinds.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126719631","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}

引用次数: 40

Quantifying the effects of recent protocol improvements to standards-track TCP 量化最近协议改进对标准的影响——跟踪TCP

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240662

Michele C. Weigle, K. Jeffay, F. D. Smith

引用次数: 6

An active traffic splitter architecture for intrusion detection 一种用于入侵检测的主动流量分配器架构

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240665

Ioannis Charitakis, K. Anagnostakis, E. Markatos

引用次数: 33

Creating realistic BGP models 创建真实的BGP模型

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI: 10.1109/MASCOT.2003.1240643

X. Dimitropoulos, G. Riley

引用次数: 34