2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)最新文献_第7页

SRLG identification from time series analysis of link state data 从链路状态数据的时间序列分析中识别SRLG

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716485

G. Das, D. Papadimitriou, B. Puype, D. Colle, M. Pickavet, P. Demeester

{"title":"SRLG identification from time series analysis of link state data","authors":"G. Das, D. Papadimitriou, B. Puype, D. Colle, M. Pickavet, P. Demeester","doi":"10.1109/COMSNETS.2011.5716485","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716485","url":null,"abstract":"Failing to account for the set of links affected by a simultaneous dependent failure during the re-computation of the routing table entries leads to traffic losses until all failed links have been accounted in the re-computation of these entries. Instead, if the router learns about the existence of Shared Risk Link Groups (SRLGs) from the arriving pattern link state routing information, then decisions regarding SRLG failure can be taken promptly to avoid successive re-computations of alternate shortest paths across the updated topology. In this paper, we propose a mechanism to improve the router recovery time upon occurrence of topological link failures by detecting and identifying the existence of SRLGs from link state routing information exchanged in the routing domain. The proposed model first groups into events individual Link State Advertisements (LSAs) issued by different network nodes (routers) upon link state change; then, it combines this information to find temporal dependence among members of event groups. It further introduces a physical model interpretation derived from the application of the Weibull distribution, to determine the error on the joint probabilities of events resulting from the finite observation sample. This association allows binding the dependence of the identified groups comprising one or more events (associated to SRLG) on the corresponding estimated failure rate. Our simulation results show that the proposed technique to locally detect and identify SRLGs performs sufficiently well to trigger with enough confidence simultaneous routing table updates from the arrival of a reduced set of LSAs (ideally one).","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130424184","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

Joint optimization of 2-tier dual-homing for NodeBs and RNCs in UMTS networks using meta-heuristic techniques 基于元启发式技术的UMTS网络中节点和rnc两层双归巢联合优化

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716508

S. Sadhukhan, S. Mandal, S. Shaw, Debashis Saha

{"title":"Joint optimization of 2-tier dual-homing for NodeBs and RNCs in UMTS networks using meta-heuristic techniques","authors":"S. Sadhukhan, S. Mandal, S. Shaw, Debashis Saha","doi":"10.1109/COMSNETS.2011.5716508","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716508","url":null,"abstract":"Conventional design of UMTS networks usually involves single-homing (i.e., many-to-one mapping) of NodeBs to Radio Network Controllers (RNCs) in tier-1 (i.e., a group of NodeBs is connected to a single RNC) and that of RNCs to Mobile Switching Centres (MSCs) as well as to Serving GPRS Support Nodes (SGSNs) in tier-2 (i.e., a group of RNCs is connected to a single MSC/SGSN). Thus, any NodeB is connected to only one RNC and any RNC is connected to only one MSC/SGSN. However, as subscriber distribution changes over time and new mobility patterns of subscribers begin to evolve, single homing solution sometimes becomes inefficient in terms of handoff cost minimization. One solution to this brown-field operational problem is dual-homing extension of some selected NodeBs and RNCs (i.e., some NodeBs are connected to two RNCs in tier-1 and some RNCs to two MSCs/SGSNs in tier-2) in order to reduce the handoff cost. Traditionally, this optimization problem has been formulated separately for each tier and solved independently, thereby missing the global optimal solution. In this paper, we have first shown how to combine the optimization problems across the two tiers and then mapped the joint dual homing optimization problem into a classical search problem. Next, we have used two common meta-heuristic techniques, namely Simulated Annealing and Tabu Search, to solve the above problem. Comparison of the results obtained from joint dual homing with the published results for individual dual homing reveals that the joint dual homing performs considerably better than individual dual homing that attacks NodeB level and RNC level separately and independently.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131021283","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

A system approach to network modeling for DDoS detection using a Naìve Bayesian classifier 使用Naìve贝叶斯分类器进行DDoS检测的网络建模的系统方法

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716474

R. Vijayasarathy, S. Raghavan, Balaraman Ravindran

引用次数: 46

CPS-Net: In-network aggregation for synchrophasor applications CPS-Net:同步性应用的网络内聚合

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716510

V. Arya, J. Hazra, Palanivel A. Kodeswaran, D. Seetharam, N. Banerjee, S. Kalyanaraman

引用次数: 12

Splitting HTTP requests on two servers 在两台服务器上分割HTTP请求

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716484

B. Rawal, R. Karne, A. Wijesinha

引用次数: 35

Minimizing content provisioning cost in heterogeneous Social Wireless Networks 在异构社会无线网络中最小化内容供应成本

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716421

Mahmoud Taghizadeh, S. Biswas

{"title":"Minimizing content provisioning cost in heterogeneous Social Wireless Networks","authors":"Mahmoud Taghizadeh, S. Biswas","doi":"10.1109/COMSNETS.2011.5716421","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716421","url":null,"abstract":"This paper introduces an optimal cooperative caching policy for minimizing electronic content provisioning cost in Social Wireless Networks (SWNET). The SWNETs are typically formed by a collection of mobile devices, such as data enabled phones, net-books, electronic book readers etc., sharing common interests in electronic content, and physically gathering in settings such as University campuses, work places, malls, airports, train stations and other public places. Electronic object caching in such SWNETs are shown to be able to reduce the content provisioning cost which depends heavily on the service and pricing dependencies among various stakeholders including the content provider, the network service provider, and the end consumers. Drawing motivation from Amazon's Kindle electronic book delivery business, this paper develops practical network, service, and pricing models which are then used for creating two optimal caching strategies, namely Split Cache and Distributed Benefit for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands. In addition to proving the optimality of the mechanisms, the paper constructs extensive analytical and simulation models for analyzing the proposed caching strategies and their optimal operating points.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131810631","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

Signed graph based approach for on-line optimization in cognitive networks 基于签名图的认知网络在线优化方法

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716470

P. Balamuralidhar, Rajan Mindigal Alasingara Bhattachar

引用次数: 1

Confidential Program update with dynamic key computation for clustered wireless sensor networks 机密程序更新与动态密钥计算的集群无线传感器网络

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716430

M. Nirmala, A. Manjunath

{"title":"Confidential Program update with dynamic key computation for clustered wireless sensor networks","authors":"M. Nirmala, A. Manjunath","doi":"10.1109/COMSNETS.2011.5716430","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716430","url":null,"abstract":"Securing Network Program update is essential for many crucial military applications. Present Network Programming protocols proposed by Hailun Tan et al. provides confidentiality and authentication with high computational effort and power consumption. We have developed a confidential network program update protocol for clustered wireless sensor networks. Our scheme has two phases, key computation phase and network program update phase. In key computation phase, we provide an efficient key computation scheme for securing the program image. The key is dynamically computed using broadcast encryption scheme when required without storing neither any keys before deployment, nor communicating directly. Network program update phase follows an approach based on Deluge, an open source code dissemination protocol, and provides confidentiality along with authentication. An immediate and independent authentication is achieved without time synchronization between the base station and the sensor nodes. The scheme is resilient to malicious program image injection by the compromised nodes. Mobile agents are used to know about the node compromise. We implement our scheme in TinyOS and evaluate the performance. General Terms: Sensor Networks, Security, Design, Performance.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114716751","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

A modified SPIN for wireless sensor networks 用于无线传感器网络的改进SPIN

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716469

Z. Rehena, Sarbani Roy, N. Mukherjee

引用次数: 69

Separating event points by Binary Proximity Sensors: An asymptotic analysis 二值接近传感器分离事件点的渐近分析

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011) Pub Date : 2011-02-17 DOI: 10.1109/COMSNETS.2011.5716479

B. Krishnan

引用次数: 0