Pub Date : 2003-04-09DOI: 10.1109/ICCT.2003.1209103
Anh Trần Quang, Qianli Zhang, Xing Li
This paper presents an approach to control the attack recall in an anomaly detection system using support vector machines (SVM). The recall and precision of SVM are controlled by the selection of the training model. The training model is selected by optimization method using genetic algorithm. A SVM training model optimization problem is presented and an expected attack recall is controlled by a tradeoff parameter /spl rho/ in the objective function. Experimental results demonstrate that as /spl rho/ increases from 0 to 1, the recall increases from 0 to 1. If we use the value of /spl rho/ to estimate the recall, the mean square error of this estimation is decreased during the evolution of the training model. Our approach allows a user to design a system with an expected recall while the precision is high.
{"title":"Attack recall control in anomaly detection","authors":"Anh Trần Quang, Qianli Zhang, Xing Li","doi":"10.1109/ICCT.2003.1209103","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209103","url":null,"abstract":"This paper presents an approach to control the attack recall in an anomaly detection system using support vector machines (SVM). The recall and precision of SVM are controlled by the selection of the training model. The training model is selected by optimization method using genetic algorithm. A SVM training model optimization problem is presented and an expected attack recall is controlled by a tradeoff parameter /spl rho/ in the objective function. Experimental results demonstrate that as /spl rho/ increases from 0 to 1, the recall increases from 0 to 1. If we use the value of /spl rho/ to estimate the recall, the mean square error of this estimation is decreased during the evolution of the training model. Our approach allows a user to design a system with an expected recall while the precision is high.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772419","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209128
Shi Feng, Wu Jianping, Xu Ke
In this paper, we consider the stability of a multicast (one-to-many) tree in cumulative layered multicast, which is traditionally realized by dropping a layer when congestion is detected. First, we define a stability index to evaluate and quantify tree's stability. Then, for obtaining the general expression of the stability index, we develop a simple statistical model, which is based on the link-dependent model and the dependency-degree model in [X. Zhang et al., 2001]. We show that even in the case of lower link-marking probability, the stability of multicast tree is significantly more sensitive to network congestion when dependency between different links becomes smaller, indicating that more links will leave the tree when congestion occurs.
{"title":"Statistical analysis of stability of multicast trees in cumulative layered multicast","authors":"Shi Feng, Wu Jianping, Xu Ke","doi":"10.1109/ICCT.2003.1209128","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209128","url":null,"abstract":"In this paper, we consider the stability of a multicast (one-to-many) tree in cumulative layered multicast, which is traditionally realized by dropping a layer when congestion is detected. First, we define a stability index to evaluate and quantify tree's stability. Then, for obtaining the general expression of the stability index, we develop a simple statistical model, which is based on the link-dependent model and the dependency-degree model in [X. Zhang et al., 2001]. We show that even in the case of lower link-marking probability, the stability of multicast tree is significantly more sensitive to network congestion when dependency between different links becomes smaller, indicating that more links will leave the tree when congestion occurs.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132866308","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209785
Hong-Yon Lach, N. Natarajan
We consider the problem of supporting moving in systems beyond 3G (B3G). We summarize the scope of problem, current solution approaches and the remaining challenges that need to be addressed.
{"title":"Support of mobile networks in B3G systems","authors":"Hong-Yon Lach, N. Natarajan","doi":"10.1109/ICCT.2003.1209785","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209785","url":null,"abstract":"We consider the problem of supporting moving in systems beyond 3G (B3G). We summarize the scope of problem, current solution approaches and the remaining challenges that need to be addressed.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"67 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268798","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209034
Ding Zhemin, M. Hamdi
Previous works have shown the wavelength conversion can considerably reduce the blocking probability in all-optical networks, but most of analytical models and algorithms are proposed under simplifying assumptions or restricted to specific cases. In this paper, we first introduce an abstracting technique called blocking island (BI) paradigm. A blocking island hierarchy (BIH) can be constructed by using the BI paradigm and bottleneck links can be easily identified in BIH. We then propose the wavelength placement algorithms using this traffic case. To make sure our algorithm is applicable in arbitrary topologies and any incoming traffic patterns, a simulation-based optimization approach is employed. In the simulation, we show the performance improvement obtained by full wavelength conversion can almost be achieved by using limited number of wavelength converters with careful placement. In a random generated network topology, we demonstrate our algorithm outperforms the best existing allocation scheme.
{"title":"Wavelength converter management in all-optical networks with arbitrary topologies using abstracting techniques","authors":"Ding Zhemin, M. Hamdi","doi":"10.1109/ICCT.2003.1209034","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209034","url":null,"abstract":"Previous works have shown the wavelength conversion can considerably reduce the blocking probability in all-optical networks, but most of analytical models and algorithms are proposed under simplifying assumptions or restricted to specific cases. In this paper, we first introduce an abstracting technique called blocking island (BI) paradigm. A blocking island hierarchy (BIH) can be constructed by using the BI paradigm and bottleneck links can be easily identified in BIH. We then propose the wavelength placement algorithms using this traffic case. To make sure our algorithm is applicable in arbitrary topologies and any incoming traffic patterns, a simulation-based optimization approach is employed. In the simulation, we show the performance improvement obtained by full wavelength conversion can almost be achieved by using limited number of wavelength converters with careful placement. In a random generated network topology, we demonstrate our algorithm outperforms the best existing allocation scheme.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131241876","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209100
W. Zhimin, J. Xiaolin
With the ceaseless development of Internet/intranet application, Internet e-mail has become one of the most important ways for people and enterprises to communicate with each other. However, in enterprises, a great deal of sensitive data, such as product reports, statistic data, may be divulged through the mail system by the provocateur. So, checking the outgoing e-mail is an effective means to protect sensitive data in the enterprises. As a network application service, the e-mail is based on simple mail transfer protocol (SMTP). According to some defects exists in mail checking system nowadays, the technology of TCP stream reassembling is proposed to restore the whole e-mail text and attachment in this paper, and audit the completed e-mail file using MIME standard and improved pattern match algorithm. Finally, the framework of implementation is illustrated using Win Pcap library.
随着Internet/intranet应用的不断发展，Internet电子邮件已成为人们与企业之间最重要的沟通方式之一。然而，在企业中，大量的敏感数据，如产品报告、统计数据等，可能会被不法分子通过邮件系统泄露出去。因此，检查外发邮件是保护企业敏感数据的有效手段。电子邮件作为一种网络应用服务，基于简单邮件传输协议SMTP (simple mail transfer protocol)。针对目前邮件检测系统存在的一些缺陷，本文提出了利用TCP流重组技术恢复邮件全文和附件，并采用MIME标准和改进的模式匹配算法对完整的邮件文件进行审计。最后，利用winpcap库对实现框架进行了说明。
{"title":"Restoration and audit of Internet e-mail based on TCP stream reassembling","authors":"W. Zhimin, J. Xiaolin","doi":"10.1109/ICCT.2003.1209100","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209100","url":null,"abstract":"With the ceaseless development of Internet/intranet application, Internet e-mail has become one of the most important ways for people and enterprises to communicate with each other. However, in enterprises, a great deal of sensitive data, such as product reports, statistic data, may be divulged through the mail system by the provocateur. So, checking the outgoing e-mail is an effective means to protect sensitive data in the enterprises. As a network application service, the e-mail is based on simple mail transfer protocol (SMTP). According to some defects exists in mail checking system nowadays, the technology of TCP stream reassembling is proposed to restore the whole e-mail text and attachment in this paper, and audit the completed e-mail file using MIME standard and improved pattern match algorithm. Finally, the framework of implementation is illustrated using Win Pcap library.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126449048","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209158
W. Anbin, Wujian, Zuo Peng, Wen Liangsheng, Gongwei, Lin Jin-tong
Clock recovery using the injected optoelectronic hybrid oscillator based on electro-absorption modular (EAM) is described and investigated in 4/spl times/10GHz optical time division multiplexing system in this paper. The time jitter of clock is less than 0.5 ps. The influence of EA modulator's window to time jitter and amplitude of extracted clock is analyzed. The tendency of theoretical results agrees with experimental result. Result shows that the window width can be larger than the width of time slot for the clock recovery.
{"title":"Experimental analysis of clock recovery based on EAM-oscillator","authors":"W. Anbin, Wujian, Zuo Peng, Wen Liangsheng, Gongwei, Lin Jin-tong","doi":"10.1109/ICCT.2003.1209158","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209158","url":null,"abstract":"Clock recovery using the injected optoelectronic hybrid oscillator based on electro-absorption modular (EAM) is described and investigated in 4/spl times/10GHz optical time division multiplexing system in this paper. The time jitter of clock is less than 0.5 ps. The influence of EA modulator's window to time jitter and amplitude of extracted clock is analyzed. The tendency of theoretical results agrees with experimental result. Result shows that the window width can be larger than the width of time slot for the clock recovery.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126555314","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209165
Yaping Zhou, Yuefeng Ji
A two-step resource precalculated and shared restoration mechanism is put forward in this paper. This mechanism separates calculation of link resource to reserve for newly created lightpath from restore path routing. The target of resource reservation is to minimize the resources for restoration under the condition that a restore path had been routed, and the restore path routing is base on various strategies. A different algorithm with minimal resource reservation can be seen as a different resource shared restoration scheme, which aims at a different objective for networking. Meanwhile a second shortest path and resource shared restoration scheme is given as an example.
{"title":"A new resource shared restoration mechanism for optical network","authors":"Yaping Zhou, Yuefeng Ji","doi":"10.1109/ICCT.2003.1209165","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209165","url":null,"abstract":"A two-step resource precalculated and shared restoration mechanism is put forward in this paper. This mechanism separates calculation of link resource to reserve for newly created lightpath from restore path routing. The target of resource reservation is to minimize the resources for restoration under the condition that a restore path had been routed, and the restore path routing is base on various strategies. A different algorithm with minimal resource reservation can be seen as a different resource shared restoration scheme, which aims at a different objective for networking. Meanwhile a second shortest path and resource shared restoration scheme is given as an example.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122570608","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209687
Yuanjun Dai, L. Zhang
Mobile e-commerce enables the mobile user to buy and pay for things via his mobile phone anywhere and at anytime. It will bring convenience and contribute to improve life quality of the user. However, security measures must be strong enough to protect the user from illegal abuses and to get confidence from him. This paper presents a secure payment scheme for the mobile e-commerce. We introduce a secure module into the WAP gateway for user authentication and making mobile e-commerce applications secure.
{"title":"A security payment scheme of mobile e-commerce","authors":"Yuanjun Dai, L. Zhang","doi":"10.1109/ICCT.2003.1209687","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209687","url":null,"abstract":"Mobile e-commerce enables the mobile user to buy and pay for things via his mobile phone anywhere and at anytime. It will bring convenience and contribute to improve life quality of the user. However, security measures must be strong enough to protect the user from illegal abuses and to get confidence from him. This paper presents a secure payment scheme for the mobile e-commerce. We introduce a secure module into the WAP gateway for user authentication and making mobile e-commerce applications secure.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122998645","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209899
Yang Guowei, Li Zhengxi, Tu Xuyan
No lossless data compression method based on neural network has been found before. A lossless compression method based on BP network for the long character-string of 0 and 1 is given by establishing specific mapping Y and specific integer function and with the non-linear approximation capability of concrete three-layer BP network in this paper. The compression and decompression algorithms of the lossless compression method are provided. Experiments show that the compression ratio of the lossless compression method is usually around 16/11 and the method can effectively compress the data which have been compressed by Huffman coding, arithmetic coding or dictionary coding.
{"title":"Lossless data compression methods based on neural network","authors":"Yang Guowei, Li Zhengxi, Tu Xuyan","doi":"10.1109/ICCT.2003.1209899","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209899","url":null,"abstract":"No lossless data compression method based on neural network has been found before. A lossless compression method based on BP network for the long character-string of 0 and 1 is given by establishing specific mapping Y and specific integer function and with the non-linear approximation capability of concrete three-layer BP network in this paper. The compression and decompression algorithms of the lossless compression method are provided. Experiments show that the compression ratio of the lossless compression method is usually around 16/11 and the method can effectively compress the data which have been compressed by Huffman coding, arithmetic coding or dictionary coding.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"119 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126302125","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209755
Ning Li, Hai Wang, Shaoren Zheng
In this paper, we propose a distributed energy-saving strategy by dynamically switching-off wireless network interface card (NIC), and analyze its performance in fully connected networks. Simulation results show that in wireless LAN, when the network load is rather heavy, this scheme can save NIC's energy consumption by more than 60%, at the meanwhile, its delay and throughput performance is still similar to that of 02.11DCF protocol. This scheme does not need global synchronization and can be applied to other MAC protocols based on collision avoidance mechanism.
{"title":"An energy-saving scheme for wireless LANs","authors":"Ning Li, Hai Wang, Shaoren Zheng","doi":"10.1109/ICCT.2003.1209755","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209755","url":null,"abstract":"In this paper, we propose a distributed energy-saving strategy by dynamically switching-off wireless network interface card (NIC), and analyze its performance in fully connected networks. Simulation results show that in wireless LAN, when the network load is rather heavy, this scheme can save NIC's energy consumption by more than 60%, at the meanwhile, its delay and throughput performance is still similar to that of 02.11DCF protocol. This scheme does not need global synchronization and can be applied to other MAC protocols based on collision avoidance mechanism.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473794","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
扫码关注我们
求助内容：
应助结果提醒方式：