Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317838
Jong-ok Kim, Toshiaki Yamamoto, A. Yamaguchi, S. Obana
In next generation wireless networks, a variety of heterogeneous radio access technologies are expected to be available simultaneously within a single wireless terminal. This paper addresses the challenge of link aggregation in multi-access networks, where a key issue is how to optimally aggregate bandwidth offered by the individual radio link. Effective link throughput model is employed as a common resource measure for heterogeneous links. Based on the model, we present a packet allocation technique to optimize link aggregation. The mapping of packets to radio access links is performed to maximize the overall expected system throughput. Airtime constraint is added for an equal load balance. We have conducted extensive simulations with two scenarios. One is at the co-existence of WiMAX and WiFi, and the other includes only WiFi links. The proposed technique adaptively operates to time-varying link resource, and achieves better the aggregated link performance than WRR with fixed distribution ratio.
{"title":"Optimal Packet Allocation with Airtime Constraint for Multi-Access Links","authors":"Jong-ok Kim, Toshiaki Yamamoto, A. Yamaguchi, S. Obana","doi":"10.1109/ICCCN.2007.4317838","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317838","url":null,"abstract":"In next generation wireless networks, a variety of heterogeneous radio access technologies are expected to be available simultaneously within a single wireless terminal. This paper addresses the challenge of link aggregation in multi-access networks, where a key issue is how to optimally aggregate bandwidth offered by the individual radio link. Effective link throughput model is employed as a common resource measure for heterogeneous links. Based on the model, we present a packet allocation technique to optimize link aggregation. The mapping of packets to radio access links is performed to maximize the overall expected system throughput. Airtime constraint is added for an equal load balance. We have conducted extensive simulations with two scenarios. One is at the co-existence of WiMAX and WiFi, and the other includes only WiFi links. The proposed technique adaptively operates to time-varying link resource, and achieves better the aggregated link performance than WRR with fixed distribution ratio.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116058255","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317948
Shengqing Zhu, Xiaoyu Ma, Lujian Wang
To support battery powered mobile broadband wireless access devices efficiently, IEEE 802.16e defines a sleep mode operation for conserving the power of mobile terminals. However, extensive research shows that frequent sleep causes serious delay. In this paper we analyze the relationship between the power consumption and the delay with a Markov chain model. Then, we present a heuristic algorithm to adapt the parameters of sleep mechanism to the network condition and the delay requirement. Extensive simulation results show that the proposed algorithm can efficiently bound the delay in the required range. Meanwhile, the proposed algorithm achieves marked gain in power consumption compared to the traditional sleep mechanism.
{"title":"A Delay-aware Auto Sleep Mode Operation for Power Saving WiMAX","authors":"Shengqing Zhu, Xiaoyu Ma, Lujian Wang","doi":"10.1109/ICCCN.2007.4317948","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317948","url":null,"abstract":"To support battery powered mobile broadband wireless access devices efficiently, IEEE 802.16e defines a sleep mode operation for conserving the power of mobile terminals. However, extensive research shows that frequent sleep causes serious delay. In this paper we analyze the relationship between the power consumption and the delay with a Markov chain model. Then, we present a heuristic algorithm to adapt the parameters of sleep mechanism to the network condition and the delay requirement. Extensive simulation results show that the proposed algorithm can efficiently bound the delay in the required range. Meanwhile, the proposed algorithm achieves marked gain in power consumption compared to the traditional sleep mechanism.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116126445","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317863
Zhipeng Zhang, M. Etoh
We propose a frequency-domain independent component analysis (ICA) with robust and computationally-light post processing method for background noise reduction in mobile phone speech communication. In our scenario, multi-source signal separation is not the target, but noise reduction is the primal one. This primal target characterizes our approach that promotes a new physical constraint, in other words, we place a restriction on the amplitude range of the transfer functions rather than assuming that the amplitudes are constant. When there are diffraction, obstacles and reflections in the real-world environment, it is better to assume that transfer function amplitude (derived from the distance to the mouth) varies within a certain range. Our two-microphone experiment shows that the ICA-based noise reduction significantly improves speech recognition performance especially in severe noise conditions.
{"title":"ICA-based Noise Reduction for Mobile Phone Speech Communication","authors":"Zhipeng Zhang, M. Etoh","doi":"10.1109/ICCCN.2007.4317863","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317863","url":null,"abstract":"We propose a frequency-domain independent component analysis (ICA) with robust and computationally-light post processing method for background noise reduction in mobile phone speech communication. In our scenario, multi-source signal separation is not the target, but noise reduction is the primal one. This primal target characterizes our approach that promotes a new physical constraint, in other words, we place a restriction on the amplitude range of the transfer functions rather than assuming that the amplitudes are constant. When there are diffraction, obstacles and reflections in the real-world environment, it is better to assume that transfer function amplitude (derived from the distance to the mouth) varies within a certain range. Our two-microphone experiment shows that the ICA-based noise reduction significantly improves speech recognition performance especially in severe noise conditions.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114653289","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317805
A. Rasti, R. Rejaie
The observed performance by individual peers in BitTorrent can be simply measured by their average download rate. While it is often stated that the observed peer-level performance by BitTorrent clients is high, it is difficult to accurately verify this claim due to the large scale, distributed and dynamic nature of this P2P system. To provide a "representative" characterization of peer-level performance in BitTorrent, the following two important questions should be addressed: (i) What is the distribution of observed performance among participating peers in a torrent? (ii) What are the primary peer-or group-level properties that determine observed performance by individual peers? In this paper, we conduct a measurement study to tackle these two questions. Toward this end, we derive observed performance for nearly all participating peers along with their main peer-and (peer-view of) group-level properties in three different torrents. Our results show that the probability of experiencing certain level of performance has a roughly uniform distribution across the entire range of observed values. Furthermore, while the performance of each peer has the highest correlation with its outgoing bandwidth, there is no dominant peer-and group-level property that primarily determines the observed performance by the majority of peers.
{"title":"Understanding Peer-level Performance in BitTorrent: A Measurement Study","authors":"A. Rasti, R. Rejaie","doi":"10.1109/ICCCN.2007.4317805","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317805","url":null,"abstract":"The observed performance by individual peers in BitTorrent can be simply measured by their average download rate. While it is often stated that the observed peer-level performance by BitTorrent clients is high, it is difficult to accurately verify this claim due to the large scale, distributed and dynamic nature of this P2P system. To provide a \"representative\" characterization of peer-level performance in BitTorrent, the following two important questions should be addressed: (i) What is the distribution of observed performance among participating peers in a torrent? (ii) What are the primary peer-or group-level properties that determine observed performance by individual peers? In this paper, we conduct a measurement study to tackle these two questions. Toward this end, we derive observed performance for nearly all participating peers along with their main peer-and (peer-view of) group-level properties in three different torrents. Our results show that the probability of experiencing certain level of performance has a roughly uniform distribution across the entire range of observed values. Furthermore, while the performance of each peer has the highest correlation with its outgoing bandwidth, there is no dominant peer-and group-level property that primarily determines the observed performance by the majority of peers.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114708173","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317950
S. Roy, Jean-François Boudreault, L. Dupont
OFDM Wireless LANs based on the IEEE 802.11 standard are complex systems in themselves. When smart antennas are used in such systems, both the MAC and the PHY layers must be redefined in order to achieve application-specific goals. As a result, the development of such systems can become impressively heavy. A complete development framework is presented here. It makes use of hardware/software codesign in order to implement all required layers to develop a wireless access point. The entire framework is targeted at an FPGA platform, providing full flexibility and processing power for the development of PHY layers.
{"title":"A Codesign Prototyping Framework for Wireless LAN Transceivers with Smart Antennas","authors":"S. Roy, Jean-François Boudreault, L. Dupont","doi":"10.1109/ICCCN.2007.4317950","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317950","url":null,"abstract":"OFDM Wireless LANs based on the IEEE 802.11 standard are complex systems in themselves. When smart antennas are used in such systems, both the MAC and the PHY layers must be redefined in order to achieve application-specific goals. As a result, the development of such systems can become impressively heavy. A complete development framework is presented here. It makes use of hardware/software codesign in order to implement all required layers to develop a wireless access point. The entire framework is targeted at an FPGA platform, providing full flexibility and processing power for the development of PHY layers.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127368532","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317944
R. Santamaria, Olivier Bourdeau, T. Anjali
This paper presents a novel medium access control (MAC) protocol intended to provide multi-hop wireless mesh networks with a higher throughput. The proposed MAC-ASA (medium access control with anticipated scheduling and agreement) protocol uses a modified version of the 802.11 CSMA/CA contention handling procedure integrated with a dynamic (time division multiple access) TDMA-like protocol structure. It combines distributed link scheduling algorithm with power control support for router -router communications with a self agreement protocol for the client -router communications. In addition, the proposed algorithm solves the "exposed node" problem by applying multiple frequencies and time saving policies. These features result in a significant improvement of the throughput in many scenarios. Performance results from an OPNET model are presented in this paper.
{"title":"MAC-ASA: A New MAC Protocol for WMNs","authors":"R. Santamaria, Olivier Bourdeau, T. Anjali","doi":"10.1109/ICCCN.2007.4317944","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317944","url":null,"abstract":"This paper presents a novel medium access control (MAC) protocol intended to provide multi-hop wireless mesh networks with a higher throughput. The proposed MAC-ASA (medium access control with anticipated scheduling and agreement) protocol uses a modified version of the 802.11 CSMA/CA contention handling procedure integrated with a dynamic (time division multiple access) TDMA-like protocol structure. It combines distributed link scheduling algorithm with power control support for router -router communications with a self agreement protocol for the client -router communications. In addition, the proposed algorithm solves the \"exposed node\" problem by applying multiple frequencies and time saving policies. These features result in a significant improvement of the throughput in many scenarios. Performance results from an OPNET model are presented in this paper.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125571336","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317849
H. K. Dai, Y. Du
A wide range of communication-intensive real-time multimedia applications over networks require guaranteed end- to-end quality of service (QoS). QoS-routing in networks aims to find feasible routes that have sufficient resources to satisfy imposed QoS-constraints. The bounded-delay minimum-cost path problem of QoS-routing is provably difficult; several efficient heuristic algorithms exist for computing feasible solutions to the problem. We design and implement an improved heuristic algorithm for solving the problem, which employs bounded-size buffers for properly maintaining competitive cost-delay combinations for feasible-path extension and offers a better chance to find optimal/quality solutions than the known heuristics. We also prove its correctness of computing feasible solutions in worst-case polynomial-time and -space complexities. Two sets of experimental results via simulations are presented: a tradeoff between the cost/time-performance of the algorithm and buffer size, and a delay/cost/time-performance comparison study.
{"title":"On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing","authors":"H. K. Dai, Y. Du","doi":"10.1109/ICCCN.2007.4317849","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317849","url":null,"abstract":"A wide range of communication-intensive real-time multimedia applications over networks require guaranteed end- to-end quality of service (QoS). QoS-routing in networks aims to find feasible routes that have sufficient resources to satisfy imposed QoS-constraints. The bounded-delay minimum-cost path problem of QoS-routing is provably difficult; several efficient heuristic algorithms exist for computing feasible solutions to the problem. We design and implement an improved heuristic algorithm for solving the problem, which employs bounded-size buffers for properly maintaining competitive cost-delay combinations for feasible-path extension and offers a better chance to find optimal/quality solutions than the known heuristics. We also prove its correctness of computing feasible solutions in worst-case polynomial-time and -space complexities. Two sets of experimental results via simulations are presented: a tradeoff between the cost/time-performance of the algorithm and buffer size, and a delay/cost/time-performance comparison study.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128130295","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317919
I. Nugraha, H. Morita
In this paper we propose an algorithm to adjust the transmission bit-rate of variable-bit-rate (VBR) MPEG video data by using a combination of transcoding and bit-rate smoothing algorithm. The algorithm works by smoothing out the bit-rate of high variance MPEG video data and when necessary transcodes some video frames in order to keep the video transmission bit-rate below a determined threshold value. This technique is useful for a live video streaming application in which an originally high-quality VBR video data for broadband users must also be delivered to other type of users where their allowed bit-rate and its variation is tightly constrained, such as mobile phone users, without sacrificing the quality of video images too much. Quality degradation caused by transcoding can be reduced by the smoothing process, which will make the number of frames required to be transcoded can be much lower than doing transcoding solely. Depending on the threshold value, our experiment results show that the number frames needed to be transcoded can be reduced significantly.
{"title":"MPEG Video Bit-Rate Shaping Technique Using Smooth-Transcoding Algorithm","authors":"I. Nugraha, H. Morita","doi":"10.1109/ICCCN.2007.4317919","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317919","url":null,"abstract":"In this paper we propose an algorithm to adjust the transmission bit-rate of variable-bit-rate (VBR) MPEG video data by using a combination of transcoding and bit-rate smoothing algorithm. The algorithm works by smoothing out the bit-rate of high variance MPEG video data and when necessary transcodes some video frames in order to keep the video transmission bit-rate below a determined threshold value. This technique is useful for a live video streaming application in which an originally high-quality VBR video data for broadband users must also be delivered to other type of users where their allowed bit-rate and its variation is tightly constrained, such as mobile phone users, without sacrificing the quality of video images too much. Quality degradation caused by transcoding can be reduced by the smoothing process, which will make the number of frames required to be transcoded can be much lower than doing transcoding solely. Depending on the threshold value, our experiment results show that the number frames needed to be transcoded can be reduced significantly.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121532459","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317939
Ting-Yu Lin, K. Fan
Most earlier works in the area of wireless mesh network assume a single interface being equipped in each node. In this paper, we consider the next-generation wireless mesh networks in which each node may be equipped with multiple radio interfaces, each capable of running in one of several modes, one of several channels, and each capable of supporting multiple modulations. For example, from off-the-shelf components, one can easily construct a mesh node with multiple IEEE 802.11a/b/g radio interfaces. Our goal is to address the resource planning and packet forwarding issues in such an environment. The proposed methodology is based on linear programming with network flow principles and radio channel access/interference models. Given a network topology, traffic requirements, and gateway capacities, we show how to allocate network interface cards and their channels to fully utilize channel bandwidths. The results can be used by a wireless Internet service provider to plan their networks under a hardware constraint so as to maximize their profits. To the best of our knowledge, this is the first work addressing resource planning in a wireless mesh network. Our numerical results show significant improvement in terms of aggregate network throughput with moderate network-layer fairness.
{"title":"Resource Planning and Packet Forwarding for Next-generation Multi-hop Wireless Mesh Networks","authors":"Ting-Yu Lin, K. Fan","doi":"10.1109/ICCCN.2007.4317939","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317939","url":null,"abstract":"Most earlier works in the area of wireless mesh network assume a single interface being equipped in each node. In this paper, we consider the next-generation wireless mesh networks in which each node may be equipped with multiple radio interfaces, each capable of running in one of several modes, one of several channels, and each capable of supporting multiple modulations. For example, from off-the-shelf components, one can easily construct a mesh node with multiple IEEE 802.11a/b/g radio interfaces. Our goal is to address the resource planning and packet forwarding issues in such an environment. The proposed methodology is based on linear programming with network flow principles and radio channel access/interference models. Given a network topology, traffic requirements, and gateway capacities, we show how to allocate network interface cards and their channels to fully utilize channel bandwidths. The results can be used by a wireless Internet service provider to plan their networks under a hardware constraint so as to maximize their profits. To the best of our knowledge, this is the first work addressing resource planning in a wireless mesh network. Our numerical results show significant improvement in terms of aggregate network throughput with moderate network-layer fairness.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123160455","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}
Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317915
Fengxiang Zhang, S. Abe
Nowadays various kinds of anomalies are prohibiting the widely used Internet from offering normal services. Within them a novel anomaly is caused by bandwidth attacks. To defense these threats many detecting schemes are essentially based on unidirectional checking of traffic changes. When legitimately abrupt changes appear, they might result in false alarms. In this paper we consider the problem from the bidirectional-traffic view and analyze the traffic characteristics by checking the input/output traffic characteristics of the protected network node. We have analyzed the relationship between input and output traffic volume pairs in the simulation traffic and studied them both under normal and abnormal cases. Based on these analyses, we've proposed a heuristic DDoS flooding attack detection method and showed a verifying simulation as well.
{"title":"A Heuristic DDoS Flooding Attack Detection Mechanism Analyses based on the Relationship between Input and Output Traffic Volumes","authors":"Fengxiang Zhang, S. Abe","doi":"10.1109/ICCCN.2007.4317915","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317915","url":null,"abstract":"Nowadays various kinds of anomalies are prohibiting the widely used Internet from offering normal services. Within them a novel anomaly is caused by bandwidth attacks. To defense these threats many detecting schemes are essentially based on unidirectional checking of traffic changes. When legitimately abrupt changes appear, they might result in false alarms. In this paper we consider the problem from the bidirectional-traffic view and analyze the traffic characteristics by checking the input/output traffic characteristics of the protected network node. We have analyzed the relationship between input and output traffic volume pairs in the simulation traffic and studied them both under normal and abnormal cases. Based on these analyses, we've proposed a heuristic DDoS flooding attack detection method and showed a verifying simulation as well.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466967","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：