Jatinder Pal Singh
Jatinder Pal Singh has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Bernd Girod
Information Systems Laboratory, Department of Electrical Engineering, Stanford University, Stanford, CA 94305 USA
3 shared publications - Tansu Alpcan
University of Melbourne
3 shared publications - Aditya Mavlankar
Stanford University
1 shared publication Cheng-Hsin Hsu
National Tsing Hua University, Hsin Chu, Taiwan
1 shared publication- David Chen
Stanford University
1 shared publication - Gabriel Takacs1 shared publication
Latest Publications
- 20 June 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 21 (2) , 469-481
Distortion-Aware Scalable Video Streaming to Multinetwork Clients
We consider the problem of scalable video streaming from a server to multinetwork clients over heterogeneous access networks, with the goal of minimizing the distortion of the received videos. This problem has numerous applications including: 1) mobile devices connecting to multiple licensed and ISM bands, and 2) cognitive multiradio devices employing spectrum bonding. In this paper, we ascertain how to optimally determine which video packets to transmit over each access network. We present models to capture the network conditions and video characteristics and develop an integer program for deterministic packet scheduling. Solving the integer program exactly is typically not computationally tractable, so we develop heuristic algorithms for deterministic packet scheduling, as well as convex optimization problems for randomized packet scheduling. We carry out a thorough study of the tradeoff between performance and computational complexity and propose a convex programming-based algorithm that yields good performance while being suitable for real-time applications. We conduct extensive trace-driven simulations to evaluate the proposed algorithms using real network conditions and scalable video streams. The simulation results show that the proposed convex programming-based algorithm: 1) outperforms the rate control algorithms defined in the Datagram Congestion Control Protocol (DCCP) by about 10-15 dB higher video quality; 2) reduces average delivery delay by over 90% compared to DCCP; 3) results in higher average video quality of 4.47 and 1.92 dB than the two developed heuristics; 4) runs efficiently, up to six times faster than the best-performing heuristic; and 5) does indeed provide service differentiation among users.
- 20 June 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 21 (2) , 469-481
Distortion-Aware Scalable Video Streaming to Multinetwork Clients
We consider the problem of scalable video streaming from a server to multinetwork clients over heterogeneous access networks, with the goal of minimizing the distortion of the received videos. This problem has numerous applications including: 1) mobile devices connecting to multiple licensed and ISM bands, and 2) cognitive multiradio devices employing spectrum bonding. In this paper, we ascertain how to optimally determine which video packets to transmit over each access network. We present models to capture the network conditions and video characteristics and develop an integer program for deterministic packet scheduling. Solving the integer program exactly is typically not computationally tractable, so we develop heuristic algorithms for deterministic packet scheduling, as well as convex optimization problems for randomized packet scheduling. We carry out a thorough study of the tradeoff between performance and computational complexity and propose a convex programming-based algorithm that yields good performance while being suitable for real-time applications. We conduct extensive trace-driven simulations to evaluate the proposed algorithms using real network conditions and scalable video streams. The simulation results show that the proposed convex programming-based algorithm: 1) outperforms the rate control algorithms defined in the Datagram Congestion Control Protocol (DCCP) by about 10-15 dB higher video quality; 2) reduces average delivery delay by over 90% compared to DCCP; 3) results in higher average video quality of 4.47 and 1.92 dB than the two developed heuristics; 4) runs efficiently, up to six times faster than the best-performing heuristic; and 5) does indeed provide service differentiation among users.
- 1 January 2009
- Published by European Alliance for Innovation n.o.
Location coding for mobile image retrieval
- 1 January 2009
- Published by European Alliance for Innovation n.o.
Location coding for mobile image retrieval
- 6 November 2008
- Published by Springer Nature in Wireless Networks
- Vol. 16 (2) , 481-495
A Markov Decision Process based flow assignment framework for heterogeneous network access
- 6 November 2008
- Published by Springer Nature in Wireless Networks
- Vol. 16 (2) , 481-495
A Markov Decision Process based flow assignment framework for heterogeneous network access
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-12
An Optimal Flow Assignment Framework for Heterogeneous Network Access
We consider a scenario where devices with multiple networking capabilities access networks with heterogeneous characteristics. In such a setting, we address the problem of efficient utilization of multiple access networks (wireless and/or wireline) by devices via optimal assignment of traffic flows with given utilities to different networks. We develop and analyze a device middleware functionality that monitors network characteristics and employs a Markov Decision Process (MDP) based control scheme that in conjunction with stochastic characterization of the available bit rate and delay of the networks generates an optimal policy for allocation of flows to different networks. The optimal policy maximizes, under available bit rate and delay constraints on the access networks, a discounted reward which is a function of the flow utilities. The flow assignment policy is periodically updated and is consulted by the flows to dynamically perform network selection during their lifetimes. We perform measurement tests to collect traces of available bit rate and delay characteristics on Ethernet and WLAN networks on a work day in a corporate work environment. We implement our flow assignment framework in ns-2 and simulate the system performance for a set of elastic video-like flows using the collected traces. We demonstrate that the MDP based flow assignment policy leads to significant enhancement in the QoS provisioning (lower packet delays and packet loss rates) for the flows, as compared to policies which do not perform dynamic flow assignment but statically allocate flows to different networks using heuristics like average available bit rate on the networks.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-12
An Optimal Flow Assignment Framework for Heterogeneous Network Access
We consider a scenario where devices with multiple networking capabilities access networks with heterogeneous characteristics. In such a setting, we address the problem of efficient utilization of multiple access networks (wireless and/or wireline) by devices via optimal assignment of traffic flows with given utilities to different networks. We develop and analyze a device middleware functionality that monitors network characteristics and employs a Markov Decision Process (MDP) based control scheme that in conjunction with stochastic characterization of the available bit rate and delay of the networks generates an optimal policy for allocation of flows to different networks. The optimal policy maximizes, under available bit rate and delay constraints on the access networks, a discounted reward which is a function of the flow utilities. The flow assignment policy is periodically updated and is consulted by the flows to dynamically perform network selection during their lifetimes. We perform measurement tests to collect traces of available bit rate and delay characteristics on Ethernet and WLAN networks on a work day in a corporate work environment. We implement our flow assignment framework in ns-2 and simulate the system performance for a set of elastic video-like flows using the collected traces. We demonstrate that the MDP based flow assignment policy leads to significant enhancement in the QoS provisioning (lower packet delays and packet loss rates) for the flows, as compared to policies which do not perform dynamic flow assignment but statically allocate flows to different networks using heuristics like average available bit rate on the networks.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
A Robust Flow Control Framework for Heterogenous Network Access
We investigate a novel robust flow control framework for heterogeneous network access by devices with multi- homing capabilities. Towards this end, we develop an H ∞ -optimal control formulation for allocating rates to devices on multiple access networks with heterogeneous time-varying characteristics. H ∞ analysis and design allow for the coupling between different devices to be relaxed by treating the dynamics for each device as independent of the others. Thus, the distributed end-to-end rate control scheme proposed in this work relies on minimum information and achieves fair and robust rate allocation for the devices. An efficient utilization of the access networks is established through an equilibrium analysis in the static case. We perform measurement tests to collect traces of the available bandwidth on various WLANs and Ethernet. Through simulations, our approach is compared with AIMD and LQG schemes. In addition, the efficiency, fairness, and robustness of the H ∞ -optimal rate controller developed are demonstrated via simulations using the measured real world network characteristics.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
A Robust Flow Control Framework for Heterogenous Network Access
We investigate a novel robust flow control framework for heterogeneous network access by devices with multi- homing capabilities. Towards this end, we develop an H ∞ -optimal control formulation for allocating rates to devices on multiple access networks with heterogeneous time-varying characteristics. H ∞ analysis and design allow for the coupling between different devices to be relaxed by treating the dynamics for each device as independent of the others. Thus, the distributed end-to-end rate control scheme proposed in this work relies on minimum information and achieves fair and robust rate allocation for the devices. An efficient utilization of the access networks is established through an equilibrium analysis in the static case. We perform measurement tests to collect traces of the available bandwidth on various WLANs and Ethernet. Through simulations, our approach is compared with AIMD and LQG schemes. In addition, the efficiency, fairness, and robustness of the H ∞ -optimal rate controller developed are demonstrated via simulations using the measured real world network characteristics.
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
An Experimental Evaluation of Urban Networking using IEEE 802.11 Technology
A new opportunity to reuse existing broadband access infrastructure has arisen by the high penetration of IEEE 802.11 technology family. DSL routers and cable modems with built-in WLAN capabilities allow broadband private customers to share bandwidth with third parties in a safe and controlled way. The success of this approach is highly dependant on the performance of WiFi technology in urban areas. It is critical to experimentally evaluate IEEE 802.11 deployments in places such as houses, flats, parks and offices. This paper describes a solution that enables controlled sharing of existing broadband connections to increase wireless access coverage. The feasibility of our solution is pondered by performing a thorough study of urban networking using IEEE 802.11 technology. We evaluate the performance of this technology in urban environments and analyze the impact of typical factors such as (i) access point elevation in relation to the mobile client, (ii) inter-floor connectivity in urban buildings and (iii) widely used hardware. Using the collected data, we estimate the potential service range for those opening their broadband connections. The results suggest that sharing private connections could exponentially increase wireless coverage in urban areas
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
An Experimental Evaluation of Urban Networking using IEEE 802.11 Technology
A new opportunity to reuse existing broadband access infrastructure has arisen by the high penetration of IEEE 802.11 technology family. DSL routers and cable modems with built-in WLAN capabilities allow broadband private customers to share bandwidth with third parties in a safe and controlled way. The success of this approach is highly dependant on the performance of WiFi technology in urban areas. It is critical to experimentally evaluate IEEE 802.11 deployments in places such as houses, flats, parks and offices. This paper describes a solution that enables controlled sharing of existing broadband connections to increase wireless access coverage. The feasibility of our solution is pondered by performing a thorough study of urban networking using IEEE 802.11 technology. We evaluate the performance of this technology in urban environments and analyze the impact of typical factors such as (i) access point elevation in relation to the mobile client, (ii) inter-floor connectivity in urban buildings and (iii) widely used hardware. Using the collected data, we estimate the potential service range for those opening their broadband connections. The results suggest that sharing private connections could exponentially increase wireless coverage in urban areas
- 1 May 2006
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (5) , 727-736
Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks
The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the video to be delivered over the chosen links. The routing and rate allocation procedures impact the sustained quality of each video stream measured as the mean squared error (MSE) distortion at the receiver, and the overall network congestion in terms of queuing delay per link. We study the trade-off between these two competing objectives in a convex optimization formulation, and discuss both centralized and distributed solutions for joint routing and rate allocation for multiple streams. For each stream, the optimal allocated rate strikes a balance between the selfish motive of minimizing video distortion and the global good of minimizing network congestions, while the routes are chosen over the least-congested links in the network. In addition to detailed analysis, network simulation results using ns-2 are presented for studying the optimal choice of parameters and to confirm the effectiveness of the proposed measures.
- 1 May 2006
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (5) , 727-736
Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks
The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the video to be delivered over the chosen links. The routing and rate allocation procedures impact the sustained quality of each video stream measured as the mean squared error (MSE) distortion at the receiver, and the overall network congestion in terms of queuing delay per link. We study the trade-off between these two competing objectives in a convex optimization formulation, and discuss both centralized and distributed solutions for joint routing and rate allocation for multiple streams. For each stream, the optimal allocated rate strikes a balance between the selfish motive of minimizing video distortion and the global good of minimizing network congestions, while the routes are chosen over the least-congested links in the network. In addition to detailed analysis, network simulation results using ns-2 are presented for studying the optimal choice of parameters and to confirm the effectiveness of the proposed measures.