2018
2.
Nadig, D.; Ramamurthy, B.; Bockelman, B.; Swanson, D.
Optimized Service Chain Mapping and reduced flow processing with Application-Awareness Proceedings Article
In: 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft), pp. 303–307, 2018.
Abstract | BibTeX | Tags: AAFR algorithm, application-aware flow reduction algorithm, application-awareness, Bandwidth, capacitated-SFC mapping case, capacitated/uncapacitated flow, cloud computing, commercial-off-the-shelf hardware, computer centres, Conferences, cost gains, data center, Data centers, Data models, flow processing cost, flow-processing costs, flow-to-SFC mappings, integer linear programming formulation, integer programming, Internet, linear programming, multiple data centers, network function virtualization, network functions, network functions virtualization, optimally map service function chains, optimized service chain mapping, security, Service Chaining, service function chains, SFC mapping, SFC mapping problem, SFC-ILP, software defined networks, Substrates, virtualisation, virtualized services | Links:
@inproceedings{nadig_optimized_2018,
title = {Optimized Service Chain Mapping and reduced flow processing with Application-Awareness},
author = {D. Nadig and B. Ramamurthy and B. Bockelman and D. Swanson},
url = {https://deepaknadig.com/wp-content/uploads/2021/09/Nadig-et-al.-2018-Optimized-Service-Chain-Mapping-and-reduced-flow-p.pdf},
doi = {10.1109/NETSOFT.2018.8459912},
year = {2018},
date = {2018-06-01},
urldate = {2018-06-01},
booktitle = {2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)},
pages = {303--307},
abstract = {Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).},
keywords = {AAFR algorithm, application-aware flow reduction algorithm, application-awareness, Bandwidth, capacitated-SFC mapping case, capacitated/uncapacitated flow, cloud computing, commercial-off-the-shelf hardware, computer centres, Conferences, cost gains, data center, Data centers, Data models, flow processing cost, flow-processing costs, flow-to-SFC mappings, integer linear programming formulation, integer programming, Internet, linear programming, multiple data centers, network function virtualization, network functions, network functions virtualization, optimally map service function chains, optimized service chain mapping, security, Service Chaining, service function chains, SFC mapping, SFC mapping problem, SFC-ILP, software defined networks, Substrates, virtualisation, virtualized services},
pubstate = {published},
tppubtype = {inproceedings}
}
Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).
2008
1.
Nadig, Deepak; Thareja, R.; Nikhil, N. A.
Performance analysis and evaluation of delay-tolerant network bundling protocol on a scalable virtual network test platform Proceedings Article
In: 2008 IET International Conference on Wireless, Mobile and Multimedia Networks, pp. 52–55, 2008.
Abstract | BibTeX | Tags: delay-tolerant network bundling protocol, delays, Internet, Internet protocol, scalable virtual network, TCP/UDP, transport protocols | Links:
@inproceedings{nadig_performance_2008,
title = {Performance analysis and evaluation of delay-tolerant network bundling protocol on a scalable virtual network test platform},
author = {Deepak Nadig and R. Thareja and N. A. Nikhil},
doi = {10.1049/cp:20080143},
year = {2008},
date = {2008-01-01},
booktitle = {2008 IET International Conference on Wireless, Mobile and Multimedia Networks},
pages = {52--55},
abstract = {The use of Internet protocol suite of TCP/UDP in environments characterized by high delay and high link error rates result in significant degradation of the Protocol performance. The DTN bundle protocol can be used in such scenarios. Performance evaluation of delay-tolerant network bundle protocol in a live network is difficult due to the absence of networks characterized by extreme environs. Control on specific performance metrics like link delay, bandwidth, connectivity, traffic flow and queue sizes are thus rendered impossible without the incorporation of a control system either in software implementation or network hardware. The control over specific environments in real- world deployments and the analysis of the protocol deployment in the above provides an understanding into the performance of the bundling protocol in harsh networking environments. This paper presents the analysis and evaluation of performance of a delay-tolerant network in a virtual test platform setup.},
keywords = {delay-tolerant network bundling protocol, delays, Internet, Internet protocol, scalable virtual network, TCP/UDP, transport protocols},
pubstate = {published},
tppubtype = {inproceedings}
}
The use of Internet protocol suite of TCP/UDP in environments characterized by high delay and high link error rates result in significant degradation of the Protocol performance. The DTN bundle protocol can be used in such scenarios. Performance evaluation of delay-tolerant network bundle protocol in a live network is difficult due to the absence of networks characterized by extreme environs. Control on specific performance metrics like link delay, bandwidth, connectivity, traffic flow and queue sizes are thus rendered impossible without the incorporation of a control system either in software implementation or network hardware. The control over specific environments in real- world deployments and the analysis of the protocol deployment in the above provides an understanding into the performance of the bundling protocol in harsh networking environments. This paper presents the analysis and evaluation of performance of a delay-tolerant network in a virtual test platform setup.