{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd-6853"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd-6853","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Simulation of Various Networks on Fibonacci Cube Network Topology","abstract":"Simulation of one interconnection topology by another has several applications in efficient uses of parallel computation networks. The Fibonacci Cube network was proposed recently, [16], [17], (18], [19], [20], [21] as an alternative to the Hypercube networks. Fibonacci Cube networks have rich properties of Fibonacci numbers and hence they can flexibly be decomposed into subgraphs of the same kind. However, there is a tremendous gap between Hypercubes and Fibonacci Cubes with respect to the availability of routing and graph embedding results. These problems have been studied extensively on Hypercubes [2], [4], [6], [7], [24], [25], [27], [28]. In this paper we investigate embeddings of Binary Tree, X-Tree, Arbitrary Binary Tree, Linear Arrays, 2-D Mesh and Ring interconnection networks. The embeddings discussed show that Fibonacci Cube network can efficiently simulate them. They are, in fact, optimum or nearly optimum in both dilation and expansion.","abstract_html":"Simulation of one interconnection topology by another has several applications in efficient uses of parallel computation networks. The Fibonacci Cube network was proposed recently, [16], [17], (18], [19], [20], [21] as an alternative to the Hypercube networks. Fibonacci Cube networks have rich properties of Fibonacci numbers and hence they can flexibly be decomposed into subgraphs of the same kind. However, there is a tremendous gap between Hypercubes and Fibonacci Cubes with respect to the availability of routing and graph embedding results. These problems have been studied extensively on Hypercubes [2], [4], [6], [7], [24], [25], [27], [28]. In this paper we investigate embeddings of Binary Tree, X-Tree, Arbitrary Binary Tree, Linear Arrays, 2-D Mesh and Ring interconnection networks. The embeddings discussed show that Fibonacci Cube network can efficiently simulate them. They are, in fact, optimum or nearly optimum in both dilation and expansion.","abstract_has_math":false,"creators":["Sharma, Sanjay"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Bin Cong"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:02:54Z","subjects":["Electrical and Computer Engineering","Engineering"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd/5855","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd/5855","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd-6853","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bin Cong"]},{"key":"dc:creator","label":"Author","values":["Sharma, Sanjay"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-08-26T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1993-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering","Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd/5855"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Simulation of one interconnection topology by another has several applications in efficient uses of parallel computation networks. The Fibonacci Cube network was proposed recently, [16], [17], (18], [19], [20], [21] as an alternative to the Hypercube networks. Fibonacci Cube networks have rich properties of Fibonacci numbers and hence they can flexibly be decomposed into subgraphs of the same kind. However, there is a tremendous gap between Hypercubes and Fibonacci Cubes with respect to the availability of routing and graph embedding results. These problems have been studied extensively on Hypercubes [2], [4], [6], [7], [24], [25], [27], [28]. In this paper we investigate embeddings of Binary Tree, X-Tree, Arbitrary Binary Tree, Linear Arrays, 2-D Mesh and Ring interconnection networks. The embeddings discussed show that Fibonacci Cube network can efficiently simulate them. They are, in fact, optimum or nearly optimum in both dilation and expansion."]},{"key":"dc:title","label":"Title","values":["Simulation of Various Networks on Fibonacci Cube Network Topology"]}]}],"canonical_facts":{"dc:contributor":["Bin Cong"],"dc:creator":["Sharma, Sanjay"],"dc:date.available":["2021-08-26T07:00:00Z"],"dc:date.created":["1993-01-01T08:00:00Z"],"dc:description.abstract":["Simulation of one interconnection topology by another has several applications in efficient uses of parallel computation networks. The Fibonacci Cube network was proposed recently, [16], [17], (18], [19], [20], [21] as an alternative to the Hypercube networks. Fibonacci Cube networks have rich properties of Fibonacci numbers and hence they can flexibly be decomposed into subgraphs of the same kind. However, there is a tremendous gap between Hypercubes and Fibonacci Cubes with respect to the availability of routing and graph embedding results. These problems have been studied extensively on Hypercubes [2], [4], [6], [7], [24], [25], [27], [28]. In this paper we investigate embeddings of Binary Tree, X-Tree, Arbitrary Binary Tree, Linear Arrays, 2-D Mesh and Ring interconnection networks. The embeddings discussed show that Fibonacci Cube network can efficiently simulate them. They are, in fact, optimum or nearly optimum in both dilation and expansion."],"dc:identifier":["https://openprairie.sdstate.edu/etd/5855"],"dc:language":["English"],"dc:subject":["Electrical and Computer Engineering","Engineering"],"dc:title":["Simulation of Various Networks on Fibonacci Cube Network Topology"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:02:54Z"}