{"id":"https://openalex.org/W1554912280","doi":"https://doi.org/10.1109/lanman.2005.1541532","title":"FATE: A Polynomial Time Framework for Flow Allocation in MPLS-TE Networks","display_name":"FATE: A Polynomial Time Framework for Flow Allocation in MPLS-TE Networks","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W1554912280","doi":"https://doi.org/10.1109/lanman.2005.1541532","mag":"1554912280"},"language":"en","primary_location":{"id":"doi:10.1109/lanman.2005.1541532","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2005.1541532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 14th IEEE Workshop on Local & Metropolitan Area Networks","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082663098","display_name":"Samer Lahoud","orcid":"https://orcid.org/0000-0003-2218-5088"},"institutions":[{"id":"https://openalex.org/I2885711838","display_name":"TDF (France)","ror":"https://ror.org/01866as23","country_code":"FR","type":"company","lineage":["https://openalex.org/I2885711838"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"S. Lahoud","raw_affiliation_strings":["D\u00e9partement R\u00e9seaux et Services Multim\u00e9dia, Cesson-Sevigne, France","Departement Reseaux et Services Multimedia, GET/ENST Bretagne, Cesson Sevigne"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement R\u00e9seaux et Services Multim\u00e9dia, Cesson-Sevigne, France","institution_ids":["https://openalex.org/I2885711838"]},{"raw_affiliation_string":"Departement Reseaux et Services Multimedia, GET/ENST Bretagne, Cesson Sevigne","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029560543","display_name":"G\u00e9raldine Texier","orcid":"https://orcid.org/0000-0003-3749-9725"},"institutions":[{"id":"https://openalex.org/I2885711838","display_name":"TDF (France)","ror":"https://ror.org/01866as23","country_code":"FR","type":"company","lineage":["https://openalex.org/I2885711838"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"G. Texier","raw_affiliation_strings":["D\u00e9partement R\u00e9seaux et Services Multim\u00e9dia, Cesson-Sevigne, France","Departement Reseaux et Services Multimedia, GET/ENST Bretagne, Cesson Sevigne"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement R\u00e9seaux et Services Multim\u00e9dia, Cesson-Sevigne, France","institution_ids":["https://openalex.org/I2885711838"]},{"raw_affiliation_string":"Departement Reseaux et Services Multimedia, GET/ENST Bretagne, Cesson Sevigne","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055522567","display_name":"Laurent Toutain","orcid":null},"institutions":[{"id":"https://openalex.org/I2885711838","display_name":"TDF (France)","ror":"https://ror.org/01866as23","country_code":"FR","type":"company","lineage":["https://openalex.org/I2885711838"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"L. Toutain","raw_affiliation_strings":["D\u00e9partement R\u00e9seaux et Services Multim\u00e9dia, Cesson-Sevigne, France","Departement Reseaux et Services Multimedia, GET/ENST Bretagne, Cesson Sevigne"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement R\u00e9seaux et Services Multim\u00e9dia, Cesson-Sevigne, France","institution_ids":["https://openalex.org/I2885711838"]},{"raw_affiliation_string":"Departement Reseaux et Services Multimedia, GET/ENST Bretagne, Cesson Sevigne","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082663098"],"corresponding_institution_ids":["https://openalex.org/I2885711838"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.04114702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10232","display_name":"Optical Network Technologies","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.8691688776016235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7389140129089355},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5625273585319519},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5543731451034546},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5395315289497375},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"Traffic engineering","score":0.5295946002006531},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5136086940765381},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5019068717956543},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.49996089935302734},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.473448246717453},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4726763367652893},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4214104413986206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1275959014892578},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11816748976707458}],"concepts":[{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.8691688776016235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7389140129089355},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5625273585319519},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5543731451034546},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5395315289497375},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.5295946002006531},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5136086940765381},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5019068717956543},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.49996089935302734},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.473448246717453},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4726763367652893},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4214104413986206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1275959014892578},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11816748976707458}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lanman.2005.1541532","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2005.1541532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 14th IEEE Workshop on Local & Metropolitan Area Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1558013715","https://openalex.org/W1682076822","https://openalex.org/W1977545325","https://openalex.org/W2021925979","https://openalex.org/W2086375379","https://openalex.org/W2103985627","https://openalex.org/W2104685111","https://openalex.org/W2120925618","https://openalex.org/W2153776688","https://openalex.org/W2154580121","https://openalex.org/W2161718593","https://openalex.org/W2178644091","https://openalex.org/W4213060235","https://openalex.org/W6677941154","https://openalex.org/W6682597455","https://openalex.org/W6683889351"],"related_works":["https://openalex.org/W2378759505","https://openalex.org/W2353554073","https://openalex.org/W2349651244","https://openalex.org/W2382274258","https://openalex.org/W2359815144","https://openalex.org/W2385321477","https://openalex.org/W2362037673","https://openalex.org/W4322358105","https://openalex.org/W2511476552","https://openalex.org/W4205877129"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,52,88],"present":[4],"a":[5,101],"novel":[6],"polynomial":[7],"time":[8],"framework":[9],"for":[10,27,38,72,109],"the":[11,35,46,49,73],"off-line":[12],"flow":[13],"allocation":[14,26],"problem":[15,74],"in":[16,76],"MPLS-traffic":[17],"engineering":[18,40],"(MPLS-TE)":[19],"networks.":[20],"This":[21],"framework,":[22],"named":[23],"FATE":[24,61],"(flow":[25],"traffic":[28,39],"engineering),":[29],"encom-passes":[30],"different":[31],"objectives":[32],"that":[33,87],"illustrate":[34],"operator":[36],"needs":[37],"and":[41,58,67,81,96],"provides":[42],"advanced":[43],"control":[44],"over":[45],"quality":[47],"of":[48,78,104],"solution.":[50],"Typically,":[51],"consider":[53],"minimizing":[54],"congestion,":[55],"bandwidth":[56,97],"consumption":[57,98],"operational":[59],"costs.":[60],"is":[62],"based":[63],"on":[64],"linear":[65],"programming":[66],"presents":[68],"an":[69,91],"efficient":[70,92],"solution":[71],"both":[75],"terms":[77],"computational":[79],"complexity":[80],"approximation":[82],"guarantees.":[83],"Simulation":[84],"results":[85],"show":[86],"can":[89],"get":[90],"trade-off":[93],"between":[94],"congestion":[95],"while":[99],"having":[100],"reduced":[102],"number":[103],"label":[105],"switched":[106],"paths":[107],"(LSPs)":[108],"various":[110],"known":[111],"topologies":[112]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}