# US 2014/0195366 A1 · Incremental valuation based network capacity allocation

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

- Number: US 2014/0195366 A1
- Document ID: US20140195366A1
- Status: Published application
- Kind: A1
- Application number: 13/738,972
- Filed: 2013-01-10
- Published: 2014-07-10
- Earliest claimed: 2013-01-10
- Assignees: Microsoft Corporation
- Applicants: Microsoft Corporation
- Inventors: Gregory Joseph McKnight; David T. Harper, III; Christopher Hanaoka; Eric C. Peterson; Ming Zhang
- Web page: https://patentgrep.com/patent/US20140195366A1

## CPC

- G06Q 30/08: Auctions
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A bid-based network sells network capacity on a transaction-by-transaction basis in accordance with bids placed on transactions. A transaction is the transmission of a quantum of data across at least some portion of the network, where the quantum of data can be as small as a single packet. Bids for network capacity are ranked in order of monetary value, or other criteria relevant to the network service provider. The amount charged to the highest bidder is based on the maximum bid of the next highest bidder. Bids are evaluated on a real-time basis at the time when the link is ready to transmit data. An automated system makes individual bids at each link through which data is transmitted and can take into account additional criteria that can be specified as part of the bid information, including latency and routing requirements. Bid information is passed with data through the network.

## Claims

### Claim 1

A computing device transmitting a quantum of data across a link in a computer network, the computing device performing steps comprising:
receiving a quantum of data and associated bid information;
generating a bid, based on the associated bid information, for a transmission of the received quantum of data across an outbound link; and
transmitting the received quantum of data across the outbound link only if the generated bid was selected.

### Claim 2 (depends on 1)

The computing device of claim 1, wherein the associated bid information comprises information indicating a remaining amount of an aggregate bid, the aggregate bid representing a bid for an end-to-end transmission of the quantum of data, the outbound link being only one link among multiple links in the end-to-end transmission; and wherein further the generating the bid comprises generating the bid to equal the remaining amount of the aggregate bid.

### Claim 3 (depends on 1)

The computing device of claim 1, wherein the associated bid information comprises information indicating a remaining amount of an aggregate bid, the aggregate bid representing a bid for an end-to-end transmission of the quantum of data, the outbound link being only one link among multiple links in the end-to-end transmission; and wherein further the generating the bid comprises generating the bid to equal a predefined portion of the remaining amount of the aggregate bid.

### Claim 4 (depends on 1)

The computing device of claim 1, further performing steps comprising: receiving latency requirements associated with the quantum of data; and wherein the generating the bid comprises generating the bid only if the latency requirements associated with the quantum of data are still being satisfied.

### Claim 5 (depends on 1)

The computing device of claim 1, further performing steps comprising: receiving routing information associated with the quantum of data; and selecting the outbound link from among multiple different outbound links, the selecting being informed by the received routing information.

### Claim 6 (depends on 1)

The computing device of claim 1, further performing steps comprising: selecting the outbound link from among multiple different outbound links, the selecting being informed by historical pricing information associated with the multiple different outbound links, the historical pricing information having been established through a bid selection process.

### Claim 7 (depends on 1)

The computing device of claim 1, wherein the quantum of data is a single packet.

### Claim 8

A computing device selecting a quantum of data for transmission across a link in a computer network, the computing device performing steps comprising:
obtaining a first bid for a transmission of a first quantum of data across the link;
obtaining a second bid for a transmission of a second quantum of data across the link, the second quantum differing from the first quantum;
sorting, when the link is ready to transmit data, the first and second bids in accordance with a sort criteria;
selecting a highest of the sorted first and second bids; and
transmitting across the link a quantum of data associated with the selected bid.

### Claim 9 (depends on 8)

The computing device of claim 8, wherein the sort criteria is a monetary amount of a bid.

### Claim 10 (depends on 8)

The computing device of claim 8, further performing steps comprising: establishing, as an amount to be charged for the transmission, across the link, of the quantum of data associated with the selected bid an amount one increment greater than a value of a next highest bid from among the sorted first and second bids.

### Claim 11 (depends on 8)

The computing device of claim 8, further performing steps comprising: receiving a quantum of data and associated bid information; and generating a bid, based on the associated bid information, for a transmission of the received quantum of data across the link.

### Claim 12

A method of providing access to a computer network, the method comprising the steps of:
receiving a quantum of data for transmission across the computing network;
receiving bid information for the transmission of the quantum of data across the computing network;
generating a bid, from the bid information, for the transmission of the quantum of data across at least some of the computing network;
sorting, in accordance with a sorting criteria, the generated bid with other bids that are for transmission of other quanta of data across the at least some of the computing network; and
transmitting, across the at least some of the computing network, a quantum of data associated with a highest bid after the sorting.

### Claim 13 (depends on 12)

The method of claim 12, wherein the at least some of the computing network consists of a single link of the computing network.

### Claim 14 (depends on 12)

The method of claim 12, further comprising the steps of: charging a customer, for the transmitting the quantum of data across the at least some of the computing network, an amount one increment greater than a value of a next highest bid from among the sorted bids.

### Claim 15 (depends on 12)

The method of claim 12, wherein the sort criteria is a monetary amount of a bid.

### Claim 16 (depends on 12)

The method of claim 12, further comprising the step of: presenting historical pricing information for the computer network on a per-link basis, each link indicating a prior amount charged to transmit data across that link.

### Claim 17 (depends on 16)

The method of claim 16, further comprising the step of: preprocessing the historical pricing information to generate metrics aiding in capacity planning.

### Claim 18 (depends on 16)

The method of claim 16, further comprising the step of: selecting a link for which to generate the bid from among multiple different links, the selecting being informed by the historical pricing information.

### Claim 19 (depends on 12)

The method of claim 12, further comprising the step of: receiving routing information associated with the quantum of data; and selecting a link for which to generate the bid from among multiple different links, the selecting being informed by the routing information.

### Claim 20 (depends on 12)

The method of claim 12, wherein the sorting occurs at a time when the at least some of the computing network is ready to transmit data.
