Optimizing Service Chain ID Generation for Flow Rule Compression

Nirankari, Om Prakash (2016) Optimizing Service Chain ID Generation for Flow Rule Compression. Masters thesis, Indian Institute of Technology Hyderabad.

[img] Text
CS14MTECH11011.pdf - Submitted Version
Restricted to Registered users only until 12 July 2019.

Download (1MB) | Request a copy

Abstract

Service Chain define the order in which a packet will go through middleboxes. Service Chaining provides opportunities for network and service providers to implement their services and policies with finer granularity of an individual user or an application. Software defined Networking (SDN) provides programmable and flexible way for implementing Service Chaining. SDN switches uses Ternary Content Addressable Memory (TCAM) for storing flow rules that decides the forwarding actions. A significant amount of research has been done on Service Chaining implementation but not satisfactory in terms of TCAM exhaustion, scalability and demand modification in middlebox software.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Thesis (Masters)
Uncontrolled Keywords: service hainin, flow rule compression, SDN, TD654
Subjects: Computer science > Big Data Analytics
Divisions: Department of Computer Science & Engineering
Depositing User: Team Library
Date Deposited: 08 Sep 2016 11:18
Last Modified: 08 Sep 2016 11:18
URI: http://raiith.iith.ac.in/id/eprint/2742
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 2742 Statistics for this ePrint Item