2015 IEEE 14th International Symposium on Network Computing and Applications最新文献_第4页

Vehicle Density and Roadmap Topology Issues when Characterizing Vehicular Communications 表征车辆通信时的车辆密度和路线图拓扑问题

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.23

Julio A. Sanguesa, Vicente Torres, Fernando Naranjo, Manuel Fogué, Piedad Garrido, Jesús Gallardo, F. Martinez

引用次数: 3

Secondary Market Mobile Users for Internet Access 二级市场移动互联网接入用户

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.13

Hengky Susanto, Benyuan Liu, Byung-Guk Kim, Honggang Zhang, Biao Chen, Junda Zhu, Xinwen Fu

引用次数: 0

NACER: A Network-Aware Cost-Efficient Resource Allocation Method for Processing-Intensive Tasks in Distributed Clouds NACER:分布式云中处理密集型任务的一种网络感知、成本高效的资源分配方法

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.37

E. Ahvar, S. Ahvar, N. Crespi, Joaquín García, Z. Mann

{"title":"NACER: A Network-Aware Cost-Efficient Resource Allocation Method for Processing-Intensive Tasks in Distributed Clouds","authors":"E. Ahvar, S. Ahvar, N. Crespi, Joaquín García, Z. Mann","doi":"10.1109/NCA.2015.37","DOIUrl":"https://doi.org/10.1109/NCA.2015.37","url":null,"abstract":"In the distributed cloud paradigm, data centers are geographically dispersed and interconnected over a wide-area network. Due to the geographical distribution of data centers, communication networks play an important role in distributed clouds in terms of communication cost and QoS. Large-scale, processing-intensive tasks require the cooperation of many VMs, which may be distributed in more than one data center and should communicate with each other. In this setting, the number of data enters serving the given task and the network distance among those data centers have critical impact on the communication cost, traffic and even completion time of the task. In this paper, we present the NACER algorithm, a Network-Aware Cost-Efficient Resource allocation method for optimizing the placement of largemulti-VM tasks in distributed clouds. NACER builds on ideas of the A* search algorithm from Artificial Intelligence research in order to obtain better results than typical greedy heuristics. We present extensive simulation results to compare the performance of NACER with competing heuristics and show its effectiveness.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124506270","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}

引用次数: 14

Reputation for Inter-Domain QoS Routing 域间QoS路由的声誉

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.19

E. Anceaume, Yann Busnel, Paul Lajoie-Mazenc, Géraldine Texier

引用次数: 3

Cheating Resistant Implicit Security 抗作弊隐式安全

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.32

Abhishek Parakh

引用次数: 1

Performance Evaluation of Microservices Architectures Using Containers 使用容器的微服务架构性能评估

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.49

Marcelo Amaral, Jordà Polo, David Carrera, Iqbal Mohomed, Merve Unuvar, M. Steinder

引用次数: 163

Car Rank: An Information-Centric Identification of Important Smart Vehicles for Urban Sensing 车阶:城市感知重要智能车辆的信息中心识别

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.10

J. Khan, Y. Ghamri-Doudane

{"title":"Car Rank: An Information-Centric Identification of Important Smart Vehicles for Urban Sensing","authors":"J. Khan, Y. Ghamri-Doudane","doi":"10.1109/NCA.2015.10","DOIUrl":"https://doi.org/10.1109/NCA.2015.10","url":null,"abstract":"Future cars are becoming powerful sensor platforms capable to collect, store and share large amount of sensory data by constant monitoring of urban streets. It is quite challenging to upload such data from all vehicles to the infrastructure due to limited bandwidth resources and high upload cost. This invoke the need to identify the appropriate vehicles within the Vehicular Ad-hoc Network, that are important for different urban sensing tasks based on their natural mobility and availability. This paper address this problem leveraging the self-decision making ability of a \"Smart Vehicle\" regarding its importance in the network. To do so, we present CarRank, an Information-Centric algorithm for a vehicle to first rank different location-aware information. It then uses the information importance, its spatio-temporal availability and neighborhood topology to analytically find its relative importance in the network. CarRank is the first step towards identifying the best set of information hubs to be used in the network for the efficient collection, storage and distribution of urban sensory information. We evaluate CarRank under a scalable simulation environment using realistic vehicular mobility traces. Results show that CarRank is an efficient ranking algorithm to identify socially important vehicles in comparison to other ranking metrics used in the literature.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122176602","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}

引用次数: 13

Cost Effective and Deadline Constrained Scientific Workflow Scheduling for Commercial Clouds 商业云的成本效益和期限约束科学工作流调度

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.33

Vahid Arabnejad, K. Bubendorfer

{"title":"Cost Effective and Deadline Constrained Scientific Workflow Scheduling for Commercial Clouds","authors":"Vahid Arabnejad, K. Bubendorfer","doi":"10.1109/NCA.2015.33","DOIUrl":"https://doi.org/10.1109/NCA.2015.33","url":null,"abstract":"Commercial clouds have increasingly become a viable platform for hosting scientific analyses and computation due to their elasticity, recent introduction of specialist hardware, and pay-as-you-go cost model. This computing paradigm therefore presents a low capital and low barrier alternative to operating dedicated eScience infrastructure. Indeed, commercial clouds now enable universal access to capabilities previously available to only large well funded research groups. While the potential benefits of cloud computing are clear, there are still significant technical hurdles associated with obtaining the best execution efficiency whilst trading off cost. Large scale scientific analyses are typically represented as workflows, in order to manage multiple tools and data sets. Mapping workflow tasks on to a set of provisioned instances is an example of the general scheduling problem and is NP-complete. In this case, the mapping includes elasticity, where as part of the mapping process additional instances may be provisioned. In this paper we present anew algorithm, Proportional Deadline Constrained (PDC), that addresses eScience workflow scheduling in the cloud. PDC's aim is to minimize costs while meeting deadline constraints. To validate the PDC algorithm, we constructed a Cloud Sim test bed and compared PDC with two other similar algorithms over three workflows. Our results demonstrate that overall PDC achieves generally lower costs for a given deadline, but more significantly, is usually able to construct a viable schedule with tight deadlines where the other algorithms studied cannot.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125546229","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}

引用次数: 20

Content Sharing among Visitors with Irregular Movement Patterns in Visiting Hotspots 访问热点时活动不规律的用户内容共享

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2015-09-28 DOI: 10.1109/NCA.2015.16

Shahriar Kaisar, J. Kamruzzaman, G. Karmakar, I. Gondal

{"title":"Content Sharing among Visitors with Irregular Movement Patterns in Visiting Hotspots","authors":"Shahriar Kaisar, J. Kamruzzaman, G. Karmakar, I. Gondal","doi":"10.1109/NCA.2015.16","DOIUrl":"https://doi.org/10.1109/NCA.2015.16","url":null,"abstract":"Smart mobile devices have become immensely popular among the people worldwide and provide a new platform for generating and sharing contents. The centralized and hybrid architectures for content sharing require constant Internet connection, increase traffic and incur costs. To address these issues several content sharing approaches have been proposed using the decentralized architecture. Most of the proposed approaches uses patio-temporal regularity and pre-existing social relationships of the users to predict their movements and facilitate content sharing. However, there are scenarios such as visiting hotspots where regular movement patterns or established social relationships among people might not exist. Content sharing in such scenarios has not been addressed yet in literature and existing prediction based approaches are ineffectual. This study focuses on facilitating content sharing in the afore-mentioned scenarios. We take account of user interests, recommendations from online social networks, hotspot specific activities and other relevant information to construct communities which facilitate content sharing. For each community an administrator, who maintains content and member lists and render directory services, is selected based on stay probability, interest score, battery lifetime and device configuration. Simulation results show that our proposed approach attains high content hit and success rate and low latency in delivery which is nearly comparable to those proposed for scenarios with regular predictable movement patterns reported in literature.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122276078","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}

引用次数: 9

Secure Fragmentation for Content-Centric Networks 以内容为中心的网络的安全碎片

2015 IEEE 14th International Symposium on Network Computing and Applications Pub Date : 2014-05-12 DOI: 10.1109/NCA.2015.34

Cesar Ghali, A. Narayanan, D. Oran, G. Tsudik, Christopher A. Wood

{"title":"Secure Fragmentation for Content-Centric Networks","authors":"Cesar Ghali, A. Narayanan, D. Oran, G. Tsudik, Christopher A. Wood","doi":"10.1109/NCA.2015.34","DOIUrl":"https://doi.org/10.1109/NCA.2015.34","url":null,"abstract":"Content-Centric Networking (CCN) is a communication paradigm that emphasizes content distribution. Named-Data Networking (NDN) is an instantiation of CCN, a candidate Future Internet Architecture. NDN supports human-readable content naming and router-based content caching which lends itself to efficient, secure, and scalable content distribution. Because of NDN's fundamental requirement that each content object must be signed by its producer, fragmentation has been considered incompatible with NDN since it precludes authentication of individual content fragments by routers. The alternative is to perform hop-by-hop reassembly, which incurs prohibitive delays. In this paper, we show that secure and efficient content fragmentation is both possible and even advantageous in NDN and similar content-centric network architectures that involve signed content. We design a concrete technique that facilitates efficient and secure content fragmentation in NDN, discuss its security guarantees and assess performance. We also describe a prototype implementation and compare performance of cut-through with hop-by-hop fragmentation and reassembly.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126762592","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}

引用次数: 34