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

2008 33rd IEEE Conference on Local Computer Networks (LCN)最新文献

筛选
英文 中文
A collaborative peer-to-peer architecture to defend against DDoS attacks 一种协同的点对点架构，用于防御DDoS攻击
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664200
R. Saad, Farid Naït-Abdesselam, A. Serhrouchni
{"title":"A collaborative peer-to-peer architecture to defend against DDoS attacks","authors":"R. Saad, Farid Naït-Abdesselam, A. Serhrouchni","doi":"10.1109/LCN.2008.4664200","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664200","url":null,"abstract":"Nowadays, we are witnessing an important increase in attacks among which distributed denial-of-service (DDoS) that easily flood the victims using multiple paths. Intrusion detection and filtering are necessary mechanisms to combat against these attacks and secure networks. However, the existing detection techniques for DDoS attacks have their entities work in isolation. In this paper, we propose an efficient and distributed collaborative architecture that allows the placement and the cooperation of the defense entities to better address the main security challenges. The use of content based DHT (distributed hash table) algorithm permits also to improve the scalability and the load balancing of the whole system. This modular architecture has been implemented on IDS (intrusion detection system) entities with the DHT Pastry protocol and has shown a promising performance.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122447226","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
On measuring available bandwidth in wireless networks 无线网络中可用带宽的测量
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664295
A. Johnsson, M. Björkman
{"title":"On measuring available bandwidth in wireless networks","authors":"A. Johnsson, M. Björkman","doi":"10.1109/LCN.2008.4664295","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664295","url":null,"abstract":"BART is a state-of-the-art active end-to-end bandwidth measurement method that estimates not only the available bandwidth but also the link capacity of the bottleneck link. It uses a Kalman filter to give estimates in real time during a measurement session. In this paper, we have studied the impact of 802.11 networks on the bandwidth estimates produced by BART. The Kalman filter used by BART is tunable, and one of the contributions of this paper is to show how the Kalman filter should be adjusted to improve real-time tracking and estimation accuracy when the bottleneck is an 802.11 link. Further, the paper contributes by discussing how to interpret the estimates produced by BART and similar bandwidth estimation tools relying on self-induced congestion when used in wireless scenarios. An analysis show that the BART estimates produced are correct - but corresponds to a fair share of the wireless link rather than to the unused capacity. However, the estimates do indicate how much bandwidth an application or device in the wireless network can expect when sending and/or receiving network traffic.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122606836","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
Connectivity-driven flow recovery for time-sensitive transport services 连接驱动的流量恢复，用于时间敏感的传输服务
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664234
Michio Honda, J. Nakazawa, Y. Nishida, H. Tokuda
{"title":"Connectivity-driven flow recovery for time-sensitive transport services","authors":"Michio Honda, J. Nakazawa, Y. Nishida, H. Tokuda","doi":"10.1109/LCN.2008.4664234","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664234","url":null,"abstract":"PR-SCTP provides a timeliness transport service. When the lifetime of the data specified by the application expires, the sender PR-SCTP gives up retransmitting the data, and transmits a Forward TSN chunk to make the receiver advance the Cumulative ACK point. However, on the mobile communication, connectivity of the nodes is intermittent. PRSCTP does not work properly in this case, thereby the timeliness transmission is impaired. In order to address this issue, we propose a new algorithm that transmits a Forward TSN triggered by readdressing events in SCTP associations. Our scheme allows PR-SCTP to restart transmission of data with lifetime smoothly regardless of duration of the connectivity disruption.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123967534","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
Interconnecting MANET and the internet a mobility approach 将MANET和互联网互连是一种移动性方法
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664246
F. D. Trujillo, A. Triviño-Cabrera, E. Casilari-Pérez, A. Estrella, A. J. Yuste
{"title":"Interconnecting MANET and the internet a mobility approach","authors":"F. D. Trujillo, A. Triviño-Cabrera, E. Casilari-Pérez, A. Estrella, A. J. Yuste","doi":"10.1109/LCN.2008.4664246","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664246","url":null,"abstract":"When a wireless node in an ad hoc network needs Internet access, it must select one gateway from the information sent in the Modified Router Advertisement (MRA) messages. In this paper, we propose an adaptive gateway discovery scheme that dynamically adjusts the frequency of MRA messages. This tuning is related to the mobility of the ad hoc network. The proposed tuning technique is supported by a control system which is configured by means of a new mobility factor obtained from the information contained in the MRA messages forwarded by the mobile nodes. Simulation results show that the proposed adaptive mechanism improves the conventional proactive schemes.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123996015","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
Evaluation and parameterization of voice traffic models for disaster area scenarios 灾区场景话音流量模型的评估与参数化
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664175
N. Aschenbruck, P. Martini
{"title":"Evaluation and parameterization of voice traffic models for disaster area scenarios","authors":"N. Aschenbruck, P. Martini","doi":"10.1109/LCN.2008.4664175","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664175","url":null,"abstract":"Analyzing and modelling traffic is one important step in the performance evaluation of communication systems. In this paper we focus on evaluation and parameterization of traffic models for disaster area scenarios invented in our previous work. The goal is to provide scalable models for public safety scenarios as realistic and intuitive as possible. During our evaluation we examine synthetic traces for different parameters and levels of detail. As measures we examine traffic intensity, burstiness, and dependencies. The evaluation shows that the models are scalable without loosing specific characteristics. Finally, we provide an intuitive and scalable parameterization for our models that eases up using them.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097680","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
Service outsourcing to support virtual home environments (VHE) 服务外包支持虚拟家庭环境(VHE)
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664257
Vitalis G. Ozianyi, N. Ventura
{"title":"Service outsourcing to support virtual home environments (VHE)","authors":"Vitalis G. Ozianyi, N. Ventura","doi":"10.1109/LCN.2008.4664257","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664257","url":null,"abstract":"In a virtual home environment (VHE), mobile users may access all services available on their home network, in the same manner and with the same level of service performance. Interaction between users, their home networks and candidate visited networks should be planned for service discovery, and QoS and price negotiation. A further aspect for consideration is the use of networks owned by unaffiliated operators that are candidates for facilitating the VHE, when the affiliated visited does not support the requested service. In this paper we explore VHE aspects and scenarios with the aim of introducing service outsourcing. We extend our earlier work on service outsourcing to VHE where services are outsourced to a candidate network if the custodian visited network cannot meet critical VHE requirements for a user. Through numerical analysis we show that if agreed roaming prices are charged for services delivered on an unaffiliated candidate network wider service usage will occur in VHEs.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001635","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
Performance measurement and queueing analysis of medium-high blocking probability of two and three parallel connection servers 两个和三个并行连接服务器中高阻塞概率的性能测量和排队分析
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664240
C. C. Chen, Ying-Wen Bai, Yin-Sheng Lee
{"title":"Performance measurement and queueing analysis of medium-high blocking probability of two and three parallel connection servers","authors":"C. C. Chen, Ying-Wen Bai, Yin-Sheng Lee","doi":"10.1109/LCN.2008.4664240","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664240","url":null,"abstract":"In this paper we propose a performance measurement and queueing analysis for medium-high blocking probability where the service rate is less than equal to the arrival rate of parallel connection servers, and for which we can estimate the system response time. First, we calculate the system response time of the parallel connection servers. Second, we simulate the queueing model of the parallel connection servers and derive the system response time. Third, we measure the system response time by using different numbers of ASP multiplication loops to represent the different service rates of the parallel connection servers. Fourth, we compare the simulation and measurement results with the medium-high blocking probability of the parallel connection from the different service rates of the servers. Fifth, we compare the system response time of both multi-parallel connection servers and a single server.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128408811","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
WBest: A bandwidth estimation tool for IEEE 802.11 wireless networks 用于IEEE 802.11无线网络的带宽估计工具
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664193
Mingzhe Li, M. Claypool, R. Kinicki
{"title":"WBest: A bandwidth estimation tool for IEEE 802.11 wireless networks","authors":"Mingzhe Li, M. Claypool, R. Kinicki","doi":"10.1109/LCN.2008.4664193","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664193","url":null,"abstract":"Bandwidth estimation techniques seek to provide an accurate estimation of available bandwidth such that network applications can adjust their behavior accordingly. However, most current techniques were designed for wired networks and produce relatively inaccurate results and long convergence times on wireless networks where capacity can vary dramatically. This paper presents a new wireless bandwidth estimation tool, WBest, designed for fast, non-intrusive, accurate estimation of available bandwidth in IEEE 802.11 networks. WBest is a two-stage algorithm: 1) a packet pair technique estimates the effective capacity over a flow path where the last hop is a wireless LAN (WLAN); and 2) a packet train technique estimates achievable throughput to infer the available bandwidth. WBest parameters are optimized given the tradeoffs of accuracy, intrusiveness and convergence time. The advantage of WBest stems from avoiding a search algorithm to detect the available bandwidth by statistically detecting the available fraction of the effective capacity to mitigate estimation delay and the impact of random wireless channel errors. WBest is implemented and evaluated on an 802.11 wireless testbed. Comparisons with other available bandwidth estimation tools shows WBest to have higher accuracy, lower intrusiveness and faster convergence times. Thus, WBest demonstrates the potential for improving the performance of applications that need bandwidth estimation, such as multimedia streaming, on wireless networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361785","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}
引用次数: 199
Analysis of proxy MIPv6 performance compared to fast MIPv6 代理MIPv6与快速MIPv6性能对比分析
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664245
Ali Diab, A. Mitschele-Thiel, Kalin Getov, O. Blume
{"title":"Analysis of proxy MIPv6 performance compared to fast MIPv6","authors":"Ali Diab, A. Mitschele-Thiel, Kalin Getov, O. Blume","doi":"10.1109/LCN.2008.4664245","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664245","url":null,"abstract":"One of the main challenges in future ldquoAll-IPrdquo networks is to guarantee seamless mobility with minimal or even without any interaction from the user. The Network-based Localized Mobility Management (NETLMM) working group is currently developing Proxy MIPv6 (PMIPv6), which tries to support terminal mobility without involving the MN. This paper analyzes PMIPv6 and evaluates it compared to the well known Fast MIPv6 (FMIPv6) protocol with respect to the handoff interruption time in different radio access technologies. The analysis has been done by means of simple analytical models. The obtained results show that the best performance can be achieved by FMIPv6 in predictive mode. The access technology has a major impact on the handoff interruption time. PMIPv6 and FMIPv6 in reactive mode perform almost comparable using a fast radio access technology. However, for slower radio access technologies, PMIPv6 shows a better performance over FMIPv6 in reactive mode. PMIPv6 is more robust than FMIPv6 against control message dropping.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"841 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117058291","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
Performance analysis of an admission control enhancement in WIMAX networks using SAN 基于SAN的WIMAX网络中接纳控制增强的性能分析
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664264
L. Mokdad, J. Ben-othman
{"title":"Performance analysis of an admission control enhancement in WIMAX networks using SAN","authors":"L. Mokdad, J. Ben-othman","doi":"10.1109/LCN.2008.4664264","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664264","url":null,"abstract":"WiMAX (worldwide interpretability for microwave access) is one of the leader standards of broadband wireless access (BWA). This standard becomes a competitor of 4G or LTE (long term evolution) with the introduction of different class of service flow (UGS, rtPS, nrtPS, BE). Each service class has its own QoS requirements. Even if the standard specify the transmission policy of each service class, it recommends the implementation of an admission control (AC) without any specification. As the standard does not define any specifications for the AC, then this task is left for the operator. In this paper, we propose an implementation of an AC algorithm mechanism for IEEE 802.16. The performance evaluation of these networks by analytical models is not easy due to the state space explosion, thus we use the stochastic automata networks (SAN) formalism to model our proposed AC mechanism. With SAN we calculate the rewards of the proposed AC and we show that the proposed solution is efficient.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117167135","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
首页 上一页 下一页 尾页
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学术官方微信