{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:33Z","timestamp":1725571293284},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_23","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"266-278","source":"Crossref","is-referenced-by-count":2,"title":["Policies for Periodic Packet Routing"],"prefix":"10.1007","author":[{"given":"Britta","family":"Peis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Stiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1594","DOI":"10.1137\/S009753979935061X","volume":"30","author":"M. Andrews","year":"2000","unstructured":"Andrews, M., Fern\u00e1ndez, A., Harchol-Balter, M., Leighton, F., Zhang, L.: General dynamic routing with per-packet delay guarantees of O (distance + 1\/session rate). SIAM Journal of Computing\u00a030, 1594\u20131623 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00453-005-1189-3","volume":"45","author":"C. Busch","year":"2006","unstructured":"Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.: Direct routing: Algorithms and complexity. Algorithmica\u00a045, 45\u201368 (2006)","journal-title":"Algorithmica"},{"key":"23_CR3","series-title":"Real-Time Systems Series","volume-title":"Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications","author":"G.C. Buttazzo","year":"2004","unstructured":"Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications. Real-Time Systems Series. Springer, Santa Clara (2004)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(97)00198-9","volume":"196","author":"M. di Ianni","year":"1998","unstructured":"di Ianni, M.: Efficient delay routing. Theoretical Computer Science\u00a0196, 131\u2013151 (1998)","journal-title":"Theoretical Computer Science"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-scheduling in O(congestion\u2009+\u2009dilation) steps. Combinatorica\u00a014, 167\u2013186 (1994)","journal-title":"Combinatorica"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"F.T. Leighton","year":"1999","unstructured":"Leighton, F.T., Maggs, B.M., Richa, A.W.: Fast algorithms for finding O(congestion\u2009+\u2009dilation) packet routing schedules. Combinatorica\u00a019, 375\u2013401 (1999)","journal-title":"Combinatorica"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Makedon, F., Tollis, I.G.: A 2n\u2009\u2212\u20092 step algorithm for routing in an n \u00d7n array with constant size queues. In: Proceedings of the 1st Annual Symposium on Parallel Algorithms and Architectures, pp. 328\u2013335 (1989)","DOI":"10.1145\/72935.72970"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis (2004)","DOI":"10.1201\/9780203489802"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Mansour, Y., Patt-Shamir, B.: Greedy packet scheduling on shortest paths. Journal of Algorithms\u00a014 (1993)","DOI":"10.1006\/jagm.1993.1024"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Peis, B., Skutella, M., Wiese, A.: Packet routing: Complexity and algorithms. In: Proceedings of the 7th Workshop on Approximation and Online Algorithms (2009)","DOI":"10.1007\/978-3-642-12450-1_20"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Peis, B., Skutella, M., Wiese, A.: Packet routing on the grid. In: Proceedings of the 9th Latin American Theoretical Informatics Symposium (2010)","DOI":"10.1007\/978-3-642-12200-2_12"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Peis, B., Stiller, S., Wiese, A.: Periodic packet routing on trees. Technical Report 008-2010, Technische Universit\u00e4t Berlin (April 2010)","DOI":"10.1007\/978-3-642-17514-5_23"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T11:32:13Z","timestamp":1636889533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}