{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:07:55Z","timestamp":1725469675304},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1109\/glocom.2009.5425402","type":"proceedings-article","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T16:49:02Z","timestamp":1268066942000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["AnyTraffic Routing Algorithm for Label-Based Forwarding"],"prefix":"10.1109","author":[{"given":"Pedro","family":"Pedroso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Pedrola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Klinkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Careglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882840"},{"key":"ref3","article-title":"Scheduling of combined unicast and multicast traffic in broadcast WDM networks","author":"ortiz","year":"1998","journal-title":"Proc PICS"},{"key":"ref10","article-title":"SNDlib 1.0Survivable Neteork Design Library","author":"orlowski","year":"2007","journal-title":"Proc INOC 2007"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220105"},{"key":"ref11","article-title":"On realizing all simple graphs with a given degree sequence","author":"kim","year":"2008","journal-title":"Discrete Mathematics"},{"key":"ref5","article-title":"On analysis of multicast forwarding state scalability","author":"wong","year":"2000","journal-title":"Proc ICNP 2000"},{"key":"ref8","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","author":"takahashi","year":"1980","journal-title":"Math Japonica"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0132072"},{"key":"ref2","article-title":"Generalized Multi-Protocol Label Switching (GMPLS) Architecture","author":"manie","year":"2004","journal-title":"RFC 3945"},{"key":"ref9","article-title":"Extensions to Resource Reservation Protocol – Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs)","author":"aggarwal","year":"2007","journal-title":"RFC 4875"},{"key":"ref1","article-title":"Multiprotocol Label Switching (MPLS) Architecture","author":"rosen","year":"2001","journal-title":"RFC 3031"}],"event":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","start":{"date-parts":[[2009,11,30]]},"location":"Honolulu, Hawaii","end":{"date-parts":[[2009,12,4]]}},"container-title":["GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5425207\/5425208\/05425402.pdf?arnumber=5425402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T04:51:37Z","timestamp":1489899097000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5425402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/glocom.2009.5425402","relation":{},"subject":[],"published":{"date-parts":[[2009,11]]}}}