http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2015020863-A1
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_3ed37d724564735d73052c3c9c8e9e23 |
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-125 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L41-0896 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-62 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L45-302 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04B10-27 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04J14-0257 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L47-25 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04J14-0227 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L41-0896 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L47-37 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L47-72 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L45-125 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L45-42 |
| filingDate | 2014-07-31-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_02c231055c0f11332d0f0f80cbd2185b http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_143e6e5801e9cbc0d88af0edf51a6030 |
| publicationDate | 2015-02-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | WO-2015020863-A1 |
| titleOfInvention | Provisioning time-varying traffic in software-defined flexible grid transport networks |
| abstract | A method is providing for provisioning time-varying traffic demands in an optical transport software-defined network. The method includes pre-provisioning an amount of bandwidth for best effort traffic. The method further includes iteratively applying, using a processor, an iterative simulated annealing-based traffic provisioning procedure to determine candidate bandwidths for the best effort traffic in a set of iterations. The method also includes selecting a particular candidate bandwidth that has a corresponding blocking value lower than a given blocking requirement β and that requires a minimum amount of spectrum as compared to other candidate bandwidths. The iteratively applying step includes varying the amount of bandwidth for best effort traffic in each iteration to determine the candidate bandwidth. The iteratively applying step further includes varying an amount of shared bandwidth between neighboring channels, out of the amount of bandwidth for best effort traffic, in each iteration, to further determine the candidate bandwidths. |
| priorityDate | 2013-08-07-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 40.