A hierarchical multilayer QoS routing system with dynamic SLA management

Iwata, Atsushi; Fujita, Norihito

doi:10.1109/49.898740

Cited by 22 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As described earlier, the packet transmission will be performed hop-by-hop, until p d reaches the destination D. Once p d has reached the destination, the packet will return to the source, where the streaming begins (line 26 -27). However, as Iwata and Fujita [7] have evaluated, the hop-by-hop solution for packet transmission can lead to unnecessary loops (e.g. packet comes back to a node that was along the path).…”

Section: B Routing Algorithmmentioning

confidence: 99%

“…A number of investigation have looked at creating more dynamic OSPF through manipulation of link weights to determine optimal route that can support various QoS constraints [11] [12]. Iwata and Fujita [7] proposed a hierarchical multi-layer QoS routing system in order to support dynamic SLA management. The solution accepts dynamic SLA changes from the users, which is submitted to a policy server of the core network to perform the routing, which is based on QoSEnabled OSPF.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Parameterised Gradient Based Routing (PGBR) for Future Internet

Balasubramaniam

Botvich

Mineraud

et al. 2009

2009 International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

Abstract-The current internet infrastructure is facing a number of limitations that is not suitable to meet the growing number of services and users. In particular, one aspect that requires enhancement is routing, where original routing concepts were designed for static traffic patterns with minimal variations and supporting mainly low throughput traffic (e.g. Data). As the number of users as well as services supporting the user grows, the current routing mechanisms will not be feasible. In this paper we present a gradient based distributed routing technique that is based on discovering routes through a gradient field created in the topology. The gradient calculation is based on weighted sum of a number of components, which modifies the gradient field as the network load changes. Simulation results have also been presented to validate the proposed routing algorithm.

show abstract

Section: B Routing Algorithmmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Parameterised Gradient Based Routing (PGBR) for Future Internet

Balasubramaniam

Botvich

Mineraud

et al. 2009

2009 International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

show abstract

“…The network operator (ISP) has to check if any traffic congestion is present on the path between edge routers; see [2]. We need very effective tool to check it, specially for huge and complex networks with many interior routers on the path.…”

Section: Acceptance Problem Of New Slamentioning

confidence: 99%

“…A solution to the MCOP problem is also a solution to the MCP problem, but not necessarily vice versa; see[2].Inthis paper we dealt about only one dimensional link weight vector, with only one constraint denoted with L. Given constraints are limited bandwidth on each link on the path: L,, m = 1, ..., M, see fig. 2.…”

mentioning

confidence: 98%

Constraint-based path selection for new SLA acceptance

Krile

SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications

View full text Add to dashboard Cite

AbsfractWe need very effective traflic engineering tools to obfain quantitative end-to-end QoS guarantees in DiffServ/iMpLS network architecture, specially for +namic service invocation. Through negotiation process the network operator (ISP) has to check f the new SLA can be accepted because of limited capacity resources on the path and existing traf$c demands. For end-to-end congestion control with N quality of semice levels (classes), an eflicient heuristic algorithm is being developed. For constrained-based path selection an effective algorithm of BFH type is used. The heuristic algorithm is compared with algorithm based on exact approach. In all numerical test-examples the best possible result is achieved, but with significant computation savings. Index Terms: quality of service in Diffseew networks. constrained-based path selection, QoS routing, SLA management

show abstract

“…Thus, large networks are usually composed hierarchically of several domains (a.k.a. areas in OSPF networks), and hierarchical source routing is considered as the most promising scalable QoS routing approach [4], [7], [8]. Hierarchical approaches have been already used in ATM networks with the PNNI routing protocol [9].…”

Section: Related Workmentioning

confidence: 99%

A hierarchical multipath approach to QoS routing: performance and cost evaluation

Lee¹,

Das²,

Pau³

et al.

IEEE International Conference on Communications, 2003. ICC '03.

View full text Add to dashboard Cite

Efforts to provide connection oriented service over the inherently best-effort Internet started almost right after its birth. Today, there exist a multitude of solutions that have been proposed but have never been implemented due to their impracticability. We propose a practical solution for fast, low cost, scalable, and yet accurate QoS routing. We propose to use hierarchical approaches to make the scheme practical and cost-effective. At the same time, we increase network utilization and decrease inaccuracy of stale information by the use of multiple paths. An extensive simulation of the various permutations of schemes over a large set of topologies and traffic conditions validate the proposed schemes and prove conclusively that hierarchical schemes with multiple path capabilities not only result in significantly lower overhead, but also give high levels of QoS performance. This paper presents the architecture of our schemes, the multiple path computation algorithm, and the simulation results validating our claims.

show abstract

A hierarchical multilayer QoS routing system with dynamic SLA management

Cited by 22 publications

References 16 publications

Parameterised Gradient Based Routing (PGBR) for Future Internet

Parameterised Gradient Based Routing (PGBR) for Future Internet

Constraint-based path selection for new SLA acceptance

A hierarchical multipath approach to QoS routing: performance and cost evaluation

Contact Info

Product

Resources

About