Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Separating Codes and Traffic Monitoring

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9778))

Included in the following conference series:

  • 377 Accesses

Abstract

This paper studies the problem of traffic monitoring which consists in differentiating a set of walks on a directed graphs by placing sensors on as few arcs as possible. The problem of characterising a set of individuals by testing as few attributes as possible is already well-known but traffic monitoring presents new challenges that the previous models of separation fall short at modelling such as taking into account the multiplicity and order of the arcs in a walk. We therefore introduce a new stronger model of separation based on languages that generalises the traffic monitoring problem. We study two subproblems that we think are especially relevant for practical applications and develop methods to solve them combining integer linear programming, separating codes and language theory.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Arden, D.N.: Delayed-logic and finite-state machines. In: Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961), FOCS 1961, pp. 133–151. IEEE Computer Society, Washington, DC (1961)

    Google Scholar 

  2. Argiroffo, G.R., Bianchi, S.M., Wagler, A.K.: Polyhedra associated with identifying codes. Electron. Not. Discrete Math. 44, 175–180 (2013)

    Article  Google Scholar 

  3. De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program. 98(1–3), 477–491 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Charbit, E., Charon, I., Cohen, G.D., Hudry, O., Lobstein, A.: Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Comm. 2(4), 403–420 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Charon, I., Cohen, G.D., Hudry, O., Lobstein, A.: Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29(5), 1353–1364 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is np-hard. Theoret. Comput. Sci. 290(3), 2109–2120 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  8. Haynes, T.W., Knisley, D.J., Seier, E., Zou, Y.: A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. 7, 108 (2006)

    Article  Google Scholar 

  9. Honkala, I.S., Laihonen, T., Ranto, S.M.: On strongly identifying codes. Discrete Math. 254(1–3), 191–205 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation - International Edition, 2nd edn. Addison-Wesley (2003)

    Google Scholar 

  11. Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599–611 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kim, J.H., Pikhurko, O., Spencer, J.H., Verbitsky, O.: How complex are random graphs in first order logic? Random Struct. Algorithms 26(1–2), 119–145 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies (1956)

    Google Scholar 

  14. Laifenfeld, M., Trachtenberg, A., Cohen, R., Starobinski, D.: Joint monitoring and routing in wireless sensor networks using robust identifying codes. MONET 14(4), 415–432 (2009)

    Google Scholar 

  15. Maheshwari, S.: Traversal marker placement problem are np-complete. In Research report no CU-CS-092-76, Dept. of Computer Science, University of Colorado at Boulder (1976)

    Google Scholar 

  16. Metze, G., Schertz, D.R., To, K., Whitney, G., Kime, C.R., Russell, J.D.: Comments on “derivation of minimal complete sets of test-input sequences using boolean differences. IEEE Trans. Comput. 24(1), 108 (1975)

    Article  MATH  Google Scholar 

  17. Meurdesoif, P., Pesneau, P., Vanderbeck, F.: Meter installation for monitoring network traffic. In: International Network Optimization Conference (INOC), Spa, Belgium, 2007

    Google Scholar 

  18. Moret, B., Shapiro, H.: On minimizing a set of tests. SIAM J. Sci. Stat. Comput. 6(4), 983–1003 (1985)

    Article  Google Scholar 

  19. Narendra, P.M., Fukunaga, K.: A branch and bound algorithm for feature subset selection. IEEE Trans. Comput. 26(9), 917–922 (1977)

    Article  MATH  Google Scholar 

  20. Seo, S.J., Slater, P.J.: Open neighborhood locating-dominating in trees. Discrete Appl. Math. 159(6), 484–489 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Seo, S.J., Slater, P.J.: Open neighborhood locating-domination for infinite cylinders. In: ACM Southeast Regional Conference, pp. 334–335 (2011)

    Google Scholar 

  22. Ungrangsi, R., Trachtenberg, A., Starobinski, D.: An implementation of indoor location detection systems based on identifying codes. In: Aagesen, F.A., Anutariya, C., Wuwongse, V. (eds.) INTELLCOMM 2004. LNCS, vol. 3283, pp. 175–189. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Holmes, B., Willcox, W.R., Lapage, S.P.: A review of numerical methods in bacterial identification. Antonie van Leeuwenhoek 46(3), 233–299 (1980)

    Article  Google Scholar 

  24. Willcox, W.R., Lapage, S.P.: Automatic construction of diagnostic tables. Comput. J. 15(3), 263–267 (1972)

    Article  Google Scholar 

Download references

Acknowledgements

I would like to thank my thesis advisor Arnaud Pêcher for his invaluable guidance for the writing of this paper and throughout the research that led to it.

Author information

Authors and Affiliations

  1. LaBRI, University of Bordeaux, Bordeaux, France

    Thomas Bellitto

Authors
  1. Thomas Bellitto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Bellitto .

Editor information

Editors and Affiliations

  1. Università degli Studi di Bergamo , Bergamo, Italy

    Riccardo Dondi

  2. Université de Nantes , Nantes, France

    Guillaume Fertin

  3. Università degli Studi di Milano-Bicocca , Milano, Italy

    Giancarlo Mauri

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bellitto, T. (2016). Separating Codes and Traffic Monitoring. In: Dondi, R., Fertin, G., Mauri, G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science(), vol 9778. Springer, Cham. https://doi.org/10.1007/978-3-319-41168-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41168-2_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-41167-5

  • Online ISBN: 978-3-319-41168-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation