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

Making Nodes Cooperative: A Secure Incentive Mechanism for Message Forwarding in DTNs 使节点合作:ddn中消息转发的安全激励机制

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

Honglong Chen, W. Lou

引用次数: 11

Budget-Minimized Resource Allocation and Task Scheduling in Distributed Grid/Clouds 分布式网格/云环境下预算最小化的资源分配与任务调度

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

Pan Yi, Hui Ding, B. Ramamurthy

{"title":"Budget-Minimized Resource Allocation and Task Scheduling in Distributed Grid/Clouds","authors":"Pan Yi, Hui Ding, B. Ramamurthy","doi":"10.1109/ICCCN.2013.6614111","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614111","url":null,"abstract":"The need for large-scale computing, storage and network capabilities by the scientific or business community has resulted in the development of cloud networks. Grid/Clouds users are provided with IT infrastructure (servers, storage, networks, etc.) as services called Infrastructure as a Service (IaaS). In this case, an efficient resource scheduling mechanism for allocating the infrastructure resources across the network will improve the resource efficiency in the cloud significantly. In this paper, we investigate the budget optimization of joint resources (storage, processor and network) allocation for IaaS model in distributed Grid/Clouds from the consumer's perspective. We develop a Mixed Integer Linear Programming (MILP) formulation along with a new resource model and propose a Best-Fit heuristic algorithm with different job scheduling policies. Our goal is to minimize the expenditure for each user to obtain enough resources to execute their submitted jobs, while enabling the Grid/Cloud provider to accept as many job requests from the users as possible. Both MILP and heuristic are tested on a 10- node topology and the Google Datacenter topology. The results show that the heuristic method can achieve approximate optimal solutions to MILP; it can reduce the user expense by at least 30%. In addition, Best-Fit algorithm with SSF (simple job structure first) job scheduling policy has the lowest blocking rate, which is 5%~25% less than other job scheduling policies.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"53 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":"124966963","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 Efficient Secure Coding Scheme for Random Linear Network Coding 随机线性网络编码中一种新的高效安全编码方案

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

H. Noura, Steven Martin, K. A. Agha

{"title":"A New Efficient Secure Coding Scheme for Random Linear Network Coding","authors":"H. Noura, Steven Martin, K. A. Agha","doi":"10.1109/ICCCN.2013.6614088","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614088","url":null,"abstract":"Random Linear Network Coding (RLNC) is a promising technology of Network coding (NC) {that is} verified to be both sufficient and efficient. In this paper, we propose an efficient implementation of coding process, ensuring the security against active and passive attacks, in order to deploy RLNC in real networks, especially on battery constrained mobile devices with low computation capabilities such as mobile phones or sensors. We first present our flexible secure solution that can achieve simultaneously the information confidentiality, the packet integrity and the source authentication. It contains a new scheme of generation of invertible key dependent binary Global Encoding Matrix (GEM) with a complexity, a memory consumption and a decoding delay lower than the traditional $RLNC$. The effectiveness of coding process is proved by modifying the Galois field of calculation from integer (int8, int16) to binary in order to ensure low computational requirements that lead to high throughput and low energy consumption. Furthermore, theoretical and numerical results reveal that the proposed methods give an effectiveness of coding and a higher level of security compared to many recent works in this field.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"1 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":"129491353","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

Resource Allocation for Energy Efficient k-out-of-n System in Mobile Ad Hoc Networks 移动Ad Hoc网络中高效k-out- n系统的资源分配

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

Chien-An Chen, M. Won, R. Stoleru, G. Xie

{"title":"Resource Allocation for Energy Efficient k-out-of-n System in Mobile Ad Hoc Networks","authors":"Chien-An Chen, M. Won, R. Stoleru, G. Xie","doi":"10.1109/ICCCN.2013.6614183","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614183","url":null,"abstract":"Resource Allocation has been widely used for improving various performance metrics in wireless networks. Applying resource allocation to a Mobile Ad Hoc Network (MANET), however, is a challenging problem because of dynamic network topology. In this paper, we develop a novel resource allocation scheme designed for MANETs that minimizes the communication cost for accessing distributed resources while improving the reliability by adopting the k-out-of-n system, a widely used technique for reliability control. Specifically, we propose a scheme that allocates resources to n nodes, called service centers, such that the expected energy consumption for nodes to access k service centers out of the n service centers (k ≤ n) is minimized. Our scheme accounts for dynamic network topology by estimating the failure probabilities of nodes and monitoring the network for significant topology changes. In addition, an Importance Sampling technique is used to reduce the computation-overhead. To evaluate the performance, we build a mobile distributed file system based on our resource allocation scheme. Through both extensive simulations and real hardware implementation on Smartphones, we show that our resource allocation scheme effectively reduces energy consumption by up to 45% and increases the successful data retrieval rate by up to 50% in comparison with a greedy algorithm.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"68 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":"133977422","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}

引用次数: 18

ROVER: Route Origin Verification Using DNS ROVER:使用DNS验证路由来源

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

Joseph Gersch, D. Massey

引用次数: 23

QoS-Aware Service Selection in Geographically Distributed Clouds 地理分布云中的qos感知服务选择

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

Xin Li, Jie Wu, Sanglu Lu

引用次数: 20

A Social Network Integrated Reputation System for Cooperative P2P File Sharing 协同P2P文件共享的社会网络集成信誉系统

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

Kang-Peng Chen, Haiying Shen, Karan Sapra, Guoxin Liu

{"title":"A Social Network Integrated Reputation System for Cooperative P2P File Sharing","authors":"Kang-Peng Chen, Haiying Shen, Karan Sapra, Guoxin Liu","doi":"10.1109/ICCCN.2013.6614093","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614093","url":null,"abstract":"In current reputation systems for peer-to-peer (P2P) file sharing networks, reputation querying generates high overhead in file service. Also, a high-reputed node may be reluctant to further increase its reputation in these reputation systems. Recently, social network-based P2P systems that favor file sharing among friends have been proposed for reliable file sharing. However, this approach contradicts the objective of widely file sharing in P2P systems. To overcome these drawbacks, we propose a social network integrated reputation system, namely SocialTrust, that synergistically leverages the concept of \"friendship fosters cooperation''. In SocialTrust, each node maintains trusted relationships for the purpose of file sharing, which are resulted from both real life acquaintance and online partnership established between high-reputed and frequently-interacted nodes. Given a number of server options, a client first chooses a friend or a partner, if available, without querying their reputations. Otherwise, it chooses the server with the highest reputation. The benefits of friendship and partnership on file sharing and cost saving encourage nodes to be continuously cooperative. Further, in order to realize accurate reputation evaluation and strong cooperation incentives, SocialTrust considers the number of friends/partners and reputation of a node in the process of reputation rewarding and punishment. Extensive trace-driven simulation demonstrates the effectiveness of SocialTrust.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"282 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":"133633770","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

An Elitist Polynomial Mutation Operator for Improved Performance of MOEAs in Computer Networks 一种改进计算机网络中moea性能的精英多项式变异算子

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

K. Liagkouras, K. Metaxiotis

引用次数: 27

Network Hypervisors: Managing the Emerging SDN Chaos 网络管理程序:管理新兴的SDN混乱

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

Shufeng Huang, J. Griffioen

{"title":"Network Hypervisors: Managing the Emerging SDN Chaos","authors":"Shufeng Huang, J. Griffioen","doi":"10.1109/ICCCN.2013.6614160","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614160","url":null,"abstract":"Software-Defined Networking (SDN) has been widely recognized as a promising way to deploy new services and protocols in future networks. The programmability and control offered by SDN networks enables users and applications to define virtually every aspect of the network architecture. Unfortunately, this flexibility comes at a cost - a cost that has the potential to significantly limit its adoption. First, in order to offer complete flexibility, today's SDN networks provide low-level API's on which almost any type of service can be written. In the process, it can actually become more difficult to implement the higher level complex services needed by future networks. Second, emerging SDN networks exhibit a heterogeneity reminiscent of the early Internet, with limited ability to piece together the various SDN platforms being deployed. In this paper we propose a new way to construct SDN networks consisting of multiple SDN providers offering virtualizable networking resources across the Internet. At the heart of our approach is a Network Hypervisor service that is capable of internetworking various SDN providers together. Moreover, our Network Hypervisor builds on the low-level APIs provided by SDNs to create a unified set of high-level abstractions and APIs that greatly simplify the task of building and deploying complex network services over SDN.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"17 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":"132585149","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

Diverse Infrastructure and Architecture for Datacenter and Cloud Resilience 数据中心和云弹性的多样化基础设施和架构

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

J. Sterbenz, P. Kulkarni

{"title":"Diverse Infrastructure and Architecture for Datacenter and Cloud Resilience","authors":"J. Sterbenz, P. Kulkarni","doi":"10.1109/ICCCN.2013.6614125","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614125","url":null,"abstract":"Internet and web services have seen widespread adoption in recent years and are now tightly integrated into society's daily activities. An important emerging part of the Internet is clouds that provide low-cost configurable computing resources, allowing businesses to reduce their hardware, software, and personnel costs. Increasingly, enterprises now use such cloud resources to host web applications. While clouds provide an excellent business model, most existing public and private cloud infrastructures are based on monocultures that allow attackers to focus their efforts on a single hardware/software platform and facilitates the rapid spreading of successful attacks. In this invited paper, we describe a methodology and mech- anisms that make clouds and hosted applications considerably more resilient to attacks and correlated failures by introducing diversity at every level of the cloud: physical interconnect, network components, processor platforms, storage management, virtual machine monitors, operating systems, and application processes. Our goal is to defend against attacks by continuing to operate correctly even when part of the infrastructure fails and to substantially raise the difficulty of executing a successful attack by requiring the attacker to simultaneously target different hardware and software choices. Furthermore, by geographically spreading applications among different datacenters using diverse network connections (in service provider and access medium - wired vs. wireless), the cloud will be resilient against physical infrastructure attacks and large-scale disasters.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"39 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":"127182756","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}

引用次数: 11