4th Annual Communication Networks and Services Research Conference (CNSR'06)最新文献

筛选
英文 中文
General window-based congestion control: buffer occupancy, network efficiency and packet loss 一般基于窗口的拥塞控制:缓冲区占用,网络效率和数据包丢失
Li-Song Shao, He-ying Zhang, Wen-hua Dou
{"title":"General window-based congestion control: buffer occupancy, network efficiency and packet loss","authors":"Li-Song Shao, He-ying Zhang, Wen-hua Dou","doi":"10.1109/CNSR.2006.29","DOIUrl":"https://doi.org/10.1109/CNSR.2006.29","url":null,"abstract":"High speed networks with long distance present a unique environment where TCP have a problem under-utilizing the bandwidth of bottleneck link. To remedy this problem, many proposals, such as window-based mechanisms (HSTCP and STCP), rate-based ones (Fast TCP) and router-assistant ones (XCP), have been suggested. The recent researches show that the buffer size in routers heavily affects the performances of HSTCP, especially network efficiency. This paper studies the performances of general window-based mechanisms, such as buffer occupancy, network efficiency and packet loss. The study of buffer occupancy shows that large increment function and small buffer size will result in pseudo-congestion, from which HSTCP and slow start of TCP suffer, under-utilizing the capacity of bottleneck link. We propose asymptotic square increase (ASI) mechanism, whose increment function is an increase additive function. Not to cause pseudo-congestion, a design principle of the buffer size of routers is given for the increment function of additive increase (AI), Multiplicative Increase (MI) and ASI. In this paper, the study of network efficiency shows that the concave increase mechanisms can obtain more network efficiency at smaller cost of packet loss than additive and convex ones","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"57 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124395699","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
Wireless airtime traffic estimation using a state space model 基于状态空间模型的无线通信流量估计
F. Kohandani, D. McAvoy, A. Khandani
{"title":"Wireless airtime traffic estimation using a state space model","authors":"F. Kohandani, D. McAvoy, A. Khandani","doi":"10.1109/CNSR.2006.58","DOIUrl":"https://doi.org/10.1109/CNSR.2006.58","url":null,"abstract":"A new forecasting technique called the extended structural model (ESM) is presented. This technique is derived from the basic structural model (BSM) by the introduction of extra parameters that were assumed to be 1 in the BSM. The ESM model is constructed from the training sequence using the standard Kalman filter recursions, and then the extra parameters are estimated to minimize the mean absolute percentage error (MAPE) of the validation sequence. The model is evaluated by prediction of the total number of minutes of wireless airtime per month on the Bell Canada network. The ESM model shows an improvement in MAPE of the test sequence over both the BSM and seasonal autoregressive integrated moving average. The improved prediction can significantly reduce the cost for wireless service providers, who need to accurately predict future wireless spectrum requirements","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123680146","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}
引用次数: 8
Genetic programming based WiFi data link layer attack detection 基于遗传编程的WiFi数据链路层攻击检测
P. LaRoche, A. N. Zincir-Heywood
{"title":"Genetic programming based WiFi data link layer attack detection","authors":"P. LaRoche, A. N. Zincir-Heywood","doi":"10.1109/CNSR.2006.30","DOIUrl":"https://doi.org/10.1109/CNSR.2006.30","url":null,"abstract":"This paper presents a genetic programming based detection system for data link layer attacks on a WiFi network. We explore the use of two different fitness functions in order to achieve both a high detection rate and a low false positive rate. Results show that the detection system developed can achieve a detection rate above 90% and a false positive rate below 1%","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125279018","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
Divalia: a practical framework for anonymous peer-to-peer file exchange in wireless ad-hoc networks Divalia:无线自组织网络中匿名点对点文件交换的实用框架
Ryan Vogt, I. Nikolaidis, P. Gburzynski
{"title":"Divalia: a practical framework for anonymous peer-to-peer file exchange in wireless ad-hoc networks","authors":"Ryan Vogt, I. Nikolaidis, P. Gburzynski","doi":"10.1109/CNSR.2006.26","DOIUrl":"https://doi.org/10.1109/CNSR.2006.26","url":null,"abstract":"We describe Divalia, a new peer-to-peer (P2P) file exchange framework that targets mobile wireless ad-hoc networks. The framework supports anonymous transfers, to protect user privacy, as well as pre-authentication of data to be received, to reduce the likelihood of spoofs and the resulting bandwidth wastage. Divalia is composed of two parts: the hash set dual-request protocol, to challenge a would-be provider to prove the possession of the requested file; and, a form of Direct Anonymous Broadcast, for anonymous acquisition of information to be used for the challenge. One goal of this paper is to demonstrate how an original and secure P2P system can be constructed within the constraints and opportunities of mobile wireless ad-hoc networks through the use of well known and extensively studied component cryptographic methods","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124592047","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
Adaptive queue management on micro-MPLS-based wireless networks for multimedia traffic 基于微mpls的多媒体业务流无线网络自适应队列管理
S. Fowler, S. Zeadally
{"title":"Adaptive queue management on micro-MPLS-based wireless networks for multimedia traffic","authors":"S. Fowler, S. Zeadally","doi":"10.1109/CNSR.2006.12","DOIUrl":"https://doi.org/10.1109/CNSR.2006.12","url":null,"abstract":"Recently, there has been increasing interest in applying MPLS (multi-protocol label switching) to IP-based wireless access networks. During a handover on a mobile MPLS-based network a registration update message is sent from the foreign agent (FA) to the home agent (HA) which results in a handover delay. There have been proposals for handover processing mechanisms over MPLS-based networks using micro-mobility to decrease the amount of signaling delay between the HA and the FA. Unfortunately, network delays still occur when the demand on the network exceeds its capacity. This makes it difficult to guarantee QoS. In this paper we propose to isolate multimedia traffic from the other traffic flows as in dynamic-class based threshold (D-CBT). Non-multimedia traffic will be forwarded to the active queue management (AQM) system. We implemented load balancing on AQM for multimedia traffic. In this paper, we propose an approach that dynamically adjusts the threshold on multimedia traffic and Drop/Mark probability based on queue length, output rate, and media access delay on a micro-mobility on a MPLS-based network. Our simulation results show that our proposed technique provides maximum resource utilization, and decreases the number of packets dropped. In addition, our proposed method also yields lower average queue length","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125704662","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
A robust methodology for performance evaluation of communication networks protocols 一种可靠的通信网络协议性能评估方法
Osama S. Youness, W. S. El-Kilani, W. A. El-Wahed, F. Torkey
{"title":"A robust methodology for performance evaluation of communication networks protocols","authors":"Osama S. Youness, W. S. El-Kilani, W. A. El-Wahed, F. Torkey","doi":"10.1109/CNSR.2006.11","DOIUrl":"https://doi.org/10.1109/CNSR.2006.11","url":null,"abstract":"Performance evaluation is required at every stage in the life cycle of a network protocol. Analytical modeling is the method of choice for fast and cost effective evaluation of a network protocol. One of the most efficient high level formalisms used for analytical modeling of network protocols is stochastic Petri nets (SPN's). Yet, complexity of nowadays network protocols, which results in the state space explosion of the underlying Markov Chains (MC) model, has hindered the wide use of SPN's in the analysis of these protocols. Decomposition techniques are considered one of the main methodologies used for the approximate solution of the state explosion problem. Unfortunately, most of these techniques either require special form of the model or give insufficient accuracy of the solution. Moreover, small rates of communication protocols have caused additional overhead on any proposed technique for approximate evaluation of these protocols. This paper presents a novel decomposition technique called behavior and delay equivalent block (BDEB) technique. This technique overcomes most of drawbacks of other techniques proposed in the literature. It introduces a new aggregation method that depends on using a new type of transitions called intelligent transition. The proposed technique adopts delay equivalent criteria but in a new philosophy different from other techniques using the same criteria. The new technique is explained by applying it to a scalable model of the courier protocol","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129481676","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
Implementation of a cable access point (CAP) device for ubiquitous network applications 实现电缆接入点(CAP)设备无处不在的网络应用
Ren-Guey Lee, Chien-Chi Lai, Chun-Chieh Hsiao
{"title":"Implementation of a cable access point (CAP) device for ubiquitous network applications","authors":"Ren-Guey Lee, Chien-Chi Lai, Chun-Chieh Hsiao","doi":"10.1109/CNSR.2006.32","DOIUrl":"https://doi.org/10.1109/CNSR.2006.32","url":null,"abstract":"This paper presents the implementation of a low-cost, data access-efficient, sample and easy to deployment, waterproof, and heatproof outdoor cable access point (CAP) device for ubiquitous network applications. The proposed CAP device is consisted of a cable modem (CM) and a wireless local area network (WLAN) access point (AP) to be integrated inside the chassis of an existing outdoor CATV amplifier. The main purpose of the CAP device is to effectively extend the coverage of outdoor wireless access link and to further provide a data access-efficient service for construction of a ubiquitous networking environment in the metropolitan area. Besides, to ensure the safety and validity for data accessing and information exchanging in the wireless broadband network, a security certifying mechanism of authentication, authorization, and accounting (AAA) is also integrated in the CAP device. The experimental results show that the performance and robustness of the CAP devices is suitable for ubiquitous network applications","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116083062","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
An efficient parallel IP lookup technique using CREW based multiprocessor organization 一种使用基于CREW的多处理器组织的高效并行IP查找技术
T. Srinivasan, M. Sandhya, N. Srikrishna
{"title":"An efficient parallel IP lookup technique using CREW based multiprocessor organization","authors":"T. Srinivasan, M. Sandhya, N. Srikrishna","doi":"10.1109/CNSR.2006.16","DOIUrl":"https://doi.org/10.1109/CNSR.2006.16","url":null,"abstract":"IP address lookup is a multifaceted problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routers bring into play the packet's destination address to determine for each packet the next hop. IP address lookup is complicated because it requires a longest matching prefix search. We propose a CREW based multiprocessor organization lookup (CMOL) that uses contemporaneous sorting and searching. This technique further uses N+1-ary search to speedup the address lookup operations. Since multiple processors are used, the prefixes to be compared are reduced for each processor. The number of comparisons for each processor is reduced by a factor of n/N. The time complexity of searching and sorting has been reduced to O(logN+1(N+1)). The use of controlled prefix expansion further reduces the storage space","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122714270","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
MPLS-based multicast shared trees 基于mpls的组播共享树
A. Matrawy, Wei Yi, I. Lambadaris, Chung-Horng Lung
{"title":"MPLS-based multicast shared trees","authors":"A. Matrawy, Wei Yi, I. Lambadaris, Chung-Horng Lung","doi":"10.1109/CNSR.2006.37","DOIUrl":"https://doi.org/10.1109/CNSR.2006.37","url":null,"abstract":"This paper presents a study of our proposed architecture for the setup of a multipoint-to-multipoint (MP2MP) label switched path (LSP). This form of LSP is needed for establishing uni-directional multicast shared trees. Such trees are required for information distribution in applications such as video conferencing. The presented architecture is intended for multicast applications within a single autonomous domain and can be extended to cover inter-domain multicast sessions. We propose the use of one (or more) control points in the network called Rendez-vous points (RP) in a simple extention may utilize more than one RP to implement RP failure the PIM-SM protocol to implement multicast in MPLS networks. This architecture has the advantage of using existing MPLS techniques and existing routing protocols and requires only the addition of more management capabilities at the RPs. The experiments we carried out show that while retaining the advantages of using MPLS over traditional multicast routine, the performance of the new architecture is comparable to that of IP multicast in terms of the volume of control messages and label and memory consumption. Also the architecture scales well with the increase of the number of senders within a multicast group and with the increase of the number of multicast groups","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122619209","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}
引用次数: 8
Symbol-wavelength MMSE gain in a multi-antenna UWB system 多天线UWB系统中的符号波长MMSE增益
V. V. S. N. Polu, B. Colpitts, B. Petersen
{"title":"Symbol-wavelength MMSE gain in a multi-antenna UWB system","authors":"V. V. S. N. Polu, B. Colpitts, B. Petersen","doi":"10.1109/CNSR.2006.51","DOIUrl":"https://doi.org/10.1109/CNSR.2006.51","url":null,"abstract":"Ultra wideband (UWB) technology has the potential to provide high speed data services. These speeds can be greatly increased by using multiple input multiple output (MIMO) techniques. Multiple antennas are used to achieve spatial diversity and these antenna elements must be separated properly to have uncorrelated communication signals. The separation can be on the scale of a symbol wavelength ([speed of light]/[symbol rate]). We have designed a printed circular disc monopole and measured the UWB radio channel. Finally, we used the measurements to show the minimum mean squared error (MMSE) performance gain which occurs when the receiver antennas are separated on the scale of a symbol wavelength","PeriodicalId":425107,"journal":{"name":"4th Annual Communication Networks and Services Research Conference (CNSR'06)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515960","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}
引用次数: 12
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学术官方微信