نتایج جستجو برای: alternative load path

تعداد نتایج: 580279  

2003
Kerr-Jia Lu Sridhar Kota

Synthesis of shape morphing compliant mechanism is inherently different from typical single output problems, due to the multiple output points along the morphing boundary. Two synthesis approaches, using a fixed initial discretization mesh and using a load path representation, have been developed previously to simultaneously address the topology, size, and geometry aspects of a compliant mechan...

2013
S. F. El-Zoghdy

As a result of the rapid growth of computational needs, grid computing is gaining more and more attention. It becomes a viable high-performance alternative to the traditional supercomputing environments. However, grid performance can still be improved by effectively and efficiently utilizing the available grid resources using a good load balancing algorithm. Ant colony optimization is one of th...

2003
Alexander A. Kist Richard J. Harris

Shortest path routing schemes like Open Shortest Path First (OSPF) have shortcomings when networks are highly loaded. Traffic engineering of IP networks is required to avoid this problem. Current efforts suggest the optimisation of OSPF weights to balance the network load more evenly. Also more advanced technologies like Multiprotocol Label Switching (MPLS) are proposed. One major problem of dy...

2001
Daniel Zappala Aaron Fabbri

Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We evaluate the feasibility of using multiple independent cores within a shared multicast tree. We consider several basic designs and discuss how using multiple cores improves fault tolerance without sacrificing router state. We exa...

2006

In Ad hoc networks most on demand routing protocols concentrate on the single path from a source to a destination. Exhaustively using a single path increases traffic load and faster consumes energy of nodes on the path. Therefore, preventing concentration on a single path and distribution of energy and traffic load on whole network is an important issue on Ad hoc networks. Some searching method...

2015
Neha gupta Yusuf Mulge

A sensor network is one of the most adaptive research area that requires the optimization in term of energy effectiveness, load balancing etc. The sensor network is defined under the particular localization architecture and having the challenges in terms of load minimization, energy loss reduction, security etc. One of such common and most adaptive research problem is routing. In this paper, op...

2007
Chao-Lieh Chen Jeng-Wei Lee Jia-Ming Yang Yau-Hwang Kuo

An overlay multicast is proposed to solve the scalability and deployment problems in IP Multicast. We propose a scheme, Topology-aware Load-balance Hierarchical Independent Tree (TLHIT), with topology-aware, load-balance and path diversity properties to improve the performance of overlay multicast. Compared to traditional methods, the proposed TLHIT constructs not only node-disjoint but also pa...

Journal: :Wireless Communications and Mobile Computing 2006
Ming-Shen Jian Peng-Long Wu Chung-Nan Lee

In this paper, we present an on-demand flow regulated routing algorithm (OFRA) for ad hoc wireless networks. The OFRA consists of two parts: an intermediate node load evaluation process and a routing path selection process. The intermediate node load evaluation process evaluates the load efficiency of the intermediate nodes according to bandwidth, data packets and computing capability. The rout...

Journal: :Cognitive Science 1999
Craig S. Miller Jill Fain Lehman Kenneth R. Koedinger

We explored the consequences for learning through interaction with an educational microworld called Electric Field Hockey (EFH). Like many microworlds, EFH is intended to help students develop a qualitative understanding of the target domain, in this case, the physics of electrical interactions. Through the development and use of a computer model that learns to play EFH, we analyzed the knowled...

2005
Shahram Mohrehkesh Saleh Yousefi Mahmoud Fathy

In this paper a new path computation algorithm in Traffic Engineering in MPLS networks for reducing blocking probability of requests is proposed which is an improvement of TEDB algorithm. The TE-DB is one of best path computation algorithm which is proposed in literatures. The Algorithm deploys multiple path routing and distributes the load more balanced n network. In addition, it reduces the b...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید