Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Evolution and Enhancement of BitTorrent Network Topologies (2008)
Cameron Dale, Jiangchuan Liu, Joseph Peters
Abstract—This paper describes an experimental study that closely examines the underlying topologies of multiple complex networks formed in BitTorrent swarms. Our results demonstrate that the...
Evolution and Enhancement of BitTorrent Network Topologies (2008)
Cameron Dale, Jiangchuan Liu, Joseph Peters, Bo Li
Abstract—This paper describes an experimental study that closely examines the underlying topologies of multiple complex networks formed in BitTorrent swarms. Our results demonstrate that the...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
Constructing Incremental Sequences in Graphs (2006)
Klasing, Ralf, Laforest, Christian, Peters, Joseph, Thibault, Nicolas
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a...
Constructing Incremental Sequences in Graphs (2006)
Klasing, Ralf, Laforest, Christian, Peters, Joseph, Thibault, Nicolas
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a...
Constructing Incremental Sequences in Graphs (2006)
Klasing, Ralf, Laforest, Christian, Peters, Joseph, Thibault, Nicolas
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a...
Constructing Incremental Sequences in Graphs (2006)
Klasing, Ralf, Laforest, Christian, Peters, Joseph, Thibault, Nicolas
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a...
Constructing Incremental Sequences in Graphs (2005)
Klasing, Ralf, Laforest, Christian, Peters, Joseph, Thibault, Nicolas
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a...
Efficient gathering in radio grids with interference (2005)
Jean-claude Bermond, Joseph Peters, Sophia Antipolis Cedex
We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most dT...
Thesis (M.S.)--Columbia University, 2003.
MANPRINT Methods Monograph: Aiding the Development of Training Constraints. (1998)
Kaplan, Jonathan D., Roth, J. T., Warm, Ronnie E., Peters, Joseph, O'Brien, Lawrence
The U.S. Army Research Institute for the Behavioral and Social Sciences (ARI) is conducting a program to develop methods to aid in successfully integrating available operations and maintenance...
Prinz, Martin, Harlow, George, Peters, Joseph, Monttana, Annibale
Traducción de: Minerali e rocce by A. Monttana, R. Crespi and G. Liborio
Thesis (doctoral)--Universitat zu Giessen, 1901.