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

DMCTCP: Desynchronized Multi-Channel TCP for high speed access networks with tiny buffers DMCTCP:用于具有微小缓冲区的高速接入网络的非同步多通道TCP

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

Cheng Cui, Lin Xue, Chui-Hui Chiu, Praveenkumar Kondikoppa, Seung-Jong Park

引用次数: 4

Channel reservation based on contention and interference in wireless ad hoc networks 无线自组网中基于争用和干扰的信道保留

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

Xinming Zhang, Zhilong Dai, Haitao Zhu

{"title":"Channel reservation based on contention and interference in wireless ad hoc networks","authors":"Xinming Zhang, Zhilong Dai, Haitao Zhu","doi":"10.1109/ICCCN.2014.6911824","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911824","url":null,"abstract":"Packet loss in multi-hop wireless ad hoc networks is an important factor in network performance optimization. Typically, MAC frame collisions and queue overflow caused by MAC contentions and interference are the main reasons of packet loss. Recently, MAC frame collisions had been paid much attentions to in mitigating packet loss. Whereas, queue overflow among inter-flow has rarely attracted attentions. In this paper, we first analyze how contentions among inter-flows will cause queue overflow and further packet loss. We show network local spatial reuse is also an important factor which will cause queue overflow at a forwarding station. With the information of queue status, each forwarding station determines whether to reserve the transmission of subsequent frames in the waiting queue. The reserved data frames will not suffer from contentions and interference and network local channel utilization is also improved. By theory analysis and simulations, we show our proposed channel reservation scheme can effectively reduce packet loss and improve network local channel efficiency in multi-hop wireless networks.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"15 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":"124358240","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

TCP congestion control based on accurate bandwidth-delay product in wireless Ad hoc networks 基于精确带宽延迟积的无线自组网TCP拥塞控制

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

Xinming Zhang, Bo Yang, Yangyang Ma

引用次数: 3

A novel human mobility model for MANETs based on real data 一种基于真实数据的人的移动网络模型

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

Ahmad Foroozani, Mohammed Gharib, A. Hemmatyar, A. Movaghar

引用次数: 4

A new interference model for the IEEE 802.22 cognitive WRAN 一种新的IEEE 802.22认知无线局域网干扰模型

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

Yanxiao Zhao, Md Nashid Anjum, Min Song

{"title":"A new interference model for the IEEE 802.22 cognitive WRAN","authors":"Yanxiao Zhao, Md Nashid Anjum, Min Song","doi":"10.1109/ICCCN.2014.6911747","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911747","url":null,"abstract":"The IEEE 802.22 cognitive Wireless Regional Area Networks (WRAN) uses cognitive radio technique to allow Secondary Users (SUs) to opportunistically share the TV bands with TV broadcast service on a non-interfering basis and hence improve the spectrum utilization. WRAN employs Orthogonal Frequency Division Multiplexing (OFDM) technology for transmission and thus is sensitive to inter-carrier interference. So one of the challenging issues in WRAN performance analysis is the interference analysis from SUs. Existing research on interference primarily focuses on the co-channel interference. The study of inter-carrier interference in WRAN has not received considerable attention. In this paper, we design a new interference model for IEEE 802.22 cognitive WRAN that incorporates both the co-channel interference and inter-carrier interference. We first examine the interference in the context of one SU, and then study the aggregate interference in the context of multiple SUs. Existing work on studying the aggregate interference is to derive its probability density function, which is known computationally intensive. In this paper, we investigate the aggregate interference from a new perspective. Instead of deriving the probability density function, we calculate the aggregate interference by estimating the maximum number of interfering SUs. Our results suggest that the maximum number typically ranges from 6 to 10 depending on the network configurations. This finding significantly simplifies the interference estimation process. To verify the new interference model, comprehensive simulations are performed. Results confirm that the inter-carrier interference cannot be ignored especially when a high frequency offset is present. The maximum number of SUs and its effectiveness are also validated.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"15 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":"115462434","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

Review of energy aware big data computing measurements, benchmark methods and performance analysis 回顾能源意识大数据计算测量，基准方法和性能分析

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

Zane Wei, D. Ren

引用次数: 3

SLA evaluation in cloud-based data-centric distributed services 基于云的以数据为中心的分布式服务中的SLA评估

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

K. Ravindran, Michael Iannelli

{"title":"SLA evaluation in cloud-based data-centric distributed services","authors":"K. Ravindran, Michael Iannelli","doi":"10.1109/ICCCN.2014.6911762","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911762","url":null,"abstract":"Given the business mode of offering computing services to customers in a cloud setting, a major question arises: how good are the services of a cloud provider when compared to that of other providers. The paper attempts to answer the question by describing a methodology to measure the various cloud parameters (such as VM cycles and number of VM instances) at run-time and map them onto meaningful service-level attributes. The paper provides a concrete definition of the service attributes experienced by the client application: such as availability, agility, and elasticity, in terms of the underlying cloud infrastructure parameters (i.e., VM instances and network bandwidth). Since the IaaS parameters are hard to measure directly, we resort to a measurement methodology that maps the client-visible PaaS-layer service attributes onto the underlying IaaS parameters exported by the cloud provider. Our measurement methodology satisfies the requirements of cloud testing: stealthiness and non-intrusiveness, while minimizing the measurement overhead. The methodology is tested using a replicated image data store implementation on the PlanetLab.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"40 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004623","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

An incentive protocol for distributed dynamic P2P video-on-demand streaming 分布式动态P2P视频点播流的激励协议

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

Wenbin Tang, Xiaowei Wu, T-H. Hubert Chan

{"title":"An incentive protocol for distributed dynamic P2P video-on-demand streaming","authors":"Wenbin Tang, Xiaowei Wu, T-H. Hubert Chan","doi":"10.1109/ICCCN.2014.6911874","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911874","url":null,"abstract":"P2P file streaming has become very popular in online video sharing. Under the video on demand (VoD) setting, peers in the network may be interested in different portions of the same video. It is a new challenge to distribute the server load to peers under the VoD setting while at the same time maintaining the streaming performance, i.e., low latency and good fluency. Our approach is to use techniques in social recommendation to spread information on which portions are currently popular. However, peers might not always reveal the truth, because of privacy issues or selfish behavior. In this paper, we describe and discuss a synchronized large-scale P2P VoD system in which each peer can only communicate with one other peer in one round. We assume the video to be streamed is divided into M consecutive chunks and only one chunk can be transmitted due to network bandwidth every communication. We decentralize the whole system such that each peer has no extra information about the network or how other peers behave, and can only communicate with its own neighbors independently without the help of tracker to obtain robustness. Moreover, the model we consider is fully dynamic: peers leave and join the network frequently. We show by experiment that even under the bounded connection, bounded transmission and distributed setting, our protocol ensures that almost all peers in the dynamic P2P VoD network can achieve low latency and good fluency in different kinds of network topologies. We also analyze the streaming performance when peers behave differently (selfish vs. unselfish). We show that peers have little incentive to be selfish in our protocol, which means that our protocol is in a sense self-enforcing.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"1 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":"130613861","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

Investigating the fractal nature of individual user netflow data 调查个人用户netflow数据的分形性质

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

L. Malott, S. Chellappan

{"title":"Investigating the fractal nature of individual user netflow data","authors":"L. Malott, S. Chellappan","doi":"10.1109/ICCCN.2014.6911837","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911837","url":null,"abstract":"Modeling and characterizing Internet traffic has been a widely studied problem since the conception of the Internet. The self-similar, bursty nature of the traffic has led to a number of conventional statistical models that unfortunately provide relatively weak modeling power. Recently, fractal analysis techniques have emerged to better characterize and model Internet traffic data. However, past research studies have focused on describing and quantifying the fractal nature of Internet traffic on user groups, instead of a single user. In this paper the authors investigate the issue of individual users exhibiting fractal (self-similar behavior) behavior across multiple application types. Using real Internet traffic traces (collected via Net-Flow logs) collected at a college campus for 30 days, our investigations reveal that in a number of application categories (http, chatting, p2p, email etc.) at least one user exhibits long-range correlations typical of fractal behavior. Of the 10 application groups, 7 had over 80% of users demonstrating self-similar behavior with 3 of those groups having > 98%. Potential benefits of our study in the realm of smart health and network security, by reducing the dimensionality of large Internet traffic datasets, are discussed.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"9 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":"131928062","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

Dynamic embedding of virtual networks in hybrid optical-electrical datacenters 光电混合数据中心中虚拟网络的动态嵌入

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

S. Hegde, Raksha Srinivas, D. Divakaran, G. Mohan

{"title":"Dynamic embedding of virtual networks in hybrid optical-electrical datacenters","authors":"S. Hegde, Raksha Srinivas, D. Divakaran, G. Mohan","doi":"10.1109/ICCCN.2014.6911749","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911749","url":null,"abstract":"A promising development in the design of datacenters is the hybrid network architecture consisting of both optical and electrical elements. In this context, the joint problem of bandwidth allocation and VM-placement, a problem that only recently received attention in all-electrical datacenter networks, poses new and different challenges not addressed yet in hybrid datacenters. In particular, we foresee two issues: (i) the number of edge-switches that can be simultaneously reached using optical paths from an edge-switch is limited by the switch size, (ii) the dynamic creation of optical paths can potentially establish a constrained optical network topology leading to poor performance. We abstract the requests of tenants as virtual networks, and study the problem of embedding virtual networks on a hybrid datacenter, which translates to the joint problem of bandwidth allocation and placement such that the topology constraints of virtual networks are satisfied. We develop and analyse two algorithms for embedding dynamically arriving virtual network demands on a hybrid optical-electrical datacenter. Through simulations, we demonstrate the effectiveness of not only exploiting the already established optical paths, but also of using electrical network in embedding requests of virtual networks.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"9 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":"132906749","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