2013 22nd International Conference on Computer Communication and Networks (ICCCN)最新文献_第9页

Steady Status Study of Distributed Data Caching in Ad Hoc Networks Ad Hoc网络中分布式数据缓存的稳态研究

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614197

J. Taylor, Bin Tang, M. Yildirim

{"title":"Steady Status Study of Distributed Data Caching in Ad Hoc Networks","authors":"J. Taylor, Bin Tang, M. Yildirim","doi":"10.1109/ICCCN.2013.6614197","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614197","url":null,"abstract":"There has been extensive research on distributed data caching in ad hoc networks. However, most of them focus on how to reduce the average delay of requests and improve the packet delivery ratio, not much work has been done to study the steady-state status achieved by the distributed caching algorithms. Information related to steady-state status includes the convergence time of the distributed caching algorithms, the final data replica placement in the network, and the performance comparison of distributed caching algorithms with optimal centralized caching solution. Previous theoretical results show that to minimize the average access cost (or average search cost) in the network, the optimal number of replica of each data object is proportional to the square root (or two-third) of the data's access frequency. In this work, we empirically show that the optimal number of replicas of each data depends on not only the access frequencies of the data, but also the storage capacity of each node. We evaluate the steady-states of both cooperative distributed data caching technique and a selfish caching in ad hoc networks, and compare them to that of the optimal caching solution obtained using integer linear programming (ILP). Via ns2 simulations, we gain some insights about the steady-states of distributed data caching.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239568","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}

引用次数: 1

Energy-Efficient QoS Provisioning in Random Access Satellite NDMA Schemes 随机接入卫星NDMA方案的节能QoS提供

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614136

José Vieira, F. Ganhão, Luís Bernardo, R. Dinis, M. Beko, Rodolfo Oliveira, Paulo Pinto

{"title":"Energy-Efficient QoS Provisioning in Random Access Satellite NDMA Schemes","authors":"José Vieira, F. Ganhão, Luís Bernardo, R. Dinis, M. Beko, Rodolfo Oliveira, Paulo Pinto","doi":"10.1109/ICCCN.2013.6614136","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614136","url":null,"abstract":"Random access approaches in Low Earth Orbit (LEO) satellite networks are usually incompatible with the Quality of Service (QoS) requirements for multimedia traffic, especially when hand-held terminals must operate with a very low signal-to-noise ratio. This paper proposes the Satellite Random Network Diversity Multiple Access (SR-NDMA) protocol that handles multimedia traffic under this context through the combination of a random and scheduled access scheme. The protocol uses a multi-packet receiver, for Single Carrier with Frequency Domain Equalization (SC-FDE) in the uplink, that gradually reduces the packet error rate with additional transmissions. The paper proposes analytical performance models for the throughput, delay and energy efficiency - as long as terminals have finite queues. System parameters are defined to enhance the energy efficiency while satisfying the QoS requirements for limited queue and bit-rate constraints. Results show that the proposed system is energy efficient and provides enough QoS to support multimedia services such as video telephony.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133634518","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}

引用次数: 1

Measuring the Relationships between Internet Geography and RTT 网络地理与RTT关系的测度

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614151

R. Landa, R. Clegg, J. Araújo, E. Mykoniati, D. Griffin, M. Rio

{"title":"Measuring the Relationships between Internet Geography and RTT","authors":"R. Landa, R. Clegg, J. Araújo, E. Mykoniati, D. Griffin, M. Rio","doi":"10.1109/ICCCN.2013.6614151","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614151","url":null,"abstract":"When designing distributed systems and Internet protocols, designers can benefit from statistical models of the Internet that can be used to estimate their performance. However, it is frequently impossible for these models to include every property of interest. In these cases, model builders have to select a reduced subset of network properties, and the rest will have to be estimated from those available. In this paper we present a technique for the analysis of Internet round trip times (RTT) and its relationship with other geographic and network properties. This technique is applied on a novel dataset comprising ~19 million RTT measurements derived from ~200 million RTT samples between ~54 thousand DNS servers. Our main contribution is an information-theoretical analysis that allows us to determine the amount of information that a given subset of geographic or network variables (such as RTT or great circle distance between geolocated hosts) gives about other variables of interest. We then provide bounds on the error that can be expected when using statistical estimators for the variables of interest based on subsets of other variables.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697757","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}

引用次数: 22

Distributed Interference Alignment in Cognitive Radio Networks 认知无线电网络中的分布式干扰对齐

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614124

Yi Xu, S. Mao

引用次数: 6

Privacy Preserving Computations Using Implicit Security 使用隐式安全性的隐私保护计算

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614172

Abhishek Parakh, W. Mahoney

引用次数: 4

Target-Temporal Effective-Sensing Coverage in Mission-Driven Camera Sensor Networks 任务驱动相机传感器网络的目标-时间有效感知覆盖

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614201

Yi Hong, Donghyun Kim, Deying Li, Wenping Chen, A. Tokuta, Zhiming Ding

引用次数: 11

Opportunistic Direct Interconnection between Co-Located Wireless Sensor Networks 位于同一位置的无线传感器网络之间的机会直接互连

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-07-30 DOI: 10.1109/ICCCN.2013.6614166

Teng Jiang, G. Merrett, N. Harris

{"title":"Opportunistic Direct Interconnection between Co-Located Wireless Sensor Networks","authors":"Teng Jiang, G. Merrett, N. Harris","doi":"10.1109/ICCCN.2013.6614166","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614166","url":null,"abstract":"Wireless sensor networks are usually designed to avoid interaction with other networks. To share information, they are usually connected via a backbone network (e.g. the Internet) using gateways. The realization of visions for pervasive computing depends upon effective interconnection between individual networks. As the number of deployed sensor networks increases, the chance of any network having multiple neighbors also increases. In this paper, we argue that a paradigm shift towards 'opportunistic direct interconnection' is required. This enables one network to share information or resources with neighboring networks that it was unaware of at design-time. We present OI-MAC, which supports automatic neighbor discovery and cross- boundary data exchange without sacrificing the independence of each network. The effects of discovery and cross-boundary data injection are evaluated using both analytical models and network simulation. Initial results indicate that neighbor discovery has little effect on latency, while energy consumption increases insignificantly compared to ordinary operations of each node. If network traffic is doubled by packets 'injected' from a neighboring network, latency increases by around 7% while average power consumption increases by 20%.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315298","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}

引用次数: 8

Profiling and Improving I/O Performance of a Large-Scale Climate Scientific Application 大规模气候科学应用的I/O性能分析与改进

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-07-30 DOI: 10.1109/ICCCN.2013.6614174

Zhuo Liu, Bin Wang, Teng Wang, Yuan Tian, Cong Xu, Yandong Wang, Weikuan Yu, Carlos A. Cruz, Shujia Zhou, T. Clune, S. Klasky

{"title":"Profiling and Improving I/O Performance of a Large-Scale Climate Scientific Application","authors":"Zhuo Liu, Bin Wang, Teng Wang, Yuan Tian, Cong Xu, Yandong Wang, Weikuan Yu, Carlos A. Cruz, Shujia Zhou, T. Clune, S. Klasky","doi":"10.1109/ICCCN.2013.6614174","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614174","url":null,"abstract":"Exascale computing systems are soon to emerge, which will pose great challenges on the huge gap between computing and I/O performance. Many large-scale scientific applications play an important role in our daily life. The huge amounts of data generated by such applications require highly parallel and efficient I/O management policies. In this paper, we adopt a mission-critical scientific application, GEOS-5, as a case to profile and analyze the communication and I/O issues that are preventing applications from fully utilizing the underlying parallel storage systems. Through in-detail architectural and experimental characterization, we observe that current legacy I/O schemes incur significant network communication overheads and are unable to fully parallelize the data access, thus degrading applications' I/O performance and scalability. To address these inefficiencies, we redesign its I/O framework along with a set of parallel I/O techniques to achieve high scalability and performance. Evaluation results on the NASA discover cluster show that our optimization of GEOS- 5 with ADIOS has led to significant performance improvements compared to the original GEOS-5 implementation.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132726053","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

Decoupling Policy from Routing with Software Defined Interdomain Management: Interdomain Routing for SDN-Based Networks 用软件定义的域间管理与路由解耦策略:基于sdn网络的域间路由

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-07-01 DOI: 10.1109/ICCCN.2013.6614121

Peter Thai, J. D. Oliveira

引用次数: 25

Stochastic Pre-Classification for Software Defined Firewalls 软件定义防火墙的随机预分类

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-07-01 DOI: 10.1109/ICCCN.2013.6614198

P. Ghoshal, C. Casey, Paul V. Gratz, A. Sprintson

引用次数: 4