共查询到20条相似文献,搜索用时 875 毫秒
1.
无向双环网络G(N;±1,±s)的直径求解算法 总被引:3,自引:1,他引:3
提出无向双环网络G(N;±1,±s)的直径求解算法,利用VB6.0作为编程语言、SQLServer2000作为数据库来实现这一算法,对任意给定N,而2≤s≤N-1的这样一族无向双环网络的直径都可以计算出来,结果存入数据库,并且利用VB6.0的控件MSChart来模拟显示计算结果。找出了该族无向双环网络直径的分布特点:具有最大值、最小值和中间对称性;对任意N,有不少s使得G(N;±1,±s)紧优或几乎紧优。验证了Boesch和Wang等提出的无向双环网络G(N;±1,±s)的直径下界,给出了一个新的直径上界公式。 相似文献
2.
方木云 《计算机技术与发展》2004,14(12)
提出无向双环网络G(N;±1,±s)的直径求解算法,利用VB6.0作为编程语言、SQL Server2000作为数据库来实现这一算法,对任意给定N,而2≤s≤N-1的这样一族无向双环网络的直径都可以计算出来,结果存入数据库,并且利用VB6.0的控件MSChart来模拟显示计算结果.找出了该族无向双环网络直径的分布特点:具有最大值、最小值和中间对称性;对任意N,有不少s使得G(N;±1,±s)紧优或几乎紧优.验证了Boesch和Wang等提出的无向双环网络G(N;±1,±s)的直径下界,给出了一个新的直径上界公式. 相似文献
3.
利用最小生成树对非单位步长的双环网络G(N;r,s)进行研究,并借助C#编程语言提出仿真算法。对任意给定的N,1≤r≠s〈N,可以得出所有紧优的双环网络G(N;r,s)。仿真结果证明对于双环网络G(N;r,s),在r=1时,双环网络的直径d(N;1,s)以s的中心对称分布;在r≠1的情况下,有许多r,s可以使G(N;r,s)达到紧优;双环网络的最小生成树不包含三层以上的满二叉树。 相似文献
4.
5.
基于前人提出的双环网络G(N;r,s)的分步直径求解法,提出了一个等价树直径求解方法,得到一个新的研究双环网络的拓扑结构-等价树;研究了双环网络等价树的性质并给出了等价树的构造算法;给出了双环网络直径d(N;r,s)的显示公式;利用C#编程语言对等价生成树的结构模型进行了仿真实现;对任意给定的N,1≤r≠s相似文献
6.
利用最小生成树对非单位步长的双环网络G(N;r,s)进行研究,并借助C#编程语言提出仿真算法.对任意给定的N,1≤r≠s<N,可以得出所有紧优的双环网络G(N;r,s).仿真结果证明对于双环网络G(N;r,s),在r=1时,双环网络的直径d(N;1,s)以s的中心对称分布;在r≠1的情况下,有许多r,s可以使G(N;r,s)达到紧优;双环网络的最小生成树不包含三层以上的满二叉树. 相似文献
7.
有向双环网络G(N;1,h)(N是节点数,1和h是步长)是重要的互联网络结构。给出了有向双环网络G(N;1,h)的若干性质。作为这些性质的两个应用,给出一类有向双环网络的直径公式,以及这类有向双环网络的单播路由算法,这个算法是简单且最优的。 相似文献
8.
对紧优双环网络G(N;1,s)的直径求解算法做了研究,提出基于生成树的紧优双环网络G(N;1,s)求解算法,给出了双环网络的直径d(N;1,s)公式.对生成树的性质做了研究。利用C#作为编程语言来实现这一算法,并对生成树的结构模型进行了仿真实现。验证了双环网络直径的分布特点:具有最大值、最小值和中间对称性。对任意给定N而2≤s≤N-1的这样一系列双环网络中的所有的紧优双环网络都可以计算出来。该算法的时间复杂度为O(N)。 相似文献
9.
步长有限制的双环网络的最优路由算法 总被引:25,自引:0,他引:25
双环网络G(n;h)(n是结点数,1和h是步长)是重要的互联网络结构.目前人们已提出了几种最优路由算法,其时间复杂性至少为O(√n).该文考虑步长h有限制的双环网络G(n;h)的最优路由问题,证明了当h满足某个不等式时,可得到G(n;h)的直径显公式和常数时间的最优路由算法,确切地说,至多只要6次算术运算或比较即可确定源结点0到任一个目标结点的最短路.这些结果可应用于66族紧优和30族几乎紧优双环网络的无限族,使得对于5≤n≤300的每个n(n=99和187除外),都有G(n;h)含于上述某个无限族中. 相似文献
10.
11.
12.
鉴于异构蜂窝网络(Heterogeneous cellular network,HCN)的自身特性,传统最强信号接入(小区选择)方式已不再适合,新型小区选择方案急需引入。不同于传统接入方案,新型方案应具备平衡各类基站负载的能力。为反映用户资源消耗水平与实现平衡网络负载的目的,设计了一个服务质量(Quality of service,QoS)感知的负载平衡方案。该方案以资源消耗量作为基站负载,且同时拟合了用户服务质量需求。最终,该方案被规划为网络加权效益最大化问题。从规划问题的形式来看,该问题为非线性、混合整数优化问题,因此求解其最优解富于挑战性(尤其针对大规模问题)。为解决该问题,尝试利用对偶分解法设计了一个分布式算法。仿真结果表明,相比于最强信号接入和区域拓展接入,提出的接入方案具有更高的负载平衡水平与更低的呼叫阻塞概率。 相似文献
13.
Luca Becchetti Paola Bertolazzi Carlo Gaibisso Giorgio Gambosi 《Theoretical computer science》2002,270(1-2):341-359
In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks; (ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight. 相似文献
14.
In this paper, optimal static load balancing in a tree hierarchy network that consists of a set of heterogeneous host computers is considered. It is formulated as a nonlinear optimization problem. By parametric analysis, we study the effects of the node processing time on the optimal link flow rate (i.e. the rate at which a node forwards jobs to other nodes for remote processing), the optimal node load (i.e. the rate at which jobs are processed at a node), and the optimal mean response time. We show that the entire network can be divided into several independent sub-tree networks with respect to the link flow rates and node loads. We find that the processing time of a node affects only the link flow rates and the loads of nodes which are in the same sub-tree network. Generally, an increase in the processing time of an arbitrary node causes an increase in the link flow rates of its ancestor nodes and itself, but causes a decrease in the link flow rates of its descendant nodes and its collateral nodes in the same sub-tree network. It also causes a decrease in the load of the node itself, but causes an increase in the loads of other nodes in the same sub-tree network. Furthermore, it causes an increase in the mean response time. By conducting numerical experiments, we find that the node processing time possesses a large influence on the system performance measures. Knowledge of the effects of node processing time is useful in designing networks or making a parametric adjustment to improve the system performance. 相似文献
15.
In a non-static information exchange network, routing is an overly complex task to perform, which has to satisfy all the needs of the network. Software Defined Network (SDN) is the latest and widely used technology in the future communication networks, which would provide smart routing that is visible universally. The various features of routing are supported by the information centric network, which minimizes the congestion in the dataflow in a network and provides the content awareness through its mined mastery. Due to the advantages of the information centric network, the concepts of the information-centric network has been used in the paper to enable an optimal routing in the software-defined networks. Although there are many advantages in the information-centric network, there are some disadvantages due to the non-static communication properties, which affects the routing in SDN. In this regard, artificial intelligence methodology has been used in the proposed approach to solve these difficulties. A detailed analysis has been conducted to map the content awareness with deep learning and deep reinforcement learning with routing. The novel aligned internet investigation technique has been proposed to process the deep reinforcement learning. The performance evaluation of the proposed systems has been conducted among various existing approaches and results in optimal load balancing, usage of the bandwidth, and maximization in the throughput of the network. 相似文献
16.
Comparator networks for constructing binary heaps of size n are presented which have size
and depth
. A lower bound of
for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in the size of heap construction networks. 相似文献
17.
Shortcut Switching Strategy in Metro Ethernet networks 总被引:1,自引:0,他引:1
IEEE Spanning Tree Protocol (STP) is a layer-2 protocol which provides a loop-free connectivity across various network nodes. STP does this task by reducing the topology of a switched network to a tree topology where redundant ports are blocked. Blocked ports are then kept in a standby mode of operation until a network failure occurs. In STP, there is not any traffic engineering mechanism for load balancing. This results in uneven load distribution and bottlenecks especially close to the Root. This protocol imposes a severe penalty on the performance and scalability of Metro Ethernet networks, since it makes inefficient use of links and switches. In this paper, we propose a novel switching strategy named Shortcut Switching Strategy (SSS) that uses blocked ports to forward frames in some special and restricted cases. It is an improved version of the standard STP and its main advantages are simplicity and backward-compatibility. Shortcut Switching Strategy decreases the average traffic volume on links and switches, improves load balancing on links and switches and reduces the Bandwidth Blocking Probability. We will demonstrate these improvements by using analytical and simulation methods for some well-known topologies. Simulation results show that using SSS can give about 25% reduction in average link loads, average switch loads and average number of hop counts compared to STP. 相似文献
18.
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments [Han Min Wong, Bharadwaj Veeravalli, Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times, IEEE Trans. Parallel Distrib. Syst. 15 (3) (2004) 273–288; Han Min Wong, Bharadwaj Veeravalli, Gerassimos Barlas, Design and performance evaluation of load distribution strategies for multiple divisible loads on heterogeneous linear daisy chain networks, J. Parallel Distrib. Comput. 65 (12) (2005) 1558–1577]. We show using a very simple example that their approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in both the above-mentioned references, an optimal schedule has an infinite number of installments. Therefore such a cost model should not be used to design practical multi-installment algorithms. 相似文献
19.
In this paper, we investigate the performance of routing and rate allocation (RRA) algorithms in rate-based multi-class networks. On the arrival of a connection request, an RRA algorithm selects a route for the connection and allocates an appropriate rate on the route; failing this, it blocks the connection request. We measure the performance of an RRA algorithm in terms of its minimum weighted carried traffic. This performance criterion encompasses two widely used performance criteria, namely, weighted carried traffic and minimum carried traffic. We derive an upper bound on the minimum weighted carried traffic of any RRA algorithm. The bound can be computed by solving a linear program. Moreover, we show that the bound is achieved asymptotically, when the offered load and the link capacities are large, by a Partitioning RRA algorithm. Therefore the bound can be used as a performance benchmark for any RRA algorithm. We observe that the proposed Partitioning RRA algorithm, though asymptotically optimal, performs poorly at very low loads. We investigate the cause of this undesirable behaviour and obtain two improved asymptotically optimal RRA algorithms. 相似文献
20.
Mesh network is very popualr and important topological structure in parallel computing. In this paper,we focus on the fault tolerance of 3-dimensional mesh. We use the probability model to analyze the fault tolerance of mesh. To simplify our analysis, we assume the failure probability of each node is independent. We partition a 3-dimensional mesh into smaller submeshes and compute the probability with which each submesh satisfies the condition we define. If each submesh satisfies the condition, then the whole mesh is connected. We then compute the probability that a 3-dimensional mesh is connected assuming each node has a failure probability p. We use mathematical methods to derive a relationship between network node failure probability and network connectivity probability. Our simulations show that 3-dimensional mesh networks can remain connected with very high probability in practice. For example, the paper formally proves that when the network node failure probability is bounded by 0.05%, 3-dimensional mesh network of more than two hundred thousand nodes remain connected with probability larger than 99%. Theoretical and experimental results show that our method is powderful technique to calculate the lower bound of the connectivity probability of mesh network. 相似文献