Real time service advertisement for billing and revenue settlement in a federated model

Patent metadata

Field	Value
Publication number	US-9953327-B2
Application number	US-201113205454-A
Country	US
Kind code	B2
Filing date	Aug 8, 2011
Priority date	Aug 8, 2011
Publication date	Apr 24, 2018
Grant date	Apr 24, 2018

Abstract

Techniques are described for fulfilling a request for services in a federated peering environment. Embodiments receive an advertisement of offered services from each of a plurality of service providers. Such an advertisement may specify a list of offered services and pricing information for the services. A request for one or more services is received from a client at a first service provider. Embodiments determine a second service provider from the plurality of service providers to peer with to dynamically create a federation of peers for fulfilling the service request, based on the received advertisements of offered services and the requested services. Embodiments then peer with at least the determined second service provider to dynamically create a peered federation and fulfill the service request through the created federation of peers.

First claim

We claim:

1. A method for dynamically peering with one or more service providers to fulfill a request for services, comprising:
receiving, by a first service provider, a tagged advertisement of offered services from each of a plurality of service providers, wherein each tagged advertisement specifies at least one service offered by the respective service provider and pricing information for each of the offered services;
receiving, by the first service provider, a request from a client specifying one or more services to be provided for a network connection between a first site and a second site;
determining, by operation of one or more computer processors, a second service provider, from the plurality, to peer with in order to fulfill the request, based on the received tagged advertisements of offered services and the one or more services specified in the request;
determining a route for establishing the network connection between the first site and the second site, wherein the route comprises a path through the network that begins at the first site and ends at the second site, and wherein the path is determined to include both the first service provider and the second service provider offering the requested services;
peering with at least the second service provider to dynamically create a peered federation to fulfill the request; and
establishing the network connection between a first network device of the first site and a second network device of the second site using the determined route that includes both the first service provider and the second service provider, wherein the requested services are provided for the network connection through the peered federation.

2. The method of claim 1 , further comprising:
storing a reference to each offered service in a service catalog at the first service provider; and
responsive to receiving an updated advertisement of offered services from one of the plurality of service providers, updating the service catalog based on the updated advertisement of offered services.

3. The method of claim 1 , wherein the tagged advertisement of offered services contains one or more tags, each of the tags specifying one of a list of offered services, a geographical location where the offered services are hosted, a network location where the offered services are hosted, metadata describing characteristics of the offered services, or metadata describing characteristics of the service provider.

4. The method of claim 1 , further comprising:
generating a proposal specifying the created peered federation including at least the first service provider and the second service provider for use in fulfilling the request; and
transmitting the proposal to the client, wherein peering the first service provider with at least the second service provider is performed responsive to receiving an acceptance of the proposal from the client, and wherein peering the first service provider with at least the second service provider is further based on the accepted proposal.

5. The method of claim 4 , wherein the proposal further specifies i) a first service to be provided through the peered federation and ii) pricing information for providing the first service.

6. The method of claim 1 , further comprising:
calculating a total price for fulfilling the request; and
for each service provider in the peered federation, determining a portion of the calculated total price to be allocated to the service provider, based on the pricing information in the tagged advertisement of offered services received from the service provider and services the service provider is providing to the peered federation to fulfill the request.

7. The method of claim 1 , further comprising:
transmitting a second tagged advertisement of offered services from the first service provider to each of the plurality of service providers wherein the second tagged advertisement specifies at least one or more services offered by the first service provider and pricing information for each of the offered services.

8. The method of claim 1 , wherein determining a second service provider from the plurality of service providers to peer with in order to fulfill the request further comprises:
generating a plurality of proposals for use in fulfilling the request, wherein each proposal specifies a respective one or more service providers for use in fulfilling the request, wherein each of the one or more service providers provides at least one service specified in the request;
transmitting the plurality of proposals to the client; and
receiving a selection of one of the plurality of proposals from the client,
and
wherein peering the first service provider with at least the second service provider is further based on the selected proposal.

9. A computer program product for dynamically peering with one or more service providers to fulfill a request for services, comprising:
computer code that receives, at a first service provider, a tagged advertisement of offered services from each of a plurality of service providers, wherein each tagged advertisement specifies at least one service offered by the respective service provider and pricing information for each of the offered services;
computer code that receives, at the first service provider, a request from a client specifying one or more services to be provided for a network connection between a first site and a second site;
computer code that determines a second service provider, from the plurality, to peer with in order to fulfill the request, based on the received tagged advertisements of offered services and the one or more services specified in the request;
computer code that determines a route for establishing the network connection between the first site and the second site, wherein the route comprises a path through the network that begins at the first site and ends at the second site, and wherein the path is determined to include both the first service provider and the second service provider offering the requested services;
computer code that peers with at least the second service provider to dynamically create a peered federation to fulfill the request;
computer code that establishes the network connection between a first network device of the first site and a second network device of the second site using the determined route that includes both the first service provider and the second service provider, wherein the requested services are provided for the network connection through the peered federation; and
a computer-readable medium that stores the computer codes.

10. The computer program product of claim 9 , further comprising:
computer code that stores a reference to each offered service in a service catalog at the first service provider; and
computer code that, responsive to receiving an updated advertisement of offered services from one of the plurality of service providers, updates the service catalog based on the updated advertisement of offered services.

11. The computer program product of claim 9 , wherein the tagged advertisement of offered services contains one or more tags, each of the tags specifying one of a list of offered services, a geographical location where the offered services are hosted, a network location where the offered services are hosted, metadata describing characteristics of the offered services, or metadata describing characteristics of the service provider.

12. The computer program product of claim 9 , further comprising:
computer code that generates a proposal specifying the created peered federation including at least the first service provider and the second service provider for use in fulfilling the re

Assignees

• Morrow Monique
• Hammer Michael
• Hasan Masum
• Cisco Tech Inc

Inventors

• Morrow Monique
• Hammer Michael
• Hasan Masum

Classifications

• G06Q30/0283

  Price estimation or determination · CPC title

• G06Q30/0206

  Price or cost determination based on market factors · CPC title

• G06Q30/00 Primary

  Commerce · CPC title