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

SCAPACH: Scalable Password-Changing Protocol for Smart Grid Device Authentication SCAPACH:智能电网设备认证的可扩展密码更改协议

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

Rehana Tabassum, K. Nahrstedt, E. Rogers, K. Lui

引用次数: 17

A Reserve Price Auction for Spectrum Sharing with Heterogeneous Channels 异构信道频谱共享的保留价格拍卖

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

M. Khaledi, A. Abouzeid

{"title":"A Reserve Price Auction for Spectrum Sharing with Heterogeneous Channels","authors":"M. Khaledi, A. Abouzeid","doi":"10.1109/ICCCN.2013.6614090","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614090","url":null,"abstract":"Cognitive radio is a novel communication paradigm that can significantly improve spectrum utilization by allowing the cognitive radio users to dynamically utilize the licensed spectrum. To achieve this, studying efficient spectrum allocation mechanisms is imperative. In this paper, we consider a cognitive radio network consisting of a primary spectrum owner (PO), multiple primary users (PU) and multiple secondary users (SU). We propose a reserve price auction mechanism for spectrum sharing in cognitive radio networks where the SUs bid to buy spectrum bands from the PO who acts as the auctioneer, selling idle spectrum bands to make a profit. Unlike most existing auction mechanisms that assume identical channels, we consider a more general and more realistic case where channels have different qualities. Also, SUs are allowed to express their preferences for each channel separately. That is, each SU submits a vector of bids, one for each channel. In addition, reservation prices that are proportional to channel qualities are imposed by the PO. The proposed auction mechanism results in efficient allocation that maximizes SUs' valuations subject to reserve price constraints, and it has desired economic properties that we formally prove in the analysis. Numerical results show performance improvements compared to the case of reserve price auction with identical channels and the case of having no reservation prices.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"54 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":"126839804","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

Towards a Cooperative Mechanism Based Distributed Source Address Filtering 基于分布式源地址过滤的协作机制研究

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

Jie Li, J. Bi, Jianping Wu

{"title":"Towards a Cooperative Mechanism Based Distributed Source Address Filtering","authors":"Jie Li, J. Bi, Jianping Wu","doi":"10.1109/ICCCN.2013.6614204","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614204","url":null,"abstract":"While making the Internet totally trustworthy is intractable, making as trustworthy as possible is a crucial problem. Within this landscape, authentication of the IP source address remains one important topic in need of further study. However, most source address validation methods are difficult to implement in practice because of deployment difficulties. This research designs an efficient inter-domain distributed source address validation solution (CatchIt). By employing a novel routing choice notification scheme, CatchIt makes the deployed ASes intelligent by allowing them cooperate to acquire the valid incoming path information of packets. With such knowledge, the deployed ASes can accurately authenticate the source address without the need for any modifications to the de facto routing protocol and packet structure. Moreover, CatchIt helps the deployed ASes proactively and quickly filter spoofed packets before they imperil the network. CatchIt also avoids any false positive, even under partial deployment. Our evaluation also shows that CatchIt is effective and accurate when catching spoofed packets while incurring a low overhead; CatchIt maintains an early deploy and rapidly benefit incremental deployment incentive mechanism.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"70 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":"126780571","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}

引用次数: 5

Secure Name Resolution for Identifier-to-Locator Mappings in the Global Internet 全球互联网中标识符到定位符映射的安全名称解析

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

Xiruo Liu, W. Trappe, Yanyong Zhang

{"title":"Secure Name Resolution for Identifier-to-Locator Mappings in the Global Internet","authors":"Xiruo Liu, W. Trappe, Yanyong Zhang","doi":"10.1109/ICCCN.2013.6614191","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614191","url":null,"abstract":"A recent trend in clean-slate network design has been to separate the role of identifiers from network locators. An essential component to such a separation is the ability to resolve names into network addresses. One challenge facing name resolution is securing the name resolution service. This paper examines the security of a clean-slate name resolution service suitable for mobile networking. We begin with a high-level threat analysis, and identify several types of attacks that may be used against name resolution services. We then present secure protocols that together form a secure global name resolution service. Specifically, we present a secure update protocol that allows users to update their network addresses as they migrate and that includes several checkpoints that prevents spoofing, collusion, stale identifiers and false identifier announcements. Since the primary function behind a name resolution service is to respond to address-lookup queries, we also present a secure query protocol. Finally, we address the security risks associated with IP holes that can arise in a global name resolution service.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"42 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113975444","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

Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput 无干扰无线网状网络实现最大吞吐量的信道要求

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

Aizaz U. Chaudhry, J. Chinneck, R. Hafez

引用次数: 14

Providing Near-Optimal Fair-Queueing Guarantees at Round-Robin Amortized Cost 以轮循平摊代价提供近乎最优的公平排队保证

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

P. Valente

引用次数: 6

Generic Real-Time Traffic Distribution Framework: Black Rider 通用实时交通分配框架:黑骑士

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

S. Frei, W. Fuhrmann, B. Ghita

引用次数: 1

Reciprocity and Fairness in Medium Access Control Games 媒介访问控制博弈中的互惠与公平

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

Mahdi Azarafrooz, R. Chandramouli, K.P. Subbalakshmi

引用次数: 0

Fast Queuing Policies for Multimedia Applications 多媒体应用程序的快速排队策略

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

D. Nguyen-Huu, T. Duong, Thinh P. Q. Nguyen

引用次数: 0

Elastic Network Design and Adaptive Flow Placement in Software Defined Networks 软件定义网络中的弹性网络设计和自适应流布局

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

Julius Mueller, Andreas Wierz, D. Vingarzan, T. Magedanz

{"title":"Elastic Network Design and Adaptive Flow Placement in Software Defined Networks","authors":"Julius Mueller, Andreas Wierz, D. Vingarzan, T. Magedanz","doi":"10.1109/ICCCN.2013.6614131","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614131","url":null,"abstract":"Large scale telecommunication network deployment and its management requires huge Operational Expenditure (OPEX) and Capital Expenditure (CAPEX) from the network operator. Network virtualization, Software Defined Networks (SDN) concepts and Cloud principles enable innovative approaches for introducing elasticity in the network for reducing OPEX. The activation and de-activation of network elements and their efficient interconnection is known as Network Design enabling up- and downscaling of the parts of the entire network on demand based on the traffic situation. Adaptive Flow Placement through SDN controller functionalities introduces novel mechanisms to influence service data flows within the network actively with the goal to distribute the network load equally, increase reliability and reduce cost through deactivation of unused network parts. This paper introduces a novel cost saving approach for on demand elastic Network Design and active Flow Placement in SDN environments. The underlying Network Design problem is being solved using a State of the Art Mixed Integer Programming (MIP) Solver and a sophisticated MIP formulation. A summary concludes this paper.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"90 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":"126448298","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