With the fast development of next generation Internet (NGI) or next generation networks (NGN), the issue related to communication protocol design has become a challenging topic. On basis of describing the related concepts and a formal description method, this paper mainly presents two algorithms for achieving self-stabilization of the protocols. One algorithm, called the Global State Algorithm, (GSA), can be used to obtain the global states of under case of a loss of cooperation of the different processes in the communication protocol, which can be applied to a recovery point that will be used by following recovery procedure for self-stabilizing a communication protocol. Second algorithm, called Recovery Stabilization Algorithm (RSA), uses the contextual information exchanged during progress process of the protocol. After a failure is detected, all processes can eventually know the error by RSA. This paper gives also correctness proof and complexity analysis these algorithms, and verifies the efficiency of the algorithms by illustrating the example protocols.

With the rapid development of Internet, mobile networks and high-performance networking technology, QoS multicast routing in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. This is also a challenging and hard problem for the next generation Internet and high-performance networks. It attracts the interests of many people. This paper discusses the multicast routing problem with multiple QoS constraints in networks with uncertain parameters, and describes a network model that is suitable to research such QoS multicast routing problem. The paper mainly presents QMRGA, a multicast routing policy for Internet, mobile network or other high-performance networks, that is based on the genetic algorithm, and can provide QoS-sensitive paths in a scalable and flexible way, in the networks environment with uncertain parameters. The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The results shows that QMRGA provides an available approach to QoS Multicast routing in networks environment with uncertain parameters.

With the rapid development of Internet, mobile networks and high-performance networking technology, QoS multicast routing has become a very important research issue in the areas of networks and distributed systems. This is also a challenging and hard problem for the next generation Internet and high-performance networks. It attracts the interests of many people. This paper presents a distributed QoS multicast routing algorithm (DQMRA). This algorithm deals with delay and bandwidth constraints, and has low cost. The DQMRA attempts to significantly reduce the overhead for constructing a multicast tree. In this paper, the proof of correctness of the DQMRA is given, and the performance of the algorithm is evaluated using simulations. The study shows that our algorithm provides an available approach to QoS multicast routing.

The provision of Quality-of-service (QoS) guarantees is of utmost importance for the development of the multicast services. These multicast services have been used by various continuous media applications such as the multicast backbone (Mbone) of the Internet has been used to transport real time audio/video for news, video conferencing and distance learning. This paper presents a hierarchical QoS multicast routing protocol (HQMRP) for mobile ad-hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed HQMRP scheme, each local node just only needs to maintain local multicast routing information and/or summary information of other clusters (or domains), but does not requires any global ad hoc network states to be maintained. The HQMRP also allows that an ad-hoc group member can join/leave the multicast group dynamically, and supports multiple QoS constraints. The paper presents formal description and main procedures for realizing routing decision process of the HQMRP, and the proof of correctness and complexity analysis of the protocol. In also presents a theoretical analysis of the mobility in the mobile ad-hoc network environment. The performance measures of HQMRP are evaluated using simulation. The studies show that HQMRP can provide an available approach to QoS multicast routing for mobile ad-hoc networks.

With the rapid development of next generation Internet (NGI), high-speed networks, multimedia communication networks and mobile computer networks, the hierarchical routing techniques for the dynamic and large networks or high-speed networks have triggered interests among many people worldwide. This paper presents a hierarchical routing protocol for large-scale computer networks (HRPLN) Which can adapt to dynamic and large computer networks (DLCN) with clustering topology. It also gives the main procedures for realizing routing update and routing decision, and the proof of correctness and complexity analysis of the protocol. The performance measures of HRPLN including throughput and average message delay are evaluated using simulation. The study shows that HRPLN provides a new available approach to routing decision for DLCN with clustering topology.

With the rapid development of high-performance networking technology, multicast routing with QoS constraints has continued to be a very important research issue in the fields of the networks and distributed systems. This paper discusses the multicast routing problem with QoS constraints such as delay, delay jitter, bandwidth and packet loss metrics, and describes a network model that is suitable to search such routing problem. The paper mainly presents a QoS-guaranteed multicast routing protocol (QGMRP). The QGMRP can operate on top of the unicast routing protocol. It only requires the local state information of the link (or the node), but does not requires any global network state to be maintained. The QGMRP can significantly reduce the overhead for constructing a multicast tree with QoS constraints. In QGMRP, a multicast group member can join or leave the multicast session dynamically. The protocol can search multiple feasible tree branches, and select the optimal or near-optimal branch for connecting the new receiver to the multicast tree if it exists. In this paper, the proof of correctness and complexity analysis of the QGMRP are given, and the performance measures of the protocol are evaluated using simulation. The study shows that QGMRP provides an available approach to multicast routing with QoS constraints.