Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
On the Capture Time of Cops and Robbers Game on a Planar Graph Read chapter Read first chapter

2016 | OriginalPaper | Chapter

Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model

Authors : Petr Gregor, Riste Škrekovski, Vida Vukašinović

Published in: Combinatorial Optimization and Applications

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In the 1-in port model, every vertex of a synchronous network can receive each time unit at most one message. We consider simultaneous broadcasting of multiple messages from the same source in such networks with an additional restriction that every received message can be sent out to neighbors only in the next time unit and never to already informed vertex. We use a general concept of level-disjoint partitions developed for this scenario. Here we introduce a subgraph extension technique for efficient spreading information within this concept. Surprisingly, this approach with so called biwheels leads to simultaneous broadcasting of optimal number of messages on a wide class of graphs in optimal time. In particular, we provide tight results for bipartite tori, meshes, hypercubes. Several problems and conjectures are proposed.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Total Dual Integrality of Triangle Covering
next chapter Fast Searching on Complete k-partite Graphs
Literature
1.
Bar-Noy, A., Kionis, S., Schieber, B.: Optimal multiple message broadcasting in telephone-like communication systems. Discrete Appl. Math. 100, 1–15 (2000)MathSciNetCrossRefMATH
2.
Bruck, J., Cypher, R., Ho, C.T.: Multiple message broadcasting with generalized Fibonacci trees. In: Proceedings of the 4th Symposium on Parallel and Distributed Processing, pp. 424–431 (1992)
3.
Chang, F.-H., Chen, Y.-M., Chia, M.-L., Kuo, D., Yu, M.-F.: All-to-all broadcast problem of some classes of graphs under the half duplex all-port model. Discrete Appl. Math. 173, 28–34 (2014)MathSciNetCrossRefMATH
4.
5.
6.
Gregor, P., Škrekovski, R., Vukašinović, V.: Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. 266, 244–258 (2015)MathSciNet
7.
Gregor, P., Škrekovski, R., Vukašinović, V.: Modelling simultaneous broadcasting by level-disjoint partitions. Preprint arXiv:​1609.​01116
8.
Grigoryan, H.: Problems related to broadcasting in graphs. Ph.D. thesis, Concordia University, Montreal, Quebec, Canada (2013)
9.
10.
11.
Harutyunyan, H.A.: Multiple message broadcasting in modified Knödel graphs. In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, pp. 157–165 (2000)
12.
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319–349 (1988)MathSciNetCrossRefMATH
13.
Hromkovič, J., Klasing, R., Monien, B., Piene, R., Du, D.-Z., Hsu, D.F.: Dissemination of information in communication networks (broadcasting and gossiping). Combinatorial Network Theory. Applied Optimization, vol. 1, pp. 125–212. Springer, New York (1996)CrossRef
14.
Hromkovič, J., Klasing, R., Pelc, A., Ružička, P., Unger, W.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. Springer, Berlin (2005)MATH
15.
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)MATH
16.
Sun, C.M., Lin, C.K., Huang, H.M., Hsu, L.H.: Mutually independent Hamiltonian cycles in hypercubes. In: Proceedings of 8th Symposium on Parallel Architectures, Algorithms and Networks (2005)
17.
Vukašinović, V., Gregor, P., Škrekovski, R.: On the mutually independent Hamiltonian cycles in faulty hypercubes. Inform. Sci. 236, 224–235 (2013)MathSciNetCrossRefMATH
18.
Wu, K.-S., Juan, JS.-T.: Mutually independent Hamiltonian cycles of \(C_m \times C_n\) when \(m\), \(n\) are odd. In: Proceedings of 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 165–170 (2012)
Metadata
Title
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model
Authors
Petr Gregor
Riste Škrekovski
Vida Vukašinović
Copyright Year
2016
Book
Combinatorial Optimization and Applications

Print ISBN: 978-3-319-48748-9

Electronic ISBN: 978-3-319-48749-6

Copyright Year: 2016

DOI
https://doi.org/10.1007/978-3-319-48749-6_11

Premium Partner

    Image Credits