发布求助
文献互助 智能选刊 最新文献

Proceedings of the 17th International Conference on Distributed Computing and Networking最新文献

筛选
英文 中文
Retricoin: Bitcoin based on compact proofs of retrievability Retricoin:基于可检索性的紧凑证明的比特币
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833317
Binanda Sengupta, Samiran Bag, S. Ruj, K. Sakurai
{"title":"Retricoin: Bitcoin based on compact proofs of retrievability","authors":"Binanda Sengupta, Samiran Bag, S. Ruj, K. Sakurai","doi":"10.1145/2833312.2833317","DOIUrl":"https://doi.org/10.1145/2833312.2833317","url":null,"abstract":"Bitcoin [24] is a fully decentralized electronic cash system. The generation of the proof-of-work in Bitcoin requires large amount of computing resources. However, this huge amount of energy is wasted as one cannot make something useful out of it. In this paper, we propose a scheme called Retricoin which replaces the heavy computational proof-of-work of Bitcoin by proofs of retrievability that have practical benefits. To guarantee the availability of an important but large file, we distribute the segments of the file among the users in the Bitcoin network. Every user who wants to mine Bitcoins must store a considerable portion of this file and prove her storage to other peers in the network using proofs of retrievability. The file can be constructed at any point of time from the users storing their respective segments untampered. Retricoin is more efficient than the existing Permacoin scheme [23] in terms of storage overhead and network bandwidth required to broadcast the proof to the Bitcoin network. The verification time in our scheme is comparable to that of Permacoin and reasonable for all practical purposes. We also design an algorithm to let the miners in a group (or pool) mine collectively.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133243009","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}
引用次数: 37
Entity reconciliation in a multi-camera network 多摄像机网络中的实体协调
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849566
R. Ganti, M. Srivatsa, B. S. Manjunath
{"title":"Entity reconciliation in a multi-camera network","authors":"R. Ganti, M. Srivatsa, B. S. Manjunath","doi":"10.1145/2833312.2849566","DOIUrl":"https://doi.org/10.1145/2833312.2849566","url":null,"abstract":"Location traces are becoming fairly abundant with the introduction of various mobile devices such as smartphones, in-car navigation units, and video cameras. Each individual type of device generates different features about a mobile entity along with the location of that entity itself. For example, the smartphone can provide the motion (using accelerometer) of an individual, whereas a video camera can identify what type of clothing the person is wearing. A key challenge is to be able to fuse the data across different data sources and generate a unique view for each entity. This paper tackles a slice of this larger problem, which is to reconcile entities across a multi-camera network and a GPS trace from a smartphone and proposes a novel algorithm that can scale horizontally to adapt to new age distributed systems such as Apache Spark and IBM's InfoSphere Streams. We show through extensive experiments on a real-world dataset that our algorithm outperforms existing approaches and adapts to horizontally scalable distributed environments.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126596541","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
Augmenting anycast network flows 增强任意播网络流
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833450
S. Brandt, Klaus-Tycho Förster, Roger Wattenhofer
{"title":"Augmenting anycast network flows","authors":"S. Brandt, Klaus-Tycho Förster, Roger Wattenhofer","doi":"10.1145/2833312.2833450","DOIUrl":"https://doi.org/10.1145/2833312.2833450","url":null,"abstract":"Updating network flows in a real-world setting is a nascent research area, especially with the recent rise of Software Defined Networks. While augmenting s-t flows of a single commodity is a well-understood concept, we study updating flows in a multi-commodity setting: Given a directed network with flows of different commodities, how can the capacity of some commodities be increased, without reducing capacities of other commodities, when moving flows in the network in an orchestrated order? To this extent, we show how the notion of augmenting flows can be efficiently extended to multiple commodities for anycast applications.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123671734","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
Dynamic server consolidation algorithms: a profit model for evaluation and an improvement 动态服务器整合算法:评估和改进的盈利模式
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833446
Anshu Yadav, V. Apte
{"title":"Dynamic server consolidation algorithms: a profit model for evaluation and an improvement","authors":"Anshu Yadav, V. Apte","doi":"10.1145/2833312.2833446","DOIUrl":"https://doi.org/10.1145/2833312.2833446","url":null,"abstract":"Dynamic Server Consolidation (DSC) uses the live migration facility of virtualization technology to consolidate virtual machines (VMs) on fewer physical machines (PMs) when demand is low, to use minimal PMs without violating the Service Level Agreements (SLAs). The implicit goal of DSC is to maximize the data center profit, or minimize the cost, which is generally approximated in terms of PM operational cost and some direct cost given to migrations. In this paper we propose a profit model in which costs of actions, such as VM migrations, manifest as SLA penalties and increased operating costs, rather than some direct artificial costs given to them. The model can be used as an important tool to evaluate different consolidation algorithms, in terms of single cost metric. We also propose an algorithm for DSC, based on the stability of VM placements, which is an improved form of an existing algorithm, and use our metric to compare the two algorithms for different values of cost parameters. In most cases our algorithm reduces costs by upto 28%.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122128349","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}
引用次数: 0
Distributed low overhead ID in a wireless sensor network 无线传感器网络中的分布式低开销ID
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833462
Md. Rakibul Haque, Mahmuda Naznin, Rifat Shahriyar
{"title":"Distributed low overhead ID in a wireless sensor network","authors":"Md. Rakibul Haque, Mahmuda Naznin, Rifat Shahriyar","doi":"10.1145/2833312.2833462","DOIUrl":"https://doi.org/10.1145/2833312.2833462","url":null,"abstract":"An overlay based ID assignment can facilitate a Wireless Sensor Network (WSN) with low tost and less time consuming look-up or event detection mechanism. In our paper, we present an efficient distributed sensor node look-up mechanism which assigns unique ID to the network nodes considering the physical proximity and ultimately this mechanism provides the low cost routes of messages with the help of these unique node IDs. Our method requires very few bounded number of physical hops for query resolution which contributes a low maintenance overhead. In this paper, we present theoretical analysis and experimental results to validate our claim.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128400385","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
Intelligent detection of MAC spoofing attack in 802.11 network 802.11网络中MAC欺骗攻击的智能检测
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2850446
Chafika Benzaid, Abderrahman Boulgheraif, F. Dahmane, Ameer Al-Nemrat, K. Zeraoulia
{"title":"Intelligent detection of MAC spoofing attack in 802.11 network","authors":"Chafika Benzaid, Abderrahman Boulgheraif, F. Dahmane, Ameer Al-Nemrat, K. Zeraoulia","doi":"10.1145/2833312.2850446","DOIUrl":"https://doi.org/10.1145/2833312.2850446","url":null,"abstract":"In 802.11, all devices are uniquely identified by a Media Access Control (MAC) address. However, legitimate MAC addresses can be easily spoofed to launch various forms of attacks, such as Denial of Service attacks. Impersonating the MAC address of a legitimate user poses a big challenge for cyber crime investigators. Indeed, MAC spoofing makes the task of identifying the source of the attack very difficult. Sequence number analysis is a common technique used to detect MAC spoofing attack. Existing solutions relying on sequence number analysis, adopt a threshold-based approach where the gap between consecutive sequence numbers is compared to a threshold to decide the presence of a MAC spoofing attack. Nevertheless, threshold-based approach may lead to a high rate of false alerts due to lost or duplicated frames. To overcome the limitations of threshold-based approach, this paper proposes a detection method that relies on a machine learning approach, namely Artificial Neural Network (ANN). ANNs provide the potential to identify and classify network behavior from limited, noisy, incomplete and non-linear data sources. The experimentation results showed the effectiveness of the proposed detection technique. Moreover, we proposed a user-friendly graphical representation of information to support the interpretation of quantitative results.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133769424","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}
引用次数: 15
Scaling architecture-on-demand based optical networks 基于按需扩展架构的光网络
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833453
Hugo Meyer, J. Sancho, M. Mrdakovic, S. Peng, D. Simeonidou, W. Miao, N. Calabretta
{"title":"Scaling architecture-on-demand based optical networks","authors":"Hugo Meyer, J. Sancho, M. Mrdakovic, S. Peng, D. Simeonidou, W. Miao, N. Calabretta","doi":"10.1145/2833312.2833453","DOIUrl":"https://doi.org/10.1145/2833312.2833453","url":null,"abstract":"This paper analyzes methodologies that allow scaling properly Architecture-On-Demand (AoD) based optical networks. As Data Centers and HPC systems are growing in size and complexity, optical networks seem to be the way to scale the bandwidth of current network infrastructures. To scale the number of servers that are connected to optical switches normally Dense Wavelength Division Multiplexing (DWDM) is used to group several servers in one fiber. Using DWDM limits the number of servers per fiber to the number of wavelengths that fiber supports, and also may increase the number of packet collisions. Our proposal focuses on using Time Division Multiplexing (TDM) to allow multiple servers per wavelength, allowing to scale to a larger number of servers per switch. Initial results have shown that when using TDM we can obtain similar results in performance when comparing it with DWDM. For some of the applications, TDM can outperform DWDM up to 2.4% taking into account execution time.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116063018","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}
引用次数: 3
Self-optimisation using runtime code generation for wireless sensor networks 自优化使用运行时代码生成无线传感器网络
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849557
Caroline Quéva, Damien Couroussé, H. Charles
{"title":"Self-optimisation using runtime code generation for wireless sensor networks","authors":"Caroline Quéva, Damien Couroussé, H. Charles","doi":"10.1145/2833312.2849557","DOIUrl":"https://doi.org/10.1145/2833312.2849557","url":null,"abstract":"This paper addresses the use of runtime code specialisation in resource-constrained embedded systems such as nodes of a Wireless Sensor Network (WSN), in order to improve software efficiency, hence the lifetime of WSN nodes. In our approach, runtime code specialisation is achieved with inplace runtime code generation. We present a self-optimising system using runtime code generation. Our system is able to automatically make the decision to generate specialised code and use it each time an improvement is observed in application performance. In the Internet of Things (IoT), devices usually have limited precision; our system adapts to theses devices decreasing precision in order to increase performance. We evaluate our system on floating point multiplication using the WisMote platform, where the specialised code executes more than 7 times faster than generic code, all overheads included. To the best of our knowledge, it is the first time that a runtime code generation system is used to automatically optimise code in such constrained devices as WSN nodes.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126898421","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
A human mobility based knowledge sharing approach for post disaster need assessment using DTN 基于人员流动性的灾后需求评估知识共享方法
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833461
Souvik Basu, Siuli Roy, S. Bit, S. Bandyopadhyay
{"title":"A human mobility based knowledge sharing approach for post disaster need assessment using DTN","authors":"Souvik Basu, Siuli Roy, S. Bit, S. Bandyopadhyay","doi":"10.1145/2833312.2833461","DOIUrl":"https://doi.org/10.1145/2833312.2833461","url":null,"abstract":"In a post disaster scenario, assessment of resource needs is indeed challenging because needs are constantly changing and supplies trickle in at an uncertain rate. Moreover, information about resource needs of far-flung areas get rarely permeated owing to the disruption of cellular and other communication infrastructure, leading to a huge gap in perception about the actual needs in those areas. Therefore, a dynamic need assessment mechanism is essential to stay abreast of the actual situation. Movements of volunteers and relief workers are governed by two dominant characteristics of human mobility - spatial locality and spatial regularity. In this paper, we make use of such mobility characteristics to propose a knowledge sharing based approach for dynamic assessment of post disaster resource needs using a smart-phone based delay tolerant network (DTN). The proposed technique caters to the objective of bridging the gap in perception about actual resource needs.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116888791","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}
引用次数: 12
A new routing protocol for WBAN to enhance energy consumption and network lifetime 一种新的无线局域网路由协议，以提高能耗和网络寿命
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849560
S. Adhikary, S. Choudhury, Samiran Chattopadhyay
{"title":"A new routing protocol for WBAN to enhance energy consumption and network lifetime","authors":"S. Adhikary, S. Choudhury, Samiran Chattopadhyay","doi":"10.1145/2833312.2849560","DOIUrl":"https://doi.org/10.1145/2833312.2849560","url":null,"abstract":"Wireless Body Area Network (WBAN) comprises wireless sensor nodes that can be either on, implanted or around the body of a person. Routing in WBAN network is not the same as routing in Wireless Sensor Network (WSN) because WBAN protocols have to be thermal aware and data delivery has to be more reliable. Though different WBAN routing schemes have already been proposed, they are not energy efficient or they are unable to relay critical health data reliably. In this paper, a Multi hop routing protocol for WBAN has been proposed that is efficient in terms of transmitting power, Packet delivery Rate (PDR) and network lifetime. Fixed nodes are added to WBAN that are used as forwarder nodes. Proper subset of fixed nodes and sensor nodes can be selected as forwarder based on a cost function that includes metrics like transmission power of the node, velocity vector of the receiver, residual energy and the current location of the node with respect to the coordinator. Simulation studies show that the proposed protocol maximizes network life time and increases packet delivery.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116589759","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}
引用次数: 39
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信