This paper considers the network design and control for multipoint-to-multipoint communications. We propose a new routing control method which includes the member connection method and the route setup algorithm. The f...
详细信息
This paper considers the network design and control for multipoint-to-multipoint communications. We propose a new routing control method which includes the member connection method and the route setup algorithm. The former implies that each member has its own route to send information to other members. Thus, it can avoid traffic concentration in a particular route. Further, in the route setup algorithm, all routes are generated in parallel, by adding links which have lower cost and lower load one by one, based on grouping by the number of destination nodes on the route. An interesting feature of the proposed algorithm is that every route can be established with a unified algorithm, even when newcomers join ongoing communications. In addition to the above method, we also propose a network design algorithm. It can make the proposed routing control method more effective. Simulation experiments show that the proposed framework is suitable for multipoint-to-multipoint communications. (C) 2000 Scripta Technica.
Network-on-Chip has become a hot spot in the field of complex System-on-Chip for its effectiveness. The performance of NoC, to a large extent, depends on the router's structure. In this paper, we present a method ...
详细信息
Network-on-Chip has become a hot spot in the field of complex System-on-Chip for its effectiveness. The performance of NoC, to a large extent, depends on the router's structure. In this paper, we present a method based on fault-tolerant hardware structure to solve the problem of instability inhere in routers. We suggest adding bypass into routers and using a dynamic reconfigurable XY-YX routing algorithm; this solution shall ensure effective communications in NoC. Verilog language is used to describe all of the modules in Quartus II environment. We conduct the simulation experiment and area integrated, as well as accomplishes the overall modules’ design using Altera's FPGA. The experiment results show that our design can meet the needs of communication in NoC.
An algorithm of path based timing optimization by buffer insertion is *** algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look up table for gate delay *** heur...
详细信息
An algorithm of path based timing optimization by buffer insertion is *** algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look up table for gate delay *** heuristic method of buffer insertion is presented to reduce *** algorithm is tested by industral circuit *** results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied.
At present, China's sea transportation develops rapidly, the scale is huge, and the rescue work cannot be ignored. Maritime rescue mainly focuses on personnel search and rescue, materials transportation, personnel...
详细信息
At present, China's sea transportation develops rapidly, the scale is huge, and the rescue work cannot be ignored. Maritime rescue mainly focuses on personnel search and rescue, materials transportation, personnel transportation and other work. Due to the influence of hydrological conditions and wind direction, the scope of search and rescue has been expanded, and the workload of search and rescue has increased. At this stage, due to the characteristics of helicopters and rescue ships, there are certain technical shortcomings. This paper analyzes the basic situation of Marine rescue by analyzing the statistical data of Marine rescue, combined with some cases of Marine rescue operations in the current stage, and explores the idea of UAV cluster playing a role in carrying out Marine rescue tasks from the aspects of application characteristics, technical advantages and cost control.
It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), and very often they are also hierarch...
详细信息
It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), and very often they are also hierarchical. Although most of the models are based on stochastic methods, some deterministic constructions have been recently proposed, because this allows a better computation of their properties. Here a new deterministic family of hierarchical networks is presented, which generalizes most of the previous proposals, such as the so-called binomial tree. The obtained graphs can be seen as graphs on alphabets (where vertices are labeled with words of a given alphabet, and the edges are defined by a specific rule relating different words). This allows us the characterization of their main distance-related parameters, such as the radius and diameter. Moreover, as a by-product, an efficient shortest-path local algorithm is proposed.
To design a Banyan network with an arbitrary even-sized port number, the PN2I network is proposed. The PN2I network can be divided into two classes: the complete and incomplete versions. A simple routing algorithm is ...
详细信息
To design a Banyan network with an arbitrary even-sized port number, the PN2I network is proposed. The PN2I network can be divided into two classes: the complete and incomplete versions. A simple routing algorithm is given, but in the incomplete PN2I networks,this routing algorithm fails to make the traffic in links even, which deteriorates the performance badly. Thus a new routing algorithm is proposed, which makes the incomplete PN2I networks behave almost the same as the PN2I networks with respect to the performance issues.
In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have be...
详细信息
In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families of interconnection networks, namely, constant degree networks. In this paper, a new interconnection network named extended star graphs is proposed, and it is proved that the extended star graphs have hypercube structure. We also provide a routing algorithm for node-to-node communication on extended star graphs. Based on the algorithm, we obtain an upper bound 2n-1 on the diameter for the n-th order extended star graph.
In order to reduce the energy consumption and data congestion caused by flooding at the initial stage of the network, the cluster head and the boundary node are used as the key nodes to reduce the data flow in the net...
详细信息
In order to reduce the energy consumption and data congestion caused by flooding at the initial stage of the network, the cluster head and the boundary node are used as the key nodes to reduce the data flow in the network, so that the network has better delay performance. Various clustering algorithms in wireless sensor networks and the improved method of clustering protocols are introduced. On the basis of directed diffusion algorithm, a directed diffusion protocol based on CONID clustering is studied. Through the OMNeT++ basic platform, the wireless sensor network simulation platform is built on the basis of the MiXiM module. The platform uses a hierarchical structure, and its network layer implements a directed diffusion protocol based on CONID clustering. The application layer implements the two step WLS localization algorithm. The MAC layer uses the FIexiTP protocol. The physical layer uses the simplest flat path fading model. Because the sensor has both perception and data transmission characteristics, the dual channel communication model is adopted. The platform is suitable for wireless sensor network detection, localization and tracking algorithm simulation. Through the hierarchical function of the platform, it can analyze the practicability and effectiveness of the algorithm in more detail, and has certain value. It can also be used in the simulation of cross layer protocols, and can combine several parameters to perform joint analysis of system performance. Simulation results show that the CONID based directional diffusion protocol has better delay performance than the conventional directed diffusion protocol. Finally, the performance of the two step WLS location protocol is analyzed from several perspectives, which provides an example for the platform.
This paper presents a hierarchical model of logistics delivery networks by using some principles in graph theory. Based on the proposed hierarchical model, an optimal solution for dynamically configuring the resou...
详细信息
This paper presents a hierarchical model of logistics delivery networks by using some principles in graph theory. Based 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 network. The solution then employs an amended Dijkstra routingalgorithm to determine a traffic path in the hierarchical model for a logistics delivery demand. The 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.
Optimization using genetic algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the genetic algorithm. It has been an active area of research to develop...
详细信息
Optimization using genetic algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the genetic algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case where one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and dampen the undesired attitudes. The proposed crossover can be achieved in two stages: The first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system show improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.
暂无评论