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

Performance evaluation of packet scheduling and synchronization algorithms for wireless multimedia systems 无线多媒体系统中分组调度和同步算法的性能评价

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.1240654

A. Boukerche, Harold Owens

引用次数: 0

NAM: a network adaptable middleware to enhance response time of Web services NAM:一种网络适应性中间件，用于提高Web服务的响应时间

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.1240651

Shahram Ghandeharizadeh, C. Papadopoulos, M. Cai, Runfang Zhou, P. Pol

{"title":"NAM: a network adaptable middleware to enhance response time of Web services","authors":"Shahram Ghandeharizadeh, C. Papadopoulos, M. Cai, Runfang Zhou, P. Pol","doi":"10.1109/MASCOT.2003.1240651","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240651","url":null,"abstract":"Web services are an emerging software technology that employ XML to share and exchange data. They may serve as wrappers for legacy data sources, integrate multiple remote data sources, filter information by processing queries (function shipping), etc. With those that interact with an end user, a fast response time might be the difference between a frustrated and a satisfied user. A Web service may employ a loss-less compression technique, e.g., Zip, XMill, etc., to reduce the size of an XML message in order to enhance its transmission time. This saving might be outweighed by the overhead of compressing the output of a Web service at a server and decompressing it at a client. The primary contribution of this paper is NAM, a middleware that strikes a compromise between these two factors in order to enhance response time. NAM decides when to compress data based on the available client and server processor speeds, and network characteristics. When compared with today's common practice to transmit the output of a Web service uncompressed always, our experimental results show NAM either provides similar or significantly improved response times (at times more than 90% improvement) with Internet connections that offer bandwidths ranging between 80 to 100 Mbps.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"23 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":"122260895","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}

引用次数: 26

Large-scale network simulation: how big? how fast? 大规模网络模拟:有多大?有多快?

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.1240649

R. Fujimoto, K. Perumalla, Alfred Park, Hao Wu, M. Ammar, G. Riley

{"title":"Large-scale network simulation: how big? how fast?","authors":"R. Fujimoto, K. Perumalla, Alfred Park, Hao Wu, M. Ammar, G. Riley","doi":"10.1109/MASCOT.2003.1240649","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240649","url":null,"abstract":"Parallel and distributed simulation tools are emerging that offer the ability to perform detailed, packet-level simulations of large-scale computer networks on an unprecedented scale. The state-of-the-art in large-scale network simulation is characterized quantitatively. For this purpose, a metric based on the number of packet transmissions that can be processed by a simulator per second of wallclock time (PTS) is used as a means to quantitatively assess packet-level network simulator performance. An approach to realizing scalable network simulations that leverages existing sequential simulation models and software is described. Results from a recent performance study are presented concerning large-scale network simulation on a variety of platforms ranging from workstations to cluster computers to supercomputers. These experiments include runs utilizing as many as 1536 processors yielding performance as high as 106 million PTS. The performance of packet-level simulations of web and ftp traffic, and denial of service attacks on networks containing millions of network nodes are briefly described, including a run demonstrating the ability to simulate a million web traffic flows in near real-time. New opportunities and research challenges to fully exploit this capability are discussed.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"69 4 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":"126108980","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}

引用次数: 207

DEVS today: recent advances in discrete event-based information technology 今天的DEVS:离散事件信息技术的最新进展

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.1240652

B. Zeigler

引用次数: 77

Performance benchmarking of dynamic Web technologies 动态Web技术的性能基准测试

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.1240668

Lance Titchkosky, M. Arlitt, C. Williamson

引用次数: 7

Scheduling parallel jobs with CPU and I/O resource requirements in cluster computing systems 在集群计算系统中调度需要CPU和I/O资源的并行作业

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.1240678

J. Abawajy, S. Dandamudi

引用次数: 12

Zone-based shortest positioning time first scheduling for MEMS-based storage devices 基于区域的mems存储设备最短定位时间优先调度

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.1240648

Bo Hong, S. Brandt, D. Long, E. L. Miller, K. Glocer, Zachary N. J. Peterson

{"title":"Zone-based shortest positioning time first scheduling for MEMS-based storage devices","authors":"Bo Hong, S. Brandt, D. Long, E. L. Miller, K. Glocer, Zachary N. J. Peterson","doi":"10.1109/MASCOT.2003.1240648","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240648","url":null,"abstract":"Access latency to secondary storage devices is frequently a limiting factor in computer system performance. New storage technologies promise to provide greater storage densities at lower latencies than is currently obtainable with hard disk drives. MEMS-based storage devices use orthogonal magnetic or physical recording techniques and thousands of simultaneously active MEMS-based read-write tips to provide high-density low-latency nonvolatile storage. These devices promise seek times 10-20 times faster than hard drives, storage densities 10 times greater, and power consumption an order of magnitude lower. Previous research has examined data layout and request ordering algorithms that are analogs of those developed for hard drives. We present an analytical model of MEMS device performance that motivates a computationally simple MEMS-based request scheduling algorithm called ZSPTF, which has average response times comparable to shortest positioning time first (SPTF) but with response time variability comparable to circular scan (C-SCAN).","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"3 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120807312","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

Quantifying the properties of SRPT scheduling 量化SRPT调度的属性

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.1240650

Mingwei Gong, C. Williamson

引用次数: 24

Markovian performance analysis of a synchronous optical packet switch 同步光分组交换机的马尔可夫性能分析

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.1240669

J. Tomasik, I. Kotuliak, T. Atmaca

引用次数: 4

Derivation of passage-time densities in PEPA models using ipc: the imperial PEPA compiler 使用ipc推导PEPA模型中的通过时间密度:帝国PEPA编译器

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.1240679

J. Bradley, N. Dingle, S. Gilmore, W. Knottenbelt

引用次数: 78