Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283856
Ken'ichiro Kanehana, H. Saito, Y. Tobe
In this paper we propose a new scheme of managing resources on public devices used by private devices. Due to the advancement of wireless LAN technologies, wireless hot spots are becoming popular in the cities. In such hot spots, we can expect that public devices such as large displays and printers be available in the future as well. Assuming that these public devices are used by anonymous group of users, there are several threats of group-secret information being exposed or unintentionally left on public devices. To overcome the problems, secure management of personalization association (SAPEA) is introduced. SAPEA has two fundamental mechanisms: accessible-zone based and soft-state management of public devices. In particular, files which are the fundamental resources in SAPEA can be extinguished even when they are being used to avoid exposure to illegitimate users. In this paper we describe the design and implementation of SAPEA on Linux PCs with Bluetooth.
{"title":"Public-device resource management preventing danger of exposure","authors":"Ken'ichiro Kanehana, H. Saito, Y. Tobe","doi":"10.1109/AINA.2004.1283856","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283856","url":null,"abstract":"In this paper we propose a new scheme of managing resources on public devices used by private devices. Due to the advancement of wireless LAN technologies, wireless hot spots are becoming popular in the cities. In such hot spots, we can expect that public devices such as large displays and printers be available in the future as well. Assuming that these public devices are used by anonymous group of users, there are several threats of group-secret information being exposed or unintentionally left on public devices. To overcome the problems, secure management of personalization association (SAPEA) is introduced. SAPEA has two fundamental mechanisms: accessible-zone based and soft-state management of public devices. In particular, files which are the fundamental resources in SAPEA can be extinguished even when they are being used to avoid exposure to illegitimate users. In this paper we describe the design and implementation of SAPEA on Linux PCs with Bluetooth.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131581578","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283821
Haw-Yun Shin, Jean-Lien C. Wu, Yi-Hsien Wu
A frame-based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide, respectively, low delay and low jitter for real-time traffic and short queue length for nonreal-time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet-level QoS requirements but also has low implementation cost. As the number of constant bit rate (CBR) connections increases, variable bit rate (VBR) traffic would suffer a larger jitter, the PWS with modular strategy (PWS/MS) scheme is proposed to further enhance the PWS scheme. We also introduce two different slot-reuse strategies named real-time traffic first (RTF) and longest queue first (LQF), respectively, to improve the resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round-robin (RR) and weighted-round-robin (WRR) by using the OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.
{"title":"A packet scheduling scheme for broadband wireless networks with heterogeneous services","authors":"Haw-Yun Shin, Jean-Lien C. Wu, Yi-Hsien Wu","doi":"10.1109/AINA.2004.1283821","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283821","url":null,"abstract":"A frame-based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide, respectively, low delay and low jitter for real-time traffic and short queue length for nonreal-time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet-level QoS requirements but also has low implementation cost. As the number of constant bit rate (CBR) connections increases, variable bit rate (VBR) traffic would suffer a larger jitter, the PWS with modular strategy (PWS/MS) scheme is proposed to further enhance the PWS scheme. We also introduce two different slot-reuse strategies named real-time traffic first (RTF) and longest queue first (LQF), respectively, to improve the resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round-robin (RR) and weighted-round-robin (WRR) by using the OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132102141","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283857
Xiaohui Li, W. Kou
The focus of this paper is on a secure mobile commerce model based on wireless local area network (WLAN). The model is investigated through the accessing procedure, the roaming management procedure, and the electronic trade procedure. To solve the security problem in the WLAN, a novel authentication method is proposed, in which the mobile node (MN) is validated twice by an access point (AP) and a mobile agent (MA), and all the devices are authenticated in a register procedure with the PKI/CA mechanism. Finally, the advantages of the model are analyzed.
{"title":"A secure m-commerce model based on wireless local area network","authors":"Xiaohui Li, W. Kou","doi":"10.1109/AINA.2004.1283857","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283857","url":null,"abstract":"The focus of this paper is on a secure mobile commerce model based on wireless local area network (WLAN). The model is investigated through the accessing procedure, the roaming management procedure, and the electronic trade procedure. To solve the security problem in the WLAN, a novel authentication method is proposed, in which the mobile node (MN) is validated twice by an access point (AP) and a mobile agent (MA), and all the devices are authenticated in a register procedure with the PKI/CA mechanism. Finally, the advantages of the model are analyzed.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"20 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113955483","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283956
Yeim-Kuan Chang, Wen-Hsin Cheng
As the demand for high bandwidth on the Internet increases, it is required to build next generation routers with the capability of forwarding multiple millions of packets per second. Reducing the required memory size of the forwarding table is a possible solution since small forward table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to make the IP forwarding table as small as possible. The experiments show that the required memory size of the proposed scheme is smaller than other existing schemes for a large routing table.
{"title":"A small IP forwarding table using hashing","authors":"Yeim-Kuan Chang, Wen-Hsin Cheng","doi":"10.1109/AINA.2004.1283956","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283956","url":null,"abstract":"As the demand for high bandwidth on the Internet increases, it is required to build next generation routers with the capability of forwarding multiple millions of packets per second. Reducing the required memory size of the forwarding table is a possible solution since small forward table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to make the IP forwarding table as small as possible. The experiments show that the required memory size of the proposed scheme is smaller than other existing schemes for a large routing table.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"691 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122981575","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283805
V. Wietrzyk, R. Lawson, R. Schmid, Vijay K. Khandelwal, M. Takizawa, T. Enokido
The focus is on the mechanism that supports the provision of the adequate service level by relying on Web system architecture with multinode clustering. Replication of Web documents can improve both performance and reliability of the Web service. Server selection algorithms allow Web clients to select one of the replicated servers which is "close " to them and thereby minimize the response time of the Web service.
{"title":"Distributed replication and caching: a mechanism for architecting responsive Web services","authors":"V. Wietrzyk, R. Lawson, R. Schmid, Vijay K. Khandelwal, M. Takizawa, T. Enokido","doi":"10.1109/AINA.2004.1283805","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283805","url":null,"abstract":"The focus is on the mechanism that supports the provision of the adequate service level by relying on Web system architecture with multinode clustering. Replication of Web documents can improve both performance and reliability of the Web service. Server selection algorithms allow Web clients to select one of the replicated servers which is \"close \" to them and thereby minimize the response time of the Web service.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123085258","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283947
Chinchen Chang, T. Lu, Yi-Long Liu
In order to improve the compression rate of vector quantization (VQ) during compression, a re-encoding scheme, called spiral scan re-encoding (SSR), was designed to compact the indices in VQ. Based on the SSR scheme, we propose a novel lossless hiding scheme, called IHSSR. When the scheme is used, information is hidden in the compression code for increasing the bandwidth efficiency of the compressed code. The IHSSR system was developed to test the performance of the IHSSR scheme. According to the experimental results, the IHSSR system can efficiently hide secret information in the compression code of indices without modifying its content. The decoding process can obtain the hidden secret information and the indices. Only a small number of extra bits are needed to record the corresponding information.
{"title":"Bandwidth efficiency of an image compression method for information hiding","authors":"Chinchen Chang, T. Lu, Yi-Long Liu","doi":"10.1109/AINA.2004.1283947","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283947","url":null,"abstract":"In order to improve the compression rate of vector quantization (VQ) during compression, a re-encoding scheme, called spiral scan re-encoding (SSR), was designed to compact the indices in VQ. Based on the SSR scheme, we propose a novel lossless hiding scheme, called IHSSR. When the scheme is used, information is hidden in the compression code for increasing the bandwidth efficiency of the compressed code. The IHSSR system was developed to test the performance of the IHSSR scheme. According to the experimental results, the IHSSR system can efficiently hide secret information in the compression code of indices without modifying its content. The decoding process can obtain the hidden secret information and the indices. Only a small number of extra bits are needed to record the corresponding information.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123986350","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283792
Voravud Santiraveewan, Y. Permpoontanalarp
Firewalls offer a protection for private networks against both internal and external attacks. However, configuring firewalls to ensure the protections is a difficult task. The main reason is the lack of methodology to analyze the security of firewall configurations. IP spoofing attack is an attack in which an attacker can impersonate another person towards a victim. We propose a new methodology for verifying the vulnerability of firewall configurations to IP spoofing attack and for synthesizing IP spoofing-free configurations. Our methodology is based on graph theory, which provides a simple and intuitive approach to the vulnerability analysis of the attack.
{"title":"A graph-based methodology for analyzing IP spoofing attack","authors":"Voravud Santiraveewan, Y. Permpoontanalarp","doi":"10.1109/AINA.2004.1283792","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283792","url":null,"abstract":"Firewalls offer a protection for private networks against both internal and external attacks. However, configuring firewalls to ensure the protections is a difficult task. The main reason is the lack of methodology to analyze the security of firewall configurations. IP spoofing attack is an attack in which an attacker can impersonate another person towards a victim. We propose a new methodology for verifying the vulnerability of firewall configurations to IP spoofing attack and for synthesizing IP spoofing-free configurations. Our methodology is based on graph theory, which provides a simple and intuitive approach to the vulnerability analysis of the attack.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124044467","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283896
M. Yan, C. K. Li
In a packet-switched network, latency is unavoidable and its characteristic always depends on the type of traffic flows and operating conditions. These affect the kind of services that the network can support as well as the quality of service (QoS) that the system can provide. Providing a fair service for users is always the main concern for operators as well as service providers. A fair delay-differentiable queueing algorithm with QoS support called Delay-Differentiable Fair Queueing (D/sup 2/FQ) is proposed. In the proposed algorithm, an additional delay-slot is used to re-order the departure order of flows according to its delay weight. D/sup 2/FQ can also protect the honest flows in delay and throughput when a node is attacked by defense of service (DoS) and the overall computation of the proposed D/sup 2/FQ is shown to be O(1). Algorithm analysis and simulation results are presented and the performance of D/sup 2/FQ is evaluated.
{"title":"Delay-differentiable fair queueing (D/sup 2/FQ): a low complexity scheduling algorithm for packet-switched networks","authors":"M. Yan, C. K. Li","doi":"10.1109/AINA.2004.1283896","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283896","url":null,"abstract":"In a packet-switched network, latency is unavoidable and its characteristic always depends on the type of traffic flows and operating conditions. These affect the kind of services that the network can support as well as the quality of service (QoS) that the system can provide. Providing a fair service for users is always the main concern for operators as well as service providers. A fair delay-differentiable queueing algorithm with QoS support called Delay-Differentiable Fair Queueing (D/sup 2/FQ) is proposed. In the proposed algorithm, an additional delay-slot is used to re-order the departure order of flows according to its delay weight. D/sup 2/FQ can also protect the honest flows in delay and throughput when a node is attacked by defense of service (DoS) and the overall computation of the proposed D/sup 2/FQ is shown to be O(1). Algorithm analysis and simulation results are presented and the performance of D/sup 2/FQ is evaluated.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128493939","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283971
Bok-Nyong Park, Jae-Won Kim, Wonjun Lee
One of the major issues raised by digital rights management (DRM) systems concerns the protection of the user's privacy and anonymous consumption of content. However, most existing DRM systems do not support the protection of each user's personal information. This paper suggests a privacy-enhancing license management protocol, named PrecePt (privacy-enhancing license management protocol), which is a more powerful protocol to protect personal information in DRM. To protect the exposure of user identifier, this protocol uses temporary ID and token to guarantee anonymity. The proposed scheme also uses a session key form ECDH cryptography and public-key so that it can protect the revelation of personal information and user privacy.
{"title":"PrecePt: a privacy-enhancing license management protocol for digital rights management","authors":"Bok-Nyong Park, Jae-Won Kim, Wonjun Lee","doi":"10.1109/AINA.2004.1283971","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283971","url":null,"abstract":"One of the major issues raised by digital rights management (DRM) systems concerns the protection of the user's privacy and anonymous consumption of content. However, most existing DRM systems do not support the protection of each user's personal information. This paper suggests a privacy-enhancing license management protocol, named PrecePt (privacy-enhancing license management protocol), which is a more powerful protocol to protect personal information in DRM. To protect the exposure of user identifier, this protocol uses temporary ID and token to guarantee anonymity. The proposed scheme also uses a session key form ECDH cryptography and public-key so that it can protect the revelation of personal information and user privacy.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117353519","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283842
Chengchen Hu, B. Liu
Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, our goal is to deploy the Random Early Detection (RED) algorithm in routers on shared buffer and solve these problems. A novel buffer management scheme that dynamically adjusts the parameters of RED named RED-ODT is proposed. Simulations under uniform traffic load and nonuniform traffic load are given, the results of which ascertain and demonstrate the superiority of the proposed scheme in terms of low packet drop ratio, satisfying buffer utilization and fairness. Simulation also shows that RED-ODT is insensitive to congestion level.
{"title":"RED with optimized dynamic threshold deployment on shared buffer","authors":"Chengchen Hu, B. Liu","doi":"10.1109/AINA.2004.1283842","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283842","url":null,"abstract":"Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, our goal is to deploy the Random Early Detection (RED) algorithm in routers on shared buffer and solve these problems. A novel buffer management scheme that dynamically adjusts the parameters of RED named RED-ODT is proposed. Simulations under uniform traffic load and nonuniform traffic load are given, the results of which ascertain and demonstrate the superiority of the proposed scheme in terms of low packet drop ratio, satisfying buffer utilization and fairness. Simulation also shows that RED-ODT is insensitive to congestion level.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693266","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
扫码关注我们
求助内容：
应助结果提醒方式：