{"title":"Allocation and Admission Policies for Service Streams","authors":"M. Mazzucco, I. Mitrani, M. Fisher, P. McKee","doi":"10.1109/MASCOT.2008.4770575","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770575","url":null,"abstract":"A service provisioning system is examined, where a number of servers are used to offer different types of services to paying customers. A customer is charged for the execution of a stream of jobs; the number of jobs in the stream and the rate of their submission is specified. On the other hand, the provider promises a certain quality of service (QoS), measured by the average waiting time of the jobs in the stream. A penalty is paid if the agreed QoS requirement is not met. The objective is to maximize the total average revenue per unit time. Dynamic policies for making server allocation and stream admission decisions are introduced and evaluated. The results of several simulations are described.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115370859","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}
{"title":"Operational Analysis of Parallel Servers","authors":"T. Kelly, Kai Shen, A. Zhang, Christopher Stewart","doi":"10.1109/MASCOT.2008.4770569","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770569","url":null,"abstract":"Multicore processors promise continued hardware performance improvements even as single-core performance flattens out. However they also enable increasingly complex application software that threatens to obfuscate application-level performance. This paper applies operational analysis to the problem of understanding and predicting application-level performance in parallel servers. We present operational laws that offer both insight and actionable information based on lightweight passive external observations of black-box applications. One law accurately infers queuing delays; others predict the performance implications of expanding or reducing capacity. The former enables improved monitoring and system management; the latter enable capacity planning and dynamic resource provisioning to incorporate application-level performance in a principled way. Our laws rest upon a handful of weak assumptions that are easy to test and widely satisfied in practice. We show that the laws are broadly applicable across many practical CPU scheduling policies. Experimental results on a multicore network server in an enterprise data center demonstrate the usefulness of our laws.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126095924","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}
{"title":"Controlled Epidemic Routing for Multicasting in Delay Tolerant Networks","authors":"Muhammad Abdulla, Robert Simon","doi":"10.1109/MASCOT.2008.4770551","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770551","url":null,"abstract":"Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. DTN multicasting is a desirable feature for applications where some form of group communication is needed. In this paper, we examine multicasting in DTNs using controlled flooding schemes. Specifically, we analyze basic multicast routing schemes for fundamental performance metrics such as message delivery ratio, message delay, and buffer occupancy. Further, we study the effects of different controlled Epidemic routing schemes using TTL and message expiration times. Our experiments show that our analytical results are accurate and that with careful protocol parameter selection it is possible to achieve high delivery rates for various system scenarios.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129504482","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}
{"title":"Optimal Layered Multicast with Network Coding: Mathematical Model and Empirical Studies","authors":"A. Gopinathan, Zongpeng Li","doi":"10.1109/MASCOT.2008.4770563","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770563","url":null,"abstract":"Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them efficiently computable. While most such algorithm design assume a single file/layer being multicast, layered coding introduces new challenges into the paradigm due to its cumulative decoding nature. Layered coding is designed to handle heterogeneity in receiver capacities, and a node may decode layer k only if it successfully receives all layers in 1..k. We show that recently proposed optimization models for layered multicast do not correctly address this challenge. We argue that in order to achieve the absolute maximum throughput (or minimum cost), it is necessary to decouple application layer throughput from network layer throughput. In particular, a node should be able to receive a non-consecutive layer or a partial layer even if it cannot decode and utilize it (e.g., for playback in media streaming applications). The rationale is that nodes at critical network locations need to receive data just for helping other peers. We present a mathematical programming model that addresses the above challenges and achieves the absolute optimal performance. Simulation results show considerable throughput gain (cost reduction) compared with previous models, in a broad range of network scenarios. We further generalize our model for studying the optimal progression of layer sizes. We show that such optimization is non-convex, and apply a Simulated Annealing algorithm to solve it, with flexible trade-off between solution quality and running time.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"33 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129486044","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}
{"title":"Lifetime Estimation of Large IEEE 802.15.4 Compliant Wireless Sensor Networks","authors":"Carol J. Fung, Yanni Ellen Liu","doi":"10.1109/MASCOT.2008.4770588","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770588","url":null,"abstract":"Lifetime of a wireless sensor network is affected by key factors such as network architecture, network size, sensor node population model, data generation rate, initial battery budget, and communication protocols. We investigate accurate lifetime estimation of large sensor networks using discrete event simulation. Our experimental networks are large IEEE 802.15.4 compliant wireless sensor networks (WSNs). We take an iterative approach and obtain the ratio network lifetime over battery budget (LBR) by simulating only small budget networks. Using the converged LBR, we are able to accurately and efficiently estimate the lifetime of a network with full battery budget. Furthermore, this approach to lifetime estimation is both necessary and efficient when the network size is large.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133381577","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}
Sungmin Park, Hoyoung Jung, Hyoki Shim, Sooyong Kang, Jaehyuk Cha
{"title":"Using Non-Volatile RAM as a Write Buffer for NAND Flash Memory-based Storage Devices","authors":"Sungmin Park, Hoyoung Jung, Hyoki Shim, Sooyong Kang, Jaehyuk Cha","doi":"10.1109/MASCOT.2008.4770591","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770591","url":null,"abstract":"Recent development of next generation non-volatile memory types such as MRAM, FeRAM and PRAM provide higher commercial value to Non-Volatile RAM (NVRAM). In this paper, we suggest the utilization of small-sized, next-generation NVRAM as a write buffer to improve the overall performance of NAND flash memory-based storage systems. We propose a novel block-based NVRAM write buffer management policy, CLC. Simulation results show that the CLC policy outperforms the traditional policies.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115225378","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}
Y. Won, Jongmyeong Ban, Jaehong Min, Jungpil Hur, Sangkyu Oh, Jangsun Lee
{"title":"Efficient index lookup for De-duplication backup system","authors":"Y. Won, Jongmyeong Ban, Jaehong Min, Jungpil Hur, Sangkyu Oh, Jangsun Lee","doi":"10.1109/MASCOT.2008.4770594","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770594","url":null,"abstract":"We minimizes fingerprint management overhead (index lookup and index insert) via introducing main memory index lookup structure and workload-aware index partitioning of the index file in the storage. Backup server maintains three data structures for redundancy elimination: Header files, chunk files and fingerprint tables. These data structures altogether enables PRUNE to effectively eliminate redundancy and to perform efficient backup. We perform various experiment to measure the overhead of each tasks in backup operation and to examine the efficiency of redundancy elimination. Incremental modulo-K reduces the file chunking latency by approximately 60%. With filter based in-memory index data structure and index partitioning, PRUNE eliminates 99.4% of disk accesses involved in fingerprint management.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"688 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116186327","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}
L. N. Kannan, Niraj Agarwal, M. Tacca, A. Fumagalli
{"title":"A Markov Chain Model to Account for Multi-Rate Transmission and Node Cooperative Behavior in IEEE 802.11 Data Link Protocol","authors":"L. N. Kannan, Niraj Agarwal, M. Tacca, A. Fumagalli","doi":"10.1109/MASCOT.2008.4770568","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770568","url":null,"abstract":"This paper presents an analytical model which extends Markov Chain models previously proposed for IEEE 802.11 data link protocol. Unlike already published models, the proposed Markov Chain accounts jointly for the following three factors. First, in addition to collision, it accounts for frames that may be lost due to a low signal-to-noise ratio value at the link receiver (frame corruption). Second, it accounts for the various link transmission rate options which affect both the frame transmission time and probability of frame corruption. Third, it accounts for co-operative protocol variants of the IEEE 802.11 protocol. According to these protocols, a third node (relay) - besides the sender and receiver - may help improve the link capacity. In such a case, the active participation of the relay node must be properly captured by the analytical model. All the above factors are combined into one single Markov Chain model by leveraging a multi-dimensional approach.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122052132","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}
{"title":"An Analysis of Hard Drive Energy Consumption","authors":"A. Hylick, R. Sohan, A. Rice, Brian Jones","doi":"10.1109/MASCOT.2008.4770567","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770567","url":null,"abstract":"The increasing storage capacity and necessary redundancy of data centers and other large-scale IT facilities has drawn attention to the issue of reducing the power consumption of hard drives. This work comprehensively investigates the power consumption of hard drives to determine typical runtime power profiles. We have instrumented at a fine-grained level and present our findings which show that (i) the energy consumed by the electronics of a drive is just as important as the mechanical energy consumption; (ii) the energy required to access data is affected by physical location on a drive; and (iii) the size of data transfers has measurable effect on power consumption.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127636179","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}
{"title":"On the Stability of Best Effort Flow Control Mechanisms in On-Chip Architectures","authors":"M. S. Talebi, A. Khonsari","doi":"10.1109/MASCOT.2008.4770580","DOIUrl":"https://doi.org/10.1109/MASCOT.2008.4770580","url":null,"abstract":"In this paper we present a centralized flow control scheme in NoCs in the presence of both elastic and streaming flow traffic paradigms. We model the desired best effort (BE) source rates as the solution to an alpha-fair utility maximization problem which is constrained with link capacities while preserving guaranteed service (GS) traffic requirements at the desired level. We propose an iterative algorithm as the solution to the aforementioned problem which has the benefit of low complexity and fast convergence. We also explore the stability and convergence behavior of the proposed algorithm and prove that it is globally asymptotically stable. Such an algorithm may be implemented by a centralized controller with low computation and communication overhead.","PeriodicalId":323154,"journal":{"name":"2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126253244","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}