Offloading content routing cost from routers
View Patent ↗Embodiments of the present invention are directed to reconfiguring communication routing architecture. A determination may be made that loading on one or more routing entities require adjustment. Adjustment may be required in situations where, for example, the amount of data to convey or the number of clients to service overcome the abilities of the router. In reconfiguring the communication routing architecture, some of the routing responsibility for the heavily loaded routers may be offloaded to neighboring routers and/or clients.
1. A method, comprising:
determining to transmit a request for routing table information to one or more apparatuses, the request comprising one or more routing table entries and a set of one or more fixed entries;
receiving routing table information from the one or more apparatuses in response to the request, the routing table information comprising a graph based data structure describing relationships between the one or more routing table entries and relationships between the one or more routing table entries and the one or more fixed entries, wherein the relationships are formulated based on one or more burdens associated with the one or more routing table entries, the one or more fixed entries, or a combination thereof, performed in the one or more apparatuses; and
determining to update a routing table based on the received routing table information.
2. The method according to claim 1 , wherein the one or more apparatuses include routers or clients.
3. The method according to claim 1 , wherein the graph based data structure is a directed acyclic graph (DAG) or a forest.
4. The method according to claim 1 , wherein updating the routing table includes updating the routing table based on the received routing table information according to the one or more fixed entries.
5. The method according to claim 1 , wherein the routing table is a directed acyclic graph (DAG) or forest.
6. The method according to claim 1 , wherein at least one of the one or more fixed entries is a client that one of the one or more apparatuses is charged with servicing.
7. The method according to claim 1 , wherein the burden is based, at least in part, on a number of subscriptions, a complexity of each subscription, a computational burden, or a combination thereof, of the one or more apparatuses.
8. An apparatus, comprising:
at least one processor; and
at least one memory including computer program code for one or more programs,
the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,
determine to transmit a request for routing table information to one or more apparatuses, the request comprising one or more routing table entries and one or more fixed entries;
receive routing table information from the one or more apparatuses in response to the request, the routing table information comprising a graph based data structure describing relationships between the one or more routing table entries and relationships between the one or more routing table entries and the one or more fixed entries, wherein the relationships are formulated by comparisons of one or more burdens associated with the one or more routing table entries, the one or more fixed entries, or a combination thereof, performed in the one or more apparatuses; and
determine to update the routing table based on the received routing table information.
9. The apparatus according to claim 8 , wherein the graph based data structure is a directed acyclic graph (DAG) or a forest.
10. The apparatus according to claim 8 , wherein the apparatus is further caused to: update the routing table based on the received routing table information according to the one or more fixed entries.
11. The apparatus according to claim 8 , wherein the routing table is a directed acyclic graph (DAG) or forest.
12. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following steps: comprising computer executable program code recorded on a computer readable medium,
determining to transmit a request for routing table information to one or more apparatuses, the request comprising one or more routing table entries and one or more fixed entries;
receiving routing table information from the one or more apparatuses in response to the request, the routing table information comprising a graph based data structure describing relationships between the one or more routing table entries and relationships between the one or more routing table entries and the one or more fixed entries, wherein the relationships are formulated by comparisons of one or more burdens associated with the one or more routing table entries, the one or more fixed entries, or a combination thereof, performed in the one or more apparatuses; and
determining to update a routing table based on the received routing table information.
13. The non-transitory computer-readable storage medium according to claim 12 , wherein the one or more apparatuses include routers or clients.
14. The non-transitory computer-readable storage medium according to claim 12 , wherein the graph based data structure is a directed acyclic graph (DAG) or a forest.
15. The non-transitory computer-readable storage medium according to claim 12 , wherein the apparatus is caused to further perform: updating the routing table based on the received routing table information according to the one or more fixed entries.
16. The non-transitory computer-readable storage medium according to claim 12 , wherein the routing table is a directed acyclic graph (DAG) or forest.
17. A method, comprising:
receiving a request from a router for routing table information, the request comprising one or more routing table entries and one or more fixed entries; and
determining to transmit routing table information to the router in response to the request, the routing table information comprising a graph based data structure describing relationships between the one or more routing table entries and relationships between the one or more routing table entries and the one or more fixed entries, wherein the relationships are formulated by performing comparisons of one or more burdens associated with the one or more routing table entries, the one or more fixed entries, or a combination thereof.
18. The method according to claim 17 , wherein the graph based data structure is a directed acyclic graph (DAG) or a forest.
19. An apparatus, comprising:
at least one processor; and
at least one memory including computer program code for one or more programs,
the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,
receive a request from a router for routing table information, the request comprising one or more routing table entries and one or more fixed entries; and
determine to transmit routing table information to the router in response to the request, the routing table information comprising a graph based data structure describing relationships between the one or more routing table entries and relationships between the one or more routing table entries and the one or more fixed entries, wherein the relationships are formulated by performing comparisons of one or more burdens associated with the one or more routing table entries, the one or more fixed entries, or a combination thereof.
20. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following steps:
receiving a request from a router for routing table information, the request comprising one or more routing table entries and one or more fixed entries; and
determining to transmit routing table information to the router in response to the request, the routing table information comprising a graph based data structure describing relationships between the one or more routing table entries and relationships between the one or more routing table entries and the one or more fixed entries, wherein the relationships are formulated by performing comparisons of one or more burdens associated with the one or more routing table entries, the one or more fixed entries, or a combination thereof.