Please wait a minute...

Current Issue

    15 January 2012, Volume 28 Issue 1
    Topic: the ultra broadband network technology
    Architecture Design and Analysis of Key Technologies of the Ultra-Broadband IP MAN
    Kang Cai,Hong Tang,Yongqing Zhu
    2012, 28(1):  5-9.  doi:10.3969/j.issn.1000-0801.2012.01.001
    Asbtract ( 280 )   HTML ( 10)   PDF (2240KB) ( 1195 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In this paper,the ultra-broadband service requirements are analyzed. Based on the IP-optical convergence,an open,safe and high-effective architecture for the ultra-broadband IP MAN is presented. At last,some key technologies related with the ultra-broadband IP MAN are discussed.

    IP Network and Optical Network Convergence for Ultra Broadband Network Development
    Wei Peng,Hong Tang,Dongcai Tan
    2012, 28(1):  11-15.  doi:10.3969/j.issn.1000-0801.2012.01.002
    Asbtract ( 551 )   HTML ( 2)   PDF (1133KB) ( 916 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    This paper analyzes IP network and optical transport network integration technology,describes the realization of“IP+ light”strategy in different levels of network,and analyzes the key technology development in these years,then provides some reference for future ultra broadband network development.

    Research on Video Packet Loss Remediation in Ultra-Broadband IP Network Environment
    Ke Ruan,Jie Zou,Yongqing Zhu
    2012, 28(1):  16-20.  doi:10.3969/j.issn.1000-0801.2012.01.003
    Asbtract ( 177 )   HTML ( 1)   PDF (1416KB) ( 468 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    More and more video services and programs will be carried by ultra-broadband IP networks.Compared with traditional operator's coaxial networks,IP networks are more complex,packet loss is more likely to happen,and the userˊs experience will suffer a lot.Current video coding redundancy technologies are only feasible in coaxial network,it is necessary to research on the video packet loss restoration technologies in IP networks.This paper analyzes the impact of packet loss on video quality,compares the mainstream remediation technology,analyzes the test results.

    Study on Integrated Self-Assignment Technologies in Ultra-Broadband Network
    Liang Ou,Ke Ruan,Yongqing Zhu,Jie Zou
    2012, 28(1):  21-25.  doi:10.3969/j.issn.1000-0801.2012.01.004
    Asbtract ( 166 )   HTML ( 1)   PDF (1337KB) ( 353 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Simplifying operation complexity and improving quality of experience in hybrid network environment for customers is becoming a popular technology in the next generation ultra-broadband network design. Aiming at enhancing operation experience for end-users,this paper defines the architecture and content of self-assignment service in fixed-mobile convergence network environment. Related key technologies to deploy self-assignment service are elaborated through typical case studying in 3G/Wi-Fi scenario. At last,we propose a series developing strategies in the construction of network for network operators.

    Simulation Research of Coexistence and Interference Between MB-OFDM-UWB and WiMAX System
    Yingdan Li,Tuo Zheng,Xianwei Zhou,Xinping Qian
    2012, 28(1):  30-34.  doi:10.3969/j.issn.1000-0801.2012.01.006
    Asbtract ( 216 )   HTML ( 3)   PDF (2038KB) ( 463 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In this paper,we study the interference and coexistence problems between the MB-OFDM-UWB system and the WiMAX system.The models of simulation are built in the ADS to simulate the characteristics of the frequency interference between the two systems.At the same time,in both with or without using DAA technology in the UWB system cases,we simulate the frame error rate of each system,and simulation results show that the co-channel interference exists between MB-OFDM-UWB system and WiMAX system,the usage of DAA technology can effectively restrain or reduce the impact of co-channel interference between systems,and achieve coexistence of systems.

    Cloud computing column
    Adaptive Resource Provisioning for Cloud Computing
    Gansen Zhao,Hai Yu,Tongkai Ji,Hong Song
    2012, 28(1):  35-41.  doi:10.3969/j.issn.1000-0801.2012.01.007
    Asbtract ( 246 )   HTML ( 7)   PDF (1529KB) ( 427 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An infrastructure cloud manages the infrastructure as a resource pool,enabling on-demand and dynamic resources provisioning according to resource consumption and service loads.This paper investigates the issue of adaptive resource provisioning for services in clouds.A model is proposed to predict cloud services'peak load and calculate the expected resources consumption.Resource of the best utility for the service is identified and allocated to the service.Simulation results suggest that the proposed adaptive resources provisioning model has a fair accuracy and stable performance.

    A Tree Cloud Database for SaaS Cloud Service
    Yimei Kang,Jiang Hu,Guan Wang
    2012, 28(1):  41-45.  doi:10.3969/j.issn.1000-0801.2012.01.008
    Asbtract ( 171 )   HTML ( 2)   PDF (1258KB) ( 169 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    SaaS provides complete software application services to different users in the endpoint of cloud.In SaaS application,cloud database should not only provide the storage and retrieval of massive data,but also be able to customize data structure easily for different users.A tree cloud database is proposed in this paper.This database organizes and searches data by a strucure of tree.The type of node in the tree includes number,characters,text,two-dimensional tables,file and so on.The time complexity of search at the worst case is O[log2N].The existed data in table and file could be reorganized easily to the tree structure in order to meet the storage and retrieval requirements of SaaS.

    Mechanism Design for Optimizing Response Time of SLA in Cloud Computing
    Cuie Wang,Yonggen Gu,Xiaohong Wu,Jie Tao
    2012, 28(1):  46-50.  doi:10.3969/j.issn.1000-0801.2012.01.009
    Asbtract ( 230 )   HTML ( 1)   PDF (621KB) ( 195 )   Knowledge map   
    References | Related Articles | Metrics

    Considering response time,one of the important indicators for measuring QoS of cloud computing services in SLA,in this paper,we propose a dominant strategy incentive compatibility mechanism.Assuming all the cloud resource providers being rational,the proposed mechanism in this paper ensures each cloud resource provider is willing to bid true resource cost information,and taking this as the prerequisite the cloud service provider can derive a way aiming to the shortest response time under the cloud user's budget constraint and also choose optimal composition of resource providers for user's job.Finally,we prove pivotal properties of mechanism proposed in the paper and present the optimization algorithm of response time.

    A Distributed Locking Mechanism for XML Database in DaaS Environment
    Jinguang Gu,Pan Luo,Zhi Zhang
    2012, 28(1):  51-56.  doi:10.3969/j.issn.1000-0801.2012.01.010
    Asbtract ( 221 )   HTML ( 3)   PDF (1199KB) ( 479 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Locking mechanism plays a key role in transaction processing of DaaS based on XML databases.Traditional research on locking mechanism has many limitations,such as poor concurrency ability,and do not support main query language such as XQuery.This paper proposes a multi-granular locking mechanism,it creates semantic locks on the nodes of dynamic pattern tree view for every database node,and manages the transaction coordination of different databases with the global pattern tree view of the main database node.A discussion about the differences between the locking mechanisms of this paper and current are proposed in the last of the paper.

    Construction of Data Mining Application Platform Based on the Service Models of Cloud Computing
    Zhangshu Huang,Qingqing Liu
    2012, 28(1):  57-61.  doi:10.3969/j.issn.1000-0801.2012.01.011
    Asbtract ( 168 )   HTML ( 5)   PDF (1245KB) ( 579 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    This paper combines data mining with cloud computing and uses the services model of cloud computing to design the data mining application platform.Firstly,we put forward a cloud computing service hierarchy that contains three levels and four modes.And then,this hierarchy is used in designing the data mining application platform.Finally,we propose a framework of data mining application platform based on the service models of cloud computing,and elaborates the functions of each subsystem and features of this platform.The platform integrates a variety of algorithms about data mining,and it possesses a good generality and expansibility.

    Charging Model Research of Application Layer in Cloud Computing Based on Cost-Profit Petri Net
    Lirui Bai,Tong Li,Zhongwen Xie,Chen Song
    2012, 28(1):  62-66.  doi:10.3969/j.issn.1000-0801.2012.01.012
    Asbtract ( 160 )   HTML ( 1)   PDF (961KB) ( 305 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    How to charge for cloud computing is an important problem to be solved urgently at present.In order to represent and research the charge model of application layer in cloud computing clearly,the Petri net which introduces the cost and the profit to the transition is proposed.A concept and some theorems of cost-profit Petri net is put forward and used to describe the charge model of the application layer in cloud computing.Thus to the choice to the charge model of the provider of cloud computing,the reference model of analysis has built up.In addition,a specific example is given.

    research and development
    FCM-Based Cell First Peer Selection Algorithm for P2P Systems over 3G Network
    Yan Zhang,Xu Zhou,Shuhao Liu,Hui Tang
    2012, 28(1):  67-73.  doi:10.3969/j.issn.1000-0801.2012.01.013
    Asbtract ( 204 )   HTML ( 2)   PDF (1971KB) ( 224 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The characteristics of mobile environments and the architecture of 3G cellular network have brought challenges for peer selection in P2P systems over 3G cellular network.This paper studies the problem of peer selection in P2P systems over 3G cellular network,and proposes a novel peer selection algorithm named CF-FCM (cell first,FCM based).Simulation results indicate that the CF-FCM algorithm can achieve excellent load balance on the cells in 3G cellular network while assuring good peer performance.

    The Cluster Algorithm Research Based on Dynamic Variable Threshold and Density
    Peishuai Chen,Chunhua Ju
    2012, 28(1):  79-85.  doi:10.3969/j.issn.1000-0801.2012.01.015
    Asbtract ( 173 )   HTML ( 3)   PDF (1814KB) ( 312 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    BIRCH and DBSCAN are popular data cluster algorithms.However,they insist some insufficiency.This paper introduces a new algorithm DVTD (the cluster algorithm based on dynamic variable threshold and density)to solve these problems.In the experiment,it is shown that DVTD is better than BIRCH and it can get almost same result to arbitrary shapes data cluster as DBSCAN.

    Research on Exact Simulation Modeling Approach for Physical Layer of Ultra-Short Communication System
    Jiashuai Zhang,Zhigang Luo,Xiang Zhang,Jianfei Liu
    2012, 28(1):  86-90.  doi:10.3969/j.issn.1000-0801.2012.01.016
    Asbtract ( 171 )   HTML ( 1)   PDF (1457KB) ( 862 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the design of simulation model for communication system,the empirical formulation is usually introduced to build up the physical layer model.However,generally such empirical formulation method suffers from two drawbacks: it fails to represent the practical scene configuration,and it cannot guarantee the modeling accuracy.In the aim of improving the effectiveness of the simulation model,the modeling accuracy of the physical layer should be further enhanced.In this paper,we build a new simulation model for the ultra-short communication system and implement a simulation system by using OMNET++based on its Simulink channel model and WI model.Experimental results confirm the accuracy of the built model compared with the empirical formulation modeling method for the physical layer.Finally,we analyze the factors affecting the performance result.

    Study of Over-Sampling Method Based on Feature Selection
    Huijuan Lu,Jinwei Zhang,Jinwei Zhang,Jinwei Zhang,Xiaoping Ma,Xiaobing Yang
    2012, 28(1):  91-95.  doi:10.3969/j.issn.1000-0801.2012.01.017
    Asbtract ( 174 )   HTML ( 2)   PDF (609KB) ( 214 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To significantly improve the classification performance of the minority class,we present an over-sampling method based on feature selection.Firstly,feature selection is performed on the training data set in order to select a set of key columns.Then minority class samples are produced using selected key columns,and each sample consists of two kinds of features.One type of features is characteristic value that is corresponding to the selected key columns,the others is generated according to the principle of SMOTE.Comparing to SMOTE algorithm,results show that the new method performs better than SMOTE,and it can effectively reduce the imbalance of data and improve the classification accuracy of the minority class.

    Research on Schedulability Analysis for Hard Real-Time Systems in Internet of Things
    Zhigang Gao,Huijuan Lu
    2012, 28(1):  96-101.  doi:10.3969/j.issn.1000-0801.2012.01.018
    Asbtract ( 184 )   HTML ( 1)   PDF (1228KB) ( 281 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    This paper builds a new task model for hard real-time Internet of Things systems with feedback tasks and non-feedback tasks and presents a new response time analysis method.This task model describes the characteristics of tasks in detail,such as their structures,interaction modes and running manner.The new schedulability analysis method can verify whether real-time requirements are met.Experimental results show the tasks in HCTS have lower average worst-case response time.However,it has some negative influence on the schedulability of tasks in the case of more feedback loops,which provides support for the optimization of HCTS.

    A Lossless Data Hiding Based on Dynamic Reference Pixel of Image Block
    Xianting Zeng,Zhuo Li,Lingdi Ping
    2012, 28(1):  106-112.  doi:10.3969/j.issn.1000-0801.2012.01.020
    Asbtract ( 173 )   HTML ( 4)   PDF (2198KB) ( 391 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    This paper presents a reversible data hiding scheme based on dynamic reference pixel and multi-layer embedding.The proposed algorithm can offer very high embedding capacity and low image degradation,and the exact original cover image can be fully restored after the hidden data extracted without any error.Especially,different from previous works based on histogram shifting,the proposed scheme can recover the original cover image after data extraction with no extra information except the message length and the stego-image itself.Experiments have been conducted to show the effectiveness of the proposed method.

    Association Rules Mining Algorithm Based on Fuzzy Relation of Linguistic Value
    Meiyu Fang,Xiaolin Zheng,Deren Chen
    2012, 28(1):  117-121.  doi:10.3969/j.issn.1000-0801.2012.01.022
    Asbtract ( 239 )   HTML ( 1)   PDF (752KB) ( 556 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the difficult determining of the membership function and the hard border of interval division when the fuzzy association rules are mining,association rules mining algorithm based on fuzzy relation is proposed.After the relation grade numbers and the similarity of neighbor grades are determined,the linguistic expressions (the properties of transactions)are mapped to each grade of the label set and then get the grade ratings as the weights.Based on these weights,the fuzzy relation support and confidence are defined.The detailed steps of the algorithm are elaborated in this paper.At the end of this article the application of this proposed algorithm about mining association rules in service trust area is described.

    Application of SMS4 Data Encryption Algorithm in 3G
    Cailiang Shen,Jiyi Wu,Yingsong Wang,Jianlin Tao
    2012, 28(1):  126-130.  doi:10.3969/j.issn.1000-0801.2012.01.024
    Asbtract ( 204 )   HTML ( 1)   PDF (1823KB) ( 504 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Since the state council issued the Regulations on the Commercial Passwords in 1990,the KASUMI algorithm is forbidden to use commercially in China,so the China mobile phone is limited in other country.The paper discusses the possibility of using commercial code algorithm SMS4 as f8 core algorithm according to the solutions of special algorithm used in China and international standard algorithm.We also analyses the security performance and the realization efficiency of SMS4 as the f8 core algorithm by experiment.

    Overview
    A Comparative Analysis on the Billing Model of Public Cloud Service
    Jun Wu,Ming Xu
    2012, 28(1):  131-136.  doi:10.3969/j.issn.1000-0801.2012.01.025
    Asbtract ( 395 )   HTML ( 15)   PDF (685KB) ( 2773 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the development of the public cloud service,the billing model has been the hot point for the commercialization of the public cloud service.This article compares the similarities and differences of the billing patterns within public cloud service provided by Amazon Web Service,Windows Azure and CloudEx,analyzes the typical billing model of the IaaS service and recognizes the insufficient.

    Study on SaaS Cloud Service Development for Telecom Operators
    Wei Li,Yunyong Zhang,Zhibin Guo,Lu Liu
    2012, 28(1):  136-140.  doi:10.3969/j.issn.1000-0801.2012.01.026
    Asbtract ( 172 )   HTML ( 5)   PDF (1229KB) ( 903 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Firstly the characters of SaaS service are studied,then the advantages and disadvantages of SaaS service development for telecom operators are analyzed. After that,some SaaS business services of international influential telecom operators are studied. Finally,some SaaS service development suggestions for telecom operators are proposed and analyzed in detail.

    Operational support technology innovation forum
    Study on the Bottom-Up&Top-Down Based Architecture of Network Resource Planning System
    Ruihao Weng
    2012, 28(1):  144-150.  doi:10.3969/j.issn.1000-0801.2012.01.028
    Asbtract ( 240 )   HTML ( 2)   PDF (2726KB) ( 274 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to decrease the CAPEX and OPEX,telecom operators need to operate the network scale in a just-in-time way and make sure service fullfillment in a service ready status.This article discusses a BU&TD based on architecture for network resource planning system.It can predict whether the network resource using ratio in the future is too high,too low or the resource capacity is insufficient,which can help telecom operators to accurately expand their networks,thereby improving the ROI of the investment on network construction.Also it can help to automatically implement the transfer from business and market planning to network resource construction planning,which will be conductive to implement the automatically network planning,thereby to improve the accuracy and efficiency of the network resource planning.

    Design and Implementation of IRMS for Data Sharing and Dispatching
    Yonghua Zhang,Yi Yang
    2012, 28(1):  151-159.  doi:10.3969/j.issn.1000-0801.2012.01.029
    Asbtract ( 181 )   HTML ( 2)   PDF (3810KB) ( 617 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Through establishing the inter-professional and customer-oriented resource model,the sharing core resources database has been formed.This paper presents a exchanging information and data interface standard specification based on comprehensive resource data,the use of the unified management of resources data,business data,data exchanging platform help achieve full professional services for network resources and information resource sharing between heterogeneous systems.

    research and development
    Research on the Method of Available Bandwidth Estimates for Wireless Mesh Network
    Taoshen Li,Yang Chen,Zhihui Ge
    2012, 28(1):  1-78.  doi:10.3969/j.issn.1000-0801.2012.01.014
    Asbtract ( 2448 )   HTML ( 30)   PDF (1075KB) ( 955 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of inaccuracy in the existing methods of available band width,amethod of passive estimates of available bandwidth for wireless mesh network is proposed.In this method,we figure out the quantitativ erelation between signal channel capacity and sending/receiving power by analyzing the features of wireless mesh network.And then,the more accurate available bandwidth can be estimated based on the relation.The simulation results show that our estimated available bandwidth is better than APEAB algorithm.

    IP Network and Optical Network Convergence for Ultra Broadband Network Development
    Peng Wei,Tang Hong and Tan Dongcai
    2012, 28(1):  7-11. 
    Asbtract ( 2119 )   Knowledge map   
    Related Articles | Metrics
    This paper analyzes IP network and optical transport network integration technology,describes the realization of "IP + light" strategy in different levels of network,and analyzes the key technology development in these years,then provides some reference for future ultra broadband network development.
    Research on Video Packet Loss Remediation in Ultra-Broadband IP Network Environment
    Ruan Ke,Zou Jie and Zhu Yongqing
    2012, 28(1):  12-16. 
    Asbtract ( 2118 )   Knowledge map   
    Related Articles | Metrics
    More and more video services and programs will be carried by ultra-broadband IP networks.Compared with traditional operator’s coaxial networks,IP networks are more complex,packet loss is more likely to happen,and the user’s experience will suffer a lot.Current video coding redundancy technologies are only feasible in coaxial network,it is necessary to research on the video packet loss restoration technologies in IP networks.This paper analyzes the impact of packet loss on video quality,compares the mainstream remediation technology,analyzes the test results.
    Study on Integrated Self-Assignment Technologies in Ultra-Broadband Network
    Ou Liang,Ruan Ke,Zhu Yongqing and Zou Jie
    2012, 28(1):  17-21. 
    Asbtract ( 1469 )   Knowledge map   
    Related Articles | Metrics
    Simplifying operation complexity and improving quality of experience in hybrid network environment for customers is becoming a popular technology in the next generation ultra-broadband network design.Aiming at enhancing operation experience for end-users,this paper defines the architecture and content of self-assignment service in fixed-mobile convergence network environment.Related key technologies to deploy self-assignment service are elaborated through typical case studying in 3G/Wi-Fi scenario.At last,we propose a series developing strategies in the construction of network for network operators.
    Technology Analysis of Abnormal Traffic Detection and Defense in Ultra-Broadband Network
    Liu Guorong,Liu Dongxin,Shen Jun and Jin Huamin
    2012, 28(1):  22-25. 
    Asbtract ( 1674 )   Knowledge map   
    Related Articles | Metrics
    With the continuous improvement of network access bandwidth,the threat of abnormal traffic to network becomes more serious,thus the defense requirement becomes more urgent.This paper describes the technology status of defending abnormal traffic.To the shortage of present technologies and applications,a defense solution based on cloud computing is proposed,with the characteristics of centralized scheduling in whole network,parallel processing,and cleaning close to the attackers.In the end the advantage of the solution is discussed.
    Topic: the ultra broadband network technology
    Technology Analysis of Abnormal Traffic Detection and Defense in Ultra-Broadband Network
    2012, 28(1):  26-29.  doi:10.3969/j.issn.1000-0801.2012.01.005
    Asbtract ( 2022 )   HTML ( 25)   PDF (1009KB) ( 1786 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the continuous improvement of network access bandwidth,the threat of abnormal traffic to network becomes more serious,thus the defense requirement becomes more urgent. This paper describes the technology status of defending abnormal traffic. To the shortage of present technologies and applications,a defense solution based on cloud computing is proposed,with the characteristics of centralized scheduling in whole network,parallel processing,and cleaning close to the attackers. In the end the advantage of the solution is discussed.

    Adaptive Resource Provisioning for Cloud Computing
    Zhao Gansen,Yu Hai,Ji Tongkai and Song Hong
    2012, 28(1):  31-37. 
    Asbtract ( 1655 )   Knowledge map   
    Related Articles | Metrics
    An infrastructure cloud manages the infrastructure as a resource pool,enabling on-demand and dynamic resources provisioning according to resource consumption and service loads.This paper investigates the issue of adaptive resource provisioning for services in clouds.A model is proposed to predict cloud services’peak load and calculate the expected resources consumption.Resource of the best utility for the service is identified and allocated to the service.Simulation results suggest that the proposed adaptive resources provisioning model has a fair accuracy and stable performance.
    A Tree Cloud Database for SaaS Cloud Service
    Kang Yimei,Hu Jiang and Wang Guan
    2012, 28(1):  37-41. 
    Asbtract ( 1526 )   Knowledge map   
    Related Articles | Metrics
    SaaS provides complete software application services to different users in the endpoint of cloud.In SaaS application,cloud database should not only provide the storage and retrieval of massive data,but also be able to customize data structure easily for different users.A tree cloud database is proposed in this paper.This database organizes and searches data by a strucure of tree.The type of node in the tree includes number,characters,text,two-dimensional tables,file and so on.The time complexity of search at the worst case is o[log2/N].The existed data in table and file could be reorganized easily to the tree structure in order to meet the storage and retrieval requirements of SaaS.
    Mechanism Design for Optimizing Response Time of SLA in Cloud Computing
    Wang Cuie,Gu Yonggen,Wu Xiaohong and Tao Jie
    2012, 28(1):  42-46. 
    Asbtract ( 2174 )   Knowledge map   
    Related Articles | Metrics
    Considering response time,one of the important indicators for measuring QoS of cloud computing services in SLA,in this paper,we propose a dominant strategy incentive compatibility mechanism.Assuming all the cloud resource providers being rational,the proposed mechanism in this paper ensures each cloud resource provider is willing to bid true resource cost information,and taking this as the prerequisite the cloud service provider can derive a way aiming to the shortest response time under the cloud user’s budget constraint and also choose optimal composition of resource providers for user’s job.Finally,we prove pivotal properties of mechanism proposed in the paper and present the optimization algorithm of response time.
    A Distributed Locking Mechanism for XML Database in DaaS Environment
    Gu Jinguang,Luo Pan and Zhang Zhi
    2012, 28(1):  47-52. 
    Asbtract ( 1820 )   Knowledge map   
    Related Articles | Metrics
    Locking mechanism plays a key role in transaction processing of DaaS based on XML databases.Traditional research on locking mechanism has many limitations,such as poor concurrency ability,and do not support main query language such as XQuery.This paper proposes a multi-granular locking mechanism,it creates semantic locks on the nodes of dynamic pattern tree view for every database node,and manages the transaction coordination of different databases with the global pattern tree view of the main database node.A discussion about the differences between the locking mechanisms of this paper and current are proposed in the last of the paper.
    Construction of Data Mining Application Platform Based on the Service Models of Cloud Computing
    Huang Zhangshu and Liu Qingqing
    2012, 28(1):  53-57. 
    Asbtract ( 2132 )   Knowledge map   
    Related Articles | Metrics
    This paper combines data mining with cloud computing and uses the services model of cloud computing to design the data mining application platform.Firstly,we put forward a cloud computing service hierarchy that contains three levels and four modes.And then,this hierarchy is used in designing the data mining application platform.Finally,we propose a framework of data mining application platform based on the service models of cloud computing,and elaborates the functions of each subsystem and features of this platform.The platform integrates a variety of algorithms about data mining,and it possesses a good generality and expansibility.
    Charging Model Research of Application Layer in Cloud Computing Based on Cost-Profit Petri Net
    Bai Lirui,Li Tong,Xie Zhongwen and Song Chen
    2012, 28(1):  58-62. 
    Asbtract ( 1406 )   Knowledge map   
    Related Articles | Metrics
    How to charge for cloud computing is an important problem to be solved urgently at present.In order to represent and research the charge model of application layer in cloud computing clearly,the Petri net which introduces the cost and the profit to the transition is proposed.A concept and some theorems of cost-profit Petri net is put forward and used to describe the charge model of the application layer in cloud computing.Thus to the choice to the charge model of the provider of cloud computing,the reference model of analysis has built up.In addition,a specific example is given.
    FCM-Based Cell First Peer Selection Algorithm for P2P Systems over 3G Network
    Zhang Yan,Zhou Xu,Liu Shuhao and Tang Hui
    2012, 28(1):  63-69. 
    Asbtract ( 2029 )   Knowledge map   
    Related Articles | Metrics
    The characteristics of mobile environments and the architecture of 3G cellular network have brought challenges for peer selection in P2P systems over 3G cellular network.This paper studies the problem of peer selection in P2P systems over 3G cellular network,and proposes a novel peer selection algorithm named CF-FCM(cell first,FCM based).Simulation results indicate that the CF-FCM algorithm can achieve excellent load balance on the cells in 3G cellular network while assuring good peer performance.
    Research on the Method of Available Bandwidth Estimates for Wireless Mesh Network
    Li Taoshen,Chen Yang and Ge Zhihui
    2012, 28(1):  70-74. 
    Asbtract ( 2337 )   Knowledge map   
    Related Articles | Metrics
    In view of inaccuracy in the existing methods of available bandwidth,a method of passive estimates of available bandwidth for wireless mesh network is proposed.In this method,we figure out the quantitative relation between signal channel capacity and sending/receiving power by analyzing the features of wireless mesh network.And then,the more accurate available bandwidth can be estimated based on the relation.The simulation results show that our estimated available bandwidth is better than APEAB algorithm.
    The Cluster Algorithm Research Based on Dynamic Variable Threshold and Density
    Chen Peishuai and Ju Chunhua
    2012, 28(1):  75-81. 
    Asbtract ( 1816 )   Knowledge map   
    Related Articles | Metrics
    BIRCH and DBSCAN are popular data cluster algorithms.However,they insist some insufficiency.This paper introduces a new algorithm DVTD(the cluster algorithm based on dynamic variable threshold and density) to solve these problems.In the experiment,it is shown that DVTD is better than BIRCH and it can get almost same result to arbitrary shapes data cluster as DBSCAN.
    Research on Exact Simulation Modeling Approach for Physical Layer of Ultra-Short Communication System
    Zhang Jiashuai,Luo Zhigang,Zhang Xiang and Liu Jianfei
    2012, 28(1):  82-86. 
    Asbtract ( 2128 )   Knowledge map   
    Related Articles | Metrics
    In the design of simulation model for communication system,the empirical formulation is usually introduced to build up the physical layer model.However,generally such empirical formulation method suffers from two drawbacks: it fails to represent the practical scene configuration,and it cannot guarantee the modeling accuracy.In the aim of improving the effectiveness of the simulation model,the modeling accuracy of the physical layer should be further enhanced.In this paper,we build a new simulation model for the ultra-short communication system and implement a simulation system by using OMNET++ based on its Simulink channel model and WI model.Experimental results confirm the accuracy of the built model compared with the empirical formulation modeling method for the physical layer.Finally,we analyze the factors affecting the performance result.
    Study of Over-Sampling Method Based on Feature Selection
    Lu Huijuan,Zhang Jinwei,Ma Xiaoping and Yang Xiaobing
    2012, 28(1):  87-91. 
    Asbtract ( 1329 )   Knowledge map   
    Related Articles | Metrics
    To significantly improve the classification performance of the minority class,we present an over-sampling method based on feature selection.Firstly,feature selection is performed on the training data set in order to select a set of key columns.Then minority class samples are produced using selected key columns,and each sample consists of two kinds of features.One type of features is characteristic value that is corresponding to the selected key columns,the others is generated according to the principle of SMOTE.Comparing to SMOTE algorithm,results show that the new method performs better than SMOTE,and it can effectively reduce the imbalance of data and improve the classification accuracy of the minority class.
    Research on Schedulability Analysis for Hard Real-Time Systems in Internet of Things
    Gao Zhigang and Lu Huijuan
    2012, 28(1):  92-97. 
    Asbtract ( 1350 )   Knowledge map   
    Related Articles | Metrics
    This paper builds a new task model for hard real-time Internet of Things systems with feedback tasks and non-feedback tasks and presents a new response time analysis method.This task model describes the characteristics of tasks in detail,such as their structures,interaction modes and running manner.The new schedulability analysis method can verify whether real-time requirements are met.Experimental results show the tasks in HCTS have lower average worst-case response time.However,it has some negative influence on the schedulability of tasks in the case of more feedback loops,which provides support for the optimization of HCTS.
    Underdetermined Blind Source Separation Algorithm Based on K-Means Clustering and Potential Function
    Yang Jing,Zhang Yujie and Li Hongwei
    2012, 28(1):  98-101. 
    Asbtract ( 2178 )   Knowledge map   
    Related Articles | Metrics
    K-means clustering method can estimate the observed clustering signal line direction,using principal component analysis can improve the accuracy and robustness of linear estimation.Under the guidance of this thinking,method of combine K-means clustering with potential function is proposed.Potential function measure the distance of clustering center with all observation points,based on the potential function find clustering center iteration formulas,using this formula to adjust clustering center.The presented algorithm is characterized by high accuracy and less computation.Simulation results illustrate the efficiency and the good performance of the algorithm.
    research and development
    Underdetermined Blind Source Separation Algorithm Based on K-Means Clustering and Potential Function
    Jing Yang,Yujie Zhang,Hongwei Li
    2012, 28(1):  102-105.  doi:10.3969/j.issn.1000-0801.2012.01.019
    Asbtract ( 2025 )   HTML ( 24)   PDF (1606KB) ( 824 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    K-means clustering method can estimate the observed clustering signal line direction,using principal component analysis can improve the accuracy and robustness of linear estimation.Under the guidance of this thinking,method of combine K-means clustering with potential function is proposed.Potential function measure the distance of clustering center with all observation points,based on the potential function find clustering center iteration formulas,using this formula to adjust clustering center.The presented algorithm is characterized by high accuracy and less computation.Simulation results illustrate the efficiency and the good performance of the algorithm.

    Quantum Secret Sharing Protocol Without Particle Entangled State
    Zhang Jun and Li Youmei
    2012, 28(1):  109-112. 
    Asbtract ( 2521 )   Knowledge map   
    Related Articles | Metrics
    Secret sharing refers to the method for distributing a secret amongst a group of participants,and the secret can be reconstructed only when a sufficient number of shares are combined together,it can ensure the information secure and data protection in cloud computing.This paper proposes a new quantum secret sharing protocol without particle entangled state,which can guarantee unconditional security by using quantum one-time pads,quantum key cryptosystem and the technique of comparing two unknown quantum states.This protocol has following advantages: compile with traditional secret sharing,the new scheme can resist the Shor algorithm by using of quantum communication technology;without particle entangled state,the protocol can reduce the complexity of implementation;if there exists attacker or malicious participant,the new protocol can discover the situation,and it can avoid recover the wrong secret.
    Quantum Secret Sharing Protocol Without Particle Entangled State
    Jun Zhang,Youmei Li
    2012, 28(1):  113-116.  doi:10.3969/j.issn.1000-0801.2012.01.021
    Asbtract ( 1466 )   HTML ( 21)   PDF (581KB) ( 698 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Secret sharing refers to the method for distributing a secret amongst a group of participants,and the secret can be reconstructed only when a sufficient number of shares are combined together,it can ensure the information secure and data protection in cloud computing.This paper proposes a new quantum secret sharing protocol without particle entangled state,which can guarantee unconditional security by using quantum one-time pads,quantum key cryptosystem and the technique of comparing two unknown quantum states.This protocol has following advantages: compile with traditional secret sharing,the new scheme can resist the Shor algorithm by using of quantum communication technology; without particle entangled state,the protocol can reduce the complexity of implementation; if there exists attacker or malicious participant,the new protocol can discover the situation,and it can avoid recover the wrong secret.

    Research on Grid Resource Scheduling Algorithm Based on Multi-QoS Constraints
    Liu Mingxin and Chen Jing
    2012, 28(1):  118-121. 
    Asbtract ( 2077 )   Knowledge map   
    Related Articles | Metrics
    To improve the utilization ratio of resources and users’ satisfaction degree of grid services,the algorithm DQ based on improved Min-Min algorithm was proposed in this paper.On the basis of DQ algorithm,applying the method of refining QoS parameter and classifying task weight value,multi-QoS constraints MQCSA was proposed.By choosing deadline of gridlets,bandwidth of network and CPU parameters,the algorithm could resolve the problem of occupying resources that the tasks cannot complete on schedule.It was proved that MQCSA and DQ algorithm are superior in solving multi-QoS constraints problems by comparing and analyzing simulation data.
    Research on Grid Resource Scheduling Algorithm Based on Multi-QoS Constraints
    Mingxin Liu,Jing Chen
    2012, 28(1):  122-125.  doi:10.3969/j.issn.1000-0801.2012.01.023
    Asbtract ( 2160 )   HTML ( 22)   PDF (795KB) ( 710 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the utilization ratio of resources and users' satisfaction degree of grid services,the algorithm DQ based on improved Min-Min algorithm was proposed in this paper.On the basis of DQ algorithm,applying the method of refining QoS parameter and classifying task weight value,multi-QoS constraints MQCSA was proposed.By choosing deadline of gridlets,bandwidth of network and CPU parameters,the algorithm could resolve the problem of occupying resources that the tasks cannot complete on schedule.It was proved that MQCSA and DQ algorithm are superior in solving multi-QoS constraints problems by comparing and analyzing simulation data.

    A Comparative Analysis on the Billing Model of Public Cloud Service
    Wu Jun and Xu Ming
    2012, 28(1):  127-132. 
    Asbtract ( 2440 )   Knowledge map   
    Related Articles | Metrics
    With the development of the public cloud service,the billing model has been the hot point for the commercialization of the public cloud service.This article compares the similarities and differences of the billing patterns within public cloud service provided by Amazon Web Service,Windows Azure and CloudEx,analyzes the typical billing model of the IaaS service and recognizes the insufficient.
    Study on SaaS Cloud Service Development for Telecom Operators
    Li Wei,Zhang Yunyong,Guo Zhibin and Liu Lu
    2012, 28(1):  132-136. 
    Asbtract ( 2408 )   Knowledge map   
    Related Articles | Metrics
    Firstly the characters of SaaS service are studied,then the advantages and disadvantages of SaaS service development for telecom operators are analyzed.After that,some SaaS business services of international influential telecom operators are studied.Finally,some SaaS service development suggestions for telecom operators are proposed and analyzed in detail.
    Design and Implementation of IRMS for Data Sharing and Dispatching
    Zhang Yonghua and Yang Yi
    2012, 28(1):  147-155. 
    Asbtract ( 1303 )   Knowledge map   
    Related Articles | Metrics
    Through establishing the inter-professional and customer-oriented resource model,the sharing core resources database has been formed.This paper presents a exchanging information and data interface standard specification based on comprehensive resource data,the use of the unified management of resources data,business data,data exchanging platform help achieve full professional services for network resources and information resource sharing between heterogeneous systems.
Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Posts and Telecom Press Co., Ltd.
Publisher: Beijing Xintong Media Co., Ltd.
Editor-in-Chief: Chen Shanzhi
Editorial Director: Li Caishan
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Postal Code: 100079
Tel: 010-53879277
        010-53879278
        010-53879279
E-mail: dxkx@ptpress.com.cn
Mailing Code: 2-397
ISSN 1000-0801
CN 11-2103/TN
Visited
Total visitors:
Visitors of today:
Now online: