A novel approach to fault tolerant multichannel networks designing problems

• Autorzy: Hajder M. , Dymora P.
• Języki publikacji: EN

Abstrakty

EN

This work presents solution of a bus interconnection network set designing task on the base of a hypergraph model. In order to do this the interconnection network is presented as a multipartite hypergraph. A system with virtual bus connections functioning in an environment of common physical channel was analyzed, which is characteristic of the networks based on the WDM technology. The mathematical reliability model was proposed for two modes of system functioning: with redundancy of communication subsystem and division of communication load. As solution estimation criteria the expected changes of processing efficiency changes were used as also a communication delay change criteria and system reliability criteria. The designing task solution is searched in a Pareto set composed of Pareto optima. The selection procedure of a specific solution in the case of its equivalency in relation to a vector goal function was presented.

Słowa kluczowe

EN

fault tolerant; multichannel network; Pareto set

• Wydawca: Wydawnictwo UMCS
• Czasopismo: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
• Rocznik: 2011
• Tom: Vol. 11, no. 1
• Strony: 67--77
• Opis fizyczny: Bibliogr. 19 poz., rys.

Twórcy

autor

Hajder M.

• Rzeszów University of Technology, Faculty of Electrical and Computer Engineering, Department of Distributed Systems, ul. Wincentego Pola 2, 35-959 Rzeszów, Poland

autor

Dymora P.

• Rzeszów University of Technology, Faculty of Electrical and Computer Engineering, Department of Distributed Systems, ul. Wincentego Pola 2, 35-959 Rzeszów, Poland

Bibliografia

• [1] Yu T., Zhang Y., Lin K. J., Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints, ACM Transaction on The Web, 1(1) (2007).
• [2] Garey M. R., Johnson D. S., Computers and Interactability. The Guide to the Theory of NPCompleteness, San Francisco: W.H. Freeman & Company (1979).
• [3] Kellerer H., Pferschy U., Pisinger D., Knapsack Problems, Berlin: Springer (2004).
• [4] Chekuri C., Hudry O., Optimal clustering of multipartite graphs, Discr. Appl. Math (2008).
• [5] Dawande M., Keskinocak P., Swaminathan J. M., On bipartite and multipartite clique problems, Journal of Algorithms 41(2) (2001).
• [6] Scarelli A., Narculla S. C., A multicriteria assignment problem, Journal of Multi-Criteria Decision Analysis 11(2) (2002).
• [7] Cela E., The Quadratic Assignment Problem, Dordrecht: Kluwer Academic Publishers (1998).
• [8] Oncan T., A survey on the generalized assignment problem, INFOR 45(3) (2007).
• [9] Jain A. K., Murty M. N., Flynn P. J., Data clustering: a review, ACM Comput. (1992).
• [10] Jardine N., Sibson R., Mathematical Taxonomy, London: John Wiley & Sons (1971).
• [11] Mishin S., Optimal organizational hierarchies in firms, J. of Business Economics and Management (2007).
• [12] Dutta R., Kamal A. E., Rouskas A. E., Traffic Grooming for Optical Networks, Springer (2009).
• [13] Dutta A. K., Dutta N. K., Fujiwara M., WDM technologies: optical networks, Elsevier (2004).
• [14] Haverkort B. R., Performance of computer communication systems: a model-based approach, Chichester: John Wiley & Sons (1999).
• [15] Hajder M., Loutskii H., Stręciwilk W., Informatyka. Wirtualna podróż w świat systemów i sieci komuterowych, Wydawnictwo WSIiZ w Rzeszowie (2002).
• [16] Sahni S., Thanvantri V., Parallel Computing: Performance Metrics and Models, IEEE Parallel and Distributed Technology (1996).
• [17] Hajder M., Poprawa efektywności wielomagistalowych sieci klient-serwer, Biuletyn Narodowego Technicznego Uniwersytetu Ukrainy, Kijów (2002).
• [18] Hajder M., Kiełbus M., Matematyczny model opóźnień w sieci z komutacją pakietów, XV Konferencja Sieci i Systemy Informatyczne, Łódź: Wydawnictwo Piątek Trzynastego (2007).
• [19] Clark M. P., Networks and Telecommunications: Design and Operation, John Wiley & Sons (1998).