Pradosh Mohapatra

RT-Constrain Lite for Provider Edge Routers

Revised Validation Procedure for BGP Flow Specifications

Fast Connectivity Restoration Using BGP Add-path

Automatic Route Target Filtering for legacy PEs

BGP ACCEPT_OWN Community Attribute

A generic simulation and optimization system for surface mount technology placement machines

Signaling LDP Label Advertisement Completion

draft-ietf-mpls-ldp-end-of-lib-04. txt, …, 2010

... Creek Rd. Research Triangle Park, NC 27709-4987 EMail: rajiva@cisco.com Pradosh Mohapatra Cis... more

Public key cryptography

Crossroads, 2000

ABSTRACT An abstract is not available.

BGP prefix origin validation

draft-ietf-sidr-pfxvalidate- …, 2011

Route Flap Damping Made Usable

Passive and Active …, 2011

The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is... more The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

Download

BGP prefix independent convergence (PIC) technical report

With the explosive growth of the Internet and the growing deployment of layer 3 virtual private n... more With the explosive growth of the Internet and the growing deployment of layer 3 virtual private networks (L3VPN), the size of the Border Gateway Protocol (BGP) routing table has dramatically increased over the past years (in the 750K range in early 2007 counting Internet and L3VPN routes in a typical major Service Provider). Studies have shown that dynamics of BGP may cause several minutes of packet loss during network failures. This duration increases further as the routing table grows, as the traditional convergence operation scales with the number of prefixes. In this paper, we present an alternate solution to provide BGP convergence and demonstrate that it is possible to limit the traffic loss period to sub-second for any failure occurring within the network of a service provider (SP) or on peering links with redundantly-connected peers. This covers the vast majority (if not all) of business models involving tight BGP convergence requirements. We term this alternate solution as BGP Prefix Independent Convergence (PIC) since it works by triggering an immediate and prefix-independent dataplane rerouting of the BGP destinations via the alternate path at Interior Gateway Protocol (IGP) convergence time. We present experimental results of the convergence behavior based on a benchmark of a commercially available carrier router that supports the BGP PIC solution, and on BGP data provided by a Tier-1 ISP.

Download

Layer 3 VPN Services over IPv6 Backbone Networks: Requirements, Technology, and Standardization Efforts

Communications Magazine, IEEE, 2007

Layer 3 virtual private networks (L3VPN) enable organizations to connect geographically dispersed... more

Advertisement of the best external route in BGP

... Expires July 6, 2012 [Page 20] Internet-Draft best-external path advertisement January 2012 A... more

Fully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees

arXiv preprint cs/0002005, 2000

In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spannin... more In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update efficiently the minimum spanning tree after dynamic changes like edge weight changes, rather than having to recompute it from scatch each time. The first part of the paper surveys various algorithms available today both in sequential and distributed environments to solve static MST problem. We also present some of the efficient sequential algorithms for computing dynamic MST like the Frederickson's algorithm and Eppstein's sparsification technique. Lastly we present our new sequential and distributed algorithms for dynamic MST problem. To our knowledge, this is the first of the distributed algorithms for computing dynamic MSTs.

Download

A generic classification and object-oriented simulation toolkit for SMT assembly equipment

Systems, Man and …, 2002

Applications of computer simulation for surface mount technology (SMT) assembly lines have addres... more Applications of computer simulation for surface mount technology (SMT) assembly lines have addressed many aspects of supply chain management, e.g., estimating cycle times, evaluating production equipment and line configurations, optimizing throughput and assessing product design for manufacturability. The implementation of an SMT machine simulator typically requires specialized code based on cycle time characterization experiments for the given machine type. This paper describes a generic simulation toolkit based on a classification of current SMT equipment. A detailed survey of machines has led to the definition of machine families and a generic machine model.

Download

The BGP Encapsulation Subsequent Address Family Identifier (SAFI) and the BGP Tunnel Encapsulation Attribute

... The type code of the attribute is 23. Each TLV contains information corresponding to a partic... more

Uploads

Papers by Pradosh Mohapatra

Log In