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

2014 IEEE 13th International Symposium on Network Computing and Applications最新文献

筛选
英文 中文
Media Streams Planning with Uncertain Link Capacities 链路容量不确定的媒体流规划
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.37
Pavel Troubil, Hana Rudová, P. Holub
{"title":"Media Streams Planning with Uncertain Link Capacities","authors":"Pavel Troubil, Hana Rudová, P. Holub","doi":"10.1109/NCA.2014.37","DOIUrl":"https://doi.org/10.1109/NCA.2014.37","url":null,"abstract":"Interactive collaborative environments built upon high quality video applications require minimum capture-to-display latency to maintain feeling of natural communication. In practice, end users often encounter interruptions due to network congestion, which they could not avoid without knowledge of physical network infrastructure. We solve the problem of application level multipoint routing without assuming accurate knowledge of network link capacities, but rather relying on their estimates by network inference and bandwidth measurement tools. Our approach can handle uncertainties caused by both unreliable bandwidth measurements and unexpected capacity sharing. Support for on-the-fly transcoding of data streams on multicast agents allows per-recipient adaptation of video quality and bandwidth. We have implemented an ant colony optimization algorithm in the Co Universe middleware for orchestration of collaborative environments. Experiments show very good quality of results on most practical use cases and ability to solve significantly larger instances than optimal approaches based on mixed integer programming.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125333557","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
Immunization against Infection Propagation in Heterogeneous Networks 异质网络中感染传播的免疫
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.51
W. Abbas, Sajal Bhatia, Yevgeniy Vorobeychik, X. Koutsoukos
{"title":"Immunization against Infection Propagation in Heterogeneous Networks","authors":"W. Abbas, Sajal Bhatia, Yevgeniy Vorobeychik, X. Koutsoukos","doi":"10.1109/NCA.2014.51","DOIUrl":"https://doi.org/10.1109/NCA.2014.51","url":null,"abstract":"Modeling spreading processes for infections has been a widely researched area owing to its application in variety of domains especially epidemic spread and worm propagation. Until recently, infection propagation models usually inspired by epidemic spreading, solely relied upon the underlying network properties without taking into account the variation in node specific properties, such as its ability to spread infection or recover from an infection. Owing to this fact, these models have been agnostic to the effects such node heterogeneity might have in the overall infection (or immunization) process. In this paper, we incorporate node properties in a well-known ac[SIRS] model for infection propagation, and propose new heuristics to curb the spread of infection in heterogeneous networks. The proposed heuristics are validated against various network topologies, including a real-world example of an email exchange network.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116475265","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}
引用次数: 2
GPU-Based NSEC3 Hash Breaking 基于gpu的NSEC3散列打破
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.27
Matthäus Wander, Lorenz Schwittmann, Christopher Boelmann, Torben Weis
{"title":"GPU-Based NSEC3 Hash Breaking","authors":"Matthäus Wander, Lorenz Schwittmann, Christopher Boelmann, Torben Weis","doi":"10.1109/NCA.2014.27","DOIUrl":"https://doi.org/10.1109/NCA.2014.27","url":null,"abstract":"When a client queries for a non-existent name in the Domain Name System (DNS), the server responds with a negative answer. With the DNS Security Extensions (DNSSEC), the server can either use NSEC or NSEC3 for authenticated negative answers. NSEC3 claims to protect DNSSEC servers against domain enumeration, but incurs significant CPU and bandwidth overhead. Thus, DNSSEC server admins must choose between more efficiency (NSEC) or privacy (NSEC3). We present a GPU-based attack on NSEC3 that revealed 64% of all DNSSEC names in the com domain in 4.5 days. This attack shows that the NSEC3 privacy promises are weak and thus DNSSEC server admins must carefully decide whether the limited privacy is worth the overhead. Furthermore, we show that an increase of the cryptographic strength of NSEC3 puts attackers at an advantage, since the cost of an attack does not rise faster than the costs incurred on the DNSSEC server.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"35 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114031936","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}
引用次数: 16
An Adaptive Peer-to-Peer Overlay Scheme for Location-Based Services 基于位置服务的自适应点对点覆盖方案
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.35
G. Brambilla, Marco Picone, M. Amoretti, F. Zanichelli
{"title":"An Adaptive Peer-to-Peer Overlay Scheme for Location-Based Services","authors":"G. Brambilla, Marco Picone, M. Amoretti, F. Zanichelli","doi":"10.1109/NCA.2014.35","DOIUrl":"https://doi.org/10.1109/NCA.2014.35","url":null,"abstract":"One envisioned distinctive feature of smart cities is the interconnection among mobile users and vehicles, to support the fulfillment of location-based services. This can be obtained with centralized architectures, and with all the problems of scalability and robustness that such a solution involves. On the other hand, a more complex but more reliable, completely distributed approach can overcome this kind of problems. In this paper, we present the Adaptive Distributed Geographic Table (ADGT), a peer-to-peer overlay scheme suitable for the development of location-based services. In particular, the ADGT allows to efficiently retrieve peers or resources, to broadcast messages within any geographical region, and to be automatically notified about any type of information around any geographical location, following the publish/subscribe model. What mainly differentiates the ADGT from the other solutions in literature is the adaptivity of the overlay's topology to peers' mobility. Actually, the ADGT has the capability to adapt the neighborhood of each mobile peer depending on speed and direction. We have evaluated the ADGT by simulating different scenarios, and the results show that it acts well, ensuring high quality of messages dissemination and low cost in terms of data usage.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128127220","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}
引用次数: 16
Clustering in WSN Using Node Ranking with Hybrid Nodes Duty-Cycle and Energy Threshold 基于混合节点占空比和能量阈值的WSN节点排序聚类
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.43
Mariam Al Nuaimi, K. Shuaib, Klaithem Al Nuaimi
{"title":"Clustering in WSN Using Node Ranking with Hybrid Nodes Duty-Cycle and Energy Threshold","authors":"Mariam Al Nuaimi, K. Shuaib, Klaithem Al Nuaimi","doi":"10.1109/NCA.2014.43","DOIUrl":"https://doi.org/10.1109/NCA.2014.43","url":null,"abstract":"The denseness and random distribution of large-scale WSNs makes it quite difficult to replace or recharge nodes. Energy efficiency and management is a major design goal in these networks. In this paper, a new node energy efficient algorithm using energy thresholds to replace cluster heads is proposed. The proposed algorithm uses node ranking to elect cluster heads based on energy levels and positions of the nodes in reference to the base station (BS) which is used as a sink for gathered information. Since the BS calculates the number of rounds a cluster head can remain through in advance, this feature will have a great effect in prolonging the network life time as it reduces the amount of energy wasted on replacing cluster heads. In addition, hybrid redundant nodes duty-cycle is used for nodes to take turn in covering the monitored area which will improve the performance further. The performance of this algorithm compared to other well-known algorithms is shown. Also the performance of the algorithm using random cluster heads replacement and using threshold values to replace the cluster heads are compared.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125440095","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}
引用次数: 6
An Advance Reservation Mechanism to Enhance Throughput in an Opportunistic High Performance Computing Environment 在机会型高性能计算环境中提高吞吐量的一种高级保留机制
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.40
Eliza Gomes, M. Dantas
{"title":"An Advance Reservation Mechanism to Enhance Throughput in an Opportunistic High Performance Computing Environment","authors":"Eliza Gomes, M. Dantas","doi":"10.1109/NCA.2014.40","DOIUrl":"https://doi.org/10.1109/NCA.2014.40","url":null,"abstract":"Opportunistic high performance computing environments have been widely used, especially by the academic community owing to the possibility of obtaining high processing power with low cost, considering that this type of distributed high performance environments uses idle computing resources of personal machines. However, excessive requests of resources allocation can be recurrent and can both degrade the performance of the system and make the process of resource request harder for the user, who might have to repeat this process until resources for execution are available. Therefore, this paper proposes the use of an advance reservation mechanism in an opportunistic environment. It aims to improve the use flow of opportunistic resources in order to offer the possibility of resources allocation for a long period of time and not only at the time of request. Case studies were carried out to illustrate the behavior of an opportunistic environment using the approach proposed here, and results showed the efficiency and validity of our proposal.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131839242","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}
引用次数: 4
Formal Analysis of Secure Device Pairing Protocols 安全设备配对协议形式化分析
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.50
Trung Nguyen, J. Leneutre
{"title":"Formal Analysis of Secure Device Pairing Protocols","authors":"Trung Nguyen, J. Leneutre","doi":"10.1109/NCA.2014.50","DOIUrl":"https://doi.org/10.1109/NCA.2014.50","url":null,"abstract":"The need to secure communications between personal devices is increasing nowadays, especially in the context of Internet of Things. Authentication between devices which have no prior common knowledge is a challenging problem. One solution consists in using a pre-authenticated auxiliary channel, human assisted or location limited, usually called out-of-band channel. A large number of device pairing protocols using an out-of-band channel were proposed, but they usually suffer from a lack of formal analysis. In this paper, we introduce a formal model, conceived as an extension of Strand Spaces, to analyze such protocols. We use it to analyze a device pairing protocol with unilateral out-of-band channel proposed by Wong & Stajano. This leads us to discover some vulnerabilities in this protocol. We propose a modified version of the protocol together with a correctness proof in our model.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131229814","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}
引用次数: 10
Health Records Protection in Cloud Environment 云环境中的健康记录保护
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.19
D. Hoang, Lingfeng Chen
{"title":"Health Records Protection in Cloud Environment","authors":"D. Hoang, Lingfeng Chen","doi":"10.1109/NCA.2014.19","DOIUrl":"https://doi.org/10.1109/NCA.2014.19","url":null,"abstract":"Cloud computing is a cost-effective solution to the current expensive IT infrastructure for healthcare but it has not been adopted due to the due to the concerns that current Cloud technologies are inadequate to protect sensitive information contents of health records in the outsourced environment. This paper focuses on how electronic health records can be protected in the Cloud environments deploying our proposed trust-oriented data protection framework. In particular, it introduces a technique for transforming raw electronic health records to active data cubes and for encoding data for storage and fast access. Implementation of the framework is also presented.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"62 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115509681","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}
引用次数: 4
Recovery of Information Lost by the Least Squares Estimation in Real-Time Network Environment 基于最小二乘估计的实时网络环境下信息丢失恢复
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.21
Hengky Susanto, Byung-Guk Kim
{"title":"Recovery of Information Lost by the Least Squares Estimation in Real-Time Network Environment","authors":"Hengky Susanto, Byung-Guk Kim","doi":"10.1109/NCA.2014.21","DOIUrl":"https://doi.org/10.1109/NCA.2014.21","url":null,"abstract":"Feedback mechanism based algorithms are frequently used to solve network optimization problems. These schemes involve users and network exchanging information to achieve convergence towards an optimal solution. However, in implementation, these algorithms do not guarantee messages will be delivered to the destination, especially when network congestion occurs, which in turn often results in packet drops. This condition may lead to algorithm failing to converge. To prevent this, we propose least square (LS) estimation algorithm to recover the missing information when packets are dropped from the network. Our results from several scenarios demonstrate that LS estimation can provide the convergence for feedback mechanism based algorithm.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147041","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 Novel Approach for Dual-Direction Load Balancing and Storage Optimization in Cloud Services 云服务中双向负载均衡与存储优化的新方法
2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.23
Klaithem Al Nuaimi, N. Mohamed, Mariam Al Nuaimi, J. Al-Jaroodi
{"title":"A Novel Approach for Dual-Direction Load Balancing and Storage Optimization in Cloud Services","authors":"Klaithem Al Nuaimi, N. Mohamed, Mariam Al Nuaimi, J. Al-Jaroodi","doi":"10.1109/NCA.2014.23","DOIUrl":"https://doi.org/10.1109/NCA.2014.23","url":null,"abstract":"In this paper, we present a novel approach to solve the cloud storage issues and provide a fast load balancing algorithm. Our approach is based on partitioning and dual direction download of the files by multiple cloud servers. Partitions of the files are also saved on the cloud rather than the full files, which provides a good optimization to the cloud storage usage. Partial replication is used in this algorithm to ensure the reliability and availability of the data. Our focus is to improve the performance and optimize the storage usage in providing the DaaS service of the cloud. This algorithm solves the problem of having to fully replicate very large data sets, which uses up a lot of precious space on the cloud servers. Reducing the space needed will help reduce the cost of providing such space. Moreover, performance is also increased since multiple cloud servers will collaborate to provide the data to cloud clients in a faster manner.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131604653","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}
引用次数: 4
下一页 尾页
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学术官方微信