PL EN


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

Referential graphs

Treść / Zawartość
Identyfikatory
Warianty tytułu
PL
Grafy referencyjne
Języki publikacji
EN
Abstrakty
EN
The authors of this paper have defined the notion of referential graphs which allow to model data and telecommunication networks in order to optimize them. Parameters of this type of graphs can be compared with parameters of modified chordal rings three and four degree. A description of the program developed for graphs of this type and its effects have been presented.
PL
W artykule zdefiniowano pojęcie Grafu Referencyjnego, za pomocą którego można modelować sieci teleinformatyczne w celu ich optymalizacji. Zdefiniowano parametry takiego typu grafów, które zostały porównane z parametrami modyfikowanych pierścieni cięciwowych trzeciego i czwartego stopnia. Do modelowania poszczególnych przypadków opracowano program symulacyjny. Zaprezentowano opis tego programu oraz wyniki otrzymane przy wyszukiwaniu grafów referencyjnych dla szerokiego spektrum danych wejściowych.
Twórcy
  • University of Technology and Life Sciences in Bydgoszcz
autor
  • University of Technology and Life Sciences in Bydgoszcz
autor
  • University of Technology and Life Sciences in Bydgoszcz
Bibliografia
  • [1] Bhuyan L.N., 1987. Interconnection Networks for Parallel and Distributed Processing. IEEE Computer 20(6), 9-12.
  • [2] Bermond J.C., Comellas F., Hsu D., 1995. Distributed loop computer networks:A survey. Journal of Parallel and Distributed Computing 24, 2-10.
  • [3] Blazewicz J., Ecker J.K., Plateau B., Trystram D., 2000. Handbook on parallel and distributed processing. Springer Berlin. Heidelberg.
  • [4] Kotsis G., 1992. Interconnection Topologies and Routing for Parallel Processing Systems. ACPC, Technical Report Series, ACPC/TR92-19.
  • [5] Mans B., 1999. On the Interval Routing of Chordal Rings. ISPAN '99 IEEE – International Symposium on Parallel Architectures, Algorithms and Networks, Fremantle, Australia, 16-21.
  • [6] Kiedrowski P., 2009. Easy Applicable Algorithm for Accelelerate Reading Process in AMR Systems based on WSN Solutions, Image Processing & Communications Challenges (ed. R.S. Choraś, A. Zabłudowski), Academy Publishing House EXIT, 482-487.
  • [7] Kiedrowski P., 2012. Media Independent Protocol Suite for Energy Management Systems Based on Short Range Devices. Prace Instytutu Elektrotechniki LIX, z. 258, 189-199.
  • [8] Kiedrowski P., Boryna B., Marciniak T., 2013. Last-mile smart grid communications based on hybrid technology as a reliable method of data acquisition and distribution, Rynek Energii 1(104), 127-132.
  • [9] Narayanan L., Opatrny J., Sotteau D., 2001. All-to-All Optical Routing in Chordal Rings of Degree 4. Algorithmica 31, 155-178.
  • [10] West D.B., 2000. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall.
  • [11] Arden W., Lee H., 1981. Analysis of Chordal Ring Network. IEEE Transactions on Computers 30(4), 291-295.
  • [12] Gavoille C. (n.d). A Survey on Internal Routing. http://deptinfo.labri.ubordeaux.fr/~gavoille/article/ survey /node28.html
  • [13] Bujnowski S., 2003. Analysis & Synthesis Homogeneous Structure Networks Connecting Communications Modules. PhD Thesis, UTP Bydgoszcz.
  • [14] Pedersen J. M., Gutierrez J.M., Marciniak T., Dubalski, B. Zabłudowski A., 2009. Describing N2R Properties Using Ideal Graphs. Advances in Mesh Networks, MESH 2009. The Second International Conference on Advances in Mesh Networks. ISBN: 978-0-7695-3667-5, 150-154.
  • [15] Azura R.N.F., Othman M., Selamat M.H., Hock P.Y., 2008. Modified Degree Six Chordal Rings Network Topology. Proceedings of Simposium Kebangsaan Sains Matematik Ke-16, 3-5, 515-522.
  • [16] Azura R.N.F., Othman M., Selamat M.H., Hock P.Y., 2010. On properties of modified degree six chordal rings networks. Malaysian Journal of Mathematical Sciences 4(2), 147-157.
  • [17] Farah R.N., Othman M., Selemat H., Hock P.Y., 2008. Analysis of Modified Degree Six Chordal Rings and Traditional Chordal Rings Degree Six Interconnection Network. International Conference of Electronics Design. Penang, Malaysia.
  • [18] Farah R.N., Othman M.., 2010. In Modified Chordal Rings Degree Six Geometrical Representation Properties. Proceedings of Fundamental Science Congress, Kuala Lumpur, Malaysia.
  • [19] Farah R.N., Othman M., Selamat M.H., 2010. Combinatorial properties of modified chordal rings degree four networks. Journal of Computer Science 6(3), 279--284.
  • [20] Farah R. N., Othman M., Selamat M. H., 2010. An optimum free-table routing algorithms of modified and traditional chordal rings networks of degree four. Journal of Material Science and Engineering 4(10), 78-89.
  • [21] Bujnowski S., Dubalski B., Pedersen J.M., Zabłudowski A., 2009. Struktury topologiczne CR3m oraz NdRm. Przegląd Telekomunikacyjny LXXXI, 8/9, 1133--1141.
  • [22] Pedersen J.M., Patel A., Knudsen T.P., Madsen O.B., 2004. Generalized Double Ring Network Structures. Proc. of SCI 2004. The 8th World Multi-Conference On Systemics. Cybernetics and Informatics 8. Orlando, USA, 47-51.
  • [23] Pedersen J.M., Knudsen T.P., Madsen O.B., 2004. Comparing and Selecting Generalized Double Ring Network Structures. Proc. of IASTED CCN 2004. The Second IASTED International Conference Communication and Computer Networks. Cambridge, USA, 375-380.
  • [24] Zabłudowski Ł., Dubalski B., Kiedrowski P., Ledziński D., Marciniak T., 2012. Modified NDR structures. Image Processing and Communications 17(3), ISSN 1425-140X, 29-47.
  • [25] Pedersen J. M., Riaz M.T., Madsen O.B., 2005. Distances in Generalized Double Rings and Degree Three Chordal Rings. Proc. of IASTED PDCN 2005. IASTED International Conference on Parallel and Distributed Computing and Networks.Innsbruck, Austria, 153-158.
  • [26] Ledzińsi D., Bujnowski S., Marciniak T., Pedersen J.M., Gutierrez Lopez J., 2013. Network Structures Constructed on Basis of Chordal Rings 4th Degree. Image Processing and Communications Challenges 5. Advances in Intelligent Systems and Computing 233, 281-299.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-8e246166-af86-4de3-9208-3928b8068b07
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ć.