{"title":"Parallel HTTP for Video Streaming in Wireless Networks","authors":"Mohsen Ansari, Majid Ghaderi","doi":"10.1109/MASCOTS.2016.63","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.63","url":null,"abstract":"To stream video using HTTP, a client device sequentially requests and receives chunks of the video file from the server over a TCP connection. It is well-known that TCP performs poorly in networks with high latency and packet loss such as wireless networks. On mobile devices, in particular, using a single TCP connection for video streaming is not efficient, and thus, the user may not receive the highest video quality possible. In this paper, we design and analyze a system called ParS that uses parallel TCP connections to stream video on mobile devices. Our system uses parallel connections to fetch each chunk of the video file using HTTP range requests. We present measurement results to characterize the performance of ParS under various network conditions in terms of latency, loss rate and bandwidth. Given the limited communication and computational resources of mobile devices, we then focus on determining the minimum number of TCP connections required to achieve high utilization of the wireless bandwidth.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116771647","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}
Yongseok Son, Hara Kang, Jin-Yong Ha, Jongsung Lee, Hyuck Han, Hyungsoo Jung, H. Yeom
{"title":"An Empirical Evaluation of Enterprise and SATA-Based Transactional Solid-State Drives","authors":"Yongseok Son, Hara Kang, Jin-Yong Ha, Jongsung Lee, Hyuck Han, Hyungsoo Jung, H. Yeom","doi":"10.1109/MASCOTS.2016.57","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.57","url":null,"abstract":"In most file systems, performance is usually sacrificed in exchange for crash consistency, which ensures that data and metadata are restored consistently in the event of a system crash. To escape this trade-off between performance and crash consistency, recent researchers designed and implemented the transactional functionality inside Solid State Drives (SSDs). However, in order to investigate its benefit in a more realistic and standard fashion, this scheme should be re-evaluated in enterprise storage with standard interface. This paper explores the challenges and implications of a transactional SSD with extensive experiments. To evaluate the potential benefit of transactional SSD, we design and implement the transaction functionality in Samsung enterprise-class and SATA-based SSD (i.e., SM843TN) and name it TxSSD. We then modify the existing file systems (i.e., ext4 and btrfs) on topof TxSSD, making both file systems crash-consistent without redundant writes. We perform performance evaluation of two filesystems by using file I/O and OLTP benchmarks with a database. We also disclose and analyze the overhead of transactional functionality inside SSD. The experimental results show that TxSSD-aware file systems exhibit better performance compared to crash-consistent modes (i.e., data journaling mode of ext4 and cow mode of btrfs) but worse performance compared to weak consistent modes (i.e., ordered mode of ext4 and no datacow mode of btrfs).","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"1626 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984315","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":"A Diffusion Model for Energy Harvesting Sensor Nodes","authors":"O. Abdelrahman, E. Gelenbe","doi":"10.1109/MASCOTS.2016.74","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.74","url":null,"abstract":"Energy harvesting has recently attracted much interest due to the emergence of the Internet of Things, and the increasing need to operate wireless sensing devices in challenging environments without much human intervention and maintenance. This paper presents a novel approach for modeling the performance of an energy harvesting wireless sensor node, which takes into account fluctuations in the amount of energy extracted from the environment, energy loss due to battery leakage, as well as the energy cost of sensing, data processing and communication. The proposed approach departs from the common queueing-theoretic framework used in the literature, and instead uses Brownian motion to represent more accurately the time evolution of the distribution of the node's battery level. The paper derives some performance measures of interest along with the stationary solution of the system, and discusses possible directions for reducing the number of parameters and states of the model without compromising accuracy.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"33 35","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131501598","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":"Diplomat: Mapping of Multi-kernel Applications Using a Static Dataflow Abstraction","authors":"Bruno Bodin, Luigi Nardi, P. Kelly, M. O’Boyle","doi":"10.1109/MASCOTS.2016.35","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.35","url":null,"abstract":"In this paper we propose a novel approach to heterogeneous embedded systems programmability using a task-graph based framework called Diplomat. Diplomat is a task-graph framework that exploits the potential of static dataflow modeling and analysis to deliver performance estimation and CPU/GPU mapping. An application has to be specified once, and then the framework can automatically propose good mappings. We evaluate Diplomat with a computer vision application on two embedded platforms. Using the Diplomat generation we observed a 16% performance improvement on average and up to a 30% improvement over the best existing hand-coded implementation.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115327955","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":"Efficient Memory Occupancy Models for In-memory Databases","authors":"Karsten Molka, G. Casale","doi":"10.1109/MASCOTS.2016.56","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.56","url":null,"abstract":"Predicting memory occupancy during the execution of large-scale analytical workloads becomes critical for in-memory databases. In particular, probabilistic performance measures for such systems are of interest, but difficult to model with analytical methods due to the highly variable threading levels in corresponding workloads. Since literature with queueing theoretic background largely ignores the memory modeling part, we propose a new probabilistic model to capture the memory occupancy distribution in such systems. We further combine this model with our analytical formulation TP-AMVA for greater efficiency compared to simulation and evaluate against experiments using SAP HANA.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124194796","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":"Bounding Aggregations on Phase-Type Arrivals for Performance Analysis of Clouds","authors":"Farah Aït-Salaht, Hind Castel-Taleb","doi":"10.1109/MASCOTS.2016.38","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.38","url":null,"abstract":"We evaluate the performance of a cloud system using a hysteresis queueing system with phase-type and batch arrivals. To represent the dynamic allocation of the resources, the hysteresis queue activates and deactivates the virtual machines according to the threshold values of the queue length. We suppose by batches, and follow a phase-type process. This system is analyze, especially when the size of the state space increases and the length of batch arrival distribution is large. So, to solve this problem, we propose to use stochastic bounds and the performance measures and compare the proposed bounding models with the exact one. The relevance of our methodology is to offer a trade-off between computational complexity and accuracy of the results and provide very interesting solutions for network dimensioning.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132876985","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":"Online Work Distribution to Clouds","authors":"Lan Wang","doi":"10.1109/MASCOTS.2016.64","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.64","url":null,"abstract":"The Cloud supports diverse workloads and simple schemes are needed to allocate jobs with satisfactory QoS and low overhead. This paper presents a further study on the potential of an online work distribution approach in adaptively distributing workloads under variable load conditions for optimizing the two contradictory criteria: reducing the energy consumption per job while maintaining the best possible job response time. For cloud systems spanning multiple geographical regions, this paper describes a smart distributed system which deploys a Task Allocation Platform (TAP) in each cloud and takes decisions to allocate tasks dynamically to the service that offers the best overall Quality of Service. Experiments are conducted in dynamic and heterogeneous environments at the global intercontinental level, both to collect data for decision making and to illustrate the effectiveness of our approach.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133979217","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}
Guillaume Artero Gallardo, B. Baynat, Thomas Begin
{"title":"Performance Modeling of Virtual Switching Systems","authors":"Guillaume Artero Gallardo, B. Baynat, Thomas Begin","doi":"10.1109/MASCOTS.2016.22","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.22","url":null,"abstract":"Virtual switches are a key elements within the new paradigms of Software Defined Networking (SDN) and Network Function Virtualization (NFV). Unlike proprietary networking appliances, virtual switches come with a high level of flexibility in the management of their physical resources such as the number of CPU cores, their allocation to the switching function, and the capacities of the RX queues, which gives the opportunity for an efficient sizing of the system resources. We propose a model for the performance evaluation of a virtual switch. Our model resorts to servers with vacation to capture the involved interactions between queues resulting from the implemented polling strategies. The solution to the model is found using a simple fixed-point iteration and it provides estimates for customary performance metrics such as the attained throughput, the packet latency, the buffer occupancy and the packet loss rate. In the tens of explored examples, the predictions of the model were found to be accurate, thereby allowing their use for the purpose of sizing problems.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133856831","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":"Geographic Routing in Extreme-Scale Highly-Dynamic Mobile Ad Hoc Networks","authors":"Ben Newton, Jay Aikat, K. Jeffay","doi":"10.1109/MASCOTS.2016.73","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.73","url":null,"abstract":"In the near future extremely large scale mobile adhoc networks of thousands or tens of thousands of mobile nodes will be physically feasible and desirable for a host of applications. However, routing within these networks is challenging, especially at high data rates and when node movement is highly-dynamic. In this work we present Topology Aware Geographic Routing(TAG), a position-based routing protocol that strategically uses local topology information (when available) to make better local forwarding decisions, decreasing the number of hops required to deliver a packet when compared with other geographic routing protocols. In addition, TAG is able to reliably deliver packets even in topologies that violate the often used but unrealistic unit disk graph and quasi-static assumptions. We present empirical results from a variety of simulations, illustrating how TAG outperforms GOAFR+, GFG, and OLSR in both theoretical environments and in a simulated, real-world, continental-scale airborne network.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"412 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123090474","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}
Wenjie Liu, Ping-Hsiu Huang, Tao Lu, Xubin He, Hua Wang, Ke Zhou
{"title":"Improve Restore Speed in Deduplication Systems Using Segregated Cache","authors":"Wenjie Liu, Ping-Hsiu Huang, Tao Lu, Xubin He, Hua Wang, Ke Zhou","doi":"10.1109/MASCOTS.2016.46","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.46","url":null,"abstract":"The chunk fragmentation problem inherently associated with deduplication systems significantly slows down the restore performance, as it causes the restore process to assemble chunks which are distributed in a large number of containers as a result of storage indirection. Existing solutions attempting to address the fragmentation problem either sacrifice deduplication efficiency or require additional memory resources. In this work, we propose a new restore cache scheme, which accelerates the restore process using the same amount of cache space as that of the traditional LRU restore cache. We leverage the recipe knowledge to recognize the containers which will soon be accessed for restoring a backup version and classify those containers into bursty containers which are differentiated from other regular containers. Bursty and regular containers are then put in two separate caches, respectively. Bursty containers, containing many chunks that will be needed for restore within a short period of time, are put in a smaller cache managed at the container granularity. On the contrary, regular containers are put in the other bigger cache managed at the chunk granularity, with chunks which will not be used dropped off at the time when the containers are brought in. In doing so, bursty containers have better chances to be quickly evicted from the restore cache, avoiding their unnecessarily occupying cache space for too long. Our evaluation results have demonstrated that our proposed cache scheme can improve restore speed factor by up to 3.05X and reduce the number of container reads by 67.3% on average, relative to a conventional LRU restore cache.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126043048","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}