2015 IEEE Symposium on Computers and Communication (ISCC)最新文献_第6页

Experimenting with alternative path tracing solutions 试验替代路径跟踪解决方案

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405552

Pietro Marchetta, Walter de Donato, V. Persico, A. Pescapé

{"title":"Experimenting with alternative path tracing solutions","authors":"Pietro Marchetta, Walter de Donato, V. Persico, A. Pescapé","doi":"10.1109/ISCC.2015.7405552","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405552","url":null,"abstract":"Tracing Internet paths is essential for gathering knowledge about the complex, heterogeneous, highly dynamic, and largely opaque eco-system of networks the Internet is. Currently, only two practical solutions are available: (i) equipping packets with the Record Route IP option to register addresses of the traversed routers; (ii) eliciting ICMP Time Exceeded messages by limiting the Time-to-Live of the injected packets. In this paper, we investigate three alternative path tracing solutions eliciting ICMP Parameter Problem (PP) messages from the network through the injection of malformed packets. After having introduced them, we describe the experimental results of a first campaign aiming at evaluating their ability to collect replies from the traversed routers. Finally, thanks to a large-scale multi-vantage points measurement campaign, we evaluate the ability of the most promising ICMP PP-based solution to discover interfaces and routers not discovered by Paris-Traceroute Multipath Detection Algorithm (MDA). Experimental results (a) confirm the ability of this novel path tracing solution to report interfaces and routers that are not reported by the state of the art tools and also (b) uncover the scenarios in which this new solution appears more helpful.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117289844","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

IMS centric communication supporting WebRTC endpoints IMS中心通信支持WebRTC端点

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405601

Bruno Simoes Cruz, J. Barraca

引用次数: 3

Android app recommendation approach based on network traffic measurement and analysis 基于网络流量测量与分析的Android应用推荐方法

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405642

Xin Su, Dafang Zhang, Wenjia Li, Wenwei Li

引用次数: 8

VBalance: A selection policy of virtual machines for load balancing in cloud computing VBalance:云计算中用于负载均衡的虚拟机选择策略

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405607

Filipe Fernandes S. B. de Matos, J. Celestino, A. R. Cardoso

{"title":"VBalance: A selection policy of virtual machines for load balancing in cloud computing","authors":"Filipe Fernandes S. B. de Matos, J. Celestino, A. R. Cardoso","doi":"10.1109/ISCC.2015.7405607","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405607","url":null,"abstract":"Cloud computing is a new computing paradigm, in which the data processing and data storage are offered to customers similar to services accessed over the Internet. These services are represented by Virtual Machines (VMs) which are hosted by real servers located in large data centers. The Virtual Machines share the physical resources offered by servers. The growing demand for solutions related to Cloud has resulted in greater investments in electrical power for service providers. Today, this financial cost represents one of the greatest expenditures incurred by maintaining such data centers. Therefore, solutions have been proposed to minimize power expenditure while maintaining maximum care with requirements demanded by customers. This work presents a selection policy project utilized for the balance of workloads among servers in a data center. The proposed policy will address power issues during its selection process. The VBalance policy will select for migration, the VM that contributes most to the power consumption of the server by using the Multiple Linear Regression (MLR) model. Furthermore, a comparative analysis is made of the proposed solution with other existing models, in order to evaluate the performance.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"28 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114382795","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

Social-based forwarding in multi-channel vehicular networks 多通道车辆网络中基于社交的转发

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405511

Matthias Sander Frigau

{"title":"Social-based forwarding in multi-channel vehicular networks","authors":"Matthias Sander Frigau","doi":"10.1109/ISCC.2015.7405511","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405511","url":null,"abstract":"Recently a lot of effort has been dedicated to maximize throughput in highly mobile multi-channel networks such as vehicular networks. Nevertheless, distributing the load as equally as possible between service channels varying in space and time is still a matter of investigation. The contributions of this paper are two-fold. Firstly, we present an adaptive multi-channel allocation mechanism (AMC) that relies on space-time discretization to fairly balance the load on service channels. Secondly, this paper investigates how the delivery performance of service updates can be enhanced by targeting vehicles which exhibit higher centrality. A Social-based Relaying Strategy (SRS) which optimizes the dissemination of service updates to create a wider situation awareness between areas of interest is introduced. This stateless strategy exploits knowledge from the social properties of the communication graph into its forwarding's weighting function. More particularly the weighting function includes a localized version of the clustering coefficient metric and the lobby index in order to select forwarding vehicles with high centrality and strong connectivity. Simulations based on a post-crash scenario demonstrate that SRS can substantially improve the delivery performance compared to GPSR-MA, a stateless geographical forwarding algorithm and slightly outperforms another social-based forwarding strategy which only accounts for lobby index.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114851565","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

A version-aware computation and storage trade-off strategy for multi-version VoD systems in the cloud 云中多版本视频点播系统的版本感知计算和存储权衡策略

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405635

Hui Zhao, Q. Zheng, Weizhan Zhang, Biao Du, Yuxuan Chen

{"title":"A version-aware computation and storage trade-off strategy for multi-version VoD systems in the cloud","authors":"Hui Zhao, Q. Zheng, Weizhan Zhang, Biao Du, Yuxuan Chen","doi":"10.1109/ISCC.2015.7405635","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405635","url":null,"abstract":"Nowdays, many Video-on-Demand (VoD) providers offer multiple-quality video streaming services to heterogeneous clients, called as multi-version VoD. Some researches focus on video transcoding in real-time or video layered encoding/decoding, but they are not widely used in VoD industry. Storing multiple versions of the same video is an easy solution, but it consumes lots of storage space. Although there are also a few works about trading-off between transcoding and storage, they did not utilize the transcoding relationships among different versions and took the video popularity into account, which bring that they may have little cost-efficiency for multi-version VoD systems. To minimize the cost, in this paper, we propose a version-aware transcoding computation and storage trade-off strategy for multi-version VoD systems in the cloud. Firstly, it utilizes the transcoding weight graph to describe the transcoding relationships among different versions of a video. According to the graph, the transcoding computation cost from one version to another version can be calculated. Secondly, it takes the video popularity of different versions, the prices of storage and computation resources in the cloud into account to decide which versions of which videos should be stored or transcoded. We then formulate it as an optimization problem and present a heuristic approximate optimal solution. Finally, we conduct extensive simulations to evaluate our strategy and solution, and the results show that they can significantly lower the cost of multi-version VoD systems.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916110","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}

引用次数: 22

Discovering high-impact routing events using traceroutes 使用traceroutes发现影响较大的路由事件

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405531

M. D. Bartolomeo, V. Donato, M. Pizzonia, Claudio Squarcella, M. Rimondini

{"title":"Discovering high-impact routing events using traceroutes","authors":"M. D. Bartolomeo, V. Donato, M. Pizzonia, Claudio Squarcella, M. Rimondini","doi":"10.1109/ISCC.2015.7405531","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405531","url":null,"abstract":"With the increasing diffusion of Internet probing technologies, a large amount of regularly collected traceroutes are available for Internet Service Providers (ISPs) at low cost. We introduce a practically applicable methodology and algorithm that, given solely an arbitrary set of traceroutes, spot routing paths that change similarly over time, aggregate them into inferred events, and report each event along with the impacted observation points and a small set of IP addresses that can help identify its cause. The formal model at the basis of our methodology revolves around the notion of empathy, a relation that binds similarly behaving traceroutes. The correctness and completeness of our approach are based on structural properties that are easily expressed in terms of empathic measurements. We perform experiments with data from public measurement infrastructures like RIPE Atlas, showing the effectiveness of our algorithm in distilling events from a large amount of traceroute data. We also validate the accuracy of the inferred events against ground-truth knowledge of routing changes originating from induced and spontaneous routing events. Given these promising results, we believe our methodology can be an effective aid for ISPs to detect and track routing changes affecting many users (with potentially adverse effects on their connection quality).","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125415838","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

Dynamic ring for seamless mobility in identity centric networks 在以身份为中心的网络中实现无缝移动的动态环

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405633

Dagang Li, Wenpeng Sha

{"title":"Dynamic ring for seamless mobility in identity centric networks","authors":"Dagang Li, Wenpeng Sha","doi":"10.1109/ISCC.2015.7405633","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405633","url":null,"abstract":"Identity centric networks (IdCN), in which packets are destined to user identities, is one of the future network architectures under discussion. Since user mobility is already widely observed in the current Internet and seen as one of the main features of the future Internet, seamless mobility needs to be kept in mind for whatever routing mechanisms developed for IdCN. However, seamless handoff techniques from the IP world won't work because no Care-of-Address or the alike is available in IdCN to help quickly locating the mobile user's new position, therefore it is difficult to redirect the packets in transit before the routing protocol re-finds the moved users. In this paper a dynamic ring mechanism that does not rely on but can work with any IdCN routing protocol is proposed to support seamless handoff in IdCN. During a handoff, the mobile user makes use of this ring to keep its global connectivity, and leaves after the handoff finishes. Appropriate timing of hooking to and leaving the ring is crucial to keep the overhead at minimum. Experiments show that the proposed mechanism can indeed prevent most packet drops and keep the flow running during handoffs at reasonably lower cost than simple retransmission.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126172544","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

Benchmarking the load scalability of IPv6 transition technologies: A black-box analysis 对IPv6转换技术的负载可扩展性进行基准测试:一个黑盒分析

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405536

M. Georgescu, H. Hazeyama, T. Okuda, Y. Kadobayashi, S. Yamaguchi

引用次数: 1

A metric-correlation-based fault detection approach using clustering analysis in wireless sensor networks 基于度量相关的无线传感器网络聚类故障检测方法

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405568

Qiang Liu, Yang Yang, Xue-song Qiu

{"title":"A metric-correlation-based fault detection approach using clustering analysis in wireless sensor networks","authors":"Qiang Liu, Yang Yang, Xue-song Qiu","doi":"10.1109/ISCC.2015.7405568","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405568","url":null,"abstract":"Fault detection plays a crucial role in wireless sensor networks (WSNs). Many fault detection approaches requiring a priori knowledge of network faults have been proposed to distinguish faulty sensors by exploring spatial-temporal correlations among sensor readings. However, many faulty sensors that may not generate anomalous sensor readings, and potential failures with unknown types and symptoms remain undetected. In this paper, we propose a Metric-Correlation-Based Fault Detection (MCFD) approach using clustering analysis. It is motivated by the fact that the system metric correlations of most fault-free sensors usually show strong similarities, whereas different patterns of such correlations indicate potential failures. MCFD explores internal metric correlations inside sensors using correlation value views. An improved Neighbor-based Local Density Clustering Analysis (NLDCA) algorithm based on the Neighbor-based Local Density Factor (NLDF) is applied in spatial domain detection to cluster similar correlation value views together, thus potential faulty sensors with abnormal views not belonging to any cluster can be detected. Simulation results demonstrate that MCFD approach performs well in respects of higher detection accuracy and lower false positive rate even under high node failure ratios and dense distribution conditions.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124389438","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