2012 IEEE Global Communications Conference (GLOBECOM) 2012
DOI: 10.1109/glocom.2012.6503541
|View full text |Cite
|
Sign up to set email alerts
|

QoS-aware multi-plane routing for future IP-based access networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
3
2

Relationship

4
1

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 12 publications
0
9
0
Order By: Relevance
“…A reference scenario was studied for MPR in [11] and [12] where the RP structure's construct was such that only dedicated RPs (i.e. paths) for every Gateway (GW)-Aggregation Router (AR) pair were considered.…”
Section: B Discussion On the Investigated Practicalitymentioning
confidence: 99%
See 2 more Smart Citations
“…A reference scenario was studied for MPR in [11] and [12] where the RP structure's construct was such that only dedicated RPs (i.e. paths) for every Gateway (GW)-Aggregation Router (AR) pair were considered.…”
Section: B Discussion On the Investigated Practicalitymentioning
confidence: 99%
“…MPR is comprised of an offline TE method that serves to build logical Routing Planes (RPs) rendering a set of multiple shortest paths between all Ingress -Egress routers ahead of the traffic flow in the network that is then governed by an online TE approach. MPR's online TE approach was initially presented in [11] and [12] serving a practical purpose of an integrated solution of distributing IP sessions over RPs.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The non-linear cost function [15], [17] shown in (17) illustrates the method to nonlinearly combine additive QoS parameters, such as delay, jitter, reliability, packet loss, into a single cost metric for any path p d n in routing plane n for demand d while the non-additive ones such as bandwidth, as stated previously, is easily dealt with a preprocession step. Let ( : = 0 , 1 , .…”
Section: Multi-constrained Planementioning
confidence: 99%
“…In this paper, we extended and based our work on the research conducted by authors in [14] and [15], in which a link weight assignment algorithm for network planning and a traffic splitting adjustment algorithm have been developed for creating up to five OSPF routing planes on one hand, and then spreading traffic amid them following the rule same path for same flow. Routing plane is an installation of the standard OSPF routing protocol.…”
Section: Introductionmentioning
confidence: 99%