Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Vijay K. Gurbani

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ivica Rimac

> Home > Persons > Vijay K. Gurbani

Publications

2012
[i13]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/rfc/rfc6821
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rfc/rfc6821
Enrico Marocco, Antonio Fusco, Ivica Rimac, Vijay K. Gurbani:
Improving Peer Selection in Peer-to-peer Applications: Myths vs. Reality. RFC 6821: 1-16 (2012)
2010
[i7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/rfc/rfc6029
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rfc/rfc6029
Ivica Rimac, Volker Hilt, Marco Tomsu, Vijay K. Gurbani, Enrico Marocco:
A Survey on Research on the Application-Layer Traffic Optimization (ALTO) Problem. RFC 6029: 1-19 (2010)
2009
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/cm/GurbaniHRTM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cm/GurbaniHRTM09
Vijay K. Gurbani, Volker Hilt, Ivica Rimac, Marco Tomsu, Enrico Marocco:
A survey of research on the application-layer traffic optimization problem and the need for layer cooperation. IEEE Commun. Mag. 47(8): 107-112 (2009)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.