2014 23rd International Conference on Computer Communication and Networks (ICCCN)最新文献_第2页

Tualatin: Towards network security service provision in cloud datacenters 面向云数据中心的网络安全服务提供

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911782

Xiang Wang, Zhi Liu, Jun Li, Baohua Yang, Yaxuan Qi

引用次数: 9

Hybrid opportunistic routing in highly dynamic MANET 高动态MANET中的混合机会路由

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911863

C. Aung, P. Chong, R. Cai

引用次数: 6

LOCON: A lookup-based content-oriented networking framework LOCON:基于查找的面向内容的网络框架

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911755

Eunsang Cho, Jaeyoung Choi, Dong-Hyoun Kim, J. Yoon, T. Kwon, Yanghee Choi

{"title":"LOCON: A lookup-based content-oriented networking framework","authors":"Eunsang Cho, Jaeyoung Choi, Dong-Hyoun Kim, J. Yoon, T. Kwon, Yanghee Choi","doi":"10.1109/ICCCN.2014.6911755","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911755","url":null,"abstract":"While the current Internet has a host-based TCP/IP architecture, the vast majority of Internet usage is attributed to the content retrieval and distribution. This mismatch has proliferated content delivery network (CDN) technologies and P2P file-sharing systems (e.g., BitTorrent); however, the inefficiency of content delivery is not fundamentally solved, and there are business/operation and content copyright/availability issues, respectively. Also, in the research community, there have been efforts to redesign the current architecture from a content-centric perspective by introducing the route-by-name paradigm and in-network caching, which however entails many issues like the routing scalability and processing overhead. We propose a lookup-based communication framework for content-oriented networking (LOCON), whose main components are locator lookup, coordinated caching, and parallel transmissions. LOCON aims to accommodate incremental deployment, support legacy end-hosts, and provide business incentives between network operators and content publishers. To carry out the experiments, we build a networking testbed on top of Amazon data centers around the world. LOCON performs better than other lookup-by-name networking technologies and CCN (i.e., a route-by-name scheme) in terms of content delivery metrics.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125879805","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

JCCA resource allocation for video transmission in OFDMA relay system OFDMA中继系统中视频传输JCCA资源分配

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911834

Yimin Zhang, Guizhong Liu

引用次数: 0

Rate-adaptive broadcast routing and scheduling for video streaming in wireless mesh networks 无线网状网络中视频流的速率自适应广播路由和调度

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911816

Yanan Chang, X. Jia

{"title":"Rate-adaptive broadcast routing and scheduling for video streaming in wireless mesh networks","authors":"Yanan Chang, X. Jia","doi":"10.1109/ICCCN.2014.6911816","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911816","url":null,"abstract":"In this paper, we address the problem of broadcast routing and scheduling of video streaming for delay-sensitive applications in backbone WMNs. Given a source node and a set of destinations, our task is to build a broadcast routing tree and compute an optimal transmission schedule such that the network throughput for the source to broadcast streaming data to all the destinations is maximized. The problem is challenged by both rate-adaptive broadcast and inter/intra-flow interference caused by video streaming. We divide the whole period for video broadcast into identical time frames and prove that maximizing the total throughput can be converted into minimizing the length of a time frame. We formulate the minimization problem as a mixed integer quadratically constrained program and propose a three-step method as a solution. Firstly, we build the broadcast routing tree by defining a new routing metric to select the relay nodes. Then we use local search to adjust the tree structure. Last, we propose a greedy method to make scheduling of concurrent transmissions without causing inter/intra-flow interference. Extensive simulations have demonstrated that our proposed method can improve the performance significantly compared with existing routing and scheduling methods.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129558909","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

Achieving data K-Availability in intermittently connected sensor networks 在间歇连接传感器网络中实现数据k -可用性

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911795

Bin Tang, Neeraj Jaggi, M. Takahashi

{"title":"Achieving data K-Availability in intermittently connected sensor networks","authors":"Bin Tang, Neeraj Jaggi, M. Takahashi","doi":"10.1109/ICCCN.2014.6911795","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911795","url":null,"abstract":"We consider the problem of preserving data in intermittently connected sensor networks wherein sensor nodes do not always have connected paths to the base stations. The generated data is first stored inside the network before being uploaded to the base station when uploading opportunities arise. Each node has both limited energy level and limited storage space, and is associated with a probability of failure. To guarantee that at any moment, each generated data item is available for being uploaded in the presence of node failure, we propose to replicate K copies of each data item in the network, where K depends upon the node failure probability. We refer to the problem as Data K-Availability Problem (DKAP). DKAP is naturally divided into two phases: K-Availability creation and K-Availability maintenance. For K-Availability creation, we show that the problem is NP-hard for arbitrary data sizes, and that it is equivalent to minimum cost flow problem for unit data sizes. For K-Availability maintenance, we show that it is NP-hard even for unit data sizes and design a centralized greedy heuristic. We further design an efficient and low-overhead distributed algorithm, which is applicable to both phases, and show using extensive simulations that it performs close to the heuristic.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"399 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130697248","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

Transient magnetic field formulation for solid source conductors with axial symmetry 轴对称固体源导体瞬态磁场公式

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911836

G. Wimmer

引用次数: 0

Key technologies for SON in next generation radio access networks 下一代无线接入网络中SON的关键技术

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911745

Xin Su, Jie Zeng, Chiyang Xiao

引用次数: 3

Dandelion: A locally-high-performance and globally-high-scalability hierarchical data center network 蒲公英:一个本地高性能和全球高可伸缩性的分层数据中心网络

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911750

Binzhang Fu, Sheng Xu, Wentao Bao, Guolong Jiang, Mingyu Chen, Lixin Zhang, Yidong Tao, Rui He, Junfeng Zhao

{"title":"Dandelion: A locally-high-performance and globally-high-scalability hierarchical data center network","authors":"Binzhang Fu, Sheng Xu, Wentao Bao, Guolong Jiang, Mingyu Chen, Lixin Zhang, Yidong Tao, Rui He, Junfeng Zhao","doi":"10.1109/ICCCN.2014.6911750","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911750","url":null,"abstract":"The increasing customer demand is driving modern data centers to embrace the freely-expandable network architecture. Unfortunately, state-of-the-art freely-expandable networks suffer from either the large granularity of expansion or the prohibitive implementation cost. Furthermore, a recent research showed that data center traffic tends to be highly clustered. Based on above observations, this paper proposes a freely-expandable network architecture, namely the dandelion. Dandelion is a two-level hierarchical network, where the first level aims at “high performance” and the second level aims at “high scalability”. The resulting network has two distinct advantages. First, it could arbitrarily expand with a reasonable granularity. Second, the router architecture is efficient as well as highly scalable since 1) the routing table is significantly compressed and 2) a fixed number of virtual channels per physical channel are required regardless of the network size. Finally, the traffic characteristics of four typical cloud applications are analyzed, and the generated traffic patterns are used to evaluate the proposed network architecture. Simulation results prove that the dandelion is a promising network architecture for future data centers.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122916071","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}

引用次数: 3

An IEEE 802.11 quantum handshake using the three-stage protocol 使用三阶段协议的IEEE 802.11量子握手

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911849

Mayssaa El Rifai, P. Verma

引用次数: 5