2011 IEEE 10th International Symposium on Network Computing and Applications最新文献

Performance Evaluation of DCB's Priority-Based Flow Control 基于优先级的DCB流量控制性能评价

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.58

Mikkel Hagen, Ryan Zarick

引用次数: 5

Decentralized Topology Aggregation for QoS Estimation in Large Overlay Networks 基于分散拓扑聚合的大型覆盖网络QoS估计

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.51

S. Wieser, L. Böszörményi

引用次数: 5

Efficient Encoding for Generalized Reed Solomon Codes 广义Reed - Solomon码的高效编码

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.52

M. Shrestha, Lihao Xu

引用次数: 1

Validation of Security Solutions for Communication Networks: A Policy-Based Approach 通信网络安全解决方案的验证:基于策略的方法

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.23

S. Rekhis, Baha Bennour, N. Boudriga

{"title":"Validation of Security Solutions for Communication Networks: A Policy-Based Approach","authors":"S. Rekhis, Baha Bennour, N. Boudriga","doi":"10.1109/NCA.2011.23","DOIUrl":"https://doi.org/10.1109/NCA.2011.23","url":null,"abstract":"Typically, security solutions are defined to meet the requirements of security policies, and are configured to implement some of their rules. Approaches proposed so far in the literature to validate security solutions have merely taken interest to the need of: a) describing the security policy used to define and configure these solutions b) generating executable description of attack scenarios targeting the secured system and c) verifying whether the secured systems react as expected. In this paper we develop a logic-based approach for the modeling of security policies and solutions based on the concept of observations, and the generation of executable scenarios of attacks. This approach provides a unified formalism for the specification of security policies, security solutions, library of legitimate actions and attacks, and correctness rules in the form of predicates over executions. We propose a modeling of two types of security solutions, namely passive and active solutions. We develop a Model Checker to generate executable scenarios of attacks, verify the security state of the system, and test whether the solutions react as expected to security attacks. A case study is proposed to illustrate the proposal.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124053563","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

Scheduler Vulnerabilities and Coordinated Attacks in Cloud Computing 云计算中的调度程序漏洞和协同攻击

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.24

Fangfei Zhou, Manishi Goel, Peter Desnoyers, Ravi Sundaram

{"title":"Scheduler Vulnerabilities and Coordinated Attacks in Cloud Computing","authors":"Fangfei Zhou, Manishi Goel, Peter Desnoyers, Ravi Sundaram","doi":"10.1109/NCA.2011.24","DOIUrl":"https://doi.org/10.1109/NCA.2011.24","url":null,"abstract":"Recently, cloud computing services such as Amazon EC2 have used virtualization to provide customers with virtual machines running on the provider's hardware, typically charging by wall clock time rather than resources consumed. Under this business model, manipulation of the scheduler may allow theft-of-service at the expense of other customers. We have discovered and implemented an attack scenario which when implemented on Amazon EC2 allowed virtual machines to consume more CPU time regardless of fair share. We provide a novel analysis of the necessary conditions for such attacks, and describe scheduler modifications to eliminate the vulnerability. We present experimental results demonstrating the effectiveness of these defenses while imposing negligible overhead. Cloud providers such as Amazon's EC2 do not explicitly provide the mapping of VMs to physical hosts. Our attack itself provides a mechanism for detecting the co-placement of VMs, which in conjunction with appropriate algorithms can be utilized to reveal this mapping. We abstract mapping discovery as a problem of finding an unknown partition (i.e. of VMs among physical hosts) using a minimum number of co-location queries. We present an algorithm that is provably optimal when the maximum partition size is bounded. In the unbounded case we show upper and lower bounds using the probabilistic method in conjunction with a sieving technique. Our work has implications beyond this attack, for other cases of system and network topology inference from limited data.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115968071","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}

引用次数: 98

Towards Resilient Synchronous e-Training Platforms 迈向弹性同步电子训练平台

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.42

J. C. Granda, Pelayo Nuño, D. García, F. J. Suárez

引用次数: 2

Timely Arbitrator Selection in P2P Virtual Environments with 3D Voronoi Diagrams 三维Voronoi图在P2P虚拟环境中的及时仲裁选择

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.40

Mahathir Almashor, I. Khalil

{"title":"Timely Arbitrator Selection in P2P Virtual Environments with 3D Voronoi Diagrams","authors":"Mahathir Almashor, I. Khalil","doi":"10.1109/NCA.2011.40","DOIUrl":"https://doi.org/10.1109/NCA.2011.40","url":null,"abstract":"Dynamically selecting game-play arbitrators remains a key concern in fully Peer-to-Peer Virtual Environments (P2P-VE). The lack of hierarchical structures and dedicated servers mean suitable candidates must be chosen from amongst the peer population. These selected peers are elevated to the role of momentary referees, deciding on the outcomes of interactions (e.g., combat) between adversarial peers. Accordingly, a timely selection process will aid game-play responsiveness in such time-sensitive applications. There is a need to promptly affirm the arbitrator as delays will hinder peers from initiating combat, impeding game-play. The aim is to address this singular issue, investigating a myriad of selection policies contrived within the context of 3D Voronoi Diagrams (3D-VD). Prior art utilized basic 2D varieties to spatially cluster peers and limit network traffic growth. The work presented here augments this approach with a non-spatial Z-axis and the use of unique selection algorithms. Each mechanism is discussed and extensively tested, with detailed simulation results presented herein. We thus demonstrate 3D-VD's unique ability to deterministically appoint such on-the-fly adjudicators from localised candidate pools in a timely manner.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122294376","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

A Hybrid Granularity Graph for Improving Adaptive Application Partitioning Efficacy in Mobile Computing Environments 一种提高移动计算环境下自适应应用分区效率的混合粒度图

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.16

E. Abebe, C. Ryan

引用次数: 17

ScaleStream - An Adaptive Replication Algorithm for Scalable Multimedia Streaming ScaleStream -可扩展多媒体流的自适应复制算法

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.39

Shabnam Ataee, B. Garbinato, Mouna Allani, F. Pedone

引用次数: 1

NoC Reconfiguration for CMP Virtualization CMP虚拟化的NoC重构

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.37

F. Triviño, F. J. Alfaro, J. L. Sánchez, J. Flich

引用次数: 5