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

Integration of Quantitative Methods for Risk Evaluation within Usage Control Policies 在使用控制政策中整合风险评估的定量方法

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

Leanid Krautsevich, A. Lazouski, F. Martinelli, P. Mori, A. Yautsiukhin

{"title":"Integration of Quantitative Methods for Risk Evaluation within Usage Control Policies","authors":"Leanid Krautsevich, A. Lazouski, F. Martinelli, P. Mori, A. Yautsiukhin","doi":"10.1109/ICCCN.2013.6614144","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614144","url":null,"abstract":"Usage Control (UCON) enhances traditional access control introducing mutable attributes and continuous policy enforcement. UCON addresses security requirements of dynamic computer environments like Grid and Cloud, but also raises new challenges. This paper considers two problems of usage control. The first problem arises when a value of a mutable attribute required for an access decision is uncertain. The second problem questions when to retrieve fresh values of mutable attributes and to trigger the access reevaluation during the continuous control. We propose quantitative risk-based methods to tackle these problems. The authorisation system grants the access if the security policy is satisfied and the risk level is acceptable. The authorisation system retrieves fresh attribute values following the strategy which minimises the risk of the usage sessions. We integrate the authorisation system based on the U-XACML language with quantitative methods for risk evaluation. We present the architecture, the implementation, and the evaluation of the overhead posed by the risk computation.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129023027","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}

引用次数: 7

Seamless Migration of Virtual Machines across Networks 跨网络的虚拟机无缝迁移

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

Umar Kalim, M. Gardner, Eric J. Brown, Wu-chun Feng

{"title":"Seamless Migration of Virtual Machines across Networks","authors":"Umar Kalim, M. Gardner, Eric J. Brown, Wu-chun Feng","doi":"10.1109/ICCCN.2013.6614190","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614190","url":null,"abstract":"Current technologies that support live migration require that the virtual machine (VM) retain its IP network address. As a consequence, VM migration is oftentimes restricted to movement within an IP subnet or entails interrupted network connectivity to allow the VM to migrate. Thus, migrating VMs beyond subnets becomes a significant challenge for the purposes of load balancing, moving computation close to data sources, or connectivity recovery during natural disasters. Conventional approaches use tunneling, routing, and layer-2 expansion methods to extend the network to geographically disparate locations, thereby transforming the problem of migration between subnets to migration within a subnet. These approaches, however, increase complexity and involve considerable human involvement. The contribution of our paper is to address the aforementioned shortcomings by enabling VM migration across subnets and doing so with uninterrupted network connectivity. We make the case that decoupling IP addresses from the notion of transport endpoints is the key to solving a host of problems, including seamless VM migration and mobility. We demonstrate that VMs can be migrated seamlessly between different subnets - without losing network state - by presenting a backward-compatible prototype implementation and a case study.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127765694","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}

引用次数: 25

Transparent Network Protocol Testing and Evaluation 透明网络协议测试与评估

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

Xiaoshuang Wang, Sunil Agham, Vikram P. Munishwar, Vaibhav Nipunage, Shailendra Singh, Kartik Gopalan

{"title":"Transparent Network Protocol Testing and Evaluation","authors":"Xiaoshuang Wang, Sunil Agham, Vikram P. Munishwar, Vaibhav Nipunage, Shailendra Singh, Kartik Gopalan","doi":"10.1109/ICCCN.2013.6614205","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614205","url":null,"abstract":"Network protocol developers typically go through a tedious and error-prone process of testing and debugging their protocol implementation for various settings. They perform a number of tasks manually such as configuration of numerous network settings, controlled reproduction of unexpected protocol behavior, and traffic capture and analysis. We present a Protocol Testing and Evaluation System (PTES) to assist developers in transparently testing their protocol implementations. PTES enables a protocol developer to construct and execute various controlled and repeatable testing scenarios. The developer can use simple iptables- like rules to specify various local and distributed network events and actions. During protocol execution, PTES triggers these events and actions in a coordinated manner and records the protocol responses to these events which can later be examined by the developer. We present the design and implementation of three variants of PTES for native, simulated, and emulated platforms for both wired and wireless networks. We demonstrate the utility of PTES by automating the testing of TCP/IP and Optimized Link State Routing (OLSR) protocols.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062823","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 Virtual Network Allocation Algorithm for Reliability Negotiation 基于可靠性协商的虚拟网络分配算法

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

R. Gomes, L. Bittencourt, E. Madeira

引用次数: 14

An Approach for Privacy Enhanced Pixel-Level Image Processing in Hybrid Clouds 混合云中增强隐私的像素级图像处理方法

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

Arash Nourian, Muthucumaru Maheswaran

引用次数: 0

Continuous Gossip-Based Aggregation through Dynamic Information Aging 基于动态信息老化的持续八卦聚合

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

Vitaliy Rapp, Kalman Graffi

引用次数: 10

Games of Timing Theoretical Protocol Development and Performance Analysis for Missile Defense 导弹防御定时博弈理论协议开发与性能分析

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

C. Niznik

{"title":"Games of Timing Theoretical Protocol Development and Performance Analysis for Missile Defense","authors":"C. Niznik","doi":"10.1109/ICCCN.2013.6614140","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614140","url":null,"abstract":"The games of timing theory enforcing optimal timing intervals and two optimal strategies will be expressed as the following two software theory generated protocols. The two optimal strategy software protocols are first, the battle manager must optimally allocate sensor and weapon systems with the threat launch events. This Internal Battle Manager Decision Optimization(BMDO) Protocol requires the threat constraints of (1) perceived threat inventory, (2) threat missile, and (3) ground asset being attacked. The theoretical generation of the games of timing optimal timing intervals and the two optimal strategies are derived realizing risk management equations within the BMDO Protocol optimization constraints solutions. Invariant Imbedding is the mathematical concept required to contain the BMDO Protocol within the Kernel of the games of timing optimal strategy and optimal timing interval solution to achieve the second and final optimal strategy protocol, the Optimal Battle Manager Decision(OBMD) Protocol. The performance analysis of the OBMD Protocol for constraints and requirements on processor capability and timeliness on a Network Centric Star Topology Architecture is also described for the two Models, Model 1 Mid-course Engagement scenario, and Model 2 Ascent Phase in the Target Trajectory.","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117102997","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

Channel Detecting Jamming Attacks against Jump-Stay Based Channel Hopping Rendezvous Algorithms for Cognitive Radio Networks 基于跳驻留的认知无线网络跳频交会算法的信道检测干扰攻击

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

Young-Hyun Oh, D. Thuente

{"title":"Channel Detecting Jamming Attacks against Jump-Stay Based Channel Hopping Rendezvous Algorithms for Cognitive Radio Networks","authors":"Young-Hyun Oh, D. Thuente","doi":"10.1109/ICCCN.2013.6614113","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614113","url":null,"abstract":"Recently many channel hopping algorithms have been studied to guarantee rendezvous for Cognitive Radio Networks (CRNs). These algorithms propose rendezvous methods without using common control channels (CCCs) to avoid the limitations such as single point of failure, low scalability, and jamming attacks. In particular, the Jump-Stay based channel hopping rendezvous (JSR) algorithms provide guaranteed rendezvous for CRNs with no time synchronization or CCCs (i.e., blind rendezvous). However, the JSR algorithms are still vulnerable to Channel Detecting Jamming Attacks (CDJAs) in which the jammer can estimate the channel hopping sequences within the first jump-pattern. The jammer can compute the entire JSR channel hopping sequence and thus reduce the rendezvous success rate from 100% to less than 20% and 10% using one and two listening channels respectively. To mitigate this problem, we revisit both the Random rendezvous scheme and the Role-based Channel Rendezvous (RCR) scheme extended from role- based rendezvous algorithms to increase the probability of the rendezvous against the CDJAs. We also compare the JSR algorithm to both the Random and RCR algorithms and show the Random and RCR vastly outperform the JSR algorithm when there are security concerns about a channel detecting jammer. Especially, the effectiveness of CDJA is negligible for the Random and RCR schemes but their expected time to rendezvous (TTR) is close to the JSR's expected TTR.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114641711","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

DECIMA: Virtualized I/O Management in 3D Teleimmersive Networks 三维远程沉浸式网络中的虚拟I/O管理

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

Raoul Rivas, A. Arefin, K. Nahrstedt

引用次数: 0

Resource Allocation in OFDMA Femto Networks OFDMA Femto网络中的资源分配

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

Debalina Ghosh, P. Mohapatra

引用次数: 2