PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Reconfiguration of logical communication channels

Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper a new reconfiguration of interconnection networks algorithm was proposed for the computational systems and the logical network connection. The proposed solution is based on the presentation of the network and base requirements in the form of linear Diophantine constraints solution in area {0,1}. A set of topologies that meet initial assumptions is obtained as the solution of the system of constrains. In the next step, the final topology is selected, which can be used to reconfigure the interconnection network. It is done using the proposed method of selecting the optimal solution from the set of acceptable solutions, taking into account a certain level of indeterminacy.
Rocznik
Strony
21--28
Opis fizyczny
Bibliogr. 15 poz., rys.
Twórcy
  • Department of Distributed Systems Rzeszow University of Technology
  • Department of Distributed Systems Rzeszow University of Technology
Bibliografia
  • [1] Gencata A.E., Mukherjee B. Virtual-topology Adaptation for WDM Mesh Networks under Dynamic Traffic. IEEE Press, IEEE/ACM Transactions on Networking, Vol. 11, Issue 2, pp. 236-247, Piscataway 2002.
  • [2] Prathombutr P. Virtual Topology Reconfiguration in wavelength-routed optical networks, Thesis presented in Kansas City University, Missouri 2003.
  • [3] Sreenath N., Gurucharan B.H., Mohan G., Siva Ram Murthy C. A Two-stage Approach for Virtual Topology Reconfiguration using Path-add Heuristics. Springer Netherlands, Optical Networks Magazine, Vol. 2, No. 3, Dordrecht 2001.
  • [4] Penaranda R., Gomez C., Gomez M. E., Lopez P., Duato J.:A New Family of Hybrid Topologies for Large–Scale Interconnection Networks; 2012 IEEE 11th International Symposium on Network Computing and Applications
  • [5] Sem-Jacobsen F., Lysne O.: Topology Agnostic Dynamic Quick Reconfiguration for Large-Scale Interconnection Networks; 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
  • [6] Oki E., Shiomoto K., Shimazaki D., Yamanaka N., Imajuku W., Takigawa Y: Dynamic Multilayer Routing Schemes in GMPLS-Based IP+Optical Networks; IEEE Communications Magazine; January 2005.
  • [7] Wilson R.J.: Wprowadzenie do teorii grafów; Wydawnictwo Naukowe PWN, 2012.
  • [8] Hajder M., Loutskii H., Stręciwilk W.: Informatyka. Wirtualna podróż w świat systemów i sieci komputerowych;Wydawnictwo WSIZ 2005.
  • [9] Hajder M., Byczkowska-Lipinska L., Bolanowski M. Analysis and synthesis of a computational system with reconfigurable multichannel connections. X International PhD Workshop OWD'2008, 18--21 October 2008.
  • [10] Hajder M., Bolanowski M. Optical communication multibus systems. Wydawnictwo UMCS, Annales UMCS Informatica, Sectio Ai Informatica, Vol. 5, ss. 333-342, Lublin 2006.
  • [11] Kryvyi S. L.: Algorithms for solving systems of linear diophantine equations in integer domains; Cybernetics and Systems Analysis; March 2006, Volume 42, Issue 2, pp 163-175.
  • [12] Крывый С.Л. Критерий совместности систем линейных диофаитовых уравнений над множеством натуральных чисел; Допов. НАНУ, Нo. 5, cc. 107-112, Киев 1999.
  • [13] Hajder M., Paszkiewicz A., Bolanowski M. Intuicja projektanta jako nieokreśloność przy projektowaniu sieci komputerowych. Współczesne problemy sieci komputerowych – nowe technologie, WNT, s. 259-268, Zakopane 2004.
  • [14] Ehrgott M., Figueira J.R., Greco S. (Eds.), Trends in Multicriteria Decision Analysis, International Series in Operations Research & Management Science, Springer, 2010.
  • [15] Hajder M., Paszkiewicz A. Selecting communication means in condition of incomplete information for distributed systems with hierarchy of topology, Polish Journal of Environmental Studies, Vol. 17, No 2A, p.19-23, 2008.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-83cdd262-fa98-4fe3-9be9-1548b5ceb731
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.