We propose two novel network layer primitives, and later adopted them as the foundation for implementing our NTAG overlay multicast protocol. The notion of NTAG originates from its former version of TAG, which exploit...
详细信息
We propose two novel network layer primitives, and later adopted them as the foundation for implementing our NTAG overlay multicast protocol. The notion of NTAG originates from its former version of TAG, which exploits network topology information to optimize the overlay tree in terms of delay penalty and link stress. However, NTAG has prominent advantages over traditional approaches. Unlike multicasting at the network layer, the novel primitives only belong to the control path and avoid problems pertaining to IP multicast On the other hand, the network support significantly reduces the complexity of the overlay multicast routing algorithm. Through a large amount of simulations, we have proven that NTAG is not only efficient in its overlay transmission but also effective when supported in an incremental manner.
In the research of Network-on-Chip(NoC), after a new routing algorithm is devised, its performance should be evaluated by a lot of simulations. In these simulations, a large number of traffic scenarios, such as unifor...
详细信息
In the research of Network-on-Chip(NoC), after a new routing algorithm is devised, its performance should be evaluated by a lot of simulations. In these simulations, a large number of traffic scenarios, such as uniform random, transpose, tornado, etc. have been taken into consideration. However, there is lack of comparative study of these traffic scenarios in the literature. In this paper, the routing pressures of ten routing algorithms are compared under 1,000,000 traffic scenarios. Then simulations are carried out under more than 100 traffic scenarios. The computation and simulation results show that if a routing has small routing pressure and good performance under both transpose1 and transpose2 traffics, then poor performance will not be achieved under any other traffic scenario, with high probability.
This paper presents a hierarchical model of logistics delivery networks by using some principles in graph *** on the proposed hierarchical model,an optimal solution for dynamically configuring the resources of logisti...
详细信息
This paper presents a hierarchical model of logistics delivery networks by using some principles in graph *** on the proposed hierarchical model,an optimal solution for dynamically configuring the resources of logistics delivery networks is devised through setting the appropriate value for the weight of edges in the model,which aims at minimizing the total traffic cost of a delivery *** solution then employs an amended Dijkstra routing algorithm to determine a traffic path in the hierarchical model for a logistics delivery *** effects of this solution were compared with the other two traditional delivery solutions from the aspects of traffic costs and the network blocking ratio,which shows the proposed solution achieved a satisfying performance.
There are many structured P2P systems that use DHT technologies to ma Pdata items onto the nodes in various ways for scalable routing and *** of them require O(logn)hops per lookup request with O(logn)neighbors per no...
详细信息
There are many structured P2P systems that use DHT technologies to ma Pdata items onto the nodes in various ways for scalable routing and *** of them require O(logn)hops per lookup request with O(logn)neighbors per node,where n is the network *** this paper we present a new oonstant-degree P2P architecture,which emulates a Generalized Peterson(GP) graph in routing of lookup *** analysis the properties of the Generalized Peterson graph and give the routing algorithm and the self-organization such as nodes join and departure.
Kademlia is a famous routing algorithm based on distributed hash table and it established a new topological relation in P2P ***,some shortages in searching efficiency and the strategy of cache need to *** paper introd...
详细信息
Kademlia is a famous routing algorithm based on distributed hash table and it established a new topological relation in P2P ***,some shortages in searching efficiency and the strategy of cache need to *** paper introduces a method to improved Kademlia *** improved,the new algorithm not only inherits the advantages of Kademlia but also improve query efficiency
Intelligent Transportation System (ITS) technology is often aimed at improving vehicle safety and mobility. Lately a number of ITS applications are also focusing on environmental issues such as reducing greenhouse gas...
详细信息
ISBN:
(纸本)9781467327534
Intelligent Transportation System (ITS) technology is often aimed at improving vehicle safety and mobility. Lately a number of ITS applications are also focusing on environmental issues such as reducing greenhouse gases (through improved fuel economy) and reducing overall pollutant emissions. Typical environmental ITS applications (e.g., eco-routing) focus on reducing total mass vehicle emissions for generalized areas. To date however, environmental ITS applications haven't considered emissions from a pollutant exposure point-of-view. In this paper, we introduce a new vehicle routing methodology that goes beyond minimizing overall pollutant emissions, instead minimizing pollutant exposure to localized populations along roadways. As part of this effort, a unique modeling suite has been developed to allow for the evaluation of environmental ITS applications from a traffic emissions exposure point of view. For the routing algorithm, the human intake fraction that is commonly used for quantifying emission exposure is modeled and used as a routing cost. Experimental modeling results show that the intake fraction of particulate matter for 5-14 year-old school children on school days can be reduced approximately 80% - 90% on a typical schoolday with the implementation of intelligent routing algorithms.
Autonomous navigation using an inter-satellite ranging and communication with inter-satellite links(ISL) is the trend of satellite navigation system development. By controlling the direction of phased array antenna fl...
详细信息
Autonomous navigation using an inter-satellite ranging and communication with inter-satellite links(ISL) is the trend of satellite navigation system development. By controlling the direction of phased array antenna flexibly, the directional crosslink can achieve more information from other satellites. However, the efficiency of communication is affected at the same time. In this paper, we analyse the navigation satellite network assembled directional crosslink, and then we propose a solution to describe the progress of information transmission based on building directional graph. Then we present a method of finding Earliest Journey and Shortest Journey. According to simulation result, the method we present is practicable and we also achieve some valuable conclusions.
It has been recognized that light-trees should be as balanced as possible in order to guarantee an adequate signal quality and to scale to large destination sets, if power losses are taken into account when routing co...
详细信息
It has been recognized that light-trees should be as balanced as possible in order to guarantee an adequate signal quality and to scale to large destination sets, if power losses are taken into account when routing connections in mesh WDM networks. In this paper we study the problem of constructing such balanced light-trees. We propose a novel algorithm, called extended shortest path heuristic algorithm (ESPH) and is an extended version of the well known shortest path heuristic (SPH) algorithm, for the problem. The ESPH algorithm aims to minimize the difference between the optimal signal quality and the worst signal quality in the process of constructing light-trees. Simulations on a typical mesh network are conducted to verify the performance of the ESPH algorithm. Results demonstrate that the light-trees constructed by the ESPH algorithm are more balanced than those constructed by the only existing algorithm, called BLT (balanced light-tree algorithm) for the same problem, with a little more cost. Thus light-trees constructed by the ESPH algorithm can provide better signal quality and are more scalable than these constructed by the BLT algorithm.
In the research of Network-on-Chip(No C), network performance is evaluated by a lot of simulations. In these simulations, traffic scenarios play an important role. A wide range of traffic scenarios, such as uniform ra...
详细信息
In the research of Network-on-Chip(No C), network performance is evaluated by a lot of simulations. In these simulations, traffic scenarios play an important role. A wide range of traffic scenarios, such as uniform random, transpose, tornado, etc. have been considered. However, there is lack of comparative study of these traffic scenarios. In this paper, simulations are carried out under a wide range of traffic scenarios. The simulation results show that if a routing has good performance under both transpose1 and transpose2 traffics then it will not have poor performance under any other traffic scenario, with high probability.
暂无评论