Load sharing system for computer network protocols (original) (raw)
Related papers
2015
A satellite communication system comprising a hub and plu rality of terminals may be divided into multiple segments, wherein each segment may support part of the terminals. A method for decentralized balancing of traffic between the system segments is presented herein. One segment in each coverage beam may be designated as home carrier and include load balancing information. The terminals may be configured to tune on a home carrier, receive the load balanc ing information and then use it for selecting a least loaded segment on which they may remain operational until reset or powered off. In some embodiments of the invention, said load balancing information may be used for calculating relative probabilities for selecting segments through a weighted ran dom selection algorithm.
This paper introduces a new mechanism for load balancing in a network. Load balancing is a computer networking method for distributing workload across multiple computing resources such as computers, a computer cluster network links ,central processing units or disk drives. Load Balancing is usually provided by dedicated software or hardware, such as a multilayer switch or Domain Name System Sever Process. There are various algorithms to perform load balancing. In this paper we will discuss how to perform load balancing using heaps and discuss the advantage and disadvantages of using this method to perform load balancing.
US9083728 Systems and methods to support sharing and exchanging in a network
US9083728, 2015
Embodiments of the invention provide for providing support for sharing and exchanging in a network. The system includes a memory coupled to a processor. The memory includes a database comprising information corresponding to first users and the second users. Each of the first users and the second users are facilitated for sharing or exchanging activity, service or product, based on one or more conditions corresponding thereto. Further, the memory includes one or more instructions executable by the processor to match each of the first users to at least one of the second users. Furthermore, the instructions may inform each of the first users about the match with the at least one of the second users when all the conditions are met by the at least one second user based on the information corresponding to each of the second users.
Implementation of the load balancing algorithm over a local area network and the internet
2004
In this paper, experimental evaluation of the load balancing algorithm in real environments is presented. We emphasize the effects of delays on the exchange of information among nodes, and the constraints these effects impose on the design of a load balancing strategy. Two testbeds in two different real environments have been built; the first implementation was over a local area network whereas the second was over Planet-Lab. The results show the effect of network delays and variances in the task processing time on choosing adequate gain values for the load balancing algorithm.
Scalable, adaptive load sharing for distributed systems
IEEE Parallel & Distributed Technology: Systems & Applications, 1993
@ 716isflexible loadsharing akorithm achieves scalability by partitioning a system into domains. Each node dynamically and adaptively selects other nodes to be included in its domain. An earlier version of this amcle appeared as "Scalable Load Sharing for Dismbuted Systems," on pp. 632-641 of the Proceedings of the 26th Hawaii Internatiunal Conference un System Scimes, published in 1993 by IEEE Computer Society Press, Los Alamitos, Calif. A distributed application consists of several software components that execute on one or more nodes of a distributed system and cooperate to provide some service. Requests to create an application, which translate into one or more com-I ponents, may arrive randomly at nodes. As a result, some nodes can be heavily loaded while others are lightly loaded or even idle, resulting in poor system performance. Load-sharing algorithms try to improve performance by distributing the components more evenly. Such algorithms can be beneficial even when 50 to 70 percent of the components are not eligible for remote execution.' AfZexible load-sharing algorithm must be general, adaptable, stable, scalable, fault tolerant, and transparent to the application.2 Scalability is especially i m p~r t a n t :~ Future distributed systems will have many interconnected computers and even more objects (such as hardware and software components). But with few exceptions," load-sharing algorithms are not scalable: Their mechanismssuch as broadcastcreate intolerable overhead or congestion in systems with more than several dozen node^.^-^ Adaptive load-sharing algorithms usually have two basic functions: disseminating information about a system's nodes and deciding how to allocate application components among them. These functions are sufficient if we limit the number of nodes, but scalability requires the algorithm's constructs to be independent of system size and physical topology. The algorithm should also have minimum sensitivity to the system's physical characteristics, such as communication bandwidth and latency.
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation, 1986
One goal of locally distributed systems is to facilitate resource sharing. Most current locally distributed systems, however, share primarily data, data storage devices, and output devices; there is little sharing of computational resourees. Load shoring is the process of sharing computational resources by transparently distributing the system workload.
Computer network development to achieve resource sharing
1970
In this paper a computer network is defined to be a set of autonomous, independent computer systems, interconnected so as to permit interactive resource sharing between any pair of systems. An overview of the need for a computer network, the requirements of a computer communication system, a description of the properties of the communication system chosen, and the potential uses of such a network are described in this paper.