Pub Date : 2003-09-21DOI: 10.1109/APCC.2003.1274229
Lee Eng Kean, S. Nor
It is currently a challenge to evaluate and compare network processor-based (a.k.a. NPU-based) applications due to the heterogeneity of the application designs and hardware architectures. Many research works have been done in the area of packet classifications, which were directed towards proposing high-speed firewall implementation algorithms. However, few researches focus on providing standard benchmarking methodology for a specific class of firewall. This paper presents a benchmarking methodology for NPU-based stateful firewall. The aim is to allow 'apple-to-apple' comparison among similar firewalls available in the market, and to provide practical benchmarks that exhibit realistic performance numbers. The key aspects of this work are benchmark specifications, separation of benchmark granularity in a layered manner, and the means of measurement. Finally, a system-level benchmark is applied on a stateful firewall implemented on Intel's IXP1200 network processor as a proof-of-concept of this work.
{"title":"A benchmarking methodology for NPU-based stateful firewall","authors":"Lee Eng Kean, S. Nor","doi":"10.1109/APCC.2003.1274229","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274229","url":null,"abstract":"It is currently a challenge to evaluate and compare network processor-based (a.k.a. NPU-based) applications due to the heterogeneity of the application designs and hardware architectures. Many research works have been done in the area of packet classifications, which were directed towards proposing high-speed firewall implementation algorithms. However, few researches focus on providing standard benchmarking methodology for a specific class of firewall. This paper presents a benchmarking methodology for NPU-based stateful firewall. The aim is to allow 'apple-to-apple' comparison among similar firewalls available in the market, and to provide practical benchmarks that exhibit realistic performance numbers. The key aspects of this work are benchmark specifications, separation of benchmark granularity in a layered manner, and the means of measurement. Finally, a system-level benchmark is applied on a stateful firewall implemented on Intel's IXP1200 network processor as a proof-of-concept of this work.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115615094","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-09-21DOI: 10.1109/APCC.2003.1274373
S. Kimura, K. Sakai, A. Kurokawa, H. Sunaga
Peer-to-peer (P2P) services, such as Gnutella, Groove [http:www.clip2.com/GnutellaProtocol04.pdf], and Freenet [http://freenet.sourceforge.com], have become popular for sharing files, information, and contents. For ordinary users, however, it can be difficult to utilize P2P-software, because need to install the software, set parameters, and share information. We thus proposed a P2P service model, that only requires user terminals to have a Web browser, and we previously described the key technologies for developing P2P-Web collaboration, including the software architecture, agent functions, and applications [S.Kimura et al., June 2002]. We have since implemented a P2P-Web system to enable collaboration among databases. In this paper, we describe the system architecture and evaluate the performance and usability of the system through an experiment.
{"title":"Implementation and evaluation of the P2P-Web system","authors":"S. Kimura, K. Sakai, A. Kurokawa, H. Sunaga","doi":"10.1109/APCC.2003.1274373","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274373","url":null,"abstract":"Peer-to-peer (P2P) services, such as Gnutella, Groove [http:www.clip2.com/GnutellaProtocol04.pdf], and Freenet [http://freenet.sourceforge.com], have become popular for sharing files, information, and contents. For ordinary users, however, it can be difficult to utilize P2P-software, because need to install the software, set parameters, and share information. We thus proposed a P2P service model, that only requires user terminals to have a Web browser, and we previously described the key technologies for developing P2P-Web collaboration, including the software architecture, agent functions, and applications [S.Kimura et al., June 2002]. We have since implemented a P2P-Web system to enable collaboration among databases. In this paper, we describe the system architecture and evaluate the performance and usability of the system through an experiment.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124416051","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-09-21DOI: 10.1109/APCC.2003.1274398
A. Marsden, N. H. Viet, S. Fujimoto, O. Koyama, Y. Katsuyama
A novel optical network architecture to integrate layer 2 and 3 routings by optical/electrical hybrid switching is proposed. One node router and 8 edge routers were prepared and connected with single-mode fibers so as to form an optical ring, and the transmission experiments were conducted. It was successfully confirmed in the performance examination that layer 2 and 3 transmission could be integrated through the network, by using 8 wavelengths in 1550 nm band for the layer 2 transmission and 1310 nm wavelength for the layer 3 transmission.
{"title":"Metropolitan/access optical network architecture to supply virtual private network, integrating layer-2&3 routings by optical/electrical hybrid switching","authors":"A. Marsden, N. H. Viet, S. Fujimoto, O. Koyama, Y. Katsuyama","doi":"10.1109/APCC.2003.1274398","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274398","url":null,"abstract":"A novel optical network architecture to integrate layer 2 and 3 routings by optical/electrical hybrid switching is proposed. One node router and 8 edge routers were prepared and connected with single-mode fibers so as to form an optical ring, and the transmission experiments were conducted. It was successfully confirmed in the performance examination that layer 2 and 3 transmission could be integrated through the network, by using 8 wavelengths in 1550 nm band for the layer 2 transmission and 1310 nm wavelength for the layer 3 transmission.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116637007","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-09-21DOI: 10.1109/APCC.2003.1274363
Yung-Fa Huang, J. Wen
In this paper, a bit inversion (BI) procedure in previous works is further investigated over multipath frequency selective fading channels for DS-CDMA communication systems. Moreover, after the BI procedure performed with partial parallel interference cancellation (PPlC) schemes where the partial cancellation weight (PCW) is adapted by the least mean square (LMS) adaptive filtering algorithm, a full PIC is performed to closely cancel the multiple access interference (MAI). Simulation results show that the proposed four-stage BI-based full PIC (BI-FPIC) detector closely cancels the MAI over a two-path frequency selective fading channel and outperforms the LMS-based PPIC schemes.
{"title":"An adaptive multistage parallel interference canceller for CDMA systems over frequency selective fading channels","authors":"Yung-Fa Huang, J. Wen","doi":"10.1109/APCC.2003.1274363","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274363","url":null,"abstract":"In this paper, a bit inversion (BI) procedure in previous works is further investigated over multipath frequency selective fading channels for DS-CDMA communication systems. Moreover, after the BI procedure performed with partial parallel interference cancellation (PPlC) schemes where the partial cancellation weight (PCW) is adapted by the least mean square (LMS) adaptive filtering algorithm, a full PIC is performed to closely cancel the multiple access interference (MAI). Simulation results show that the proposed four-stage BI-based full PIC (BI-FPIC) detector closely cancels the MAI over a two-path frequency selective fading channel and outperforms the LMS-based PPIC schemes.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116797125","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-09-21DOI: 10.1109/APCC.2003.1274404
T. S. Kiong, M. Ismail, A. Hassan
Teletraffic performance of channel assignment strategy with and without genetic algorithm (GA) integration is presented in this paper. Genetic algorithm (GA) D. Goldberg (1989) J.H. Holland (1975) which is a well-known method in solving various types of complex mathematical is integrated into ordinary channel assignment strategies to design a conflict-free channel assignment strategy that satisfies both the electromagnetic compatibility (EMC) constraints and traffic demand requirements W.K. Lai et al. (1996). The teletraffic performance is based on grade of service (GoS) of mobile cellular-system that can be predicted using Erlang-B and through simulation. Good agreement is obtained between the predicted results and simulation data. The simulation results show that GA has improved the GoS (grade of service) of cellular radio system in the aspect of blocking probability and C/I (carrier-to-interference ratio) median in mobile cellular system.
研究了采用遗传算法集成和不采用遗传算法集成的信道分配策略的电信业务性能。将遗传算法(GA) D. Goldberg(1989)和J.H. Holland(1975)这一解决各类复杂数学问题的著名方法整合到普通信道分配策略中，设计出既满足电磁兼容性约束又满足流量需求要求的无冲突信道分配策略W.K. Lai等(1996)。远程通信性能是基于移动蜂窝系统的服务等级(GoS)，可以通过Erlang-B和仿真来预测。预测结果与仿真数据吻合较好。仿真结果表明，遗传算法从阻塞概率和C/I(载波干扰比)中值两方面提高了蜂窝无线电系统的服务等级。
{"title":"Teletraffic performance of mobile cellular channel assignment using genetic algorithm","authors":"T. S. Kiong, M. Ismail, A. Hassan","doi":"10.1109/APCC.2003.1274404","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274404","url":null,"abstract":"Teletraffic performance of channel assignment strategy with and without genetic algorithm (GA) integration is presented in this paper. Genetic algorithm (GA) D. Goldberg (1989) J.H. Holland (1975) which is a well-known method in solving various types of complex mathematical is integrated into ordinary channel assignment strategies to design a conflict-free channel assignment strategy that satisfies both the electromagnetic compatibility (EMC) constraints and traffic demand requirements W.K. Lai et al. (1996). The teletraffic performance is based on grade of service (GoS) of mobile cellular-system that can be predicted using Erlang-B and through simulation. Good agreement is obtained between the predicted results and simulation data. The simulation results show that GA has improved the GoS (grade of service) of cellular radio system in the aspect of blocking probability and C/I (carrier-to-interference ratio) median in mobile cellular system.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121036054","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-09-21DOI: 10.1109/APCC.2003.1274331
Cong Shen, Xin Su, Xibin Xu, Yan Yao
System reconfiguration and resource re-allocation are important issues in software radio systems. They are crucial in realizing multi-band and multi-mode. In this paper, a strategy named layered reconfiguration management, which aims at reconfiguring the system more effectively, is proposed and implemented in the software radio system based on general PCs and network. Relevant issues are discussed in this paper.
{"title":"An effective reconfiguration management in PC-based software radio systems","authors":"Cong Shen, Xin Su, Xibin Xu, Yan Yao","doi":"10.1109/APCC.2003.1274331","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274331","url":null,"abstract":"System reconfiguration and resource re-allocation are important issues in software radio systems. They are crucial in realizing multi-band and multi-mode. In this paper, a strategy named layered reconfiguration management, which aims at reconfiguring the system more effectively, is proposed and implemented in the software radio system based on general PCs and network. Relevant issues are discussed in this paper.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121132169","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-09-21DOI: 10.1109/APCC.2003.1274457
A. Sayenko, Timo Hämäläinen, J. Joutsensalo, Jarmo Siltanen
This paper proposes the adaptive resource allocation model that is based on the WFQ service policy. This model ensures QoS requirements and at the same time tries to maximize a service provider's revenue by manipulating weights of the WFQ policy. The model is flexible in that different network services are grouped into service classes and are given such QoS characteristics as bandwidth and delay. To adjust dynamically weights it is proposed to use the usage-based revenue criterion that enables the allocation of free resource between service classes. The simulation considers a single node with the implemented model that serves several service classes with different QoS requirements and traffic characteristics. It is shown that the total revenue can be increased due to the allocation of unused resources to more expensive service classes. Though the simulation has revealed that certain QoS threshold are violated, the percentage of them is insignificant and can be easily tolerated by many network applications.
{"title":"On providing bandwidth and delay guarantees using the revenue criterion based adaptive WFQ","authors":"A. Sayenko, Timo Hämäläinen, J. Joutsensalo, Jarmo Siltanen","doi":"10.1109/APCC.2003.1274457","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274457","url":null,"abstract":"This paper proposes the adaptive resource allocation model that is based on the WFQ service policy. This model ensures QoS requirements and at the same time tries to maximize a service provider's revenue by manipulating weights of the WFQ policy. The model is flexible in that different network services are grouped into service classes and are given such QoS characteristics as bandwidth and delay. To adjust dynamically weights it is proposed to use the usage-based revenue criterion that enables the allocation of free resource between service classes. The simulation considers a single node with the implemented model that serves several service classes with different QoS requirements and traffic characteristics. It is shown that the total revenue can be increased due to the allocation of unused resources to more expensive service classes. Though the simulation has revealed that certain QoS threshold are violated, the percentage of them is insignificant and can be easily tolerated by many network applications.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127219336","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-09-21DOI: 10.1109/APCC.2003.1274305
Kuo-Bin Tseng, Jhin-Fang Huang
As WDM technology mature and popular, it has merged as a potential candidate for future networks with high-capacity bandwidth providing efficient multicast in WDM networks. Multicast is the ability to transmit information from a single source node to multiple destinations, its applications includes video-conference, e-commerce, video-on-demand, distributed databases, distribution software and World Wide Web browsing. In this paper, we propose a multicast routing algorithm called "multicast-FCR". The Multicast-FCR algorithm can optimal routing path and minimal wavelength conversion more efficiency than multicast-random.
{"title":"Optimal routing path and wavelength assignment in WDM multicast networks","authors":"Kuo-Bin Tseng, Jhin-Fang Huang","doi":"10.1109/APCC.2003.1274305","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274305","url":null,"abstract":"As WDM technology mature and popular, it has merged as a potential candidate for future networks with high-capacity bandwidth providing efficient multicast in WDM networks. Multicast is the ability to transmit information from a single source node to multiple destinations, its applications includes video-conference, e-commerce, video-on-demand, distributed databases, distribution software and World Wide Web browsing. In this paper, we propose a multicast routing algorithm called \"multicast-FCR\". The Multicast-FCR algorithm can optimal routing path and minimal wavelength conversion more efficiency than multicast-random.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123743866","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-09-21DOI: 10.1109/APCC.2003.1274273
Jae-Young Kim, ByungJun Ahn, Y. Kim
IP lookup is an important issue in core router systems. Several new algorithms have been proposed to solve this problem. These approaches have strength and weakness compared with the number of memory access times, route insertion/deletion time, and memory usage fact. In a point of view high-speed prefix lookup, we propose the improved lookup scheme using dual-mode tables based on multibit tries and the fast hardware-based IP address lookup approach. The proposed scheme is very related to real Internet traffics because this scheme is an optimized current prefix length distributions.
{"title":"High speed lookup scheme based on two-pass for core router","authors":"Jae-Young Kim, ByungJun Ahn, Y. Kim","doi":"10.1109/APCC.2003.1274273","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274273","url":null,"abstract":"IP lookup is an important issue in core router systems. Several new algorithms have been proposed to solve this problem. These approaches have strength and weakness compared with the number of memory access times, route insertion/deletion time, and memory usage fact. In a point of view high-speed prefix lookup, we propose the improved lookup scheme using dual-mode tables based on multibit tries and the fast hardware-based IP address lookup approach. The proposed scheme is very related to real Internet traffics because this scheme is an optimized current prefix length distributions.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827175","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-09-21DOI: 10.1109/APCC.2003.1274449
S. Meftah, R. Razali, A. Samsudin, R. Budiator
Cryptography has become an important discipline, especially for computer and communication system. There are various methods and algorithms in cryptography which require multiplication of large numbers. These multiplications of large numbers normally require high computing power and need to be completed in 'real-time'. In this paper, Karatsuba algorithm is investigated for speeding up the performance of multiplying large integers using distributed workstations (server-clients). Also included in this paper is a comparison of various methods in implementing Karatsuba algorithm.
{"title":"Enhancing public-key cryptosystem using parallel Karatsuba algorithm with socket programming","authors":"S. Meftah, R. Razali, A. Samsudin, R. Budiator","doi":"10.1109/APCC.2003.1274449","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274449","url":null,"abstract":"Cryptography has become an important discipline, especially for computer and communication system. There are various methods and algorithms in cryptography which require multiplication of large numbers. These multiplications of large numbers normally require high computing power and need to be completed in 'real-time'. In this paper, Karatsuba algorithm is investigated for speeding up the performance of multiplying large integers using distributed workstations (server-clients). Also included in this paper is a comparison of various methods in implementing Karatsuba algorithm.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061748","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
扫码关注我们
求助内容：
应助结果提醒方式：