{"id":"https://openalex.org/W1580574450","doi":"https://doi.org/10.1007/978-0-387-35522-1_13","title":"Dynamic Programming Based Link Cost Function and Load Estimation Method for ATM Links","display_name":"Dynamic Programming Based Link Cost Function and Load Estimation Method for ATM Links","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1580574450","doi":"https://doi.org/10.1007/978-0-387-35522-1_13","mag":"1580574450"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-35522-1_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35522-1_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35522-1_13.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Telecommunication Network Intelligence","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35522-1_13.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072682682","display_name":"M. Conte","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127033","display_name":"Siemens (Austria)","ror":"https://ror.org/03794w632","country_code":"AT","type":"company","lineage":["https://openalex.org/I1325886976","https://openalex.org/I4210127033"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"M. Conte","raw_affiliation_strings":["Siemens AG \u00d6sterreich, Boschstra\u00dfe 10, 1190, Wien, Austria","Siemens AG \u00d6sterreich, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Siemens AG \u00d6sterreich, Boschstra\u00dfe 10, 1190, Wien, Austria","institution_ids":["https://openalex.org/I4210127033"]},{"raw_affiliation_string":"Siemens AG \u00d6sterreich, Wien, Austria","institution_ids":["https://openalex.org/I4210127033"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072682682"],"corresponding_institution_ids":["https://openalex.org/I4210127033"],"apc_list":null,"apc_paid":null,"fwci":0.8023,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77979982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983000159263611,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6274210214614868},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5650432705879211},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4787918031215668},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.47159895300865173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34085214138031006},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25633811950683594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10012513399124146}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6274210214614868},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5650432705879211},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4787918031215668},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.47159895300865173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34085214138031006},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25633811950683594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10012513399124146},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-35522-1_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35522-1_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35522-1_13.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Telecommunication Network Intelligence","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-35522-1_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35522-1_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35522-1_13.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Telecommunication Network Intelligence","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1580574450.pdf","grobid_xml":"https://content.openalex.org/works/W1580574450.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W12023602","https://openalex.org/W1496455205","https://openalex.org/W1863938836","https://openalex.org/W2025553036","https://openalex.org/W2078556239","https://openalex.org/W2154744713","https://openalex.org/W2162046389","https://openalex.org/W2797915579","https://openalex.org/W4237694517"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"In":[0,81,117],"connection-oriented":[1],"networks":[2,23,83],"dynamic":[3,38,62,73,215],"routing":[4,104,216,268],"schemes":[5],"are":[6,107],"designed":[7],"to":[8,157],"improve":[9],"the":[10,27,35,45,53,59,100,133,146,158,170,183,187,199,211,223,236,239,257],"call":[11],"blocking":[12,258],"performance":[13,221,237,259],"by":[14,196],"introducing":[15],"network":[16,28,231],"intelligence.":[17],"An":[18,163],"accurate":[19],"model":[20,34,137],"describing":[21],"a":[22,72,87,120,179,214],"statistical":[24],"behaviour":[25],"is":[26,92,129,142,166,191,194,233,250,260],"Markov":[29,41,46],"model.":[30],"Based":[31],"on":[32,132],"this":[33,118,151],"theory":[36,91],"of":[37,61,99,186,213,222,238],"programming":[39],"for":[40,77,95,103,109,126,145,168,181],"processes":[42],"(also":[43],"called":[44,218],"Decision":[47],"Process":[48],"theory,":[49],"MDP)":[50],"has":[51],"in":[52,58,111,139,174,226,244],"past":[54],"successfully":[55],"been":[56],"applied":[57],"field":[60],"routing.":[63],"The":[64,220,252],"Forward":[65],"Looking":[66],"Routing":[67],"(FLR)":[68],"scheme":[69,180,217,225],"[1]":[70],"defines":[71],"link":[74,123,135,152,160,172,189,201,241,247],"cost":[75,124,153,161,202,242],"function":[76,125,154,203,243],"single-rate":[78,96],"circuit-switched":[79],"networks.":[80,177],"ATM":[82,200,240],"carrying":[84],"multirate":[85,105,127],"traffic":[86,90,106,149],"more":[88],"complex":[89],"encountered":[93],"than":[94],"traffic.":[97],"Applications":[98],"MDP":[101],"concept":[102],"made":[108],"example":[110],"[2],":[112],"[3],":[113],"[4]":[114],"and":[115,204],"[5].":[116,140],"work,":[119],"state":[121,136,248],"dependent":[122],"links":[128],"derived,":[130],"based":[131],"scalar":[134],"introduced":[138],"It":[141,193],"shown":[143,195],"that":[144,256],"single":[147],"rate":[148],"model,":[150],"becomes":[155],"equal":[156],"FLR":[159],"function.":[162],"approximation":[164],"method":[165],"proposed":[167],"determining":[169],"offered":[171],"load":[173,190,205],"weak":[175],"mesh":[176],"Furthermore,":[178],"estimating":[182],"temporal":[184],"evolution":[185],"carried":[188],"developed.":[192],"simulation":[197,227,253],"how":[198],"estimation":[206],"may":[207],"be":[208],"used":[209],"within":[210],"frame":[212],"DR/ATM.":[219],"DR/ATM":[224],"runs":[228,254],"involving":[229],"different":[230],"topologies":[232],"presented.":[234],"Moreover":[235],"combination":[245],"with":[246,265],"flooding":[249],"shown.":[251],"show":[255],"substantially":[261],"improved":[262],"as":[263],"compared":[264],"standard":[266],"reference":[267],"schemes.":[269]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
