Load balancing for multiple traffic matrices using SDN hybrid routing

Junjie Zhang, Kang Xi, Min Luo, H. Jonathan Chao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Classical traffic engineering (TE) methods calculate the optimal routing based on a single traffic matrix. However, they are unable to handle unexpected traffic changes. Thus, it is of interest to find a good routing configuration to accommodate multiple possible traffic scenarios. There are two major approaches to achieve load balancing for multiple traffic matrices: destination-based routing and explicit routing. It has been shown that explicit routing performs better than destination-based routing for multiple traffic matrices. However, explicit routing has high complexity and requires large Ternary Content Addressable Memory (TCAM) in the routers. Thus, it is power hungry and unscalable. This paper presents an approach called hybrid routing to achieve load balancing for multiple traffic matrices with low complexity and good scalability. Our basic idea is to complement destination-based routing with a small number of explicit routing forwarding entries to take advantage of both two routing approaches. Hybrid routing greatly reduces the number of forwarding entries compared with pure explicit routing. This has great value for practice in that the scheme requires very small TCAM to implement. Hybrid routing is very suitable for implementation using SDN. A heuristic algorithm is developed to obtain the near-optimal hybrid routing configuration. Extensive evaluation demonstrates the effectiveness of hybrid routing. The results show that hybrid routing achieves near-optimal load balancing compared with pure explicit routing. In particular, hybrid routing saves at least 84.6% TCAM resources in all practical networks used in our evaluation.

Original languageEnglish (US)
Title of host publication2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages44-49
Number of pages6
ISBN (Print)9781479916337
DOIs
StatePublished - Sep 16 2014
Event2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014 - Vancouver, Canada
Duration: Jul 1 2014Jul 4 2014

Other

Other2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014
CountryCanada
CityVancouver
Period7/1/147/4/14

Fingerprint

Associative storage
Telecommunication traffic
Resource allocation
Heuristic algorithms
Routers
Scalability
Software defined networking

Keywords

  • Hybrid Routing
  • Load Balancing
  • Multiple Traffic Matrices
  • TCAM Saving

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Zhang, J., Xi, K., Luo, M., & Chao, H. J. (2014). Load balancing for multiple traffic matrices using SDN hybrid routing. In 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014 (pp. 44-49). [6900880] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPSR.2014.6900880

Load balancing for multiple traffic matrices using SDN hybrid routing. / Zhang, Junjie; Xi, Kang; Luo, Min; Chao, H. Jonathan.

