Sun Qibo, W. Shangguang, Yan Dan-feng, Y. Fangchun
{"title":"ARM-CPD: Detecting SYN flooding attack by traffic prediction","authors":"Sun Qibo, W. Shangguang, Yan Dan-feng, Y. Fangchun","doi":"10.1109/ICBNMT.2009.5348532","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348532","url":null,"abstract":"This paper proposed an ARM-CPD scheme that is a simple but fast and effective approach to detect SYN flooding attacks. Instead of managing all real time ongoing traffic on the network, ARM-CPD only monitors the SYN packet and use it to predict the SYN packet in the near future to detect the SYN flooding attacks. To get the prediction SYN traffic, the Autoregressive Integrated Moving Average Model (ARIMA) is proposed; and to make the detection method insensitive to site and access pattern, a non-parametric Cumulative Sum (CUSUM) algorithm is applied. The trace-driven simulations demonstrate that ARM-CPD can shorten the detection time of SYN flooding attack effectively.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127566589","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}
Zhang Pei, Lin Zhaowen, Jiang Xiaoxiao, Huang Xiaohong, Ma Yan
{"title":"An extensible flow information export engine for traffic measurement","authors":"Zhang Pei, Lin Zhaowen, Jiang Xiaoxiao, Huang Xiaohong, Ma Yan","doi":"10.1109/ICBNMT.2009.5348495","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348495","url":null,"abstract":"Flow-based IP traffic measurement is a very important part of network monitoring. However, traffic measurement devices and flow exporting software have still too low performance to collect all flows. In this paper, we propose an extensible flow export engine, called XFix, on basis of a GPL tool, -nProbe, which is an efficient flow probe that supports for NetFlow v9/IPFIX. In the engine, we also propose some solutions and improvements in flow aggregation, which are able to improve the performance of the metering process, support bidirectional flow and reduce application information loss. Experimental results have shown its efficiency in multi-thread processing activity.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127722180","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}
{"title":"A GA approach for traffic matrix estimation","authors":"Jiang Yi, Shan Fengjun, Zou Yang, Li Linhao","doi":"10.1109/ICBNMT.2009.5348489","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348489","url":null,"abstract":"Traffic matrix is important for many network design, engineering, and management functions. However they are often difficult to measure directly. Because networks are dynamic, analysis tools must be adaptive and computationally light weight. In order to estimate the traffic matrix for whole network, a novel calculating model is proposed based the genetic algorithm (GA). Firstly, a generalized inverse matrix is introduced to acquire the general solutions of traffic matrix equation. Secondly, in order to improve the method, an original traffic matrix is estimated according to the prior, for example, Poisson model. Lastly, genetic algorithm is proposed to estimate the traffic matrix. Through both theoretical analysis and simulating results, it is shown that the proposed algorithm achieves better performance than the existing representative methods.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114573506","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}
{"title":"Audio compression using a filter ear model and a Gammachirp wavelet","authors":"K. Abid, K. Ouni, N. Ellouze","doi":"10.1109/ICBNMT.2009.5348480","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348480","url":null,"abstract":"In this paper we present a new design of a psycho-acoustic model for audio coding following the model used in the standard MPEG-1 audio layer 3. This architecture is based on the combined external and middle ear model and on the appropriate wavelet packet decomposition instead of a short term Fourier transformation. Its important characteristic is to propose an analysis of the frequency bands that come closer to the critical bands of the ear. This study shows the best performance of the Gammachirp coder.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"83 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114002704","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}
{"title":"The design and implementation of component-based multimedia conferencing services model","authors":"Z. Shicheng, Hu Xiaoxiao, Cheng Bo, Chen Junliang","doi":"10.1109/ICBNMT.2009.5348464","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348464","url":null,"abstract":"Multimedia conference is a real-time communication service for multiple parties, which involve audio, video, white board and so on. In this paper, we introduce a layered and component-based multimedia conference model based on JAIN SLEE Specification, and design the couple of subservices, such as create-conference, end-conference, modify-conference, change-chairman, and so forth. Finally, we implement a prototype.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122767835","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}
{"title":"An approach to evaluate network performance based on hop-by-hop latencies","authors":"Xu Yi, J. Yue-hui, Cui Yidong, Que Xirong","doi":"10.1109/ICBNMT.2009.5348491","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348491","url":null,"abstract":"Understanding network performance especially in link level is becoming increasingly important for network management. This paper puts forward an approach to evaluate network performance based on hop-by-hop latencies from three different levels of granularity including interface granularity, city granularity and AS granularity. We use a set of large scaled traceroute data, from a number of sources which are PlanetLab nodes to other random selected destinations to accomplish the experimental study. The analysis results show that this approach can carry out network performance evaluation in a flexible and effective way.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828804","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}
{"title":"Cluster based reverse traffic channel rate control for CDMA2000 1X EV-DO system","authors":"Li-min Peng, W. Shanshan, Lu Xingguo","doi":"10.1109/ICBNMT.2009.5347842","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347842","url":null,"abstract":"CDMA2000 1x EV-DO standard has a simple reverse traffic channel rate control scheme including reverse activity bit (RAB) and transition probability techniques. The RAB is used to specify whether the sector's reverse traffic channel is busy or not, and determined by comparison between the total received RoT (Rise over Thermal) and predefined threshold. Obviously, this determination method doesn't consider each access terminal's status or reflect the respective qualities of reverse traffic channels. Therefore, we propose a new scheme based on cluster to realize dedicated rate control. Different clusters represent different reverse traffic channel qualities, and set different probabilities for rate transition. The propose scheme is validated through simulations. The results show that the proposed scheme can increase the reverse traffic throughout and average data rate.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127846814","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}
{"title":"Dasher: A peer-to-peer content distribution system based on combined network coding","authors":"Ou Kaiqian, X. Yinlong, Ma Guanjun, Zhu Yulin","doi":"10.1109/ICBNMT.2009.5347839","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347839","url":null,"abstract":"Network coding can ease the block scheduling and thus makes the distribution more efficient. However, the complexities of encoding and decoding increase sharply as the content size scales up. In this paper, we propose a coding scheme which combines chunked coding and sparse linear network coding to reduce both encoding and decoding costs of content distribution. Based on the combined scheme, we implement a P2P content distribution system, named Dasher, where Local-Rarest-First scheme is adopted for chunk scheduling. Under the same system architecture, we implement three comparative systems, a BitTorrent-like system, named Mybt, a system only with sparse coding, named Sparser and a system using chunked coding, named Chunker. We conduct extensive experiments to compare the performance among these four systems. The experimental results show that Dasher with certain chunk sizes can reduce the average downloading time up to 15% compared with Mybt, and up to 43% with Chunker. With proper chunk sizes, the downloading time of Dasher is almost the same with Sparser. The average decoding rate of Dasher is the same with Chunker, and is nearly m times as fast as Sparser, where m is the number of chunks. Moreover, with respect to robustness, Dasher performs almost as well as Chunker, better than Mybt, but worse than Sparser.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133202966","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}
{"title":"Brief descriptions of museum collection management system","authors":"Shuxiang Fan","doi":"10.1109/ICBNMT.2009.5347807","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347807","url":null,"abstract":"With the development of computer network and communication network, people can shoping, book tickets and deposit or fetch money through Electronic Commerce at home; they also need to see the collection, exhibition and activities of museum via Internet at home. Therefore, many museums make their collection digitalized to meet people's needs. In accordance with The United Nations definition, cultural heritage includes \" contacted heritage\" and \"uncontact heritage \" and related information. As the development of digital information technology, digitalization has concerned all types of cultural heritage,. Its level of development has been one of the important symbols to evaluate the information infrastructure of a nation. As a result, developed countries in the world have used the current national policy led to public funds to start building the digitalization of cultural heritage.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131302472","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}
Deng Chao, Yan Dan-feng, Yong-Gib Yun, Y. Fangchun
{"title":"A domain-oriented distributed vulnerability scanning mechanism","authors":"Deng Chao, Yan Dan-feng, Yong-Gib Yun, Y. Fangchun","doi":"10.1109/ICBNMT.2009.5347797","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347797","url":null,"abstract":"This paper introduces a new domain-oriented distributed vulnerability scanning mechanism based on the studies of other vulnerability scanning systems, which have difficulties on dealing with network crossing, interceptor crossing and bottleneck effect, etc. After giving some description about domain-oriented distributed architecture, this paper introduces a SOA-like service providing mode. Following introduction leads to a new hierarchical strategy scheduling model that solves the problems of distributed scheduling management. A comparing experiment on the new scanning prototype and a Centralized scanner called Nessus is given at the end of this paper. At last, it comes to the conclusion that this new domain-oriented distributed vulnerability scanning mechanism has great performance on timing and accuracy.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123040709","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}