IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v9y2017i4p94-d122440.html
   My bibliography  Save this article

Approximate Networking for Universal Internet Access

Author

Listed:
  • Junaid Qadir

    (Department of Electrical Engineering, Information Technology University (ITU)-Punjab, Lahore 54000, Pakistan)

  • Arjuna Sathiaseelan

    (Computer Laboratory, University of Cambridge, Cambridge CB3 0FD, UK)

  • Umar Bin Farooq

    (Department of Electrical Engineering, Information Technology University (ITU)-Punjab, Lahore 54000, Pakistan)

  • Muhammad Usama

    (Department of Electrical Engineering, Information Technology University (ITU)-Punjab, Lahore 54000, Pakistan)

  • Muhammad Ali Imran

    (School of Engineering, University of Glasgow, Glasgow G12 8QQ, UK)

  • Muhammad Shafique

    (Institute of Computer Engineering, Vienna University of Technology (TU Wien), Wien 1040, Austria)

Abstract

Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost-efficient ways of provisioning high-performance, global Internet. In this paper, we argue that instead of an exclusive focus on a utopian goal of universally accessible “ideal networking” (in which we have a high throughput and quality of service as well as low latency and congestion), we should consider providing “approximate networking” through the adoption of context-appropriate trade-offs. In this regard, we propose to leverage the advances in the emerging trend of “approximate computing” that rely on relaxing the bounds of precise/exact computing to provide new opportunities for improving the area, power, and performance efficiency of systems by orders of magnitude by embracing output errors in resilient applications. Furthermore, we propose to extend the dimensions of approximate computing towards various knobs available at network layers. Approximate networking can be used to provision “Global Access to the Internet for All” (GAIA) in a pragmatically tiered fashion, in which different users around the world are provided a different context-appropriate (but still contextually functional) Internet experience.

Suggested Citation

  • Junaid Qadir & Arjuna Sathiaseelan & Umar Bin Farooq & Muhammad Usama & Muhammad Ali Imran & Muhammad Shafique, 2017. "Approximate Networking for Universal Internet Access," Future Internet, MDPI, vol. 9(4), pages 1-23, December.
  • Handle: RePEc:gam:jftint:v:9:y:2017:i:4:p:94-:d:122440
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/9/4/94/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/9/4/94/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:9:y:2017:i:4:p:94-:d:122440. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.