发布求助
文献互助 智能选刊 最新文献

Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)最新文献

筛选
英文 中文
Capacity of Cellular CDMA Systems with Integrated Voice and Data Services 具有综合话音和数据服务的蜂窝CDMA系统的容量
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.20
Zikuan Liu, J. Almhana, R. McGorman, Changle Li
{"title":"Capacity of Cellular CDMA Systems with Integrated Voice and Data Services","authors":"Zikuan Liu, J. Almhana, R. McGorman, Changle Li","doi":"10.1109/CNSR.2007.20","DOIUrl":"https://doi.org/10.1109/CNSR.2007.20","url":null,"abstract":"In this paper we analyze the capacity of a CDMA system supporting integrated voice and data services. The bit energy-to-interference ratios for voice and data services are each modeled using lognormal distributions, and an integrated capacity formula based on a lognormal approximation is proposed. The capacity formula defines an admission scheme to guarantee with a predefined probability the total interference is less than the maximum acceptable interference. Under the assumption of Poisson arrivals for voice and data services, Kaufman's method is applied to calculate the blocking probabilities for voice and data services. Numerical results are provided to illustrate the proposed procedure.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133627264","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
Comparative Study of Supervised Machine Learning Techniques for Intrusion Detection 入侵检测中监督式机器学习技术的比较研究
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.22
Farnaz Gharibian, A. Ghorbani
{"title":"Comparative Study of Supervised Machine Learning Techniques for Intrusion Detection","authors":"Farnaz Gharibian, A. Ghorbani","doi":"10.1109/CNSR.2007.22","DOIUrl":"https://doi.org/10.1109/CNSR.2007.22","url":null,"abstract":"Intrusion detection is an effective approach for dealing with various problems in the area of network security. This paper presents a comparative study of using supervised probabilistic and predictive machine learning techniques for intrusion detection. Two probabilistic techniques Naive Bayes and Gaussian and two predictive techniques decision tree and random forests are employed. Different training datasets constructed from the KDD99 dataset are employed for training. The ability of each technique for detecting four attack categories (DoS,Probe,R2L and U2R) have been compared. The statistical results to show the sensitivity of each technique to the population of attacks in a dataset have also been reported. We compare the performance of the techniques and also investigate the robustness of each technique by calculating their standard deviations with respect to the detection rate of each attack category.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131985446","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}
引用次数: 81
PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers PTSPM:一种新的基于PTS的IPv6路由器前缀匹配方案
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.53
Srinivasan T, Vijayalakshmi D, Azeezunnisa A A, Assistant Professor
{"title":"PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers","authors":"Srinivasan T, Vijayalakshmi D, Azeezunnisa A A, Assistant Professor","doi":"10.1109/CNSR.2007.53","DOIUrl":"https://doi.org/10.1109/CNSR.2007.53","url":null,"abstract":"Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when router traffic increases or when employed for IPv6 address lookup. Our paper describes a novel parallel ternary search based prefix matching (PTSPM) scheme with reduced collision for IPv6 routers. This approach employs multiple hashing on reduced number of hash tables on which parallel ternary search (PTS) on levels is applied. This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups. The approach we describe is fast, simple, scalable, parallelizable, and flexible.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114493823","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 Scenario for Identity Management in Daidalos Daidalos中的身份管理场景
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.6
Zhikui Chen
{"title":"A Scenario for Identity Management in Daidalos","authors":"Zhikui Chen","doi":"10.1109/CNSR.2007.6","DOIUrl":"https://doi.org/10.1109/CNSR.2007.6","url":null,"abstract":"Digital Identity corresponds to the electronic information associated generally with an individual in a particular identity system. This is used by online service providers to authenticate and authorize users for services protected by access policies. Having good identity systems can enable individuals to use effectively and extensively electronic transactions in a secure yet privacy preserving manner. In order to match the above purpose, this paper introduces an identity scenario, a user-centric identity management, in terms of VID - virtual identity, which concept is designed to protect a user's privacy and secure communication data, which contemplates the multitude of identities and roles we take on each time we turn on our computer, mobile phone or PDA.. Simultaneously, the associated identity management system with its related infrastructure is described. A key component, the ID broker, of the proposed infrastructure is also detailed including some interfaces and their related components. Furthermore, a method that allows a user to manage his/her service via the VID is introduced.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228158","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
Public Key Multi-Message Signcryption (PK-MMS) Scheme For Secure Communication Systems 安全通信系统公钥多消息签名加密(PK-MMS)方案
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.54
H. Elkamchouchi, A. Emarah, E. Hagras
{"title":"Public Key Multi-Message Signcryption (PK-MMS) Scheme For Secure Communication Systems","authors":"H. Elkamchouchi, A. Emarah, E. Hagras","doi":"10.1109/CNSR.2007.54","DOIUrl":"https://doi.org/10.1109/CNSR.2007.54","url":null,"abstract":"In this paper, a new and efficient public key multi-message signcryption (PK-MMS) scheme for provable secure communications has been proposed. The proposed scheme simultaneously signcrypts the multiple messages in a logical single step by using a multi-key generator which introduce a great deal of redundancy, efficient cost and low processing time for multi-message signcryption. The proposed PK-MMS has an efficient computation time and communication overhead compared with Zheng signcryption scheme. More specifically, it has been shown that for the minimum security parameters recommended for use in current practice, the numerical value for the saving in communication overhead using the proposed scheme are 27.7 % and 41.7 % for two and four signcrypted message over Zheng signcryption scheme. The proposed scheme costs 50 % and 75 % less in computation cost for two and four signcrypted message than does Zheng signcryption scheme.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125589196","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
An Adaptive FEC-based Packet Loss Recovery Scheme Using RZ Turbo Codes 基于自适应fec的RZ Turbo码丢包恢复方案
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.11
A. Al-Shaikhi, J. Ilow, X. Liao
{"title":"An Adaptive FEC-based Packet Loss Recovery Scheme Using RZ Turbo Codes","authors":"A. Al-Shaikhi, J. Ilow, X. Liao","doi":"10.1109/CNSR.2007.11","DOIUrl":"https://doi.org/10.1109/CNSR.2007.11","url":null,"abstract":"Packet-level forward error correction (FEC) is a packet loss recovery technique which does not require retransmissions and allows packet delivery with bounded delay and controllable reliability. This makes packet-level FEC attractive in networks running real-time applications like video and audio streaming. Current packet level FEC schemes are either based on simple parity check codes or Reed-Solomon codes with erasure decoding, whereas this paper considers the application of more powerful turbo codes to recover from lost packets. In particular, we investigate the capability of a newly designed Return to Zero (RZ) turbo code to reduce the packet loss rate (PLR) between the source and the destination. In the proposed implementation of the RZ turbo code packet loss recovery scheme, when a packet is lost, a burst of erasures, i.e., lost bits, is introduced into the turbo code codeword, and these erasures are recovered using the soft-decision RZ turbo decoder. Because of the RZ interleaver, the RZ turbo decoder randomizes erasure positions and recovers them quite well. Our simulations indicate that the PLR performance of the proposed RZ turbo code packet loss recovery scheme benefits from adjusting the interleaver size to accommodate the changes in the raw link PLR.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121296785","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}
引用次数: 6
A Two-step TOA Estimation Method for IR-UWB Ranging Systems 红外-超宽带测距系统的两步TOA估计方法
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.8
Shaohua Wu, Qinyu Zhang, Naitong Zhang
{"title":"A Two-step TOA Estimation Method for IR-UWB Ranging Systems","authors":"Shaohua Wu, Qinyu Zhang, Naitong Zhang","doi":"10.1109/CNSR.2007.8","DOIUrl":"https://doi.org/10.1109/CNSR.2007.8","url":null,"abstract":"To design a low-calculation and high-precision TOA estimation algorithm for IR-UWB ranging systems, a two-step TOA estimation method which jointly employs energy-detection (ED) and match- filtering (MF) is proposed. Based on analyzing the principles of the two-step method, it was pointed out that the success rate of DP block detection in the first step and the setting of MF-threshold-factor in the second step were the key issues that affect the performance of the method. Algorithm selection of the first step and setting of the energy integration interval, which are the two factors that affects the success rate of DP block detection, were discussed through simulations. The idea of DMR (DP to minimum energy sample ratio) based MF-threshold-factor selection was proposed. Results show that the proposed two-step method greatly outperforms the one-step energy-detection based non-coherent method, while largely decreases the computational complexity compared to the one-step match-filtering based coherent method.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115107764","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}
引用次数: 16
Performance Analysis of Non-Orthogonal Pulse Position Modulation for Time-Hopping UWB Transmission 跳时UWB传输中非正交脉冲位置调制性能分析
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.49
Hao Zhang, Wei Li, T. Gulliver
{"title":"Performance Analysis of Non-Orthogonal Pulse Position Modulation for Time-Hopping UWB Transmission","authors":"Hao Zhang, Wei Li, T. Gulliver","doi":"10.1109/CNSR.2007.49","DOIUrl":"https://doi.org/10.1109/CNSR.2007.49","url":null,"abstract":"In this paper, we study the performance of non- orthogonal pulse position modulation (NPPM) for ultra-wideband (UWB) communication. Error probability and performance bounds are derived for a multi-user environment. It is shown that with proper selection of the pulse waveform and modulation index, NPPM can achieve better performance than orthogonal PPM with the same throughput.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134211455","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
Multi-Perspective Optimization of GEANTInter-domain Traffic geantdomain间流量的多视角优化
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.44
M. Pedro, E. Monteiro, F. Boavida
{"title":"Multi-Perspective Optimization of GEANTInter-domain Traffic","authors":"M. Pedro, E. Monteiro, F. Boavida","doi":"10.1109/CNSR.2007.44","DOIUrl":"https://doi.org/10.1109/CNSR.2007.44","url":null,"abstract":"Interdomain traffic engineering is a key issue when resource optimization across autonomous systems boundaries is concerned. Mapping interdomain traffic flows into existing service level agreements is, in general, a complex problem, for which an optimization tool is needed. Th is work aims at demonstrating the advantages of using such a tool to perform offline interdomain traffic optimization, using a multiperspective approach. This optimization approach was applied to GEANT, the European Research and Educational Network. The paper presents optimization solutions from various perspectives, namely bandwidth, monetary cost and routing trustworthiness. Results show the costs of the original GEANT traffic engineering solution and the costs of the optimized solutions side by side. This case study also shows the advantages of being able to select between the perspectives that best fit the domain management policies.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132680166","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
Secure Dynamic MANET On-demand (SEDYMO) Routing Protocol 安全动态MANET按需(SEDYMO)路由协议
Fifth Annual Conference on Communication Networks and Services Research (CNSR '07) Pub Date : 2007-05-14 DOI: 10.1109/CNSR.2007.57
H. Rifà-Pous, J. Herrera-Joancomartí
{"title":"Secure Dynamic MANET On-demand (SEDYMO) Routing Protocol","authors":"H. Rifà-Pous, J. Herrera-Joancomartí","doi":"10.1109/CNSR.2007.57","DOIUrl":"https://doi.org/10.1109/CNSR.2007.57","url":null,"abstract":"This paper describes the state of the art of secure ad hoc routing protocols and presents SEDYMO, a mechanism to secure a dynamic multihop ad hoc routing protocol. The proposed solution defeats internal and external attacks using a trustworthiness model based on a distributed certification authority. Digital signatures and hash chains are used to ensure the correctness of the protocol. The protocol is compared with other alternatives in terms of security strength, energy efficiency and time delay. Both computational and transmission costs are considered and it is shown that the secure protocol overhead is not a critical factor compared to the high network interface cost.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132270425","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}
引用次数: 18
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信