Ravi Manghirmalani

dblp:82/4004 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Routing and switching · 64% Software-defined and programmable networks · 16% Network optimization and economics · 10%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching
traffic engineering
0.312018
Dragon: Scalable, Flexible, and Efficient Traffic Engineering in Software Defined ISP Networks · IEEE J. Sel. Areas Commun. 2018
Software-defined and programmable networks › network function virtualization
service function chaining
0.212013
StEERING: A software-defined networking for inline service chaining · ICNP 2013
Network optimization and economics › resource allocation
bandwidth allocation
0.112018
Dragon: Scalable, Flexible, and Efficient Traffic Engineering in Software Defined ISP Networks · IEEE J. Sel. Areas Commun. 2018
Wireless networking › network deployment
middlebox deployment
0.012013
StEERING: A software-defined networking for inline service chaining · ICNP 2013
Network management and operations
network configuration
0.012013
StEERING: A software-defined networking for inline service chaining · ICNP 2013

Methods — techniques the papers use, named apart from their topics

parallel optimization · 0.3hierarchical optimization · 0.3service placement optimization · 0.2openflow · 0.2centralized flow steering · 0.2
YearPublicationVenuePosition
2018 Dragon: Scalable, Flexible, and Efficient Traffic Engineering in Software Defined ISP Networks
abstract
To optimize network cost, performance, and reliability, SDN advocates for centralized traffic engineering (TE) that enables more efficient path and egress point selection as well as bandwidth allocation. In this paper, we argue SDN-based TE for ISP networks can be very challenging. First, ISP networks often are very large in size, imposing significant scalability challenges to the centralized TE. Second, ISP networks usually have diverse types of links, switches, and cost models, leading to a complex combination of optimizations. Third, ISP networks not only have many choices of internal paths but also include rich selections of egress points and interdomain routes, unlike cloud/enterprise networks. To overcome these challenges, we present a novel TE application framework, called Dragon, for existing SDN control planes. To address the scalability challenge, Dragon consists of hierarchical and recursive TE algorithms and mechanisms that divide flow optimization problems into subtasks and execute them in parallel. Further, Dragon allows ISPs to express diverse objectives for different parts of their network. Finally, we extend Dragon to jointly optimize the selection of intradomain and interdomain paths. Using extensive evaluation on real topologies and prototyping with SDN controller and switches, we demonstrate that Dragon outperforms existing TE methods both in speed and optimality.
Mehrdad Moradi, Ying Zhang 0022, Z. Morley Mao, Ravi Manghirmalani
IEEE J. Sel. Areas Commun.4
2013 StEERING: A software-defined networking for inline service chaining
abstract
Network operators are faced with the challenge of deploying and managing middleboxes (also called inline services) such as firewalls within their broadband access, datacenter or enterprise networks. Due to the lack of available protocols to route traffic through middleboxes, operators still rely on error-prone and complex low-level configurations to coerce traffic through the desired set of middleboxes. Built upon the recent software-defined networking (SDN) architecture and OpenFlow protocol, this paper proposes StEERING, short for SDN inlinE sERvices and forwardlNG. It is a scalable framework for dynamically routing traffic through any sequence of middleboxes. With simple centralized configuration, StEERING can explicitly steer different types of flows through the desired set of middleboxes, scaling at the level of per-subscriber and per-application policies. With its capability to support flexible routing, we further propose an algorithm to select the best locations for placing services, such that the performance is optimized. Overall, StEERING allows network operators to monetize their middlebox deployment in new ways by allowing subscribers flexibly to select available network services.
Ying Zhang 0022, Neda Beheshti, Ludovic Béliveau, Geoffrey Lefebvre, Ravi Manghirmalani, Ramesh Mishra, Ritun Patney, Meral Shirazipour, Ramesh Subrahmaniam, Catherine Truchan, Mallik Tatipamula
ICNP5
1988 Morris' tree traversal algorithm reconsidered
Prabhaker Mateti, Ravi Manghirmalani
Sci. Comput. Program.2