A forward-secure threshold proxy re-signature scheme in the standard model is firstly proposed in this paper. The scheme has the property that it is infeasible to forge valid proxy re-signatures relating to the past even if more than or equal to the threshold proxies are corrupted. Re-signature keys are updated at regular periods of time. It implies that past proxy re-signatures remain secure if the current re-signature key is leaked. The scheme is provably robust, forward-secure and unforgettable without relying on the random oracle model. The scheme has many attractive applications, such as the construction of the interoperable system of digital rights management (DRM).
{"title":"A new forward-secure threshold proxy re-signature scheme","authors":"Xiaodong Yang, Caifen Wang, Yulei Zhang, Weiyi Wei","doi":"10.1109/ICNIDC.2009.5360842","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360842","url":null,"abstract":"A forward-secure threshold proxy re-signature scheme in the standard model is firstly proposed in this paper. The scheme has the property that it is infeasible to forge valid proxy re-signatures relating to the past even if more than or equal to the threshold proxies are corrupted. Re-signature keys are updated at regular periods of time. It implies that past proxy re-signatures remain secure if the current re-signature key is leaked. The scheme is provably robust, forward-secure and unforgettable without relying on the random oracle model. The scheme has many attractive applications, such as the construction of the interoperable system of digital rights management (DRM).","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753611","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360890
Dong Wei, Caili Guo, Fangfang Liu, Zhimin Zeng
A scheme based on optimal polarization receiving (OPR) is proposed for the cognitive radios to improve the signal to interference and noise ratio (SINR) of the cognitive user. This OPR-Based scheme will not produce extra interference to the licensed user. The simulation results show that without increasing the transmitting power of the cognitive user, the cognitive receiver with OPR-Based scheme can improve the SINR by over 30dB at most compared with the traditional cognitive receiver.
{"title":"A SINR improving scheme based on optimal polarization receiving for the cognitive radios","authors":"Dong Wei, Caili Guo, Fangfang Liu, Zhimin Zeng","doi":"10.1109/ICNIDC.2009.5360890","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360890","url":null,"abstract":"A scheme based on optimal polarization receiving (OPR) is proposed for the cognitive radios to improve the signal to interference and noise ratio (SINR) of the cognitive user. This OPR-Based scheme will not produce extra interference to the licensed user. The simulation results show that without increasing the transmitting power of the cognitive user, the cognitive receiver with OPR-Based scheme can improve the SINR by over 30dB at most compared with the traditional cognitive receiver.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114978131","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360896
S. Prabhavat, Hiroki Nishiyama, N. Ansari, N. Kato
Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. To be able to simultaneously and efficiently use such parallel paths, it is essential to facilitate high quality network services at high speeds. So, traffic splitting, having a significant impact on quality of services (QoS), is an important means to achieve load balancing. In general, most existing models can be classified into flow-based or packet-based models. Unfortunately, both classes exhibit some drawbacks, such as low efficiency under the high variance of flow size in flow-based models and the phenomenon of packet reordering in packet-based models. In contrast, Table-based Hashing with Reassignment (THR) and Flowlet Aware Routing Engine (FLARE), both belonging to the class of flow-based models, attempt to achieve both efficient bandwidth utilization and packet order preservation. An original flow can be split into several paths. As compared to the traditional flow-based models, load balancing deviation from ideal distribution decreases while the risk of packet reordering increases. In this paper, we introduce analytical models of THR and FLARE, and derive the probabilities of traffic splitting and packet reordering for each model. Our analysis shows that FLARE is superior to THR in packet order preservation. Also, the performance of FLARE on bursty traffic is demonstrated and discussed.
{"title":"On the performance analysis of traffic splitting on load imbalancing and packet reordering of bursty traffic","authors":"S. Prabhavat, Hiroki Nishiyama, N. Ansari, N. Kato","doi":"10.1109/ICNIDC.2009.5360896","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360896","url":null,"abstract":"Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. To be able to simultaneously and efficiently use such parallel paths, it is essential to facilitate high quality network services at high speeds. So, traffic splitting, having a significant impact on quality of services (QoS), is an important means to achieve load balancing. In general, most existing models can be classified into flow-based or packet-based models. Unfortunately, both classes exhibit some drawbacks, such as low efficiency under the high variance of flow size in flow-based models and the phenomenon of packet reordering in packet-based models. In contrast, Table-based Hashing with Reassignment (THR) and Flowlet Aware Routing Engine (FLARE), both belonging to the class of flow-based models, attempt to achieve both efficient bandwidth utilization and packet order preservation. An original flow can be split into several paths. As compared to the traditional flow-based models, load balancing deviation from ideal distribution decreases while the risk of packet reordering increases. In this paper, we introduce analytical models of THR and FLARE, and derive the probabilities of traffic splitting and packet reordering for each model. Our analysis shows that FLARE is superior to THR in packet order preservation. Also, the performance of FLARE on bursty traffic is demonstrated and discussed.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117027400","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360928
Yuncai Wang
There are many latent dangers in Digital Library (DL) Information System. To protect the information resources and the continuity of information service effectively, it is necessary to construct Digital Library Remote Disaster Recovery System (RDRS). Firstly, this paper discusses the role of disaster recovery in digital library information security system, the classification & technique parameters of disaster recovery system, and its domestic application status quo. Secondly, this paper focuses on the design principles of RDRS, network structure, and the realization of RDRS functions as well. Meanwhile, it sketches the network structure and platform of RDRS. Finally, this article expounds the management and maintenance for the RDRS.
{"title":"Research on remote disaster Recovery System of Digital Library","authors":"Yuncai Wang","doi":"10.1109/ICNIDC.2009.5360928","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360928","url":null,"abstract":"There are many latent dangers in Digital Library (DL) Information System. To protect the information resources and the continuity of information service effectively, it is necessary to construct Digital Library Remote Disaster Recovery System (RDRS). Firstly, this paper discusses the role of disaster recovery in digital library information security system, the classification & technique parameters of disaster recovery system, and its domestic application status quo. Secondly, this paper focuses on the design principles of RDRS, network structure, and the realization of RDRS functions as well. Meanwhile, it sketches the network structure and platform of RDRS. Finally, this article expounds the management and maintenance for the RDRS.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116716971","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360794
Yan Bai, Ke Ma, Guangsi Ma
Based on Grey theory, a combined wavelet-GM (1,1) forecasting model is proposed. The random properties of some non-stationary time series can be reduced by wavelet decomposition into many series according to different scales. Decomposed time series are predicted with GM (1,1) model to obtain forecasted results of the original time series. Experiments on network traffic show that the combined model is more effective than the common grey model. The application of the proposed combined model to network traffic forecasting may offer scientific rationale to Internet routing decision, LAN virus detection and illegal invasion prevention.
{"title":"An analysis of the combined wavelet-GM (1,1) model for network traffic forecasting","authors":"Yan Bai, Ke Ma, Guangsi Ma","doi":"10.1109/ICNIDC.2009.5360794","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360794","url":null,"abstract":"Based on Grey theory, a combined wavelet-GM (1,1) forecasting model is proposed. The random properties of some non-stationary time series can be reduced by wavelet decomposition into many series according to different scales. Decomposed time series are predicted with GM (1,1) model to obtain forecasted results of the original time series. Experiments on network traffic show that the combined model is more effective than the common grey model. The application of the proposed combined model to network traffic forecasting may offer scientific rationale to Internet routing decision, LAN virus detection and illegal invasion prevention.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592906","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360864
Shilin Zhang, Shuwu Zhang, Heping Li
Web mining has become an important field of research. However, there is an important challenge to applying the technique to NLP applications. An integrated data mining system for NLP in Chinese Commercial Web Sites is presented in this paper. It presented the data mining process in detail. More importantly, it puts forward a new enhanced method to Acquire User Preferences. Web mining applied to NLP provides a scientific basis for ebusiness and decision-making.
{"title":"Applying data miming and NLP techniques to automatically acquire user preferences in Chinese web sites","authors":"Shilin Zhang, Shuwu Zhang, Heping Li","doi":"10.1109/ICNIDC.2009.5360864","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360864","url":null,"abstract":"Web mining has become an important field of research. However, there is an important challenge to applying the technique to NLP applications. An integrated data mining system for NLP in Chinese Commercial Web Sites is presented in this paper. It presented the data mining process in detail. More importantly, it puts forward a new enhanced method to Acquire User Preferences. Web mining applied to NLP provides a scientific basis for ebusiness and decision-making.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123627727","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360880
Yinghua Zhou, Xuemei Cai
The huge volume of history sensing data of a wireless sensor network need to be processed and discriminated to help the users of the data to analyze and judge the different situations of the monitored object and environment. A novel approach is proposed to first divide the history sensing data into partitions so that the data, measured when the monitored object or environment is normal, are roughly distinguishable from those measured when the object or environment is abnormal. Then the method uses a new centroid-based clustering algorithm to group the data in the partitions into different clusters. Finally the clusters of data are labeled “normal” or “abnormal” by applying the suggested heuristics.
{"title":"Discrimination of sensing data in normal and abnormal situations of the monitored object or environment","authors":"Yinghua Zhou, Xuemei Cai","doi":"10.1109/ICNIDC.2009.5360880","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360880","url":null,"abstract":"The huge volume of history sensing data of a wireless sensor network need to be processed and discriminated to help the users of the data to analyze and judge the different situations of the monitored object and environment. A novel approach is proposed to first divide the history sensing data into partitions so that the data, measured when the monitored object or environment is normal, are roughly distinguishable from those measured when the object or environment is abnormal. Then the method uses a new centroid-based clustering algorithm to group the data in the partitions into different clusters. Finally the clusters of data are labeled “normal” or “abnormal” by applying the suggested heuristics.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125107357","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360791
Q. Meng, Bojin Zhuang, Fei Su
In this paper, a new joint Rate-distortion Optimization model based on texture and mean-error factors (TMJRDM) is proposed. Texture factor implies the subjective factor, giving the texture similarity measure between the original image and the target image. At the same time, mean-error factor gives the objective measure. The joint weighted value of texture and mean-error factors is calculated as the distortion metric, which balances the subjective and objective quality. Experimental results show that our proposed algorithm improves the subjective quality of the reconstructed images without obvious degradation of the objective quality.
{"title":"A new joint Rate-distortion Optimization model based on texture and mean-error factors","authors":"Q. Meng, Bojin Zhuang, Fei Su","doi":"10.1109/ICNIDC.2009.5360791","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360791","url":null,"abstract":"In this paper, a new joint Rate-distortion Optimization model based on texture and mean-error factors (TMJRDM) is proposed. Texture factor implies the subjective factor, giving the texture similarity measure between the original image and the target image. At the same time, mean-error factor gives the objective measure. The joint weighted value of texture and mean-error factors is calculated as the distortion metric, which balances the subjective and objective quality. Experimental results show that our proposed algorithm improves the subjective quality of the reconstructed images without obvious degradation of the objective quality.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128919885","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360784
Huanlin Liu, Junyu Pang,
An optical buffering architecture based-on traffic load selection was put forward for optical packet switching networks in the paper. For improving the limited fiber delay lines utilization, the segment shared buffering mechanism be used to configure the output fiber delay lines and the output/feedback shared buffer module configuration using degenerate model. When the traffic load is larger than threshold value, the output/feedback buffer module is worked on the feedback buffer mode. Otherwise, the output/feedback module is worked on the output buffer mode. So, the buffer mode can be selected flexible according to the traffic load. The analysis and simulation results show that this buffer architecture can decrease packet loss probability effectively and achieve reasonable average packet delay.
{"title":"A buffering architecture based-on traffic load selection scheduling for optical packet switching networks","authors":"Huanlin Liu, Junyu Pang,","doi":"10.1109/ICNIDC.2009.5360784","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360784","url":null,"abstract":"An optical buffering architecture based-on traffic load selection was put forward for optical packet switching networks in the paper. For improving the limited fiber delay lines utilization, the segment shared buffering mechanism be used to configure the output fiber delay lines and the output/feedback shared buffer module configuration using degenerate model. When the traffic load is larger than threshold value, the output/feedback buffer module is worked on the feedback buffer mode. Otherwise, the output/feedback module is worked on the output buffer mode. So, the buffer mode can be selected flexible according to the traffic load. The analysis and simulation results show that this buffer architecture can decrease packet loss probability effectively and achieve reasonable average packet delay.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129428320","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360913
Eunjo Lee, Beomgu Kang, Sungkwon Park, Hosook Lee
Mobile access networks are being developed to support various multimedia services such as IPTV (Internet Protocol Television), VoD (Video on Demand), and high speed internet services. Especially, these networks are a point-to-multipoint method in which one MAG (Mobile Access Gateway) and many MNs (Mobile Node) are connected. In other words, if a mobile multimedia viewer is joining a specific multicast group over mobile access networks, the others receive the multimedia program at the same time although they do not belong to the same multicast group. However, the traditional IGMP versions do not allow immediate multimedia program sharing as explained about. Also, in traditional IGMP versions, a viewer always needs to send IGMP join report. This paper proposes IGMP extensions which improves group join and leave process in mobile access networks for multimedia services.
{"title":"IGMP extentions for mobile multimedia services","authors":"Eunjo Lee, Beomgu Kang, Sungkwon Park, Hosook Lee","doi":"10.1109/ICNIDC.2009.5360913","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360913","url":null,"abstract":"Mobile access networks are being developed to support various multimedia services such as IPTV (Internet Protocol Television), VoD (Video on Demand), and high speed internet services. Especially, these networks are a point-to-multipoint method in which one MAG (Mobile Access Gateway) and many MNs (Mobile Node) are connected. In other words, if a mobile multimedia viewer is joining a specific multicast group over mobile access networks, the others receive the multimedia program at the same time although they do not belong to the same multicast group. However, the traditional IGMP versions do not allow immediate multimedia program sharing as explained about. Also, in traditional IGMP versions, a viewer always needs to send IGMP join report. This paper proposes IGMP extensions which improves group join and leave process in mobile access networks for multimedia services.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129901960","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
扫码关注我们
求助内容：
应助结果提醒方式：