2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 44-49 6900880.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, J, Xi, K, Luo, M & Chao, HJ 2014, Load balancing for multiple traffic matrices using SDN hybrid routing. in 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014., 6900880, Institute of Electrical and Electronics Engineers Inc., pp. 44-49, 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014, Vancouver, Canada, 7/1/14. https://doi.org/10.1109/HPSR.2014.6900880
Zhang J, Xi K, Luo M, Chao HJ. Load balancing for multiple traffic matrices using SDN hybrid routing. In 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 44-49. 6900880 https://doi.org/10.1109/HPSR.2014.6900880
Zhang, Junjie ; Xi, Kang ; Luo, Min ; Chao, H. Jonathan. / Load balancing for multiple traffic matrices using SDN hybrid routing. 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 44-49
@inproceedings{06444312fcb646f6ab6e74cfc9a55987,
title = "Load balancing for multiple traffic matrices using SDN hybrid routing",
abstract = "Classical traffic engineering (TE) methods calculate the optimal routing based on a single traffic matrix. However, they are unable to handle unexpected traffic changes. Thus, it is of interest to find a good routing configuration to accommodate multiple possible traffic scenarios. There are two major approaches to achieve load balancing for multiple traffic matrices: destination-based routing and explicit routing. It has been shown that explicit routing performs better than destination-based routing for multiple traffic matrices. However, explicit routing has high complexity and requires large Ternary Content Addressable Memory (TCAM) in the routers. Thus, it is power hungry and unscalable. This paper presents an approach called hybrid routing to achieve load balancing for multiple traffic matrices with low complexity and good scalability. Our basic idea is to complement destination-based routing with a small number of explicit routing forwarding entries to take advantage of both two routing approaches. Hybrid routing greatly reduces the number of forwarding entries compared with pure explicit routing. This has great value for practice in that the scheme requires very small TCAM to implement. Hybrid routing is very suitable for implementation using SDN. A heuristic algorithm is developed to obtain the near-optimal hybrid routing configuration. Extensive evaluation demonstrates the effectiveness of hybrid routing. The results show that hybrid routing achieves near-optimal load balancing compared with pure explicit routing. In particular, hybrid routing saves at least 84.6{\%} TCAM resources in all practical networks used in our evaluation.",
keywords = "Hybrid Routing, Load Balancing, Multiple Traffic Matrices, TCAM Saving",
author = "Junjie Zhang and Kang Xi and Min Luo and Chao, {H. Jonathan}",
year = "2014",
month = "9",
day = "16",
doi = "10.1109/HPSR.2014.6900880",
language = "English (US)",
isbn = "9781479916337",
pages = "44--49",
booktitle = "2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Load balancing for multiple traffic matrices using SDN hybrid routing

AU - Zhang, Junjie

AU - Xi, Kang

AU - Luo, Min

AU - Chao, H. Jonathan

PY - 2014/9/16

Y1 - 2014/9/16

N2 - Classical traffic engineering (TE) methods calculate the optimal routing based on a single traffic matrix. However, they are unable to handle unexpected traffic changes. Thus, it is of interest to find a good routing configuration to accommodate multiple possible traffic scenarios. There are two major approaches to achieve load balancing for multiple traffic matrices: destination-based routing and explicit routing. It has been shown that explicit routing performs better than destination-based routing for multiple traffic matrices. However, explicit routing has high complexity and requires large Ternary Content Addressable Memory (TCAM) in the routers. Thus, it is power hungry and unscalable. This paper presents an approach called hybrid routing to achieve load balancing for multiple traffic matrices with low complexity and good scalability. Our basic idea is to complement destination-based routing with a small number of explicit routing forwarding entries to take advantage of both two routing approaches. Hybrid routing greatly reduces the number of forwarding entries compared with pure explicit routing. This has great value for practice in that the scheme requires very small TCAM to implement. Hybrid routing is very suitable for implementation using SDN. A heuristic algorithm is developed to obtain the near-optimal hybrid routing configuration. Extensive evaluation demonstrates the effectiveness of hybrid routing. The results show that hybrid routing achieves near-optimal load balancing compared with pure explicit routing. In particular, hybrid routing saves at least 84.6% TCAM resources in all practical networks used in our evaluation.

AB - Classical traffic engineering (TE) methods calculate the optimal routing based on a single traffic matrix. However, they are unable to handle unexpected traffic changes. Thus, it is of interest to find a good routing configuration to accommodate multiple possible traffic scenarios. There are two major approaches to achieve load balancing for multiple traffic matrices: destination-based routing and explicit routing. It has been shown that explicit routing performs better than destination-based routing for multiple traffic matrices. However, explicit routing has high complexity and requires large Ternary Content Addressable Memory (TCAM) in the routers. Thus, it is power hungry and unscalable. This paper presents an approach called hybrid routing to achieve load balancing for multiple traffic matrices with low complexity and good scalability. Our basic idea is to complement destination-based routing with a small number of explicit routing forwarding entries to take advantage of both two routing approaches. Hybrid routing greatly reduces the number of forwarding entries compared with pure explicit routing. This has great value for practice in that the scheme requires very small TCAM to implement. Hybrid routing is very suitable for implementation using SDN. A heuristic algorithm is developed to obtain the near-optimal hybrid routing configuration. Extensive evaluation demonstrates the effectiveness of hybrid routing. The results show that hybrid routing achieves near-optimal load balancing compared with pure explicit routing. In particular, hybrid routing saves at least 84.6% TCAM resources in all practical networks used in our evaluation.

KW - Hybrid Routing

KW - Load Balancing

KW - Multiple Traffic Matrices

KW - TCAM Saving

UR - http://www.scopus.com/inward/record.url?scp=84908591090&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908591090&partnerID=8YFLogxK

U2 - 10.1109/HPSR.2014.6900880

DO - 10.1109/HPSR.2014.6900880

M3 - Conference contribution

AN - SCOPUS:84908591090

SN - 9781479916337

SP - 44

EP - 49

BT - 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -