Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Karthik Ramasamy.
Archive | 2018
Deep Medhi; Karthik Ramasamy
In this chapter, we present how routing works in the global switched telephone newtork (GSTN). We disucss E.164 addressing for phone devices. We also discusses network and carrier addressing that are used for transfering a call between different providers. We also disuss SS7, the signalling network, and how this is used with circuits for the call network. Finally, we discuss local number portability and its impact on call routing.
Archive | 2018
Deep Medhi; Karthik Ramasamy
Circuit-switched routing is of great historical significance in communication networks as well as for its application in modern communication networks such as optical networks. In this chapter, we first explain circuit-switching and then a number of call routing schemes for circuit-switching. In particular, we explain hierarchical routing and dynamic call routing that have been used in the global switched voice telephone networks. The main focus is to explain the basic principles of hierarchical and dynamic routing since they can be potentially useful in other (and future) communication networks.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
This chapter addresses routing issues in a number of related environments. We first start with routing in optical networks. Optical networks provide the core infrastructure for Internet services across the world, including submarine cables that connect continents via oceans. We discuss in general, how routing in optical networks works for a number of optical network technologies. We then present routing in multilayer newtorks and overlay networks.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
The Global Switched Telephone Network (GSTN) connects callers in different places around the world. For this Voice service over IP (VoIP) services have received considerable attention in the past decade. This raises the issue of providing seamless voice service (and/or multimedia services) between the Internet and the public switched telephone network. In this chapter, we present call routing in this hybrid Internet-GSTN environment.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
The Border Gateway Protocol (BGP) is an inter-domain routing protocol. It plays a critical role in making communication on the Internet work. It facilitates exchange of information about networks, defined by IP prefixes, between autonomous systems (ASes) so that one part of the Internet knows how to reach another part. In this chapter, we present a comprehensive view on BGP by covering topics such as its protocol messages, attributes, and the policy framework.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
Software Defined Networking (SDN) has received much attention in the past several years. SDN allows much better control over a network and is well suited for a network environment such as data center networks where a provider has full administrative control. In this chapter, we discuss SDN architecture and how separation of data and control plane is accomplished. We present OpenFlow, a well-known protocol to accomplish SDN. We then present a number of traffic engineering models that are applicable to SDN flow routing.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
MultiProtocol Label Switching (MPLS) is a popular technology for controlled traffic engineering and for use in virtual private networks. In this chapter, we present MPLS covering the basic concepts and message formats. Further, we discuss how MPLS is used with OSPFand IS–IS extensions to enable traffic engineering. We also discuss GMPLS and where it differs from MPLS. Finally, we discuss MPLS applicability in virtual private networks both at layer 2 and layer 3, and with multicasting.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
In this chapter, we present traffic engineering for circuit-swtiched networks. In particlar, we define the offered load in Erlangs and its relation to blocking for a given capacity. We also discuss blocking computation in the presence of dynamic routing without or with trunk reservation.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
In this chapter, we present the applicability of MPLS for routing and traffic engineering for a set of representative real-world problems. Specifically, four problem classes are considered: 1) An integrated IP/MPLS environment for IP traffic engineering; 2) VPN traffic engineering/routing using MPLS; 3) multicast VPN traffic engineering with MPLS; and 4) a Voice over MPLS network, that is, an MPLS network where voice or multimedia real-time interactive service is provided.
Network Routing (Second edition)#R##N#Algorithms, Protocols, and Architectures | 2018
Deep Medhi; Karthik Ramasamy
In this chapter, we present multicast routing on the Internet. First, IP multicasting addressing discussed both for IPv4 and IPv6. Then, the role of Internet Group Management Protocol (IGMP) in IP multicasting is described. This is followed by presentation of several well-known intra-domain multicasting protocols, namely, Distance-Vector Multicast Routing Protocol (DVMRP), Multicast OSPF (MOSPF), Core Based Trees (CBT), and Protocol Independent Multicast (PIM). Finally, inter-domain multicasting was discussed.
