| 2008 |
|---|
| 21 | EE | Lusheng Wang,
Brahim Gaabab,
David Binet,
Daniel Kofman:
Novel MAP Selection Scheme Using Location History in Hierarchical MIPv6 Networks.
WCNC 2008: 2420-2425 |
| 2007 |
|---|
| 20 | EE | Huu Quynh Nguyen,
François Baccelli,
Daniel Kofman:
A Stochastic Geometry Analysis of Dense IEEE 802.11 Networks.
INFOCOM 2007: 1199-1207 |
| 19 | EE | Yannick Brehon,
Daniel Kofman,
Augusto Casaca:
Virtual Private Network to Spanning Tree Mapping.
Networking 2007: 703-713 |
| 18 | EE | Yannick Brehon,
Daniel Kofman,
Michal Pióro,
Madiagne Diallo:
Optimal Virtual Topology Design using Bus-Label Switched Paths.
IEEE Journal on Selected Areas in Communications 25(5): 1001-1010 (2007) |
| 17 | EE | Anthony Busson,
Daniel Kofman,
Jean-Louis Rougier:
A new service overlays dimensioning approach based on stochastic geometry.
Perform. Eval. 64(1): 76-92 (2007) |
| 2006 |
|---|
| 16 | EE | Kinda Khawam,
Daniel Kofman:
Opportunistic Weighted Fair Queueing.
VTC Fall 2006: 1-5 |
| 2005 |
|---|
| 15 | EE | Vivek Mhatre,
Catherine Rosenberg,
Daniel Kofman,
Ravi Mazumdar,
Ness B. Shroff:
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint.
IEEE Trans. Mob. Comput. 4(1): 4-15 (2005) |
| 14 | EE | Demetres D. Kouvatsos,
Daniel Kofman:
Performance modelling and evaluation of heterogeneous networks.
Perform. Eval. 59: 99-101 (2005) |
| 2004 |
|---|
| 13 | EE | Vivek Mhatre,
Catherine Rosenberg,
Daniel Kofman,
Ravi Mazumdar,
Ness B. Shroff:
Design of Surveillance Sensor Grids with a Lifetime Constraint.
EWSN 2004: 263-275 |
| 2001 |
|---|
| 12 | EE | Anthony Busson,
Jean-Louis Rougier,
Daniel Kofman:
Impact of Tree Structure on Retransmission Efficiency for TRACK.
Networked Group Communication 2001: 113-127 |
| 2000 |
|---|
| 11 | | Jean-Louis Rougier,
Daniel Kofman,
Annie Gravey:
Optimization of hierarchical routing protocols.
Perform. Eval. 41(2-3): 227-245 (2000) |
| 1999 |
|---|
| 10 | | Jean-Louis Rougier,
A. R. P. Ragozini,
Annie Gravey,
Daniel Kofman:
A Model for Evaluating the Impact of Aggregated Routing Information on Network Performance.
Broadband Communications 1999: 481-492 |
| 9 | | François Baccelli,
Daniel Kofman,
Jean-Louis Rougier:
Self Organizing Hierarchical Multicast Trees and Their Optimization.
INFOCOM 1999: 1081-1089 |
| 8 | | Jean-Louis Rougier,
Daniel Kofman,
Annie Gravey:
Traffic management for connectionless services over ATM.
Telecommunication Systems 12(2-3): 193-210 (1999) |
| 1996 |
|---|
| 7 | EE | Eitan Altman,
Daniel Kofman:
Bounds for performance measures of token rings.
IEEE/ACM Trans. Netw. 4(2): 292-299 (1996) |
| 6 | | Daniel Kofman,
Uri Yechiali:
Polling Systems with Station Breakdowns.
Perform. Eval. 27/28(4): 647-672 (1996) |
| 1995 |
|---|
| 5 | | S. Halberstadt,
Daniel Kofman,
Annie Gravey:
A congestion control mechanism for connectionless services offered by ATM networks.
Modelling and Evaluation of ATM Networks 1995: 57-73 |
| 4 | EE | Eitan Altman,
Daniel Kofman,
Uri Yechiali:
Discrete time queues with delayed information.
Queueing Syst. 19(4): 361-376 (1995) |
| 1994 |
|---|
| 3 | | Maurice Gagnaire,
Daniel Kofman,
Hayri Korezlioglu:
An analytical description of the packet trains model for LAN traffic characterization.
Modelling and Evaluation of ATM Networks 1994: 3-13 |
| 1993 |
|---|
| 2 | EE | Daniel Kofman:
Blocking probability, throughput and waiting time in finite capacity polling systems.
Queueing Syst. 14(3-4): 385-411 (1993) |
| 1991 |
|---|
| 1 | | Ian F. Akyildiz,
Giovanni Chiola,
Daniel Kofman,
Hayri Korezlioglu:
Stochastic Petri Net Modeling of the FDDI Network Protocol.
PSTV 1991: 179-197 |
