Study on Optimal Topology for Computer Local Double Loop Networks

A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter d and average hop distance a for this class of networks are [3N- 2]≤d≤[3N ] and (5N/9 (N-1))-(3N -1.8)<a<(5N/9(N-1)) (3N -0.9),respectively (N is the number of nodes in the network ). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed and analyzed. The correctness of the algorithm has also been verified by simulating.

Literature Review on Network Design Problems in Closed Loop and Reverse Supply Chains

The productivity of an organization is very much affected by non-value adding activity like logistics, which moves the resources from suppliers to factory, raw materials/semi-finished items within the factory and finished goods from factory to customers via a designated distribution channel called as forward logistics. In some cases, parts of the products such as automobiles, computers, cameras, mobile phones, washing machines, refrigerators, garments, footwear and empty glass bottles of beverages, etc. will be brought back to the factories as a product recovery strategy through reverse logistics network which is integrated in a sustainable closed loop supply chain network. So, it is highly essential to optimize the movement of the items in the reverse logistics network. This paper gives a comprehensive review of literature of the design of networks for the reverse logistics as well as for the reverse logistics coupled with forward logistics. The contributions of the researchers are classified into nine categories based on the methods used to design the logistics network.

DISTRIBUTED OPTIMAL LOCAL DOUBLE LOOP NETWORK

A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.

A Routing Algorithm for Distributed Optimal Double Loop Computer Networks

A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.

Remanufacturing closed-loop supply chain network design based on genetic particle swarm optimization algorithm

As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.

Improvement of the Voltage Quality in an Electrical Network via the Loopback: Case of the Southern Interconnected Grid (SIG) of Cameroon

Electricity being a basic national infrastructure for a country, its security, reliability and quality are the most important parameters for the network managers. Several methods are generally used to improve the voltage quality more and more. However, most of the means implemented depend on external factors independent of the network managers or require huge regular financial resources. The method used in this paper is the loopback, applied to the Southern Interconnected Grid (SIG) of Cameroon, which is the largest network in the country. The procedure used takes into account nodes experiencing huge voltage drops and network constraints. The chosen loopback scenario results in a clear improvement of the voltage plan in this network, and also a discharge of the transformers, a considerable decongestion of the lines, a reduction of the power losses and a significant reduction of the thermal placement used for improvement of the voltage profile.

THE ANALYSIS METHOD OF THE SETS OF BRANCHES BASED ON INDEPENDENT LOOPS IN THE ELECTRIC NETWORK

The matrix D describing relations of the loops to the nodes in the graph and also the setsof branches based on the independent loops and their matrix Q are defined.The theorem in whichthe product of the loop-node matrix D multiplied by the incidence matrix Aa is equal to matrix Qis put forward and proved.The admittance matrix Ylc of the sets of the branches is defined and it isassumed that the vector Vlc of voltage of the sets of branches to be a calculative quantity.The equa-tion of the sets of branches is derived and the analysis method of the sets of branches based on theindependent loops in the electric network is presented.

A new algorithm for diameter of double loop network

Presents a new algorithm for diameter of double loop network(DLN) by which two new classes of infinite families of tight DLN of the known twelve infinie families of tight DLNs, under 3.3 in [1] including eleven are constructed.

ON THE FAULT-TOLERANT ROUTING IN DISTRIBUTED LOOP NETWORKS

Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both "Theorem 2" and its proof are in error. A new and more faster O(△)-time, △≤δ, algorithm will be presented in this paper.

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Although clustering is a convenient framework to enable traffic control and service support in Mo- bile Ad hoc NETworks (MANETs), it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is dissemi- nated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop suggests smart route recovery strategy. Our approach is composed of setup procedure, regular procedure and recovery procedure to achieve clustering, routing and emergent route recovering.

Role of Self-Loop in Cell-Cycle Network of Budding Yeast

Study of network dynamics is very active area in biological and social sciences. However, the relationship between the network structure and the attractors of the dynamics has not been fully understood yet. In this study, we numerically investigated the role of degenerate self-loops on the attractors and its basin size using the budding yeast cell-cycle network model. In the network, all self-loops negatively suppress the node (self-inhibition loops) and the attractors are only fixed points, i.e. point attractors. It is found that there is a simple division rule of the state space by removing the self-loops when the attractors consist only of point attractors. The point attractor with largest basin size is robust against the change of the self-inhibition loop. Furthermore, some limit cycles of period 2 appear as new attractor when a self-activation loop is added to the original network. It is also shown that even in that case, the point attractor with largest basin size is robust.

Hardware in Loop Simulation for Emergency Communication Mobile Ad Hoc Network

For the research of mobile Ad hoc network (MANET), hardware in the loop simulation (HILS) is introduced to improve simulation fidelity. The architectures and frameworks of HILS system are discussed. Based on HILS and QualNet network simulator, two kinds of simulation frameworks for MANET multicast emergency communication network are proposed. By running simulation under this configuration and doing experiments with on-demand multicast routing protocol (ODMRP), unicast and multicast functions of this protocol are tested. Research results indicate that HILS method can effectively reduce the difficulty of system modeling and improve precision of simulation, and can further accelerate transition from design to system deployment.

An Integrated Multi-Echelon Model for a Sustainable Closed Loop Supply Chain Network Design

