Search

The extensible router is the next generation router architecture. This paper studies the extensibility of the router control plane, which contains complicated modules such as routing protocol processing, router information management, etc. It is difficult to decide when to extending the control plane, and how many nodes are needed. Moreover, the module dispatching configurations is another issues. This paper describes the extensible architecture of the router system and the control plane. It defines three variables to evaluate the extensibility. And a two-step extensible model is provided to achieve the maximum extensibility under these evaluations. Finally, the experiments show that the model is correct and efficient. [ABSTRACT FROM AUTHOR]

Implementing traditional multicast in a network domain including core and edge routers is likely to indicate a huge burden of storage and forwarding for core routers. Supporting QoS aggravates the scalability problem of multicast. The recent multicasting on application layers is more scalable as well as increasing traffic load in network layers and end-to-end delivery delay. In the paper, we deploy the multicast supporting heterogeneous QoS on the overlay only comprising edge routers, and core routers may be unaware of multicast. With router resource limitation and QoS class constraint, we design an algorithm to build minimum cost trees. Also, we present a method to improve the tree performance through introducing some eligible non-member edge routers into multicast session. The simulation results demonstrate that the proposed multicast scheme is effective to decrease the total tree cost and satisfy the considered restriction factors. The scheme can offer an option to realize heterogeneous QoS multicast in DiffServ domains or MPLS VPN networks. [ABSTRACT FROM AUTHOR]

The scalable architecture is one of the key issues of the next generation routers. The distributed routing protocol computing model is one of the most difficult challenges on the router control plane. This paper studies the route processing model of BGP, which has been deployed in backbone widely. A tree-based distributed computing model is discovered, based on the inherent parallel features of BGP. The model is described in two structures for two different system configurations. And the related algorithms are given. The performance promotion is analyzed theoretically. Finally, the promotion is proved by experiments. [ABSTRACT FROM AUTHOR]

The present Internet is not trustworthy, partially because the routing system forwards packets only according to destination IP address. Forged packets with mendacious source IP address will also be brought to the destination, which can be utilized to compromise the destination machine. In this paper, we propose to enhance BGP by adding Route Selection Notice functionality. With BGP Route Selection Notice, Autonomous Systems can validate the authenticity of incoming IP packets and filter out improper packets to make routing infrastructure offer support to trustworthy service. BGP Route Selection Notice does not impair the routing function of BGP and with proper design its bandwidth cost and convergence delay is acceptable which is proved by our simulation. [ABSTRACT FROM AUTHOR]

In link-weighted Application Layer Multicast (ALM), each selfish and strategic end-host receiver may cheat in distance measurement to obtain a better position in the ALM tree. Distance cheating of ALM receivers might lead the ALM tree to be sub-optimal and unstable. We proposed a VCG-based cheat-proof mechanism to defend this kind of cheating behavior in previous work. Based on the theoretical framework, a practical algorithm is designed in this paper, which runs distributedly on ALM receivers. The primary characteristic of the distributed algorithm lies in that it is trustworthy to enforce each selfish receiver to fulfill the algorithm truthfully, which is not considered in other similar studies. Simulations results further suggest that the algorithm is effective in defending distance cheating in link-weighted ALM. [ABSTRACT FROM AUTHOR]

A tree structure has been widely used in constructing application-layer overlays. It is known that the instability of a tree will significantly reduce the performance of the overlay. In this paper, we propose a novel stochastic model that captures the (in)stability characteristics of an application-layer multicast tree. Our model has considered various important factors related to the tree stability, and we have derived closed-form solutions to a class of typical multicast trees. Our results offer a better understanding on the (in)stability of application-layer multicast trees, and also suggest three effective enhancements to improve their stability. Keywords: Application-Layer Multicast, Stability, Stochastic model. [ABSTRACT FROM AUTHOR]

Free Network Visible Network is an active media system that uses the possibilities of the new technologies to create new landscapes in the public space by means of the visualization of the data that ow between digital networks. It changes our perception of the world with the "invisible meanings" that are around us. Mixed Reality Technology and Internet Traffic Listening system are adopted in this project in order to visualize, floating in the space, the interchanged information between users of a network. The people are able to experience in a new exciting way about how colorful virtual objects, representing the digital data, are flying around. These virtual objects will change their shape, size and color in relation with the different characteristics of the information that is circulating in the network. By the use of the objects exciting movement through space, users will feel fun and aesthetic entertainment at observing the social digital communications in their physical space and city streets. [ABSTRACT FROM AUTHOR]

This paper studies the topological structure of network using graph-theoretical properties and proposes a topology constructionmethod of regular directed graphs (or digraphs). The diameter of the topological digraph is . In this paper, we also propose a routing algorithm based thistopological structure and find its complexity is O( ).This algorithm has a smaller diameter and easier to construct than the existing algorithms, which can be used of downloading files and defending worms in structured peer-to-peer systems. [ABSTRACT FROM AUTHOR]

The development of modern science requires the equipment grid to provide a scientific collaboration research platform, which can realize remote collaboration and sharing with the key instruments and equipment in wide areas. The reliability and high efficiency of a grid service chain model are key points in creation of a grid equipment system. The π-calculus as powerful process algebra has a specific advantage in modeling and testing the grid service chain model. This research investigates and improves a theoretical analysis and algorithm framework for the modeling, correctness checking and analysis of the π-calculus based equipment grid service chain model. It also studies on the analysis of its logistic structure and flexible modeling for the equipment grid. It would be beneficial to open up a new space in the theoretical and applied research on grid technology and formal methodology based on cross-disciplinary cooperation. [ABSTRACT FROM AUTHOR]

