S Banerjee

Publications (2)0 Total impact

• Source

  Available from: psu.edu

  Conference Proceeding: VoIP on Wireless Meshes: Models, Algorithms and Evaluation

  A. Kashyap, S. Ganguly, S.R. Das, S. Banerjee
  [show abstract] [hide abstract]
  ABSTRACT: We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls. Call admission decisions must evaluate how the capacity of the mesh network is utilized by the existing calls. We address this issue via a measurement-based modeling effort to model mutual interference between wireless links. The modeling approach evaluates whether capacity constraints (or, required QoS metrics) will be satisfied if a new call is admitted with a given route. Evaluations with a 6-node 802.11a testbed demonstrate excellent accuracy of the model and thus also the CAC performance. We address the issue of route selection by also using a modeling approach that considers models of transmission and interference ranges to develop a polynomial-time algorithm to search for feasible routes. This problem takes exponential time for wireless networks without such modeling. In addition to studying feasibility, we study several routing metrics such as shortest feasible path and maximum residual feasible path. Finally, we develop a new method for routing using call statistics that uses prior calling patterns to avoid potentially critical links. We evaluate the performance of these route selection techniques via extensive simulations and demonstrate the superiority of using max residual feasible path over simply shortest feasible path, and routing using call statistics over max residual feasible path.
  INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE; 06/2007
• Source

  Available from: psu.edu

  Conference Proceeding: Fast replication in content distribution overlays

  S. Ganguly, A. Saxena, S. Bhatnagar, R. Izmailov, S. Banerjee
  [show abstract] [hide abstract]
  ABSTRACT: We present SPIDER-a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private network. In order to exploit spatial diversity of the underlying network, SPIDER uses an overlay structure composed of dedicated transit nodes (TNs). The data transport mechanism in SPIDER leverages this overlay structure to provide a coordinated approach that minimizes the maximum time to replicate to all destination sites (the make span of content replication). In order to achieve this objective, SPIDER employs two orthogonal components: a) creation of multiple dynamic distribution trees using the transit nodes b) end-to-end reliable data transport with flow control on these trees by chaining point-to-point TCPs. We further present simulations based results to quantify benefits of tree construction algorithms in random topologies. We evaluate the real implementation of the SPIDER in Planet Lab and observe a 2-6 times speed up compared to different existing schemes.
  INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE; 04/2005