Yuhong Li

Beijing University of Posts and Telecommunications, Peping, Beijing, China

Are you Yuhong Li?

Claim your profile

Publications (23)0.92 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents the final results achieved within the EFIPSANS project on the topic of resilience and survivability in autonomic networks. In particular, the outcome of the investigation of the following issues is presented: adaptive level of recovery, unified architecture for autonomic routing resilience, synergies between autonomic fault-management and resilience in self-managing networks, as well as network resilience through autonomic reroute mechanism enhanced with multi-path node-to-node cooperation. The described ideas are supported by exhaustive descriptions and analyses featuring extensive validation results aimed to prove the applicability of the proposed concepts.
    10/2013; 4(4):36-63. DOI:10.4018/ijaras.2013100103
  • Yufeng Xiao · Liqiong Yang · Yuhong Li · Xin Li · Zhen Qin
    [Show abstract] [Hide abstract]
    ABSTRACT: With efficient failure detections, Multiprotocol Label Switching (MPLS) network can tolerate faults and ensure the quality of service (QoS). This paper proposes a mechanism named MPLS loopback detection (MLD) to inspect network failures. In the process of loopback failure detection, it measures the delay and record the number of sequential timeouts. According to the delay and timeout, it dynamically adjusts detection period so that the failure can be found in time with less detection packets. To support the implementation of MLD, the LOAM (loopback operation and maintenance) module is developed and integrated into the existing MPLS protocol module. Finally, the MLD is implemented on a Linux platform, and the experiments proved the mechanism worked effectively.
  • Yufeng Xiao · Hong Jiang · Bo Liu · Yuhong Li · Xin Li
    [Show abstract] [Hide abstract]
    ABSTRACT: To guarantee the quality of service (QoS) when failure takes place, the fault-tolerant MultiProtocol Label Switching (MPLS) network should find out failures as soon as possible. This paper proposes a MPLS failure detection mechanism, named bimodal detection (BD). Based on the adaptive model (AM), it adaptively adjusts the detection period along with delay variation and occurrence of detection timeout. Not only can the failure be found in time, but also the number of detection packets is decreased as few as possible. Finally, the BD is deployed on a Linux platform, and the experiments show that it can timely find out failure with low costs.
  • Source
    Feng Gao · Yuhong Li · Li Han · Jian Ma
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a novel personalized news recommendation system named InfoSlim. The new system uses semantic technique to annotate news items and user preference in order to add rich metadata information into traditional keyword vector. By doing this, the similarity measure between item profile and user profile can be done by not only lexical-level cosine-based method but also by semantic-level ontology-based method. Such recommendation method can efficiently improve the accuracy of recommendation and therefore can better reflect user's interest and save mobile resources.
    Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on; 10/2009
  • Chaohui Wang · Yuhong Li · Li Han · Jian Ma
    [Show abstract] [Hide abstract]
    ABSTRACT: With the constant development of multimedia technologies and mobile devices, the demand of transmitting multimedia streams to mobile devices will be one of the major applications in wireless networks. But the categories of devices and user preference vary widely. How to provide appropriate multimedia streams to mobile terminals and how to process the received multimedia content in the user side will be a potential application for content providers and service operators. In this paper, we propose a context-aware multimedia multicast approach which is composed of two sides - server side and client side to deal with the above problems. This approach can not only decrease the frequencies between server side and client side in wireless environment but also decrease the initiative manual user intervention.
    Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on; 10/2009
  • Source
    Zhan Shi · Yuhong Li · Li Han · Jian Ma
    [Show abstract] [Hide abstract]
    ABSTRACT: Nowadays user behavior perception becomes more and more important in scientific experiments and people’s daily lives, especially in mobile services. This paper presents a model which can be used to perceive user’s behavior on intelligent mobile terminals based on Markov process. The model combines the syntax model and the probability transition model, and introduces also other parameters like weight. It can perceive users behavior through different kinds of contexts, such as users’ reading history. According to the perceived behavior, the model can better perceive the user’s behavior, and therefore allows better mobiles services experiences to users. A system architecture based on the presented model has been introduced and implemented, and a verification method of the model has also been given.
    Web Information Systems and Mining, International Conference, WISM 2009, Shanghai, China, November 7-8, 2009. Proceedings; 01/2009
  • Source
    Yufeng Xiao · Xin Li · Yuhong Li · Shanzhi Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: Reliability evaluation of wireless sensor networks (WSN) is a critical step in WSN design. To evaluate the reliability of WSN, an algorithm named COBDD is presented in this paper. COBDD executes recursive construction of the ordered binary decision diagram (OBDD) only once, and therefore save much running time when WSN is subject to large number of common causes. Furthermore, it constructs OBDD with node expansion and decrease redundant computations from isomorphic sub-networks. Experiments show that COBDD is an efficient algorithm for the reliability evaluation of WSN.
    Proceedings of IEEE International Conference on Communications, ICC 2009, Dresden, Germany, 14-18 June 2009; 01/2009
  • Source
    Yuhong Li · Shuwen Pan · Na He · Yi Zhao · Huichun Su · Kuifei Yu · Jian Ma
    [Show abstract] [Hide abstract]
    ABSTRACT: With the increase of the networking functions of the mobile handheld devices, today there is a strong need for receiving multimedia through mobile handheld devices. However, the current streaming technologies cannot well satisfy the users' need due to the large network bandwidth requirement and high price. And the infrastructure of broadcasting oriented for a mobile handheld device, such as DVB-H, are not yet popular in the daily life.
    International Journal of Distributed Sensor Networks 01/2009; 5(1). DOI:10.1080/15501320802575187 · 0.92 Impact Factor
  • Yi Zhao · Yuhong Li · Kuifei Yu · Jian Ma
    [Show abstract] [Hide abstract]
    ABSTRACT: Multimedia services for portable handheld devices have shown great market demand. This paper presents a novel multimedia service-provisioning solution by combining the digital terrestrial broadcasting networks (DVB-T), Internet and WLAN, which provides a new business model and market for both service providers and end device manufactures. Some key problems, techniques, such as streaming, and transcoding, for implementing the suggested gateway system, have been studied, and several new services have been implemented. The experimental results show that the proposed system is Practical to provide multimedia and Internet services to portable handheld devices flexibly and economically.
    International Conference on Informational Technology and Environmental; 01/2008
  • Source
    Yufeng Xiao · Shanzhi Chen · Xin Li · Yuhong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Reliability evaluation can help to minimize costs and maximize reliability of wireless sensor networks (WSN). To evaluate the reliability of WSN, a mathematical model and an enhanced factoring (EF) algorithm are presented in this paper. Being different from traditional factoring algorithm, the node contraction is enhanced by source expansion and the isomorphic sub-networks are identified. These operations can help to decrease the number of repeated computations and make the reliability computing fast. The traditional factoring algorithm and EF are compared in experiments, and the results show EF is more efficient than traditional factoring for large size network.
    Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008; 01/2008
  • Fang Wang · Shanzhi Chen · Xin Li · Yuhong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Route flap caused by link flap in OSPF always lead to network instability and unreliability. Most of the prevailing solutions are network-wide and require all routers to participate in the route flap suppressing process, which not only lack flexibility and scalability but also occupy additional computation resources across the network. In this paper, a localized approach is proposed to suppress the routing flap through dynamically tuning the hello interval of OSPF. To support the real-time adjustment of the hello timer, an analytical model is also established to investigate the relationship between link flap and route flap. Simulation results show that our approach can achieve better performance in eliminating routing flap and at the same time consume much less computation resources than the network-wide method.
    Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008; 01/2008
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the booming wireless mobile applications in recent years, there is an emerging trend that mobile users demand individualized services via their portable devices. Hence a mobile service provisioning scheme is needed to provide novel and personalized applications and services for mobile users rapidly and efficiently. To address these issues, CSPSME is proposed. It provides a solution for collecting the user's current context and adapting its service behaviour to the users' requirements accordingly. By using emerging service composition technology, it offers a common mechanism to design and execute context-aware applications in a flexible and efficient way. A mobile Point of Interest service is designed and implemented based on CSPSME to illustrate its feasibility.
    China-Ireland International Conference on Information and Communications Technologies (CIICT 2008); 01/2008
  • Source
    Wei Li · Shanzhi Chen · Ping Zhou · Xin Li · Yuhong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Broadcasting has become a basic service that adds to existing DHT systems the ability to search using arbitrary queries as well as disseminate/collection global information. However, the phenomenon of system churn, a continuous process of needs joining and leaving the networks, degrades the broadcast performance of DHT systems and adversely impact the performance of applications built on top of them. In this paper, we present an efficient algorithm for performing a broadcast operation in DHT systems under churn. It is suitable for most DHT systems such as Chord, Tapestry, etc. Through the proposed algorithm, nodes in DHT system could perform broadcast operation rapidly, and will not send any redundant message. Furthermore, it ensures full coverage of the nodes in the system even when the churn rate is high. The algorithm is validated and evaluated through simulations.
    Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on; 10/2007
  • Source
    Yufeng Xiao · Shanzhi Chen · Xin Li · Yuhong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a new available bandwidth measurement method based on self-loading periodic streams (SLoPS) in this paper. SLoPS sends probe stream at specific rate and estimates the available bandwidth from the inference of self-induced congestion. Contrary to traditional SLoPS method, the new method infers the congestion from a parameter named interval difference, not end-to-end delays. In probing scheme, the new method exponentially adjust probe rate to demarcate a rough bandwidth range and constringe the rate to available bandwidth value with quick search in the rough range. Since it uses only interval times of packets, our method does not require high time-stamping accuracy nor synchronous at the sender and receiver. We test our method in controlled and reproducible environment using NS2, and the simulation experiments show our method is accurate, quick and non-intrusive.
    Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on; 10/2007
  • Source
    Mingxin Li · Shanzhi Chen · Yuhong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: With the rapid development of wireless network, the integration of heterogeneous networks' mobility management is necessary. It is really an opportunity and challenge to study in this area. The primary factor currently limiting progress in mobility management is not any specific technical challenges (though many remain, and deserve much further study) but is instead the lack of overall mobility management architecture. The contribution of this work is a proposal of mobility management architecture in heterogeneous networks. It is a bow-tie architecture and imports information into a logically centralized, two-tier database. It supports heterogeneous wireless networks such as UMTS, Ad hoc, and etc. Moreover, this paper also discusses the handoff scenarios of heterogeneous network and simulates them.
    Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on; 10/2007
  • Source
    Tao Yu · Shanzhi Chen · Ming Ai · Xin Li · Yuhong Li · Zhen Qin
    [Show abstract] [Hide abstract]
    ABSTRACT: As communication networks play an important role in today's life, network reliability becomes more critical than ever. Traditionally, network reliability is measured by connectivity or traffic volume. However, most of performance degradation problems are correlated with routing dynamic and congestion. It is necessary to include the both routing dynamics and congestion into network reliability computation. This paper proposes a new framework to compute the reliability. In this framework, the effects of multiple facts such as routing dynamics, traffic pattern and congestion probability are investigated. The reliability based on the proposed framework provides a new way for network operator to evaluate the performance of the IP network.
    Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on; 01/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the prototype system of the integration of MPLS and MIPv6 (mobile IPv6), and a test network supporting both MIPv6 and MPLS are presented; and the performance of the applications running on the test network is evaluated. The testing results indicate that the integrated network can achieve better RTT, jitter, loss rate, data transmission rate and handover delay than a non-integrated network. Nevertheless, with the variation of the background payloads, the improvements on the performance of the integrated network are not obvious and in some cases even worse than non-integrated network.
    Communications and Networking in China, 2006. ChinaCom '06. First International Conference on; 11/2006
  • Source
    Bo Hu · Yan Shi · Xin Li · Shanzhi Chen · Yuhong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Mobile IPv6 (MIPv6) is a generally accepted mobility management protocol to support user mobility in IP networks, which use registration mechanism to maintain location information of mobile nodes. However, MIPv6 can not satisfy requirements of seamless mobility, such as signaling traffic, handoff delay and packet loss rate. Accordingly, there are two typical location management extensions to MIPv6: hierarchical location management and IP paging. Four related location management schemes are considered, MIPv6, paging extension for MIPv6, hierarchical MIPv6 (HMIPv6) and paging extension on HMIPv6. Then, the signaling cost of these schemes is analyzed through theoretical modeling. We analyze impacts of network environment parameters, such as domain size and mobile nodes speed, to the signaling cost and compare the performance of these schemes. The analysis result shows that the MIPv6 extended schemes can provide more scalable and efficient location tracking mechanism and reduce signaling overhead significantly, but the HMIPv6-P does not remarkably outperform P-MIPv6 and HMIPv6 as expected
    ITS Telecommunications Proceedings, 2006 6th International Conference on; 07/2006
  • Changxing Shen · Yuhong Li · Jian Ma
    [Show abstract] [Hide abstract]
    ABSTRACT: The packet forwarding algorithms in the existing geographical location based Ad Hoc routing protocols consider only one factor that influences the performance of the routing protocols. Therefore, the performance of these protocols is not good enough. In this paper, we present a new packet forwarding algorithm--Universal Weighted Greedy (UWG) algorithm, which takes two factors into account. The two factors are the distance of next hop and destination, and the angel that the next hop deviates the beeline between source and destination node. The algorithm has good universality and can improve the routing performance because the two considered factors are critical factors for routing. In the following paper, first the design principle of geographical location based Ad Hoc routing protocol is introduced and the packet forwarding algorithms in some typical routing protocols are reviewed. Then the principle of the UWG algorithm is elaborated. We simulate the UWG algorithm and determine the parameter scope when the performance of the routing protocol is optimal.
    Proceedings of the 5th WSEAS international conference on Applied computer science; 04/2006