Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017022
T. Abdou, Pankaj Kamthan
The development of open source software (OSS), and their deployment by general public as well as by different types of organizations, has increased manifold over the past decade or so. In spite of the ubiquity of OSS, the quality of many OSS remains questionable. Testing provides a curative approach for OSS quality assurance, and a comprehensive approach to testing is a knowledge-intensive endeavor. The management of knowledge in the OSS test process forms a perpetual cycle of creation, dissemination, and acquisition of test knowledge.
{"title":"A knowledge management approach for testing open source software systems","authors":"T. Abdou, Pankaj Kamthan","doi":"10.1109/PCCC.2014.7017022","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017022","url":null,"abstract":"The development of open source software (OSS), and their deployment by general public as well as by different types of organizations, has increased manifold over the past decade or so. In spite of the ubiquity of OSS, the quality of many OSS remains questionable. Testing provides a curative approach for OSS quality assurance, and a comprehensive approach to testing is a knowledge-intensive endeavor. The management of knowledge in the OSS test process forms a perpetual cycle of creation, dissemination, and acquisition of test knowledge.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130934578","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017066
Xiaoguang Niu, Meng Li, Qianyuan Chen, Qingqing Cao, Houzhen Wang
The proliferation of mobile devices has facilitated the prevalence of participatory sensing applications in which participants collect and share information in their environments. The design of a participatory sensing application confronts two challenges: “privacy” and “incentive” which are two conflicting objectives and deserve deeper attention. Inspired by physical currency circulation system, this paper firstly proposes E-cent, a unit bearer currency. It is exchangeable, and participants can utilize it to participate in tasks anonymously. By employing E-cent, we further propose an E-cent-based privacy-preserving incentive mechanism, called EPPI, which exploits a pledge-based participating protocol to encourage participants to participate without revealing privacy and prohibit participants from sending false data. EPPI also takes advantage of a dynamic reward allocation scheme to maximize the value of the services under a budget constraint. To the best of our knowledge, EPPI is the first attempt to build an incentive mechanism while maintaining the desired privacy-preserving in participatory sensing systems. Extensive simulation and analysis results show that EPPI can achieve high anonymity level and remarkable incentive effects.
{"title":"EPPI: An E-cent-based privacy-preserving incentive mechanism for participatory sensing systems","authors":"Xiaoguang Niu, Meng Li, Qianyuan Chen, Qingqing Cao, Houzhen Wang","doi":"10.1109/PCCC.2014.7017066","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017066","url":null,"abstract":"The proliferation of mobile devices has facilitated the prevalence of participatory sensing applications in which participants collect and share information in their environments. The design of a participatory sensing application confronts two challenges: “privacy” and “incentive” which are two conflicting objectives and deserve deeper attention. Inspired by physical currency circulation system, this paper firstly proposes E-cent, a unit bearer currency. It is exchangeable, and participants can utilize it to participate in tasks anonymously. By employing E-cent, we further propose an E-cent-based privacy-preserving incentive mechanism, called EPPI, which exploits a pledge-based participating protocol to encourage participants to participate without revealing privacy and prohibit participants from sending false data. EPPI also takes advantage of a dynamic reward allocation scheme to maximize the value of the services under a budget constraint. To the best of our knowledge, EPPI is the first attempt to build an incentive mechanism while maintaining the desired privacy-preserving in participatory sensing systems. Extensive simulation and analysis results show that EPPI can achieve high anonymity level and remarkable incentive effects.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129541585","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017098
Chenkai Yang, Liusheng Huang, Bing Leng, Hongli Xu, Xinglong Wang
Content Delivery Network (CDN) is proposed for replicating data objects at multiple locations in the network and encounters vast potential for future development, as a result of which, a number of replica placement techniques have been proposed over the last decade. However, most of the existing works on replica placement (RP) ignore the statistical property of the demands and the restricted service rate of the servers. In this paper, we investigate the techniques of replica placement in CDNs with stochastic demands and M/M/1 servers to optimize the overall performance in the network. We first model the demands and the servers as independent Poisson streams and simple M/M/1 queueing systems, respectively. Then, a formal definition and formalization of RP problem will be given. We show that RP problem is NP-complete and propose two heuristic algorithms: Greedy Dropping (GD) and Tabu Search (TS). We conduct abundant simulation experiments to evaluate the performance of our proposed algorithms. According to our simulation results, both of the two algorithms are efficient in finding a feasible solution with high probability. Especially, the TS decreases the average delay of the demands about 50% on average.
{"title":"Replica placement in content delivery networks with stochastic demands and M/M/1 servers","authors":"Chenkai Yang, Liusheng Huang, Bing Leng, Hongli Xu, Xinglong Wang","doi":"10.1109/PCCC.2014.7017098","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017098","url":null,"abstract":"Content Delivery Network (CDN) is proposed for replicating data objects at multiple locations in the network and encounters vast potential for future development, as a result of which, a number of replica placement techniques have been proposed over the last decade. However, most of the existing works on replica placement (RP) ignore the statistical property of the demands and the restricted service rate of the servers. In this paper, we investigate the techniques of replica placement in CDNs with stochastic demands and M/M/1 servers to optimize the overall performance in the network. We first model the demands and the servers as independent Poisson streams and simple M/M/1 queueing systems, respectively. Then, a formal definition and formalization of RP problem will be given. We show that RP problem is NP-complete and propose two heuristic algorithms: Greedy Dropping (GD) and Tabu Search (TS). We conduct abundant simulation experiments to evaluate the performance of our proposed algorithms. According to our simulation results, both of the two algorithms are efficient in finding a feasible solution with high probability. Especially, the TS decreases the average delay of the demands about 50% on average.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"41 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114039600","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017089
S. Alam, David K. Y. Yau, S. Fahmy
Sensor nodes are inherently unreliable and prone to hardware or software faults. Thus, they may report untrustworthy or inconsistent data. Assessing the trustworthiness of sensor data items can allow reliable sensing or monitoring of physical phenomena. A provenance-based trust framework can evaluate the trustworthiness of data items and sensor nodes based on the intuition that two data items with similar data values but with different provenance (i.e., forwarding path) can be considered more trustworthy. Forwarding paths of data items generated from redundantly deployed sensors should consist of trustworthy nodes and remain dissimilar. Unfortunately, operating many sensors with dissimilar paths consumes significant energy. In this paper, we formulate an optimization problem to identify a set of sensor nodes and their corresponding paths toward the base station that achieve a certain trustworthiness threshold, while keeping the energy consumption of the network minimal. We prove the NP-hardness of this problem and propose ERUPT, a simulated annealing solution. Testbed and simulation results show that ERUPT achieves high trustworthiness, while reducing total energy consumption by 32-50% with respect to current approaches.
{"title":"ERUPT: Energy-efficient trustworthy provenance trees for wireless sensor networks","authors":"S. Alam, David K. Y. Yau, S. Fahmy","doi":"10.1109/PCCC.2014.7017089","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017089","url":null,"abstract":"Sensor nodes are inherently unreliable and prone to hardware or software faults. Thus, they may report untrustworthy or inconsistent data. Assessing the trustworthiness of sensor data items can allow reliable sensing or monitoring of physical phenomena. A provenance-based trust framework can evaluate the trustworthiness of data items and sensor nodes based on the intuition that two data items with similar data values but with different provenance (i.e., forwarding path) can be considered more trustworthy. Forwarding paths of data items generated from redundantly deployed sensors should consist of trustworthy nodes and remain dissimilar. Unfortunately, operating many sensors with dissimilar paths consumes significant energy. In this paper, we formulate an optimization problem to identify a set of sensor nodes and their corresponding paths toward the base station that achieve a certain trustworthiness threshold, while keeping the energy consumption of the network minimal. We prove the NP-hardness of this problem and propose ERUPT, a simulated annealing solution. Testbed and simulation results show that ERUPT achieves high trustworthiness, while reducing total energy consumption by 32-50% with respect to current approaches.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229240","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017064
Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li
The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.
{"title":"GPU acceleration of finding LPRs in DNA sequence based on SUA index","authors":"Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li","doi":"10.1109/PCCC.2014.7017064","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017064","url":null,"abstract":"The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116420976","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017029
Rosangela Melo, Maria Clara Bezerra, J. Dantas, Rúbens de Souza Matos Júnior, I. J. M. Filho, P. Maciel
Cloud computing environments provide powerful storage and processing capabilities, as well as other computational resources. Due to the business potential of the pay-peruse model, as well as the advantages of easy scalability, up-to-date Video on Demand (VoD) streaming services rely on cloud infrastructures to offer a wide variety of multimedia content. This paper proposes the application of availability models to a cloud environment designed for a video streaming service. Sensitivity analysis is proposed to identify the availability bottlenecks.
{"title":"Sensitivity analysis of availability of video streaming service in cloud computing","authors":"Rosangela Melo, Maria Clara Bezerra, J. Dantas, Rúbens de Souza Matos Júnior, I. J. M. Filho, P. Maciel","doi":"10.1109/PCCC.2014.7017029","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017029","url":null,"abstract":"Cloud computing environments provide powerful storage and processing capabilities, as well as other computational resources. Due to the business potential of the pay-peruse model, as well as the advantages of easy scalability, up-to-date Video on Demand (VoD) streaming services rely on cloud infrastructures to offer a wide variety of multimedia content. This paper proposes the application of availability models to a cloud environment designed for a video streaming service. Sensitivity analysis is proposed to identify the availability bottlenecks.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405326","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017096
Myoungwon Oh, Hyeonsang Eom, H. Yeom
Storage I/O in VM (Virtual Machine) environments, which requires low latency, becomes problematic as the fast storage such as SSDs (Solid-State Drives) is currently in use. The low performance problem in the VM environment is caused by 1) the presence of additional software layer such as guest OS, 2) context switching between VM and host OS, and 3) scheduling delay for I/O process. These factors do not cause serious problems in the case of using HDD which leads to high latency batching. However, there will be significant performance degradation when fast storage devices are used. To address this problem, we have proposed the following methods to improve the performance of I/O stack in the VM environments by attempting to optimize the I/O stack: one is pipelined polling, and the other is multiple issues and multiple completions. We have found via experiments that our approach leads to increases in the performance of SSDs in a VM environment by up to 50% when multiple VM storage devices are used, and that it leads to improvements in the performance by more than 80% when a single VM storage device is used, with the CPU utilization reduced by up to 25%.
VM (Virtual Machine)环境中的存储I/O需要低延迟，但随着ssd (Solid-State Drives)等快速存储的使用，存储I/O就会出现问题。VM环境中的低性能问题是由以下原因引起的:1)额外的软件层(如客户机操作系统)的存在;2)VM和主机操作系统之间的上下文切换;3)I/O进程的调度延迟。在使用HDD的情况下，这些因素不会导致导致高延迟批处理的严重问题。然而，当使用快速存储设备时，将会有明显的性能下降。为了解决这个问题，我们提出了以下方法，通过尝试优化I/O堆栈来提高VM环境中I/O堆栈的性能:一种是流水线轮询，另一种是多问题和多完成。我们通过实验发现，当使用多个虚拟机存储设备时，我们的方法可以将虚拟机环境中的ssd性能提高50%，当使用单个虚拟机存储设备时，它可以将性能提高80%以上，CPU利用率降低高达25%。
{"title":"Enhancing the I/O system for virtual machines using high performance SSDs","authors":"Myoungwon Oh, Hyeonsang Eom, H. Yeom","doi":"10.1109/PCCC.2014.7017096","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017096","url":null,"abstract":"Storage I/O in VM (Virtual Machine) environments, which requires low latency, becomes problematic as the fast storage such as SSDs (Solid-State Drives) is currently in use. The low performance problem in the VM environment is caused by 1) the presence of additional software layer such as guest OS, 2) context switching between VM and host OS, and 3) scheduling delay for I/O process. These factors do not cause serious problems in the case of using HDD which leads to high latency batching. However, there will be significant performance degradation when fast storage devices are used. To address this problem, we have proposed the following methods to improve the performance of I/O stack in the VM environments by attempting to optimize the I/O stack: one is pipelined polling, and the other is multiple issues and multiple completions. We have found via experiments that our approach leads to increases in the performance of SSDs in a VM environment by up to 50% when multiple VM storage devices are used, and that it leads to improvements in the performance by more than 80% when a single VM storage device is used, with the CPU utilization reduced by up to 25%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643267","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017027
J. Issa
Given the rapid change in processor architecture in the past years, there is a driving necessity to assess processor performance for a high performance computation workload. Assessing performance for a given workload is important to understand which architecture parameters the workload performance is sensitive to. A given workload can be categorized as memory bounded, compute bounded, or in between. In this paper we present performance sensitivity analysis for a high performance computation workload using LS-DYNA/car2car. We derive a sensitivity analysis for this workload with respect to different processor architecture parameters such as number for threads and memory. We also propose a performance estimation analytical model in which we can estimate performance for LS-DYNA workload by changing specific processor architecture parameters. The models is verified to estimate performance for different processor architectures with error margin <;5%.
{"title":"A novel method to estimate performance for a high performance computation workload","authors":"J. Issa","doi":"10.1109/PCCC.2014.7017027","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017027","url":null,"abstract":"Given the rapid change in processor architecture in the past years, there is a driving necessity to assess processor performance for a high performance computation workload. Assessing performance for a given workload is important to understand which architecture parameters the workload performance is sensitive to. A given workload can be categorized as memory bounded, compute bounded, or in between. In this paper we present performance sensitivity analysis for a high performance computation workload using LS-DYNA/car2car. We derive a sensitivity analysis for this workload with respect to different processor architecture parameters such as number for threads and memory. We also propose a performance estimation analytical model in which we can estimate performance for LS-DYNA workload by changing specific processor architecture parameters. The models is verified to estimate performance for different processor architectures with error margin <;5%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130803917","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017057
D. Vijayakumar, Q. Mahmoud
Despite research spanning more than a decade in the area of Web services, the industry has not yet seen a consensus regarding an effective method for the provisioning of Web services. In recent years, a new paradigm for implementing Web services based on Representational State Transfer, the successful architectural foundation of the Web, has seen greater interest in the industry. We had previously proposed a framework for the implementation of platforms for provisioning community-contributed Web services using the REpresentational State Transfer (REST) paradigm. We had also presented a proof-of-concept prototype implementation of the framework for use as a reference. In this paper, we elaborate more on the prototype by presenting its architecture and then present the results of evaluating the performance of this prototype in order to explore the feasibility of our proposed framework.
尽管在Web服务领域进行了十多年的研究，但业界尚未就提供Web服务的有效方法达成共识。近年来，业界对基于Representational State Transfer (Web的成功架构基础)实现Web服务的新范式产生了更大的兴趣。我们之前提出了一个框架，用于使用具象状态传输(REpresentational State Transfer, REST)范式提供社区贡献的Web服务的平台的实现。我们还提供了框架的概念验证原型实现，以供参考。在本文中，我们通过介绍其架构来详细阐述原型，然后介绍评估该原型性能的结果，以探索我们提出的框架的可行性。
{"title":"Evaluation of a platform for the provisioning of community-contributed web services","authors":"D. Vijayakumar, Q. Mahmoud","doi":"10.1109/PCCC.2014.7017057","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017057","url":null,"abstract":"Despite research spanning more than a decade in the area of Web services, the industry has not yet seen a consensus regarding an effective method for the provisioning of Web services. In recent years, a new paradigm for implementing Web services based on Representational State Transfer, the successful architectural foundation of the Web, has seen greater interest in the industry. We had previously proposed a framework for the implementation of platforms for provisioning community-contributed Web services using the REpresentational State Transfer (REST) paradigm. We had also presented a proof-of-concept prototype implementation of the framework for use as a reference. In this paper, we elaborate more on the prototype by presenting its architecture and then present the results of evaluating the performance of this prototype in order to explore the feasibility of our proposed framework.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131082613","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017046
Jeremiah D. Deng
Delay tolerant networks under wireless intermittent settings have gathered growing research interests in recent years. There remains, however, a lacking of performance modelling results for DTN protocols. In this paper, we propose to model the system-level performance of DTN protocols using the Erlang B queueing model, and profile the performance metrics such as message delivery ratios under different traffic conditions using the system capacity measurements. A number of common DTN protocols are evaluated using a scenario based on map-based mobility under different settings.
{"title":"Empirical capacity modeling and evaluation of delay tolerant network routing protocols","authors":"Jeremiah D. Deng","doi":"10.1109/PCCC.2014.7017046","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017046","url":null,"abstract":"Delay tolerant networks under wireless intermittent settings have gathered growing research interests in recent years. There remains, however, a lacking of performance modelling results for DTN protocols. In this paper, we propose to model the system-level performance of DTN protocols using the Erlang B queueing model, and profile the performance metrics such as message delivery ratios under different traffic conditions using the system capacity measurements. A number of common DTN protocols are evaluated using a scenario based on map-based mobility under different settings.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129673329","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：