Ronald Beaubrun

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 Jean-Marc Conan

> Home > Persons > Ronald Beaubrun

Publications

2007
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ijwin/BeaubrunPC07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijwin/BeaubrunPC07
Ronald Beaubrun, Samuel Pierre, Jean-Marc Conan:
Analysis of Traffic Distribution and Blocking Probability in Future Wireless Networks. Int. J. Wirel. Inf. Networks 14(1): 47-53 (2007)
2005
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/comcom/BeaubrunPC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comcom/BeaubrunPC05
Ronald Beaubrun, Samuel Pierre, Jean-Marc Conan:
An approach for managing global mobility and roaming in the next-generation wireless systems. Comput. Commun. 28(5): 571-581 (2005)
2004
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/BeaubrunPC04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/BeaubrunPC04
Ronald Beaubrun, Samuel Pierre, Jean-Marc Conan:
Blocking probability analysis in future wireless networks. ICC 2004: 2323-2326
2002
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/BeaubrunPFC02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/BeaubrunPFC02
Ronald Beaubrun, Samuel Pierre, Paola Flocchini, Jean-Marc Conan:
Global roaming management in the next-generation wireless systems. ICC 2002: 2070-2074

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.