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

Suggestion of routes for vehicles in vehicular networks using the multicommodity flow model 基于多商品流模型的车辆网络路径建议

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

A. Ribeiro, Guilherme Maia, Fatima de L. P. Duarte-Figueiredo, A. Loureiro

引用次数: 2

Events and causal factors charting of kernel traces for root cause analysis 为根本原因分析绘制内核轨迹的事件和原因图表

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

Yi-Ching Liao, Hanno Langweg

引用次数: 2

Design and implement delay-aware QoS scheme for 3GPP LTE/LTE-A networks for mixed traffic flow 设计并实现了混合流量下3GPP LTE/LTE- a网络延迟感知QoS方案

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

M. R. Tabany, C. Guy

{"title":"Design and implement delay-aware QoS scheme for 3GPP LTE/LTE-A networks for mixed traffic flow","authors":"M. R. Tabany, C. Guy","doi":"10.1109/ISCC.2015.7405451","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405451","url":null,"abstract":"There is a growing demand for mobile networks to support high Quality of Service (QoS) for multiple applications in critical single all IP-based infrastructures. In addition, satisfying end-users' Quality of Experience (QoE) is still crucial. For these reasons, the Third-Generation Partnership Project (3GPP) has deployed a QoS framework for Long Term Evolution (LTE) based networks. However, the users' emerging demand for high-data rate and bandwidth hungry applications make this target more complicated, especially during network congestion. This pushes Mobile Network Operators (MNOs) to think about more-intelligent techniques to manage their wireless network traffic, mainly in the transport layer. In this paper, a new Delay-Aware QoS Scheme (DAQS) for 3GPP LTE-based networks is proposed, implemented and critically evaluated. The proposed scheme uses QCI-DSCP (QoS Class Identifier-Differentiated Services Code Point) mapping in the transport layer along with queuing scheduling algorithms in the LTE backhaul network. The proposed scheme takes fairness between applications into account and so provides different levels of priorities. The scheme does not starve any application service; rather it dynamically associates applications to the appropriate priority level. An extensive simulation using OPNET Modeler Wireless Suite 17.5 based on the 3GPP standard specifications for 20MHz, 5MHz and 1.4MHz LTE bandwidths confirms that guaranteeing the QoS and QoE requirements for heterogeneous applications is possible in LTE networks.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"32 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":"128107139","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

Spectral partitioning for node criticality 节点临界的谱划分

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

Waqar Asif, M. Lestas, H. K. Qureshi, M. Rajarajan

{"title":"Spectral partitioning for node criticality","authors":"Waqar Asif, M. Lestas, H. K. Qureshi, M. Rajarajan","doi":"10.1109/ISCC.2015.7405624","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405624","url":null,"abstract":"Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated with the implementation of a maximization consensus algorithm. In this work, we use spectral partitioning concepts introduced by Fiedler, to propose a new suboptimal solution which significantly reduces the implementation complexity. Our approach, combined with recently proposed distributed Fiedler vector calculation algorithms enable each node to decide by itself whether it is a critical node. If a single node is required then the maximization algorithm is applied on a restricted set of nodes within the network. We derive a lower bound for the achievable algebraic connectivity when nodes are removed from the network and we show through simulations that our approach leads to algebraic connectivity values close to this lower bound. Similar behaviour is exhibited by other approaches at the expense, however, of a higher implementation complexity.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"42 8 Pt 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":"125753302","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

Time Petri Nets for performance evaluation of composite web services architectures 时间Petri网用于组合web服务体系结构的性能评估

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

Abdelli Abdelkrim, Walid Serrai, L. Mokdad, Y. Hammal

引用次数: 1

A two-dimensional structured overlay based on flexible routing tables 基于柔性路由表的二维结构叠加

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

Masashi Hojo, Hiroya Nagao, T. Miyao, Kazuyuki Shudo

引用次数: 4

Genetic algorithm based intrusion detection system for wireless body area networks 基于遗传算法的无线体域网络入侵检测系统

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

Geethapriya Thamilarasu

引用次数: 5

A first study on using MPTCP to reduce latency for cloud based mobile applications 第一项关于使用MPTCP减少基于云的移动应用程序延迟的研究

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

Karl-Johan Grinnemo, A. Brunström

{"title":"A first study on using MPTCP to reduce latency for cloud based mobile applications","authors":"Karl-Johan Grinnemo, A. Brunström","doi":"10.1109/ISCC.2015.7405495","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405495","url":null,"abstract":"Currently, Multipath TCP (MPTCP) - a modification to standard TCP that enables the concurrent use of several network paths in a single TCP connection - is being standardized by IETF. This paper provides a comprehensive evaluation of the use of MPTCP to reduce latency and thus improve the quality of experience or QoE for cloud-based applications. In particular, the paper considers the possible reductions in latency that could be obtained by using MPTCP and multiple network paths between a cloud service and a mobile end user. To obtain an appreciation of the expected latency performance for different types of cloud traffic, three applications are studied, Netflix, Google Maps, and Google Docs, representing typical applications generating high-, mid-, and low-intensity traffic. The results suggest that MPTCP could provide significant latency reductions for cloud applications, especially for applications such as Netflix and Google Maps. Moreover, the results suggest that MPTCP offers a reduced latency despite a few percent packet loss, and in spite of limited differences in the round-trip times of the network paths in an MPTCP connection. Still, larger differences in the round-trip times seem to significantly increase the application latency, especially for Netflix, Google Maps, and similar applications. Thus, to become an even better alternative to these applications, this paper suggests that the MPTCP packet scheduling policy should be changed: Apart from the round-trip times of the network paths in a connection, it should also consider the difference in round-trip time between the network paths.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"114 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":"133464538","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}

引用次数: 17

Predicting model for identifying the malicious activity of nodes in MANETs 用于识别manet中节点恶意活动的预测模型

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

Anderson A. A. Silva, E. Pontes, A. Guelfi, I. Caproni, R. Aguiar, Fen Zhou, S. Kofuji

{"title":"Predicting model for identifying the malicious activity of nodes in MANETs","authors":"Anderson A. A. Silva, E. Pontes, A. Guelfi, I. Caproni, R. Aguiar, Fen Zhou, S. Kofuji","doi":"10.1109/ISCC.2015.7405596","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405596","url":null,"abstract":"For many applications based on Mobile Ad Hoc Networks (MANETs), the position of the nodes is generally hard to be determined. In sensor networks, for instance, such information may be critical for the MANETs. Additionally, one problem to be faced in this scenario is the fake parameters broadcasted by misbehaving/malicious nodes, which can either compromise results about positioning, or deplete power resources of mobile devices. Therefore, in this paper we propose a model for (1) identifying the fake parameters broadcasted in the network, and for (2) detecting the malicious/misbehaving nodes. The Linear Regression and Variance Analysis (LRVA) are both the basis for the multi-step-ahead predictions in this paper. Through NS-2 and Avrora, we simulated the movement and energy consumption of nodes in a MANET, analyzing the time series of beacon-packets exchanged in the network. As a result of the LRVA employment, the fake parameters broadcasted in the network were detected, with the malicious/misbehaving nodes identified. The simulations presented in this paper show low power consumption, which allows the jointly employment of LRVA with other security techniques in the MANETs.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"33 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":"114947963","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}

引用次数: 9

Two-aggregator network topology optimization with splitting 带拆分的双聚合器网络拓扑优化

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

Soham Das, S. Sahni

引用次数: 4