Skip to main content
SpringerLink
Log in

Modeling Access Control Lists with Discrete-Time Quasi Birth-Death Processes

  • Conference paper
Computer and Information Sciences - ISCIS 2005 (ISCIS 2005)

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

Included in the following conference series:

Abstract

This paper examines Access Control Lists (ACLs) that are used primarily in IP routers for providing network admission control and maintaining a certain level of Quality of Service. We present a method for modeling ACLs and firewall rules in various systems that use the same logic for their operation. Besides, we analyze the performance impact of ACLs on the packet forwarding capability of a router with discrete-time QBD processes.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Funke, R., Grote, A., Heiss, H.-U.: Performance Evaluation of Firewalls in Gigabit-networks. In: Proc. of 1999 Symposium on Performance Evaluation of Computer and Telecommuniction Systems, Chicago (1999)

    Google Scholar 

  2. Catalyst 6000 Family Multilayer Switch Feature Card and Policy Feature Card Configuration Guide, Configuring Access Control Lists, Cisco Systems Inc. (2004), http://www.cisco.com/univercd/home/home.htm

  3. Held, G.: Working with Cisco Access Lists. Int. J. Network Mgmt. 9, 151–154 (1999)

    Article  Google Scholar 

  4. Hazelhurst, S.: A Proposal for Dynamic Access Lists for TCP/IP Packet Filtering. Univer-sity of Witwatersrand, Johannesburg, Technical Report TR-Wits-CS-2001-2 (2001)

    Google Scholar 

  5. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models, pp. 81–107, pp. 63–70, pp. 112–114. Johns Hopkins University Press, Baltimore (1981)

    Google Scholar 

  6. Neuts, M.F.: Structured Stochastic Matrices of M/G/1 Type and Their Applications, pp. 231–248. Marcel Dekker, New York (1989)

    MATH  Google Scholar 

  7. Ye, J., Li, S.: Folding Algorithm: A Computational Method for Finite QBD Processes with Level-Dependent Transitions. IEEE Trans. Commu. 42(2), 625–639 (1994)

    Article  Google Scholar 

  8. Li, S., Sheng, H.-D.: Generalized Folding Algorithm For Sojourn Time Analysis of Finite QBD Processes and its Queuing Applications. In: Proc. of International Conference on Multimedia Computing and Systems, pp. 394–398 (1996)

    Google Scholar 

  9. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. By the American Statistical Association and the Society for Industrial and Applied Mathematics, 83–99, 221–237 (1999)

    Google Scholar 

  10. The discrete event Network Simulator – ns-2, from the University of Southern California, Information Sciences Institute, http://www.isi.edu/nsnam/ns/

Download references

Author information

Authors and Affiliations

  1. Test Competence Center, Ericsson Hungary Ltd., H–1117, Budapest, Irinyi J. u. 4–20, Hungary

    Sándor Palugya & Máté J. Csorba

Authors
  1. Sándor Palugya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Máté J. Csorba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Boğaziçi University, 34342, Bebek, Istanbul, Turkey

    pInar Yolum  & Can Özturan  & 

  2. Computer Engineering Department, Boğaziçi University, 34342, Bebek, İstanbul, Turkey

    Tunga Güngör

  3. Computer Engineering Department, Bogazici University, 80815, Bebek, Istanbul, Turkey

    Fikret Gürgen

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palugya, S., Csorba, M.J. (2005). Modeling Access Control Lists with Discrete-Time Quasi Birth-Death Processes. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_26

Download citation

  • DOI: https://doi.org/10.1007/11569596_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29414-6

  • Online ISBN: 978-3-540-32085-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation