Content delivery in wireless wide area networks
First Claim
1. A method for selecting an edge-server set from a plurality of edge servers in a wireless network, comprising:
- constructing a trellis having a number of states equal to a number of edge servers in the edge server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers;
andemploying a trellis-exploration algorithm to select the edge-server set, comprising providing interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, selecting a path corresponding to a best performance metric that connects to a node in a previous state, wherein each performance metric comprises a network topology state based on channel-quality measurements and wherein at least one of the plurality of candidate edge servers is selected based on which clients a candidate edge server can reach using peer-to-peer wireless links.
1 Assignment
0 Petitions
Accused Products
Abstract
Selecting an edge-server set in a wireless network comprises generating channel-quality measurements of wireless links between available nodes; determining a network topology state based on the measurements; calculating a performance metric for each candidate edge-server set; and selecting a candidate edge-server set based on the performance metric. An iterative process may be employed for selecting the best edge-server set. The iterative process may employ a trellis-exploration algorithm. A back-pressure routing algorithm may be used to calculate the performance metric. A server processes a request from a client residing on a wireless network by determining if another client on the wireless network has the requested object; determining if the requesting client can communicatively couple to the other client; and directing the request to the other client.
-
Citations
17 Claims
-
1. A method for selecting an edge-server set from a plurality of edge servers in a wireless network, comprising:
-
constructing a trellis having a number of states equal to a number of edge servers in the edge server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers; and employing a trellis-exploration algorithm to select the edge-server set, comprising providing interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, selecting a path corresponding to a best performance metric that connects to a node in a previous state, wherein each performance metric comprises a network topology state based on channel-quality measurements and wherein at least one of the plurality of candidate edge servers is selected based on which clients a candidate edge server can reach using peer-to-peer wireless links. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method employing an iterative process for selecting an edge-server set, comprising:
-
constructing a trellis having a number of states at least equal to a number of edge servers in the edge server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers; and employing a trellis-exploration algorithm for selecting the edge-server set, comprising providing interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, selecting a path corresponding to a best performance metric that connects to a node in a previous state, wherein the best performance metric comprises a benefit minus a cost for serving clients and comprises a network topology state based on channel state information, and wherein at least one of the plurality of candidate edge servers is selected based on which clients a candidate edge server can reach using peer-to-peer wireless links. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A method for selecting an edge server set, comprising:
-
constructing a trellis having a number of states at least equal to a number of edge servers in the edge server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers; calculating a fitness function based on network performance improvements and costs corresponding to each candidate edge server; and employing a trellis-exploration algorithm to identify a path through the trellis having optimal path metrics derived from the fitness function, comprising providing interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, selecting a path corresponding to a best path metric that connects to a node in a previous state, wherein the best path metric comprises the fitness function, and wherein at least one of the plurality of candidate edge servers is selected based on which clients a candidate edge server can reach using peer-to-peer wireless links. - View Dependent Claims (15, 16, 17)
-
Specification