|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Hybrid QoS-aware semantic web service composition strategies显示文摘Hybrid QoS model which consists of certain and uncertain expressions has strong power of semantic QoS description. For solving the hybrid QoS-aware semantic web service composition problem,this paper presents an Uncertain Multi-attribute decision making based Composition algorithm(UMC) . The UMC includes two parts. First,UMC-Core can be used to synthetically evaluate the hybrid service quality information. Second,UMC-DH(Distributed and Heuristic framework for UMC) aims at enhancing the run-time performance of UMC when the problem space increases. The simulation results show that the UMC has lower execution cost,higher approximation ratio and success ratio than other similar approaches. | YANG FangChun SU Sen LI Zhen | 2008 | Science in China(Series F)2008，51，11： | 19 |
| 2 | Cooperative Vehicular Content Distribution in Edge Computing Assisted 5G-VANET显示文摘By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertainment experience. However, many enabling applications in 5G-VANET rely on the efficient content sharing among mobile vehicles, which is a very challenging issue due to the extremely large data volume, rapid topology change, and unbalanced traffic. In this paper, we investigate content prefetching and distribution in 5G-VANET. We first introduce an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data. We then propose a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic. The content requests of vehicles can be served by neighbors, which can improve the sharing efficiency and alleviate the burden of networks. Furthermore, we use a graph theory based approach to solve the content distribution by transforming it into a maximum weighted independent set problem. Finally, the proposed scheme is evaluated with a greedy transmission strategy to demonstrate its efficiency. | Guiyang Luo Quan Yuan Haibo Zhou Nan Cheng Zhihan Liu Fangchun Yang Xuemin (Sherman) Shen | 2018 | China Communications2018，15，7： | 13 |
| 3 | An Algorithm Based on Markov Chain to Improve Edge Cache Hit Ratio for Blockchain-Enabled IoT显示文摘Reasonable allocation of storage and computing resources is the basis of building big data system.With the development of IoT(Internet of Things),more data will be brought.A three-layer architecture includes smart devices layer,edge cloud layer and blockchain-based distributed cloud layer.Blockchain is used in IoT for building a distributed decentralize P2P architecture to deal with the secure issue while edge computing deals with increasing volume of data.Edge caching is one of the important application scenarios.In order to allocate edge cache resources reasonably,to improve the quality of service and to reduce the waste of bandwidth resources,this paper proposes a content selection algorithm of edge cache nodes.The algorithm adopts markov chain model,improves the utilization of cache space and reduces the content transmission delay.The hierarchical caching strategy is adopted and the secondary cache stores slides of contents to expand the coverage of cached content and to reduce user waiting time.Regional node cooperation is adopted to expand the cache space and to support the regional preference of cache content.Compared with the classical substitution algorithm,simulation results show that the algorithm in this paper has higher cache hit ratio and higher space utilization. | Hongman Wang Yingxue Li Xiaoqi Zhao Fangchun Yang | 2020 | China Communications2020，17，9： | 9 |
| 4 | Iterative selection algorithm for service composition in distributed environments显示文摘In service oriented architecture(SOA) ,service composition is a promising way to create new services. However,some technical challenges are hindering the application of service composition. One of the greatest challenges for composite service provider is to select a set of services to instantiate composite service with endto-end quality of service(QoS) assurance across different autonomous networks and business regions. This paper presents an iterative service selection algorithm for quality driven service composition. The algorithm runs on a peer-to-peer(P2P) service execution environment―distributed intelligent service execution(DISE) ,which provides scalable QoS registry,dynamic service selection and service execution services. The most significant feature of our iterative service selection algorithm is that it can work on a centralized QoS registry as well as cross decentralized ones. Network status is an optional factor in our QoS model and selection algorithm. The algorithm iteratively selects services following service execution order,so it can be applied either before service execution or at service run-time without any modification. We test our algorithm with a series of experiments on DISE. Experimental results illustrated its excellent selection and outstanding performance. | SU Sen LI Fei YANG FangChun | 2008 | Science in China(Series F)2008，51，11： | 8 |
| 5 | An Efficient Adaptive Failure Detection Mechanism for Cloud Platform Based on Volterra Series显示文摘Failure detection module is one of important components in fault-tolerant distributed systems,especially cloud platform.However,to achieve fast and accurate detection of failure becomes more and more difficult especially when network and other resources' status keep changing.This study presented an efficient adaptive failure detection mechanism based on volterra series,which can use a small amount of data for predicting.The mechanism uses a volterra filter for time series prediction and a decision tree for decision making.Major contributions are applying volterra filter in cloud failure prediction,and introducing a user factor for different QoS requirements in different modules and levels of IaaS.Detailed implementation is proposed,and an evaluation is performed in Beijing and Guangzhou experiment environment. | LIN Rongheng WU Budan YANG Fangchun ZHAO Yao HOU Jinxuan | 2014 | China Communications2014，11，4： | 6 |
| 6 | QoS-Aware Semantic Web Service Composition with Uncertainties显示文摘 | LI Zhen YANG Fangchun SU Sen | 2008 | Chinese Journal of Electronics2008，17，4： | 6 |
| 7 | Edgence: A Blockchain-Enabled Edge-Computing Platform for Intelligent IoT-Based dApps显示文摘Nowadays scalable Io T management is a bottleneck of Io T development due to the geographically dispersed distribution, fragmented ownerships, and ever-growing population of Io T devices. To intelligently manage massive decentralized applications(d Apps) in Io T usecases, Edgence(EDGe + intellig ENCE) is proposed to use edge clouds to access Io T devices and users, and then use its in-built blockchain to realize self-governing and self-supervision of the edge clouds. Edgence proposes to use masternode technology to introduce Io T devices and users into a closed blockchain system, which can extend the range of blockchain to Io T-based d Apps. Further, masternodes do good to scalability by raising the TPS(transactions per second) of the blockchain network. To support various d Apps, a three-tier validation is proposed, namely script validation, smartcontract validation, and masternode validation. To avoid energy consumption resulted by blockchain consensus, Edgence proposes a random but verifiable way to elect a masternode to generate each new block. The potential of the tailored Edgence is shown by examples of decentralized crowdsourcing and AI training. | Jinliang Xu Shangguang Wang Ao Zhou Fangchun Yang | 2020 | China Communications2020，17，4： | 5 |
| 8 | Particle Swarm Optimization with Skyline Operator for Fast Cloud-based Web Service Composition显示文摘 | Shangguang Wang Qibo Sun Hua Zou Fangchun Yang | 2013 | Mobile Networks and Applications2013，，1： | 4 |
| 9 | Design of equivalent-input-disturbance estimator using a generalized state observer显示文摘In this paper, we present a design method based on the concept of equivalent input disturbance (EID) to reject disturbances for a linear time-invariant system. A generalized state observer (GSO) is used to estimate an EID of the external disturbances, and the pole-assignment algorithm is employed to select the matrices of the GSO. Simulation and experimental results of a rotational speed control system demonstrate the validity of our method. | Min WU Kunpeng LOU Fangchun XIAO Ruijuan LIU Yong HE Jinhua SHE | 2013 | 控制理论与应用(英文版)2013，11，1： | 3 |
| 10 | Towards an accurate evaluation of quality of cloud service in service-oriented cloud computing显示文摘 | Shangguang Wang Zhipiao Liu Qibo Sun Hua Zou Fangchun Yang | 2014 | Journal of Intelligent Manufacturing2014，，2： | 3 |
| 11 | Integrated Route Planning and Resource Allocation for Connected Vehicles显示文摘Intelligent and connected vehicles have leveraged edge computing paradigm to enhance their environment comprehension and behavior planning capabilities.As the quantity of intelligent vehicles and the demand for edge computing are increasing rapidly,it becomes critical to efficiently orchestrate the communication and computation resources on edge clouds.Existing methods usually perform resource allocation in a fairly effective but still reactive manner,which is subject to the capacity of nearby edge clouds.To deal with the contradiction between the spatiotemporally varying demands for edge computing and the fixed edge cloud capacity,we proactively balance the edge computing demands across edge clouds by appropriate route planning.In this paper,route planning and resource allocation are jointly optimized to enhance intelligent driving.We propose a multi-scale decentralized optimization method to deal with the curse of dimensionality.In large-scale optimization,backpressure algorithm is used to conduct route planning and load balancing across edge clouds.In small-scale optimization,game-theoretic multi-agent learning is exploited to perform regional resource allocation.The experimental results show that the proposed algorithm outperforms the baseline algorithms which optimize route planning and resource allocation separately. | Quan Yuan Bo Chen Guiyang Luo Jinglin Li Fangchun Yang | 2021 | China Communications2021，18，3： | 3 |
| 12 | GPSA:A Greedy Pull-based Scheduling Approach for P2P Live Streaming under Heterogeneous Environments显示文摘Pull-based P2P live streaming is a promising solution for the large scale streaming systems, like PPStream, PPlive, due to its high scalability, low cost and high resilience. However, they usually suffer from bad delay performance. In this paper, we seek to improve the delay performance under ensuring video display quality stemming from chunk scheduling. And so we model Pull-based chunk scheduling problem as a multi-objective optimization problem to minimize the video delay and maximize video display quality in the environment of heterogeneous upload bandwidths, heterogeneous and dynamic propagation delays. Finally we put up with a greedy Pull-based scheduling approach(GPSA) to solve the optimization problem. The evaluation shows GPSA can outperform two classical chunk scheduling approaches and adapt to dynamic variance of propagation delays. | Chen Wei Su Sen Yang Fangchun Shuang Kai | 2010 | China Communications2010，7，2： | 2 |
| 13 | Finding Main Causes of Elevator Accidents via Multi-Dimensional Association Rule in Edge Computing Environment显示文摘In order to discover the main causes of elevator group accidents in edge computing environment, a multi-dimensional data model of elevator accident data is established by using data cube technology, proposing and implementing a method by combining classical Apriori algorithm with the model, digging out frequent items of elevator accident data to explore the main reasons for the occurrence of elevator accidents. In addition, a collaborative edge model of elevator accidents is set to achieve data sharing, making it possible to check the detail of each cause to confirm the causes of elevator accidents. Lastly the association rules are applied to find the law of elevator Accidents. | Hongman Wang Mengqi Zeng Zijie Xiong Fangchun Yang | 2017 | China Communications2017，14，11： | 2 |
| 14 | Efficacy of intrapleural instillation of fibrinolytics for treating pleural empyema and parapneumonic effusion: a meta‐analysis of randomized control trials显示文摘 | Wencheng Nie Yanru Liu Jian Ye Liuhong Shi Fangchun Shao Kejing Ying Ruifeng Zhang | 2014 | The Clinical Respiratory Journal2014，，3： | 1 |
| 15 | An efficient server bandwidth costs decreased mechanism towards mobile devices in cloud-assisted P2P-VoD system显示文摘 | Xin Cong Kai Shuang Sen Su FangChun Yang | 2014 | Peer-to-Peer Networking and Applications2014，，2： | 1 |
| 16 | Effects of super-absorbent polymer on dry matter accumulation and nutrient uptake of Pinus pinaster container seedlings显示文摘 | Liu Fangchun Ma Hailin Xing Shangjun | 2013 | Journal of Forest Research2013，18，： | 1 |
| 17 | Trust-Compensation-Based Access Control Model for Web Services显示文摘For most current Web Service access control methods,Web Service providers create a series of access control rules based on specified attributes.Only by meeting all the rules can a subject obtain the access to necessary operations and resources.However,because of the dynamic and open traits of Web Services,it is difficult for Web Service providers to work out an access control policy with moderate intensity and to realize a satisfactory balance between protecting the security of resources and maintaining the service reachable rate.To provide a solution to the above problem,this paper proposed a trust compensation access control method based on the Attribute-Based Access Control model.Our main contributions include a formal description of the access control method,a method to calculate the attribute trust degree based on time decay,and the trust compensation value of the attribute trust degree,as well as a new Service Oriented Architecture(SOA) architecture and its procedures based on a detailed trust compensation access control method. | Yan Danfeng Sun Jing Zhang Liying Yang Fangchun | 2012 | China Communications2012，9，12： | 1 |
| 18 | Architecture and key technologies for Internet of Vehicles:a survey显示文摘In recent years,IoV(Internet of Vehicles)has become one of the most active research elds in network and intelligent transportation system.As an open converged network,IoV plays an important role in solving various driving and traffc problems by advanced information and communications technology.We review the existing notions of IoV from di erent perspectives.Then,we provide our notion from a network point of view and propose a novel IoV architecture with four layers.Particularly,a novel layer named coordinative computing control layer is separated from the application layer.The novel layer is used for solving the coordinative computing and control problems for human-vehicle-environment.After summarizing the key technologies in IoV architecture,we construct a VV(Virtual Vehicle),which is an integrated image of driver and vehicle in networks.VVs can interact with each other in cyber space by providing traffc service and sharing sensing data coordinately,which can solve the communication bottleneck in physical space.Finally,an extended IoV architecture based on VVs is proposed. | Fangchun Yang Jinglin Li Tao Lei Shangguang Wang | 2017 | Journal of Communications and Information Networks2017，2，2： | 1 |
| 19 | SLA-driven container consolidation with usage prediction for green cloud computing显示文摘Since service level agreement(SLA)is essentially used to maintain reliable quality of service between cloud providers and clients in cloud environment,there has been a growing effort in reducing power consumption while complying with the SLA by maximizing physical machine(PM)-level utilization and load balancing techniques in infrastructure as a service.However,with the recent introduction of container as a service by cloud providers,containers are increasingly popular and will become the major deployment model in the cloud environment and specifically in platform as a service.Therefore,reducing power consumption while complying with the SLA at virtual machine(VM)-level becomes essential.In this context,we exploit a container consolidation scheme with usage prediction to achieve the above objectives.To obtain a reliable characterization of overutilized and underutilized PMs,our scheme jointly exploits the current and predicted CPU utilization based on local history of the considered PMs in the process of the container consolidation.We demonstrate our solution through simulations on real workloads.The experimental results show that the container consolidation scheme with usage prediction reduces the power consumption,number of container migrations,and average number of active VMs while complying with the SLA. | Jialei LIU Shangguang WANG Ao ZHOU Jinliang XU Fangchun YANG | 2020 | Frontiers of Computer Science2020，14，1： | 1 |
| 20 | A Scalable Peer-to-Peer Web Services Overlay for Semantic Discovery显示文摘 | SHUANG Kai YANG Fangchun SU Sen | 2008 | Chinese Journal of Electronics2008，17，2： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员