# US 2010/0169891 A1 · Method and apparatus for locating load-balanced facilities

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0169891 A1
- Document ID: US20100169891A1
- Status: Published application
- Kind: A1
- Application number: 12/347,810
- Filed: 2008-12-31
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: AT&T Intellectual I, L.P.
- Inventors: Shankar Krishnan
- Web page: https://patentgrep.com/patent/US20100169891A1

## CPC

- G06F 9/5072: {Grid computing}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- H04L 41/145: {involving simulating, designing, planning or modelling of a network}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method and apparatus for providing a facility location plan for a network with a V-shaped facility cost are disclosed. For example, the method receives an event from a queue, wherein the event comprises an open event or a tight event. The method connects a plurality of adjacent clients to a facility, if the event comprises the open event, and adds a new client-facility edge to a graph comprising a plurality of client-facility edges, if the event comprises the tight event.

## Claims

### Claim 1

A method for providing a facility location plan for a network with a V-shaped facility cost, comprising:
receiving an event from a queue, wherein said event comprises an open event or a tight event;
connecting a plurality of adjacent clients to a facility, if said event comprises said open event; and
adding a new client-facility edge to a graph comprising a plurality of client-facility edges, if said event comprises said tight event.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
updating said queue if said event comprises said tight event, and if it is determined that said facility is not to be opened.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
connecting a new client to said facility if said event comprises said tight event, and if it is determined that said facility is opened.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
withdrawing a contribution of said new client from other facilities.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
updating said queue.

### Claim 6 (depends on 1)

The method of claim 1, wherein said connecting said plurality of adjacent clients to said facility comprises opening said facility prior to connecting said plurality of adjacent clients to said facility.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
withdrawing contributions of said plurality of adjacent clients from other facilities.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
updating said queue.

### Claim 9

A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform steps of a method for providing a facility location plan for a network with a V-shaped facility cost, comprising:
receiving an event from a queue, wherein said event comprises an open event or a tight event;
connecting a plurality of adjacent clients to a facility, if said event comprises said open event; and
adding a new client-facility edge to a graph comprising a plurality of client-facility edges, if said event comprises said tight event.

### Claim 10 (depends on 9)

The computer-readable medium of claim 9, further comprising:
updating said queue if said event comprises said tight event, and if it is determined that said facility is not to be opened.

### Claim 11 (depends on 9)

The computer-readable medium of claim 9, further comprising:
connecting a new client to said facility if said event comprises said tight event, and if it is determined that said facility is opened.

### Claim 12 (depends on 11)

The computer-readable medium of claim 11, further comprising:
withdrawing a contribution of said new client from other facilities.

### Claim 13 (depends on 12)

The computer-readable medium of claim 12, further comprising:
updating said queue.

### Claim 14 (depends on 9)

The computer-readable medium of claim 9, wherein said connecting said plurality of adjacent clients to said facility comprises opening said facility prior to connecting said plurality of adjacent clients to said facility.

### Claim 15 (depends on 14)

The computer-readable medium of claim 14, further comprising:
withdrawing contributions of said plurality of adjacent clients from other facilities.

### Claim 16 (depends on 15)

The computer-readable medium of claim 15, further comprising:
updating said queue.

### Claim 17

An apparatus for providing a facility location plan for a network with a V-shaped facility cost, comprising:
means for receiving an event from a queue, wherein said event comprises an open event or a tight event;
means for connecting a plurality of adjacent clients to a facility, if said event comprises said open event; and
means for adding a new client-facility edge to a graph comprising a plurality of client-facility edges, if said event comprises said tight event.

### Claim 18 (depends on 17)

The apparatus of claim 17, further comprising:
means for updating said queue if said event comprises said tight event, and if it is determined that said facility is not to be opened.

### Claim 19 (depends on 17)

The apparatus of claim 17, further comprising:
means for connecting a new client to said facility if said event comprises said tight event, and if it is determined that said facility is opened.

### Claim 20 (depends on 19)

The apparatus of claim 19, further comprising:
means for withdrawing a contribution of said new client from other facilities.
