Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Narayanan Venkitaraman

dblp:63/4466 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 5 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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
3 papers
Internet architecture and protocols · 57% Transport protocols and congestion control · 39% Cellular and mobile networks · 4%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › quality of service › qos architecture
core-stateless network
0.012000
Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks · INFOCOM 2000
Internet architecture and protocols › quality of service › differentiated services
delay differentiation
0.012000
Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks · INFOCOM 2000
Internet architecture and protocols › quality of service › differentiated services
per-hop behavior
0.012000
Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks · INFOCOM 2000
Internet architecture and protocols
quality of service
0.012000
Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks · INFOCOM 2000
Transport protocols and congestion control
congestion control algorithm design
0.011999
Design and Evaluation of Congestion Control Algorithms in the Future Internet · SIGMETRICS 1999
Transport protocols and congestion control › transport protocols
rate-based transport protocol
0.011999
WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks · MobiCom 1999
Transport protocols and congestion control › transport protocols
wireless transport protocol
0.011999
WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks · MobiCom 1999
Transport protocols and congestion control
queue management
0.012000
Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks · INFOCOM 2000
Internet architecture and protocols
future internet
0.011999
Design and Evaluation of Congestion Control Algorithms in the Future Internet · SIGMETRICS 1999
Cellular and mobile networks › mobile networks
WWAN
0.011999
WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks · MobiCom 1999

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

