{"id":{"repo_id":"brazil-ufrn","oai_identifier":"oai:repositorio.ufrn.br:123456789/57146"},"canonical_url":"https://search.dev.ndltd.org/etd/brazil-ufrn/oai:repositorio.ufrn.br:123456789/57146","repository":{"repo_id":"brazil-ufrn","name":"Brazil UFRN","base_url":"https://repositorio.ufrn.br/server/oai/request"},"display":{"title":"SDNoC 42: modelo de SDNoC baseada em otimização de caminhos mínimos","abstract":"In this work, we developed a new network-on-chip architecture using softwaredefined networks; this architecture proved to be robust and capable of improving routing in a network-on-chip. The implementation consists of a software-defined network-on-chip architectural model, exploring the parallelism of control mechanisms using Dijkstra’s algorithm to find the best path in packet routing between switches. The approach proposes a significant improvement in communication latency by reducing the waiting time of packets in the controllers’ queue and exploring the network’s topological potential through the OpenFlow protocol. The results obtained are promising. Using the Dijkstra algorithm and increasing the number of cores makes optimizing communication latency in 100% of cases possible compared to the XY algorithm.","abstract_html":"In this work, we developed a new network-on-chip architecture using softwaredefined networks; this architecture proved to be robust and capable of improving routing in a network-on-chip. The implementation consists of a software-defined network-on-chip architectural model, exploring the parallelism of control mechanisms using Dijkstra’s algorithm to find the best path in packet routing between switches. The approach proposes a significant improvement in communication latency by reducing the waiting time of packets in the controllers’ queue and exploring the network’s topological potential through the OpenFlow protocol. The results obtained are promising. Using the Dijkstra algorithm and increasing the number of cores makes optimizing communication latency in 100% of cases possible compared to the XY algorithm.","abstract_has_math":false,"creators":["Avelino, Adelino Afonso Fernandes"],"institution":"Universidade Federal do Rio Grande do Norte","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Kreutz, Márcio Eduardo"],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-09-29","date_published":"2023-09-29","updated_at":"2026-07-24T01:20:51Z","subjects":["Computação","Latência","Paralelismo","Rede-em-chip definida por software","Rede-em-chip"],"languages":["pt_BR"],"rights":["Acesso Aberto"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://repositorio.ufrn.br/handle/123456789/57146","outbound_label":"Repository record","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Kreutz, Márcio Eduardo"]},{"key":"dc:creator","label":"Author","values":["Avelino, Adelino Afonso Fernandes"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-01-03T18:28:46Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-01-03T18:28:46Z"]},{"key":"dc:date.issued","label":"Date","values":["2023-09-29"]},{"key":"dc:publisher","label":"Institution","values":["Universidade Federal do Rio Grande do Norte"]},{"key":"dc:type","label":"Dc Type","values":["masterThesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computação","Latência","Paralelismo","Rede-em-chip definida por software","Rede-em-chip"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["pt_BR"]},{"key":"dc:rights","label":"Dc Rights","values":["Acesso Aberto"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://repositorio.ufrn.br/handle/123456789/57146"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this work, we developed a new network-on-chip architecture using softwaredefined networks; this architecture proved to be robust and capable of improving routing in a network-on-chip. The implementation consists of a software-defined network-on-chip architectural model, exploring the parallelism of control mechanisms using Dijkstra’s algorithm to find the best path in packet routing between switches. The approach proposes a significant improvement in communication latency by reducing the waiting time of packets in the controllers’ queue and exploring the network’s topological potential through the OpenFlow protocol. The results obtained are promising. Using the Dijkstra algorithm and increasing the number of cores makes optimizing communication latency in 100% of cases possible compared to the XY algorithm."]},{"key":"dc:title","label":"Title","values":["SDNoC 42: modelo de SDNoC baseada em otimização de caminhos mínimos"]}]}],"canonical_facts":{"dc:contributor.advisor":["Kreutz, Márcio Eduardo"],"dc:creator":["Avelino, Adelino Afonso Fernandes"],"dc:date.accessioned":["2024-01-03T18:28:46Z"],"dc:date.available":["2024-01-03T18:28:46Z"],"dc:date.issued":["2023-09-29"],"dc:description.abstract":["In this work, we developed a new network-on-chip architecture using softwaredefined networks; this architecture proved to be robust and capable of improving routing in a network-on-chip. The implementation consists of a software-defined network-on-chip architectural model, exploring the parallelism of control mechanisms using Dijkstra’s algorithm to find the best path in packet routing between switches. The approach proposes a significant improvement in communication latency by reducing the waiting time of packets in the controllers’ queue and exploring the network’s topological potential through the OpenFlow protocol. The results obtained are promising. Using the Dijkstra algorithm and increasing the number of cores makes optimizing communication latency in 100% of cases possible compared to the XY algorithm."],"dc:identifier.uri":["https://repositorio.ufrn.br/handle/123456789/57146"],"dc:language":["pt_BR"],"dc:publisher":["Universidade Federal do Rio Grande do Norte"],"dc:rights":["Acesso Aberto"],"dc:subject":["Computação","Latência","Paralelismo","Rede-em-chip definida por software","Rede-em-chip"],"dc:title":["SDNoC 42: modelo de SDNoC baseada em otimização de caminhos mínimos"],"dc:type":["masterThesis"]},"updated_at":"2026-07-24T01:20:51Z"}