Path coupled accounting mechanisms for "all IP networks"

Klenk, Andreas; Schlicker, Philipp; Kühne, Ralph; Fessi, Ali; Fan, Changpeng; Dressler, Falko; Carle, Georg

doi:10.1049/cp:20050231

Cited by 3 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we assume that the network is designed such that we have path-coupled signaling on stateful firewalls and NAT, which means that the forward data path and the backward signaling path contain the same set of middleboxes. The path-coupled property holds for most existing networks [5], [6]. Thus, when all middleboxes in are stateful, the instantaneous reachability from to is the intersection of the set of TCP packets accepted by every ACL on the path from to .…”

Section: B Reachability Formulationmentioning

confidence: 99%

“…1) , where each element is the set of packets representing the instantaneous reachability from to on the th path for connectionless protocols; 2) , where each element is the set of packets representing the instantaneous reachability from to on the th data path and the th signaling path for connection-oriented protocols; 3) , where each element is the set of packets representing the lower-bound reachability from to for connectionless protocols; 4) , where each element is the set of packets representing the lower-bound reachability from to for connection-oriented protocols; 5) , where each element is the set of packets representing the upper-bound reachability from to for connectionless protocols; 6) , where each element is the set of packets representing the upper-bound reachability from to for connection-oriented protocols.…”

Section: A Reachability Matricesmentioning

confidence: 99%

See 1 more Smart Citation

Quantifying and Verifying Reachability for Access Controlled Networks

Liu

Khakpour

2013

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenance, and design. Although attempts to model network reachability have been made, feasible solutions to computing network reachability have remained unknown. In this paper, we propose a suite of algorithms for quantifying reachability based on network configurations [mainly Access Control Lists (ACLs)] as well as solutions for querying network reachability. We present a network reachability model that considers connectionless and connection-oriented transport protocols, stateless and stateful routers/ firewalls, static and dynamic NAT, PAT, IP tunneling, etc. We implemented the algorithms in our network reachability tool called Quarnet and conducted experiments on a university network. Experimental results show that the offline computation of reachability matrices takes a few hours, and the online processing of a reachability query takes 0.075 s on average.

show abstract

Section: B Reachability Formulationmentioning

confidence: 99%

Section: A Reachability Matricesmentioning

confidence: 99%

Quantifying and Verifying Reachability for Access Controlled Networks

Liu

Khakpour

2013

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Here we assume that the network is designed such that we have path-coupled signaling on stateful firewalls and NAT, which means that the forward data path and the backward signaling path contain the same set of middleboxes. The path-coupled property holds for most existing networks [9], [16]. Thus, when all middleboxes in , ( ) are stateful, the instantaneous reachability from to is the intersection of the set of TCP packets accepted by every ACL on the path from to .…”

Section: Notationmentioning

confidence: 99%

Quantifying and Querying Network Reachability

Khakpour

Liu

2010

2010 IEEE 30th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenance, and design. Although attempts to model network reachability have been made, feasible solutions to computing network reachability have remained unknown. In this paper, we propose a suite of algorithms for quantifying reachability based on network configurations (mainly ACLs) as well as solutions for querying network reachability. We present a comprehensive network reachability model that considers connectionless and connection-oriented transport protocols, stateless and stateful routers/firewalls, static and dynamic NAT, PAT, etc. We implemented the algorithms in our network reachability analysis tool called Quarnet and conducted experiments on a university network. Experimental results show that the offline computation of reachability matrices takes a few hours and the online processing of a reachability query takes 0.075 seconds on average.

show abstract

“…These processes are controlled by the Charging Domain which passes so called accounting policies down to the Accounting Domain. Based on such policies the accounting entities are configured taking load-balancing aspects into account as described in [4]. In contrast to accounting in the 3GPP context today the presented Accounting Domain is easily extensible by plugging accounting entities with new capabilities to the system.…”

Section: Accounting Domainmentioning

confidence: 99%

“…he or she may not access this special content), rendering the service is denied by returning a corresponding message to the subscriber's mobile terminal via the Service Portal and no further processing is done in this case. (4) Based on the acquired information, Authorisation then requests a credit check for the given subscriber based on his tariff.…”

Section: Authenticationmentioning

confidence: 99%

Architecture for a service-oriented and convergent charging in 3G mobile networks and beyond

Kühne

Reimer

Schläger

et al. 2005

6th IEE International Conference on 3G and Beyond (05/11182)

View full text Add to dashboard Cite

Services will be the economic driver for 3G mobile networks and beyond. For the provision of new services a charging architecture supporting fast and easy integration of new services on the one hand and enabling versatile tariff models on the other hand is of vital importance. In this paper we present a service-oriented charging architecture. The key idea of the architecture is the separation of service-conscious and service-agnostic areas whereas the different areas are configurable by policy rules. A service example is used to demonstrate the operation and flexibility of our architecture.

show abstract

Path coupled accounting mechanisms for "all IP networks"

Cited by 3 publications

References 2 publications

Quantifying and Verifying Reachability for Access Controlled Networks

Quantifying and Verifying Reachability for Access Controlled Networks

Quantifying and Querying Network Reachability

Architecture for a service-oriented and convergent charging in 3G mobile networks and beyond

Contact Info

Product

Resources

About