Browse by Author "Gupta, Indranil"

  • Saremi, Fatemeh; Gupta, Indranil (2011)
    Disruption-Tolerant Networks (DTNs) enable transfer of data when network nodes are only intermittently connected. With respect to the scarcity of connectivity in DTNs, a key research challenge is to guarantee schedulability ...

    application/pdf

    application/pdfPDF (373Kb)
  • Gupta, Indranil (2004-05)
    We propose a framework to translate systems of differential equations into distributed protocols. The synthesized protocols are state machines containing probabilistic transitions and actions, and they show equivalent ...

    application/pdf

    application/pdfPDF (574Kb)
  • Gupta, Indranil; Jo, Yookyung (2005-02)
    The invention of distributed protocols is an extremely challenging activity. Today however, few design paradigms are available for the creative task of designing scalable and reliable protocols for the Grid, peer to peer ...

    application/pdf

    application/pdfPDF (175Kb)
  • Liang, Jin; Gupta, Indranil; Nahrstedt, Klara (2006-06)
    The emergence of large-scale distributed computing clusters such as PlanetLab and Utility Grids has fueled the development of applications ranging from content distribution to name service to large-scale prototype experiments. ...

    application/pdf

    application/pdfPDF (239Kb)
  • Newell, James; Gupta, Indranil (2005-02)
    Peer-to-peer distributed hash tables (p2p DHTs) are individually built by their designers with specific performance goals in mind. However, no individual DHT can satisfy an application that requires a "best of all worlds" ...

    application/pdf

    application/pdfPDF (376Kb)
  • Khurshid, Ahmed; Al-Nayeem, Abdullah; Gupta, Indranil (2009-06-30)
    Cloud computing has the potential to bring sophisticated computing facility at the door-steps of users. The performance of services hosted at a cloud generally depends on its computation, storage and networking models. ...

    application/pdf

    application/pdfPDF (194Kb)
  • Ko, Steven Y.; Gupta, Indranil (2005-04)
    This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay-independent. Perturbation-resistance means ...

    application/pdf

    application/pdfPDF (111Kb)
  • Rahman, Muntasir Raihan; Tseng, Lewis; Nguyen, Son; Gupta, Indranil; Vaidya, Nitin (2014)
    The CAP theorem is a fundamental result that applies to distributed storage systems. In this paper, we first propose and prove a probabilistic variant of the CAP theorem. This extends the CAP theorem from merely being a ...

    application/pdf

    application/pdfPDF (603Kb)
  • Patel, Jay A.; Luo, Haiyun; Gupta, Indranil (2007-11)
    The design of single transceiver based multi-channel multi-hop wireless mesh networks focuses on the trade-off between rapid neighbor synchronization and maximizing the usage of all available channels. Existing designs are ...

    application/pdf

    application/pdfPDF (324Kb)
  • Thompson, Nathanael A.; Ucan, Ercan; Gupta, Indranil (2006-05)
    Many distributed applications are beginning to employ gossip-based message dissemination, where the burden of content distribution is shared democratically among the recipient nodes, e.g., for RSS distribution. However, ...

    application/pdf

    application/pdfPDF (184Kb)
  • Kyasanur, Pradeep N.; Choudhury, Romit Roy; Gupta, Indranil (2006-04)
    Probabilistic techniques have been used to address many challenges in sensor networks. However, little work exists on developing adaptive versions of probabilistic protocols. In this paper, we consider the class of ...

    application/pdf

    application/pdfPDF (245Kb)
  • Hoque, Imranul; Gupta, Indranil (2010-12-03)
    Disk access patterns of social networking applications are different from those of traditional applications. However, today's disk layout techniques are not adapted to social networking workloads and thus suffer in ...

    application/pdf

    application/pdfPDF (355Kb)
  • Amin, Md Tanvir Al; Li, Shen; Rahman, Muntasir Raihan; Seetharamu, Panindra Tumkur; Wang, Shiguang; Abdelzaher, Tarek F.; Gupta, Indranil; Srivatsa, Mudhakar; Ganti, Raghu; Ahmed, Reaz; Le, Hieu (2015-02-03)
    The increasing availability of smartphones, cameras, and wearables with instant data sharing capabilities, and the exploitation of social networks for information broadcast, heralds a future of real-time information overload. ...

    application/pdf

    application/pdfPDF (396Kb)
  • Newell, James; Gupta, Indranil (2006-05)
    Today's emerging large-scale p2p systems such as GRID or PlanetLab applications tend to require a capacity for time-indexing system data that is updated perpetually. Time-indexing is defined as the ability to efficiently ...

    application/pdf

    application/pdfPDF (247Kb)
  • Zheng, Rong; He, Guanghui; Gupta, Indranil; Hou, Jennifer C.; Sha, Lui (2004-04)
    Time attribute is one of the most important attributes of time series data generated in wireless sensor networks. Coupled with energy, bandwidth, computational constraints of wireless sensors, efficient mechanisms need to ...

    application/pdf

    application/pdfPDF (382Kb)
  • Wu, Wanmin; Yang, Zhenyu; Gupta, Indranil; Nahrstedt, Klara (2008-03)
    3D tele-immersion (3DTI) has recently emerged as a new way of video- mediated collaboration across the Internet. Unlike conventional 2D video-conferencing systems, it can immerse remote users into a shared 3D virtual space ...

    application/pdf

    application/pdfPDF (999Kb)
  • Patel, Jay A.; Yang, Charles M.; Gupta, Indranil (2005-03)
    A flash crowd occurs when a stampede of clients attempt to access a resource, e.g., a Web page. It can cause drastic performance degradation at servers and clients, and even outage of the service. In this paper, we first ...

    application/pdf

    application/pdfPDF (754Kb)
  • Devaraj, Christo; Nagda, Mehwish; Gupta, Indranil; Agha, Gul A. (2005-04)
    We propose localized and decentralized protocols to construct and maintain an underlay for sensor networks. An underlay lies in between overlay operations (e.g., data indexing, multicast, etc.) and the sensor network itself. ...

    application/pdf

    application/pdfPDF (366Kb)
  • Vu, Long; Gupta, Indranil; Nahrstedt, Klara; Liang, Jin (2008-09)
    This paper presents results from our measurement and modeling efforts on the large-scale peer- to-peer (p2p) overlay graphs spanned by the PPLive system, the most popular and largest p2p IPTV (Internet Protocol Television) ...

    application/pdf

    application/pdfPDF (437Kb)
  • Vu, Long; Gupta, Indranil; Nahrstedt, Klara; Liang, Jin (2008-09)
    This paper presents results from our measurement and modeling efforts on the large-scale peer- to-peer (p2p) overlay graphs spanned by the PPLive system, the most popular and largest p2p IPTV (Internet Protocol Television) ...

    application/pdf

    application/pdfPDF (437Kb)