Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A Formal Framework to Reduce Communications in Communication Systems

  • Conference paper
Innovative Internet Community Systems (IICS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3473))

Included in the following conference series:

Abstract

In this paper we present a method that, given a communicating system, allows us to reduce on average the number of messages sent. The basic idea is to shortcut the most frequent dialogs appearing in the communications. By doing so, some large dialogs can be reduced to only two messages. In addition, not only the number of messages, but also the size of them, can be minimized, on average, by considering the probabilities of sending each message in each state.

Work supported in part by the projects TIC2003-07848-C02-01 and PAC-03-001

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bosik, B.S., Uyar, M.U.: Finite state machine based formal methods in protocol conformance testing. Computer Networks & ISDN Systems 22, 7–33 (1991)

    Article  Google Scholar 

  2. Holzmann, G.J.: Design and Validation of Protocols. Prentice-Hall, Englewood Cliffs (1990)

    Google Scholar 

  3. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  4. Huffman, D.A.: A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers 40(9), 1098–1101 (1952)

    Google Scholar 

  5. Kurshan, R.P.: Computer-aided Verification of Coordinating Processes. Princeton University Press, Princeton (1995)

    MATH  Google Scholar 

  6. Welch, T.A.: A technique for high-performance data compression. IEEE Computer 17(6), 8–19 (1984)

    Google Scholar 

  7. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337–343 (1977)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad Informática, Universidad Complutense de Madrid, C/. Juan del Rosal, 8, E-28040, Madrid, Spain

    Manuel Núñez, Ismael Rodríguez & Fernando Rubio

Authors
  1. Manuel Núñez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ismael Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik, Technische Universität Ilmenau, PF 100565, 98684, Ilmenau, Germany

    Thomas Böhme

  2. CUCEA, Universidad de Guadalajara, Periférico Norte 799, Edif. L308, 45000, Zapopan, Jalisco, Mexico

    Victor M. Larios Rosillo

  3. Departamento de Sistema de Información, Centro Universitario de Ciencias Economicas y Administrativas (CUCEA), Universidad de Guadalajara (UdeG), Anillo Periférico Nte. No. 799, Núcleo Los Belenes, Zapopan

    Helena Unger

  4. Computer Science Dept., University of Rostock, 18051, Rostock, Germany

    Herwig Unger

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Núñez, M., Rodríguez, I., Rubio, F. (2006). A Formal Framework to Reduce Communications in Communication Systems. In: Böhme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds) Innovative Internet Community Systems. IICS 2004. Lecture Notes in Computer Science, vol 3473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553762_7

Download citation

  • DOI: https://doi.org/10.1007/11553762_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28880-0

  • Online ISBN: 978-3-540-33995-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation