Pascale Minet - Academia.edu (original) (raw)

Papers by Pascale Minet

Research paper thumbnail of Data gathering architecture for temporary worksites based on a uniform deployment of wireless sensors

International Journal of Sensor Networks, 2015

ABSTRACT

Research paper thumbnail of Preserving the consistency of distributed objects with real-time transactions

Proceedings of the 8th international conference on New technologies in distributed systems - NOTERE '08, 2008

In this paper, we study the problem of maintaining the consistency of distributed objects in real... more In this paper, we study the problem of maintaining the consistency of distributed objects in real-time. Sporadic transactions sent by a set of clients must be processed by a set servers with a bounded end-to-end response time. We propose in this article a solution, following the state machine approach, based on a particular non-preemptive scheduling denoted EDF* (Earliest Deadline First

Research paper thumbnail of ORCHID-MASS-oct2014

Research paper thumbnail of An efficient learning technique to predict link quality in WSN

2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), 2014

Research paper thumbnail of Conflict-free Opportunistic Centralized Time Slot Assignment in Cognitive Radio Sensor Networks

Research paper thumbnail of A uniform reliable multicast protocol with guaranteed response times

Lecture Notes in Computer Science, 1998

Uniform reliable multicast protocols with a guaranteed response time are of concern in numerous d... more Uniform reliable multicast protocols with a guaranteed response time are of concern in numerous distributed real-time systems (e.g. distributed transactional systems, high available systems). We focus on uniform reliable multicast protocols in processors groups. The source of a message can belong or not to the destination group. A bounded number of processors crashes and network omissions is tolerated. The uniform

Research paper thumbnail of The Trajectory Approach for the End-to-End Response Times with Non-preemptive FP/EDF*

Lecture Notes in Computer Science, 2006

We focus on non-preemptive Fixed Priority (fp) scheduling. Unlike the classical approach, where f... more We focus on non-preemptive Fixed Priority (fp) scheduling. Unlike the classical approach, where flows sharing the same priority are assumed to be scheduled arbitrarily, we assume that these flows are scheduled Earliest Deadline First (edf), by considering their absolute deadline on their first visited node. The resulting scheduling is called fp/edf *. In this paper, we establish new results for fp/edf * in a distributed context, first when flows follow the same sequence of nodes (the same path). We then extend these results when flows follow different paths. We show how to compute an upper bound on the end-to-end response time of any flow when the packet priority is computed on the first node and left unchanged on any subsequent node. This alleviates the packet processing in core nodes. For that purpose, we use a worst case analysis based on the trajectory approach, that is less pessimistic than classical approaches. We compare our results with those provided by the holistic approach: the benefit can be very high.

Research paper thumbnail of Deterministic End-to-End Guarantees for Real-Time Applications in a DiffServ-MPLS Domain

Lecture Notes in Computer Science, 2004

ABSTRACT

Research paper thumbnail of Worst case end-to-end response times of flows scheduled with FP/FIFO

International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006

In this paper, we are interested in real-time flows requiring quantitative and deterministic Qual... more In this paper, we are interested in real-time flows requiring quantitative and deterministic Quality of Service (QoS) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a non-preemptive scheduling of flows, called FP/FIFO, based on fixed priorities. On each node, packets are scheduled according to their fixed priority, if several

Research paper thumbnail of Deterministic QoS guarantees for multicast multimedia applications

Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05), 2005

ABSTRACT

Research paper thumbnail of Holistic and Trajectory Approaches for Distributed Non-preemptive FP/DP* Scheduling

Lecture Notes in Computer Science, 2005

In this paper, we are interested in real-time flows requiring quantitative and deterministic Qual... more In this paper, we are interested in real-time flows requiring quantitative and deterministic Quality of Service (QoS) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a non-preemptive scheduling of flows, called fp/dp \sc *^{\rm {\sc *}}, combining fixed priority and dynamic priority established on the first node visited in

Research paper thumbnail of A Fibre Channel Dimensioning for a Multimedia System with Deterministic QoS

Lecture Notes in Computer Science, 2002

We propose to use Fibre Channel (FC) technology in multimedia systems offering Video on Demand (V... more We propose to use Fibre Channel (FC) technology in multimedia systems offering Video on Demand (VoD) services. The Storage Area Network (SAN) is based on (i) FC-loops connecting magnetic disks and on (ii) FC-switches connecting loops to servers. We show how to dimension FC-loops to offer a deterministic guarantee of Quality of Service to the VoD clients. The performance results

Research paper thumbnail of Performance evaluation of the implementation integrating mobile-IP and OLSR in full-IP networks

2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004

ABSTRACT

Research paper thumbnail of Atomic broadcast in one phase

Proceedings of the 4th workshop on ACM SIGOPS European workshop - EW 4, 1990

An atomic broadcast protocol should meet the three properties of unanimity, order and termination... more An atomic broadcast protocol should meet the three properties of unanimity, order and termination. The protocol presented here assumes weak fail-silent Network Attachment Controllers (NACs) and a broadcast channel subject to omission failures. In a failure-free environment it consists of a single phase. The response time achieved is almost the same as for a simple broadcast. In case of receivers failures, the number of phases depends on failure occurrences. In case of a broadcaster failure all the correct receivers detect the failure and all the receivers ignore the broadcast. This protocol ensures that each correct NACs has the same view of the correct NACs' list.

Research paper thumbnail of Comparison of Local Deadline Assignment Techniques with FP/EDF Scheduling in a Real Time Context: Probabilistic QoS Guarantees

2006 First International Conference on Communications and Networking in China, 2006

... (wj~)s) (1pab) s + Ark (I-(Brk)*(s)) S - A+ + A+ (B+) (s) ... B. End-to-end Response Time Dis... more ... (wj~)s) (1pab) s + Ark (I-(Brk)*(s)) S - A+ + A+ (B+) (s) ... B. End-to-end Response Time Distribution Let Srck be the random variable the end to end response time for a packet of class k with priority r and Srk(s) the LT of its probability density function. We have: ...

Research paper thumbnail of Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class

Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006

Research paper thumbnail of Optimized Link State Routing Protocol (OLSR)

Research paper thumbnail of Conflict-Free Opportunistic Centralized Time Slot Assignment in Cognitive Radio Sensor Networks

2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS), 2014

Research paper thumbnail of A simple method for the deployment of wireless sensors to ensure full coverage of an irregular area with obstacles

Proceedings of the 17th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems - MSWiM '14, 2014

Research paper thumbnail of Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols

Lecture Notes in Computer Science, 2002

... A. Qayyum, Analysis and evaluation of channel access schemes and routing pro-tocols for wirel... more ... A. Qayyum, Analysis and evaluation of channel access schemes and routing pro-tocols for wireless ... P. Jacquet, A. Laouiti, P. Minet, L. Viennot, “Performance analysis of OLSR multipoint relay ... A. Boukerche et al., “Analysis of randomized congestion control with DSDV rout-ing in ...

Research paper thumbnail of Data gathering architecture for temporary worksites based on a uniform deployment of wireless sensors

International Journal of Sensor Networks, 2015

ABSTRACT

Research paper thumbnail of Preserving the consistency of distributed objects with real-time transactions

Proceedings of the 8th international conference on New technologies in distributed systems - NOTERE '08, 2008

In this paper, we study the problem of maintaining the consistency of distributed objects in real... more In this paper, we study the problem of maintaining the consistency of distributed objects in real-time. Sporadic transactions sent by a set of clients must be processed by a set servers with a bounded end-to-end response time. We propose in this article a solution, following the state machine approach, based on a particular non-preemptive scheduling denoted EDF* (Earliest Deadline First

Research paper thumbnail of ORCHID-MASS-oct2014

Research paper thumbnail of An efficient learning technique to predict link quality in WSN

2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), 2014

Research paper thumbnail of Conflict-free Opportunistic Centralized Time Slot Assignment in Cognitive Radio Sensor Networks

Research paper thumbnail of A uniform reliable multicast protocol with guaranteed response times

Lecture Notes in Computer Science, 1998

Uniform reliable multicast protocols with a guaranteed response time are of concern in numerous d... more Uniform reliable multicast protocols with a guaranteed response time are of concern in numerous distributed real-time systems (e.g. distributed transactional systems, high available systems). We focus on uniform reliable multicast protocols in processors groups. The source of a message can belong or not to the destination group. A bounded number of processors crashes and network omissions is tolerated. The uniform

Research paper thumbnail of The Trajectory Approach for the End-to-End Response Times with Non-preemptive FP/EDF*

Lecture Notes in Computer Science, 2006

We focus on non-preemptive Fixed Priority (fp) scheduling. Unlike the classical approach, where f... more We focus on non-preemptive Fixed Priority (fp) scheduling. Unlike the classical approach, where flows sharing the same priority are assumed to be scheduled arbitrarily, we assume that these flows are scheduled Earliest Deadline First (edf), by considering their absolute deadline on their first visited node. The resulting scheduling is called fp/edf *. In this paper, we establish new results for fp/edf * in a distributed context, first when flows follow the same sequence of nodes (the same path). We then extend these results when flows follow different paths. We show how to compute an upper bound on the end-to-end response time of any flow when the packet priority is computed on the first node and left unchanged on any subsequent node. This alleviates the packet processing in core nodes. For that purpose, we use a worst case analysis based on the trajectory approach, that is less pessimistic than classical approaches. We compare our results with those provided by the holistic approach: the benefit can be very high.

Research paper thumbnail of Deterministic End-to-End Guarantees for Real-Time Applications in a DiffServ-MPLS Domain

Lecture Notes in Computer Science, 2004

ABSTRACT

Research paper thumbnail of Worst case end-to-end response times of flows scheduled with FP/FIFO

International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006

In this paper, we are interested in real-time flows requiring quantitative and deterministic Qual... more In this paper, we are interested in real-time flows requiring quantitative and deterministic Quality of Service (QoS) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a non-preemptive scheduling of flows, called FP/FIFO, based on fixed priorities. On each node, packets are scheduled according to their fixed priority, if several

Research paper thumbnail of Deterministic QoS guarantees for multicast multimedia applications

Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05), 2005

ABSTRACT

Research paper thumbnail of Holistic and Trajectory Approaches for Distributed Non-preemptive FP/DP* Scheduling

Lecture Notes in Computer Science, 2005

In this paper, we are interested in real-time flows requiring quantitative and deterministic Qual... more In this paper, we are interested in real-time flows requiring quantitative and deterministic Quality of Service (QoS) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a non-preemptive scheduling of flows, called fp/dp \sc *^{\rm {\sc *}}, combining fixed priority and dynamic priority established on the first node visited in

Research paper thumbnail of A Fibre Channel Dimensioning for a Multimedia System with Deterministic QoS

Lecture Notes in Computer Science, 2002

We propose to use Fibre Channel (FC) technology in multimedia systems offering Video on Demand (V... more We propose to use Fibre Channel (FC) technology in multimedia systems offering Video on Demand (VoD) services. The Storage Area Network (SAN) is based on (i) FC-loops connecting magnetic disks and on (ii) FC-switches connecting loops to servers. We show how to dimension FC-loops to offer a deterministic guarantee of Quality of Service to the VoD clients. The performance results

Research paper thumbnail of Performance evaluation of the implementation integrating mobile-IP and OLSR in full-IP networks

2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004

ABSTRACT

Research paper thumbnail of Atomic broadcast in one phase

Proceedings of the 4th workshop on ACM SIGOPS European workshop - EW 4, 1990

An atomic broadcast protocol should meet the three properties of unanimity, order and termination... more An atomic broadcast protocol should meet the three properties of unanimity, order and termination. The protocol presented here assumes weak fail-silent Network Attachment Controllers (NACs) and a broadcast channel subject to omission failures. In a failure-free environment it consists of a single phase. The response time achieved is almost the same as for a simple broadcast. In case of receivers failures, the number of phases depends on failure occurrences. In case of a broadcaster failure all the correct receivers detect the failure and all the receivers ignore the broadcast. This protocol ensures that each correct NACs has the same view of the correct NACs' list.

Research paper thumbnail of Comparison of Local Deadline Assignment Techniques with FP/EDF Scheduling in a Real Time Context: Probabilistic QoS Guarantees

2006 First International Conference on Communications and Networking in China, 2006

... (wj~)s) (1pab) s + Ark (I-(Brk)*(s)) S - A+ + A+ (B+) (s) ... B. End-to-end Response Time Dis... more ... (wj~)s) (1pab) s + Ark (I-(Brk)*(s)) S - A+ + A+ (B+) (s) ... B. End-to-end Response Time Distribution Let Srck be the random variable the end to end response time for a packet of class k with priority r and Srk(s) the LT of its probability density function. We have: ...

Research paper thumbnail of Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class

Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006

Research paper thumbnail of Optimized Link State Routing Protocol (OLSR)

Research paper thumbnail of Conflict-Free Opportunistic Centralized Time Slot Assignment in Cognitive Radio Sensor Networks

2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS), 2014

Research paper thumbnail of A simple method for the deployment of wireless sensors to ensure full coverage of an irregular area with obstacles

Proceedings of the 17th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems - MSWiM '14, 2014

Research paper thumbnail of Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols

Lecture Notes in Computer Science, 2002

... A. Qayyum, Analysis and evaluation of channel access schemes and routing pro-tocols for wirel... more ... A. Qayyum, Analysis and evaluation of channel access schemes and routing pro-tocols for wireless ... P. Jacquet, A. Laouiti, P. Minet, L. Viennot, “Performance analysis of OLSR multipoint relay ... A. Boukerche et al., “Analysis of randomized congestion control with DSDV rout-ing in ...