Pub Date : 2006-05-08DOI: 10.1109/ICACT.2006.206059
M. Mujinga, H. Muyingi, G. Rao
Internet Protocol version 4 (IPv4) is the current IP in use at the backbone of the Internet. Internet protocol version 6 (IPv6) is proposed to succeed IPv4 by IETF. IPv6 addresses among other issues the lack of security in IPv4 at network layer, in IPv6 this is addressed by the use of Internet protocol security (IPSec). This research reports on the evaluation of IPSec in an IPv4/IPv6 dual stack network
Internet Protocol version 4 (IPv4)是目前在Internet骨干网中使用的IP。Internet协议版本6 (IPv6)是IETF提出的取代IPv4的协议。IPv6解决了IPv4在网络层缺乏安全性的问题，IPv6通过使用互联网协议安全(IPSec)来解决这个问题。本研究报告了IPv4/IPv6双栈网络中IPSec的评估
{"title":"IPSec overhead analysis in dual stack IPv4/IPv6 transition mechanisms","authors":"M. Mujinga, H. Muyingi, G. Rao","doi":"10.1109/ICACT.2006.206059","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206059","url":null,"abstract":"Internet Protocol version 4 (IPv4) is the current IP in use at the backbone of the Internet. Internet protocol version 6 (IPv6) is proposed to succeed IPv4 by IETF. IPv6 addresses among other issues the lack of security in IPv4 at network layer, in IPv6 this is addressed by the use of Internet protocol security (IPSec). This research reports on the evaluation of IPSec in an IPv4/IPv6 dual stack network","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124973040","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206404
Sung Uk Park
The introduction of a VoIP is expected to increase consumer benefits, boost competition in the IT market. This research endeavors to study the optimal access charge for a VoIP, which is expected to be introduced to the Korean IT market. I find that the optimal access charge is higher for the interdependent model than for the independent model; if the demand for the VoIP is a substitution-based relationship, the optimal access charge is higher than the marginal cost. However, if the relationship is complementary, the access charge is lower than the marginal cost in the upstream market
{"title":"Policy Analysis and Studies on a Model for Determining an Optimal VoIP Access Charge","authors":"Sung Uk Park","doi":"10.1109/ICACT.2006.206404","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206404","url":null,"abstract":"The introduction of a VoIP is expected to increase consumer benefits, boost competition in the IT market. This research endeavors to study the optimal access charge for a VoIP, which is expected to be introduced to the Korean IT market. I find that the optimal access charge is higher for the interdependent model than for the independent model; if the demand for the VoIP is a substitution-based relationship, the optimal access charge is higher than the marginal cost. However, if the relationship is complementary, the access charge is lower than the marginal cost in the upstream market","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134484679","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206268
Suncheul Kim, Ho-yong Ryu, Jaehyung Park, Taell Kim
A VPN is a network composed of hosts and system in different locations. In the past, the most common way to connect these sites was to use an ATM or frame relay leased line, supplied by a service provider. These were traditionally straightforward to provide, as service provider networks were often implemented using a variety of protocols including ATM and frame relay. Recently, service providers have been looking at alternative technologies for creating VPN solutions. For supporting Layer 2 VPN service, MPLS protocol such as LDP, RSVP-TE should be implemented for supporting LSP and LDP proposed by Martini or BGP extended by Kompella. Also, MPLS protocol should be implemented for negotiating the specific virtual circuit. In this paper, we implement the Layer 2 VPN that is controlled by Martini protocol and static. And we evaluate the Layer 2 data traffic including both LSP protection and QoS features
{"title":"Design and implementation of Martini based Layer 2 VPN","authors":"Suncheul Kim, Ho-yong Ryu, Jaehyung Park, Taell Kim","doi":"10.1109/ICACT.2006.206268","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206268","url":null,"abstract":"A VPN is a network composed of hosts and system in different locations. In the past, the most common way to connect these sites was to use an ATM or frame relay leased line, supplied by a service provider. These were traditionally straightforward to provide, as service provider networks were often implemented using a variety of protocols including ATM and frame relay. Recently, service providers have been looking at alternative technologies for creating VPN solutions. For supporting Layer 2 VPN service, MPLS protocol such as LDP, RSVP-TE should be implemented for supporting LSP and LDP proposed by Martini or BGP extended by Kompella. Also, MPLS protocol should be implemented for negotiating the specific virtual circuit. In this paper, we implement the Layer 2 VPN that is controlled by Martini protocol and static. And we evaluate the Layer 2 data traffic including both LSP protection and QoS features","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134548164","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205934
Jong-ho Ryu, Kook-han Kim, D. Seo
In 1996, the concept of proxy signature was introduced by Mambo, Usuda and Okamoto in M. Mambo et al. (1996). A strong proxy signature scheme has been introduced in B. Lee et al. (2001), which we call LKK (B. Lee, H. Kim, K. Kim) scheme. In Z. Dong et al. (2003), the authors showed that the LKK scheme is vulnerable to their attack. In this paper, based on the vulnerability of the LKK scheme and blind Schnorr signature scheme, we propose a revised proxy signature and a proxy blind signature scheme. The basic idea is to propose the revised scheme resisting their attack and to make it difficult for the original signer to delete a delegation value
1996年，Mambo、Usuda和Okamoto在M. Mambo et al.(1996)中引入了代理签名的概念。B. Lee等人(2001)提出了一种强代理签名方案，我们称之为LKK (B. Lee, H. Kim, K. Kim)方案。在Z. Dong et al.(2003)中，作者证明了LKK方案容易受到他们的攻击。本文针对LKK方案和盲Schnorr签名方案的漏洞，提出了一种改进的代理签名方案和代理盲签名方案。其基本思想是提出修改后的方案，以抵抗他们的攻击，并使原始签名者难以删除委托值
{"title":"A revised LKK proxy blind signature scheme","authors":"Jong-ho Ryu, Kook-han Kim, D. Seo","doi":"10.1109/ICACT.2006.205934","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205934","url":null,"abstract":"In 1996, the concept of proxy signature was introduced by Mambo, Usuda and Okamoto in M. Mambo et al. (1996). A strong proxy signature scheme has been introduced in B. Lee et al. (2001), which we call LKK (B. Lee, H. Kim, K. Kim) scheme. In Z. Dong et al. (2003), the authors showed that the LKK scheme is vulnerable to their attack. In this paper, based on the vulnerability of the LKK scheme and blind Schnorr signature scheme, we propose a revised proxy signature and a proxy blind signature scheme. The basic idea is to propose the revised scheme resisting their attack and to make it difficult for the original signer to delete a delegation value","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129162983","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206335
Jin Lee, Sin-Chong Park
Since finding the nearest point in a lattice for multi-input multi-output (MIMO) channels is NP-hard, simplified algorithms such as a sphere decoder (SD) have been proposed. List sphere decoder (LSD), which is a modified version of SD, allows soft information to be extracted for channel decoding and iterative detection/decoding. In this paper, recently proposed efficient methods for reducing the computational complexity of a sphere decoder (SD) and a list sphere decoder (LSD) with depth-first tree searching are summarized. Numerous simulations have been carried out and comparison has been made based on of the average number of processing cycles
{"title":"Novel techniques of a list sphere decoder for high throughput","authors":"Jin Lee, Sin-Chong Park","doi":"10.1109/ICACT.2006.206335","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206335","url":null,"abstract":"Since finding the nearest point in a lattice for multi-input multi-output (MIMO) channels is NP-hard, simplified algorithms such as a sphere decoder (SD) have been proposed. List sphere decoder (LSD), which is a modified version of SD, allows soft information to be extracted for channel decoding and iterative detection/decoding. In this paper, recently proposed efficient methods for reducing the computational complexity of a sphere decoder (SD) and a list sphere decoder (LSD) with depth-first tree searching are summarized. Numerous simulations have been carried out and comparison has been made based on of the average number of processing cycles","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132498366","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206344
Xiaopeng Hu, Guiming He, Xiaoping Zhou
For the purpose of improving the coding efficiency, this paper attempts to combine psychoacoustic model for perceptual evaluation of audio quality in BS.1387 with perceptual audio coder. The principle of this new psychoacoustic model is analyzed in theory, and corresponding improvements are proposed to make it be effectively applied to actual audio coder. Both this new model and MPEG psychoacoustic model 2 are implemented in the latest AVS reference coder of China, and comparison of output masking parameter and subjective hearing test between the two models are conducted. Experimental results show that the proposed psychoacoustic model is feasible
{"title":"PEAQ-based psychoacoustic model for perceptual audio coder","authors":"Xiaopeng Hu, Guiming He, Xiaoping Zhou","doi":"10.1109/ICACT.2006.206344","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206344","url":null,"abstract":"For the purpose of improving the coding efficiency, this paper attempts to combine psychoacoustic model for perceptual evaluation of audio quality in BS.1387 with perceptual audio coder. The principle of this new psychoacoustic model is analyzed in theory, and corresponding improvements are proposed to make it be effectively applied to actual audio coder. Both this new model and MPEG psychoacoustic model 2 are implemented in the latest AVS reference coder of China, and comparison of output masking parameter and subjective hearing test between the two models are conducted. Experimental results show that the proposed psychoacoustic model is feasible","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132274643","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206096
Dahae Chong, Byeongyun Lee, Sanghun Kim, Seokho Yoon, Sun Yong Kim
In this paper, a new detector is proposed for code acquisition, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The mean acquisition performance of the proposed detector is compared with that of the detector of S. Yoon et al. (2004). The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of S. Yoon et al. (2004) using exact knowledge of the non-Gaussian noise dispersion
{"title":"PN code acquisition using signed-rank-based detector in non-Gaussian impulsive channels","authors":"Dahae Chong, Byeongyun Lee, Sanghun Kim, Seokho Yoon, Sun Yong Kim","doi":"10.1109/ICACT.2006.206096","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206096","url":null,"abstract":"In this paper, a new detector is proposed for code acquisition, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The mean acquisition performance of the proposed detector is compared with that of the detector of S. Yoon et al. (2004). The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of S. Yoon et al. (2004) using exact knowledge of the non-Gaussian noise dispersion","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132859973","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206361
O. Jung, Juyoung Park, Shingak Kang
ITU-T SG17 is standardizing overlay multicast protocol for n-plex group multicast. It contains multicast agent and session manager. In this paper, we provide design of session management for n-to-n multicast protocol and also describe the implementation of session management services according to ITU-T RMCP-3
{"title":"Design and implementation of session management for n-to-n multicast","authors":"O. Jung, Juyoung Park, Shingak Kang","doi":"10.1109/ICACT.2006.206361","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206361","url":null,"abstract":"ITU-T SG17 is standardizing overlay multicast protocol for n-plex group multicast. It contains multicast agent and session manager. In this paper, we provide design of session management for n-to-n multicast protocol and also describe the implementation of session management services according to ITU-T RMCP-3","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133047833","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206212
Il-Young Moon
With the growth of data communication service by mobile devices, WAP is a protocol proposed to efficiently access the Internet contents by user request through wireless condition that has a high error rate and mobility. In this paper, it has analyzed transmission time for wireless application protocol (WAP) in wireless CDMA network. In order for segmentation and reassembly (SAR) to improve the transfer capability, the transmission of messages have been simulated using a fragmentation that begins with the total package and incremental fragmentation for each layer using the wireless transaction protocol (WTP) to define the resultant packet size and the level of fragmentation for each proceeding layer. SAR decreases transmission time of radio link protocol (RLP) baseband packets by sending packets. From the results, it was able to obtain packet transmission time and optimal WTP packet size in wireless network
WAP是随着移动设备数据通信业务的发展，为了在无线条件下根据用户请求高效访问互联网内容而提出的一种协议，具有较高的错误率和移动性。本文分析了无线CDMA网络中无线应用协议(WAP)的传输时间。为了进行分段和重组(SAR)以提高传输能力，使用从总包开始的分段和每层的增量分段来模拟消息的传输，使用无线事务协议(WTP)来定义生成的数据包大小和每个处理层的分段级别。SAR通过发送报文来减少RLP (radio link protocol)基带报文的传输时间。结果表明，该算法能够得到无线网络中WTP包的传输时间和最佳包大小
{"title":"Performance Evaluation of WAP Packet Considering WTP SAR Algorithm and RLP in Wireless Network","authors":"Il-Young Moon","doi":"10.1109/ICACT.2006.206212","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206212","url":null,"abstract":"With the growth of data communication service by mobile devices, WAP is a protocol proposed to efficiently access the Internet contents by user request through wireless condition that has a high error rate and mobility. In this paper, it has analyzed transmission time for wireless application protocol (WAP) in wireless CDMA network. In order for segmentation and reassembly (SAR) to improve the transfer capability, the transmission of messages have been simulated using a fragmentation that begins with the total package and incremental fragmentation for each layer using the wireless transaction protocol (WTP) to define the resultant packet size and the level of fragmentation for each proceeding layer. SAR decreases transmission time of radio link protocol (RLP) baseband packets by sending packets. From the results, it was able to obtain packet transmission time and optimal WTP packet size in wireless network","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122729529","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206436
T. Hiruntaraporn, N. Nupairoj
Conventional grid cache follows Web-based caching concept, which stores the whole object as one piece in the cache storage. Although this object-based approach can be very effective for Web-based files, which are typically small, grid data files are usually large. Thus, conventional grid cache performs rather poor and becomes less-effective as the cache storage is not well-managed. This paper presents a new block-based grid caching model which divide caching space into fixed-size cache blocks for storing data. We evaluate the performance of our block-based approach and the impact of different block sizes using real-world data on our ns-based simulator. The results strongly indicate that our block-based grid caching perform reasonably well comparing to the conventional file-based grid caching
{"title":"Block-based grid caching for grid datafarm","authors":"T. Hiruntaraporn, N. Nupairoj","doi":"10.1109/ICACT.2006.206436","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206436","url":null,"abstract":"Conventional grid cache follows Web-based caching concept, which stores the whole object as one piece in the cache storage. Although this object-based approach can be very effective for Web-based files, which are typically small, grid data files are usually large. Thus, conventional grid cache performs rather poor and becomes less-effective as the cache storage is not well-managed. This paper presents a new block-based grid caching model which divide caching space into fixed-size cache blocks for storing data. We evaluate the performance of our block-based approach and the impact of different block sizes using real-world data on our ns-based simulator. The results strongly indicate that our block-based grid caching perform reasonably well comparing to the conventional file-based grid caching","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117230622","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
扫码关注我们
求助内容：
应助结果提醒方式：