The integration of entire supply and value chain into a closed loop network is gaining more importance in recent times in order to ensure a business to be economically and environmentally sustainable with the changing trends in business and social environments, growing environmental consciousness in the society and government legislations to protect the environment as well as the business. In this context, this paper considers a multi-echelon closed loop supply chain network design with forward and reverse logistics components. An attempt has been made to develop a mixed integer non-linear programming model for this problem with different costs so that the sum of the total cost is minimized subject to different constraints pertaining to capacities of the entities of the system, demands of first customers and second customers. A generalized model is presented and then its application is illustrated using an example problem by solving the model using LINGO14. This model forms as a tool to compare future meta-heuristics to check the closeness of their solutions with corresponding optimal solutions.

Hardware-in-the-loop simulation of communication networks

To enhance the fidelity and accuracy of the simulation of communication networks,hardware-in-the-loop（HITL） simulation was employed.HITL simulation methods was classified into three categories,of which the merits and shortages were compared.Combing system-in-the-loop（SITL） simulation principle with high level architecture（HLA）,an HITL simulation model of asynchronous transfer mode（ATM） network was constructed.The throughput and end-to-end delay of all-digital simulation and HITL simulation was analyzed,which showed that HITL simulation was more reliable and effectively improved the simulation credibility of communication network.Meanwhile,HLA-SITL method was fast and easy to achieve and low-cost during design lifecycle.Thus,it was a feasible way to research and analyze the large-scale network.

A closed-loop Supply Chain Network Equilibrium Model with Fuzzy Demand under Production Capacity Constraints and Price Rigidities

A closed-loop supply chain network equilibrium problem is examined,which consists of mutual competitive manufacturers with production capacity constraints and retailers with fuzzy market demands,mutual competitive collectors as well as a binding price ceiling of the commodities.By utilizing the credibility measure of fuzzy event,variational inequality and Lagrange dual theory,the optimum behaviors of manufactures,retailers,collectors and consumers are described.Therefore,the supply chain network equilibrium model is established.Numerical examples were given to illustrate the impact of production capacity constraints and price ceiling on the network equilibrium pattern.The results show that the shortage of commodities in consumer market will be more serious,the wholesale price of product and purchase price of waste products rise,the profits of retailers decrease,the profits of manufacturers and collectors increase as the government gradually reduce the binding price ceiling on competitive markets,and the trend will be more obvious in the existence of production capacity constraints at same time.

校园网二层环路防治技术研究

作为校园网常见问题,二层环路故障不仅隐蔽性强,而且定位也较为困难。文章分析了二层环路网络故障所带来的危害,给出了具体检测方法和防范措施。研究对于优化校园网运维管理体系,进一步提高校园网的可靠性和稳定性具有一定实践意义。

基于动态磁网络法大型感应电机阻抗参数及起动特性计算

为提高大型感应电机动态阻抗参数及起动特性计算的准确性及计算效率,构建了考虑电机转子转速变化引起气隙磁导变化的非线性动态磁网络模型。以一台6.5 MW大型感应电机为例,分析起动电流变化对电机内各处饱和程度的影响机理,在此基础上,根据磁力线路径及电机内饱和程度确定动态磁网络模型中的非线性磁导的计算方法。将动态磁网络模型与转子趋肤效应模型相结合,提出计及漏磁并考虑转子转速变化及饱和偏移现象的电机动态阻抗参数的计算方法。推导并建立基于转子多回路法的大型感应电机的动态数学模型,根据电机瞬态过程中的电磁耦合关系,确定动态数学模型与磁网络模型的动态耦合求解方法,提出大型电机瞬态过程中考虑电流、转速、饱和及趋肤程度变化的动态阻抗参数及起动特性的计算方法。通过与有限元计算结果及实验结果对比,验证了所提出计算方法的正确性。

基于多导体回路法的AT供电方式长回路电容计算方法研究

提出了一种基于多导体回路法以接触网和正馈线为传输导体的电气化铁路AT供电方式牵引网长回路电容计算方法。该方法以与电荷唯一对应的回路为基本单元,对复杂多导体传输线系统开展电场描述,实现了AT供电方式牵引网长回路电容的精确计算。

极端气象灾害下考虑MESS主动调控的配电网故障恢复策略

针对极端灾害天气下配电网的故障恢复问题,计及极端灾害的时空演变特性,提出了一种利用移动储能(mobile energy storage system,MESS)的灵活性主动参与抑制合环冲击电流,辅助配电网故障恢复的策略。首先,建立了暴风雨等不同气象灾害条件下配电线路的故障率统计模型。其次,将复杂交通网与配电网进行耦合,建立了以最小化MESS调度时空成本的上层预布局模型。然后,分析了MESS出力对冲击电流的影响,以抑制合环冲击电流、最大化负荷恢复率和最小化MESS调度成本为目标,构建了MESS参与网络重构的下层调度模型。最后,在改进的IEEE 123节点系统中进行测试,验证了MESS对配网故障恢复安全性的提升效果。结果表明,采用MESS主动参与调控能够有效应对移动的极端气象灾害引发的配电网动态故障恢复问题,并抑制合解环过程中电流的波动,提升网络重构方案的可行性和增强配电网的韧性。