{"id":12931,"date":"2021-11-30T19:10:30","date_gmt":"2021-12-01T00:10:30","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12931"},"modified":"2021-11-30T19:10:30","modified_gmt":"2021-12-01T00:10:30","slug":"tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/","title":{"rendered":"TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem"},"content":{"rendered":"

Carleton University
\nTechnical Report<\/a> TR-97-05
\nApril 1997<\/p>\n

TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem<\/h2>\n
\n
\n
\n
\n
\n
\n
\n
B. John Oommen & T. Dale Roberts<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most approaches consider a single class of packets flowing through the network, but in reality, different classes of packets with different packet lengths and priorities are transmitted over the networks. In this paper we assume that the traffic consists of different classes of packets with different average packet lengths and priorities. We shall look at three different solutions to this problem.<\/p>\n

Marayuma and Tang [MTI7] proposed a single algorithm composed of several elementary heuristic procedures. Levi and Ersoy [LE94] introduced a simulated annealing approach which produced substantially better results. In this paper we introduce a new method which uses continuous learning automata to solve the problem. Our new schemes produce superior results when compared with either of the previous solutions and is, to our knowledge, currently the best known solution.<\/p>\n

TR-97-05.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-97-05 April 1997 TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem B. John Oommen & T. Dale Roberts Abstract The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most […]<\/p>\n","protected":false},"author":49,"featured_media":0,"parent":12157,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Carleton University Technical Report TR-97-05 April 1997 TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem B. John Oommen &\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/\",\"name\":\"TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-12-01T00:10:30+00:00\",\"dateModified\":\"2021-12-01T00:10:30+00:00\",\"description\":\"Carleton University Technical Report TR-97-05 April 1997 TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem B. John Oommen &\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1997\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/\"},{\"@type\":\"ListItem\",\"position\":5,\"name\":\"TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem - School of Computer Science","description":"Carleton University Technical Report TR-97-05 April 1997 TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem B. John Oommen &","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/","name":"TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-12-01T00:10:30+00:00","dateModified":"2021-12-01T00:10:30+00:00","description":"Carleton University Technical Report TR-97-05 April 1997 TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem B. John Oommen &","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-05-continuous-automata-solutions-to-the-capacity-assignment-problem\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1997","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/"},{"@type":"ListItem","position":5,"name":"TR-97-05: Continuous Automata Solutions to the Capacity Assignment Problem"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"none","banner_button":"no"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12931"}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/49"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12931"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12931\/revisions"}],"predecessor-version":[{"id":12932,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12931\/revisions\/12932"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12157"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12931"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}