3sons is a distributed overlay network services framework based on hierarchal semi-structured topology. Its excellent characters include good scalability,high utilization rate of network resources and strong robustness. Every node of 3Sons maintains two static neighbors and $\lfloor{logN}\rfloor$ dynamic neighbors, which can guarantee network connectivity and improve the success rate of fuzzy lookup. 3Sons can effectively reduce the average lookup length and improve transmission performance by adjusting dynamic neighbors and optimizing forward routes according to current traffic of network. The simulation results show that 3Sons can get higher lookup success rate with shorter average lookup length, and lower fuzzy lookup workload of network, so that it can better support large-scale overlay service. [ABSTRACT FROM AUTHOR]

The hybrid types of traffic containing traditional data and multimedia streams are delivered in networks. Besides the Best Effort service, Internet has to supply other different services to various types of traffic with multiple priorities. DiffServ architecture is considered to be the promising Internet framework meeting QoS requirements. One of crucial elements in DiffServ is its network node scheme. In this paper, we propose a novel scheme which combines dynamic buffer management with active queue management to assist routers in provisioning loss differentiated services. In order to support several levels of different traffic classes, we extend a dynamic threshold buffer management method in the case of multiple loss priorities. We detail the implementation of the scheme on routers. Simulation results confirmed that our scheme is able to adapt to load changing conditions and offer different guarantees for hybrid traffic flows in terms of their loss priorities. [ABSTRACT FROM AUTHOR]

Protocol Independent Multicast - Sparse Mode (PIM-SM) is the preferred multicast routing protocol currently. But it has the deficiency of high overhead of control messages and it needs to be improved. Stochastic Petri Nets is a soft computing technique that has been widely used in the area of performance evaluation. We improve PIM-SM protocol in this paper by use of Stochastic Petri Nets. The improvement mainly focuses on Register message, Join/Prune message and Bootstrap message. Experiments and analysis using Petri nets suggest that our improvement results in better performance than the current standard of PIM-SM protocol. [ABSTRACT FROM AUTHOR]

In the semi-structured Chord(S-Chord), every node maintains two static neighbors and O(logN) dynamic neighbors, which can guarantee network connectivity and improve the success rate of fuzzy lookup. It can effectively reduce the average lookup length and improve transmission performance by adjusting dynamic neighbors and optimizing forward routes according to current traffic of network. The simulation results show that the semi-structured Chord can get higher lookup success rate with shorter average lookup length, and lower fuzzy lookup workload of network, so it can better support large-scale overlay service. [ABSTRACT FROM AUTHOR]

In order to provide QoS guarantees for data transmission, we developed the QoS router, which can seek feasible paths subject to QoS requirements for the IP packets. However, the QoS router cannot be deployed extensively in the Internet because the current routers need to be modified. Based on the overlay network, we propose QoS Routing Network (QOSRN), which consists of fewer QoS routers and virtual links. We go further by researching into the impact of the arrangement of QoS routers upon the performance of QOSRN. Extensive simulations show that by adopting reasonable arrangement scheme, e.g. deploying border routers first, QOSRN achieves high performance without increasing the load of the network excessively. The research result can give some guidance to the construction of the overlay network that provides QoS guarantees. [ABSTRACT FROM AUTHOR]

IP traceback is an important task in Internet security area. Techniques have been developed to deploy in pure IP network, but, to date, no system has been presented to use the facility of MPLS in MPLS-enabled network. We present Overlay Logging, a technique combines the hash based logging (SPIE) and the convenience of setup overlay network in MPLS network. Our system can achieve a relatively lower false positive rate than SPIE, needs less hardware investment, and reduces the storage pressure. It is impervious to multi-path routing in the network. What's more, the network overhead and configuration cost of our system is low. [ABSTRACT FROM AUTHOR]

Chapter 39 of the book "Health Systems Performance Assessment" is presented. The chapter introduces a method for estimating the household's financial contribution (HFC) from household survey data. It presents the framework for analysis and the definition of the numerator and denominator of HFC. It describes in detail the calculation of households' health system payments through different payment mechanisms and the measurement of capacity to pay. The chapter also describes some remaining challenges concerning the measurement of capacity to pay.

Chapter 41 of the book "Health Systems Performance Assessment" is presented. The chapter investigates empirically the sources of inequality underlying the fairness in financial contribution (FFC) index. It introduces the approach used to decompose the observed unfairness into vertical, extreme horizontal, and moderate horizontal inequality. It also reports the empirical results on the effects of removing the various inequality components from total unfairness.

Chapter 42 of the book "Health Systems Performance Assessment" is presented. The chapter explores the conditions under which catastrophic health expenditures occur more frequently taking advantage of the increasing household income and expenditure surveys that are available. It defines catastrophic health expenditure in relation to a households' capacity to pay. It also presents the results of an analysis of household surveys from 59 countries demonstrating an increased proportion of households facing catastrophic payments from health expenses.

Chapter 40 of the book "Health Systems Performance Assessment" is presented. The chapter develops a justification for the choice of a summary measure for the household financial contribution (HFC) distribution. It discusses various desirable properties that the measure should possess. It presents an overview of the survey data used in the analysis. It also presents some common measures of income inequality and proposes a new measure, called the fairness in financial contribution index (FFC).

Chapter 38 of the book "Health Systems Performance Assessment" is presented. The chapter illustrates the two different approaches to analyzing the consequences of household health system contributions using household survey data from 59 countries. It reviews some core principles that underlie both the income and burden approaches. It also examines the income approach and gives an overview of the statistical indices that are used in this context to summarize the distribution.