simulation · 0.0analysis · 0.0rate control · 0.0performance evaluation · 0.0end-to-end mechanisms · 0.0
YearPublicationVenuePosition
2008 Wide-Area Media Sharing with UPnP/DLNA
abstract
DLNA has defined schemes for interoperable content sharing between devices in a home network. In this paper we describe our architecture for extending UPnP and sharing content between devices using DLNA specified schemes across broadband wireless networks. The architecture relies only on end-points and does not require any service specific intelligence in network servers. We also describe how that same approach can also enable sharing between remote mobile devices and in-home off-the-shelf DLNA compatible devices.
Narayanan Venkitaraman
CCNC1
2008 A P2P Model for SIP Based Telecom Services
abstract
This paper describes an architecture for providing services using only generic network functions and without requiring service-specific intelligence in the network. We also describe its rationale, our implementation and use some SIP based call services as examples to show how the architecture can facilitate creation of peer-to-peer instantiations of services.
Narayanan Venkitaraman, Ross Lillie
CCNC1
2004 Session aware network controlled interface selection for multihomed hosts
abstract
This paper proposes network-controlled architecture to enable multihomed devices-devices that have multiple network interfaces independently connected to different networks - to effectively use all the available interfaces. The salient features of our approach are that it is session aware, i.e. the choice of network interface is based on the network state and session characteristics. Furthermore, it does so without exposing a user's location and preferences to the correspondent nodes thereby preserving user privacy. Network control using a middle-box as opposed to an end-to-end mechanism ensures fast response, optimal network use, minimal changes to end hosts and support for legacy applications and provides a detailed instantiation in the context of a SIP based call model. This paper also discusses deployment issues and details of our implementation.
Narayanan Venkitaraman, Jay Almaula, Anwar Haneef, Jayanth Mysore
WCNC1
2002 WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks
Prasun Sinha, Thyaga Nandagopal, Narayanan Venkitaraman, Raghupathy Sivakumar, Vaduvur Bharghavan
Wirel. Networks3
2000 Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network
abstract
Corelite is a quality of service architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers. There are three key mechanisms that work in concert to achieve the service model of Corelite: the introduction of markers in a packet flow by the edge routers to reflect the normalized rate of the flow; weighted fair marker feedback at the core routers upon incipient congestion detection; and linear increase/multiplicative decrease based rate adaptation of packet flows at the edge routers in response to marker feedback.
Raghupathy Sivakumar, Tae-eun Kim, Narayanan Venkitaraman, Jia-Ru Li, Vaduvur Bharghavan
ICDCS3
2000 Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks
abstract
We present a core-stateless quality of service architecture for achieving delay differentiation between flows. There are two key components in our approach: (1) per-class per-hop relative average delay-the average queueing delay perceived by the packets in a delay class at a link is inversely proportional to the delay weight of the class; (2) per-flow end-to-end delay class adaptation-the delay class of a flow is dynamically adjusted based on its perceived end-to-end delay in order to maintain the desired end-to-end average delay requirement of the flow. We show through simulations and analysis that these two components can, in concert, support end-to-end delay differentiation between flows using only simple mechanisms at the core routers in the network.
Thyaga Nandagopal, Narayanan Venkitaraman, Raghupathy Sivakumar, Vaduvur Bharghavan
INFOCOM2
1999 WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks
abstract
Most current wireless wide area packet data networks (WWANs) are characterized by low and variable bandwidths, high and variable delays, significant non-congestion related loss, asymmetric uplink and downlink channels, and occasional blackouts.Additionally, the majority of the latency in a WWAN connection is incurred over the wireless link.Under such operating conditions, most contemporary wireless TCP algorithms do not perform very well.In this paper, we present WTCP, a reliable transport protocol that is designed to operate efficiently over commercial WWAN networks such as CDPD.WTCP is rate-based, uses only end-to-end mechanisms, performs rate control at the receiver, and uses the ratio of sending rate to receiving rate as the primary metric for rate control.We have implemented and evaluated WTCP over the CDPD network, and also simulated it in the ns-2 simulator.Our initial results indicate the WTCP can improve on the performance of comparable algorithms such as TCP-NewReno, TCP-Vegas, and Snoop-TCP by between 20% to 200% for typical operating conditions.'Most of the current deployment uses the proxy model for three reasons: (a) the connection quality of the WWAN network is too poor to sustain typical client-server applications, (b) the amount of data transfered to the mobile host must be filtered because of the orders of magnitude difference in bandwidth between the wired and WWAN connections, and (c) many portable computing devices have display and processing limitations that must be addressed by the proxy before sending the processed/filtered response to the mobile user.Permission to make digital or hard copies of all or part of this work tw personal or classroom use is gxnted without fee provided that coPi= are oat ma& or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first Page.To COPY othenvise, to rqublish, to post on servers or to redistribute to lists, reqllires prior specific permissioll and/or a fee.
Prasun Sinha, Narayanan Venkitaraman, Raghupathy Sivakumar, Vaduvur Bharghavan
MobiCom2
1999 Design and Evaluation of Congestion Control Algorithms in the Future Internet
abstract
No abstract available.
Narayanan Venkitaraman, Tae-eun Kim, Kang-Won Lee 0002
SIGMETRICS1
1999 A wireless transmission control protocol for CDPD
abstract
Many current wireless wide area packet data networks are characterized by very low and variable bandwidths, very high and variable delays, significant non-congestion related loss, asymmetric uplink and downlink channels, and occasional blackouts. Additionally, the majority of the latency in a WWAN connection is incurred over the wireless link. Under such operating conditions, most contemporary wireless TCP algorithms do not perform very well. Sinha, Venkitaraman, Sivakumar and Bharghavan (see Proc. of ACM Mobicom '99, 1999) we presented WTCP, a reliable transport protocol that is designed to operate efficiently and fairly over wireless wide area networks. WTCP is rate-based, uses only end-to-end mechanisms, performs rate control at the receiver, and uses the ratio of sending rate to receiving rate as as the primary metric for rate control. In this paper, we evaluate the performance of WTCP over CDPD networks. We have implemented and evaluated WTCP over the CDPD network, and also simulated it in the ns-2 simulator. Our performance results indicate that WTCP can improve on the performance of comparable algorithms such as TCP-NewReno and TCP-Vegas by between 20% to 200% for typical operating conditions.
Prasun Sinha, Narayanan Venkitaraman, Thyaga Nandagopal, Raghupathy Sivakumar, Vaduvur Bharghavan
WCNC2