Browse Prior Art Database

Method for Pool Element Load Balancing for Registrars in a Reliable Server Pool

IP.com Disclosure Number: IPCOM000129193D
Original Publication Date: 2005-Sep-30
Included in the Prior Art Database: 2005-Sep-30
Document File: 5 page(s) / 531K

Publishing Venue

Motorola

Related People

Gregory Cox: AUTHOR [+2]

Abstract

This document describes a method of balancing the load on RSerPool registrars when servers dynamically enter and leave a pool. A new method for balancing the pool element load amongst the registrars is described. Simulation results showing the advantage of this method are presented.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 40% of the total text.

Document Title:  Method for Pool Element Load Balancing for Registrars in a Reliable Server Pool

Authors’ Names: Gregory Cox and Aron Silverton

Abstract

This document describes a method of balancing the load on RSerPool registrars when servers dynamically enter and leave a pool.  A new method for balancing the pool element load amongst the registrars is described.  Simulation results showing the advantage of this method are presented.

Description of Problem

Reliable server pooling is addressed by the emerging IETF RSerPool standard.  (see [2]) According to the current drafts, Pool Elements (PEs) provide services.  Registrars (also known as name servers or Endpoint Name Resolution Protocol (ENRP) servers) keep track of what PEs are available, mapping pool handles to lists of pool elements when queried by Pool Users (PUs).  (ENRP details in [3]) Pool Users (PUs) communicate with registrars using the Aggregate Server Access Protocol (ASAP).  (see [1]) According to the current drafts, PEs associate with a home registrar and conduct their updates with that registrar using ASAP.  Registrars maintain the namespace of the server pool, providing mappings from pool handles to pool members.  The registrars maintain synchronization with each other using ENRP.  According to the current RSerPool drafts, PEs and registrars may dynamically enter and leave a system.  One undesirable implication of the current drafts is that early-arriving registrars become disproportionately loaded with PEs relative to late-arriving registrars.  The current drafts do not address how to balance PE loading among registrars.  The present invention addresses how to dynamically maintain the balance loading of PEs among registrars using a flexible, distributed, utility metric-based approach.

A simple simulator in ANSI C was created to support and refine this invention.  The following characteristics summarize the example scenario used this disclosure’s simulations:

 

  • The simulation runs from time 1 to time 100 in discrete, integer time steps.
  • Up to three registrars are present in the simulation.  Registrar 1 lives for the entire simulation.  Registrars 2 and 3 live for a contiguous subset of the simulation time.  That is, they come online and provide service, then they die and another registrar takes over their loads, if necessary.  The nearest available registrar takes over for an exiting registrar.
    • Registrar 1 lives from time 1 to time 100
    • Registrar 2 lives from time 13 to time 94
    • Registrar 3 lives from time 17 to time 51
  • Pool elements also live for a contiguous subset of the simulation time.  They come alive, select a registrar, and die.  A total of 25 pool elements are simulated, although a maximum of 23 are alive at any given point in the example simulation. Pool Element activity is illustrated in the total registrar population shown in Figure 1.
  • Topology is simplified to 1 dimension.  A Pool Element always selects the nearest registrar available as its...