Caching at the wireless tower with remote charging services
US-9294895-B2 · Mar 22, 2016 · US
US9537765B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9537765-B2 |
| Application number | US-201514684587-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 13, 2015 |
| Priority date | Dec 10, 2009 |
| Publication date | Jan 3, 2017 |
| Grant date | Jan 3, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A passage channel is calculated by taking into account a plurality of requirements having different importance degrees. A channel calculation unit ( 202 ) of a transport control server ( 100 ) calculates a plurality of passage channel candidates with respect to a passage setting request wherein an active passage candidate and a standby passage candidate are paired in the passage channel candidate; and calculates the occurrence number of phenomena that violate a predetermined requirement relating an operation of the active passage and the standby passage, or a value of a network element for determining whether the requirement is violated, with respect to each passage channel candidate. A cost calculation unit ( 205 ) calculates the cost of a passage channel from the calculated number of occurrence, network element value, and a predetermined cost calculation coefficient corresponding to the requirement. A GUI control unit (display control unit) 201 displays identification information of the passage channel candidate, the number of occurrences or the network element value, and the cost, as a list on, for example, a management terminal.
Opening claim text (preview).
The invention claimed is: 1. A transport control server coupled to a plurality of nodes in a network, the transport control server comprising: at least one processor coupled to a storage device, the at least one processor configured to: receive designation of a plurality of requirements for operation; select a group of candidates of path channels to be determined for the plurality of requirements, among paths that are among the plurality of nodes in the network and that are obtained by path search responsive to a request for path setting; determine a number of phenomenon according to any of the requirements or a value of network elements regarding any of the requirements, for each of the plurality of candidates of path channels of the selected group, for each of the designated requirements, wherein the phenomenon comprises at least one of a link disjoint, a node disjoint, or a package disjoint, and wherein the value of network elements comprises at least one of a number of hops, a number of package straddles, or redundant bandwidths; provide the determined number of phenomenon or the determined value of network elements for each of the requirements in distinguishable state; receive designation of a coefficient which is given for each of the requirements; determine cost for each of the plurality of candidates of path channels of the group based on (i) the coefficient and (ii) the number of phenomenon or the value of network elements determined for each of the requirements; determine a rank of the plurality of candidates of path channels of the group using the determined cost; receive a correction of the coefficient after determining the rank of the plurality of candidates of path channels of the group using the designated coefficient; re-determine the cost by using the corrected coefficient where the corrected coefficient is designated; and pair a candidate of an active path with a candidate of a backup path, both are selected among the paths obtained by the path search, when selecting the group of candidates of path channels. 2. The transport control server according to claim 1 , wherein the at least one processor is further configured to provide an order of the plurality of candidates of path channels of the group in distinguishable state for each requirement, based on the determined number of phenomenon or the determined value of network elements. 3. The transport control server according to claim 2 , wherein the at least one processor is further configured to provide the rank of the plurality of candidates of path channels of the group. 4. The transport control server according to claim 1 , wherein the at least one processor is further configured to display the determined number of phenomenon or the determined value of network elements, for each of the plurality of candidates of path channels of the group, for each of the requirements. 5. The transport control server according to claim 3 , wherein the at least one processor is further configured to display the determined number of phenomenon or the determined value of network elements, and the cost, by corresponding each other, for each of the plurality of candidates of path channels of the group, for each of the requirements.
using label swapping, e.g. multi-protocol label switch [MPLS] · CPC title
Evaluation of link metrics (techniques for monitoring network metrics H04L43/08) · CPC title
Alternate routing · CPC title
Routing in connection-oriented networks, e.g. X.25 or ATM · CPC title
Routing tree calculation · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.