  Foreword - Transport protocols for next generation networks; Leduc, Guy  in Annales des Télécommunications = Annals of Telecommunications (2006), 61(1-2, JAN-FEB), 2-4 Detailed reference viewed: 8 (4 ULg)  A scheduler for relative delay service differentiationJennes, Geoffroy ; Leduc, Guy ; in Annales des Télécommunications = Annals of Telecommunications (2002), 57(1-2, JAN-FEB), 83-104 We propose a new delay-based scheduler called as RD-VC (Relative Delay VirtualClock). Since it performs a delay-based service differentiation among flow aggregates, the quality at microflow level is the ... [more ▼] We propose a new delay-based scheduler called as RD-VC (Relative Delay VirtualClock). Since it performs a delay-based service differentiation among flow aggregates, the quality at microflow level is the same as that at aggregate level. This is not easily achievable when the service differentiation is bandwidth-based or loss-based. Unlike the EDF (Earliest Deadline First) scheduler [1], our proposed scheduler self-regulates and adapts the delays according to load changes. This characteristic permits its to implement it in an AF-like PHB providing the relative quantification service in a DiffServ network. Finally, we compare our proposed RD-VC scheduler with two important existing propositions: WTP (Waiting Time Priority) [2, 3] and EX-VC (Extended VirtualClock) [4]. Both these propositions are delay-based and have self-regulation property All three schedulers (RD-VC, WTP and EX-VC) maintain the required service differentiation among aggregates and have comparable long term average performance like mean throughput per aggregate and packet loss ratio etc. However, RD-VC and WTP take an edge over EX-VC at short-term performance like jitter. Both RD-VC and WTP have good long term and short-term performance. Our proposed RD-VC, compared to existing WTP, has two additional characteristics, i.e. unlike WTP which is limited to architectures with one queue per QoS class, it has no limitation on implementation scope (with or without separate queues per class) and it has lower complexity. This renders RD-VC an interesting proposition. [less ▲] Detailed reference viewed: 5 (0 ULg)Verification of two versions of the challenge handshake authentication protocol (CHAP)Leduc, Guy in Annales des Télécommunications = Annals of Telecommunications (2000), 55(1-2), 20-30 The challenge handshake authentication protocol, CHAP, is an authentication protocol intended for use primarily by hosts and routers that connect to a network server I in switched circuits or dial-up ... [more ▼] The challenge handshake authentication protocol, CHAP, is an authentication protocol intended for use primarily by hosts and routers that connect to a network server I in switched circuits or dial-up lines. but might be applied to dedicated links as well. In this paper; we specify two versions of the protocol, using the formal language Lotos, and apply the Eucalyptus model-based verification tools to prove that the first version has a flaw: whereas the second one is robust to passive and active attacks. The paper is written bl a tutorial fashion with a strong emphasis oil the methodology used. The relative simplicity of the CHAP protocol allows one to include complete Lotos specifications and definitions of properties, so that the experiment can be reproduced easily. [less ▲] Detailed reference viewed: 16 (1 ULg)Recent and prospective decorrelation techniques for image processing; ; Van Droogenbroeck, Marc in Annales des Télécommunications = Annals of Telecommunications (1993), 48(7-8), 390-403 Detailed reference viewed: 30 (4 ULg) |
||
