Design of a Deterministic Service Switch for Avionics Networks

2014 ◽  
Vol 11 (6) ◽  
pp. 386-396
Author(s):  
Mario Baldi ◽  
Guido Marchetto
Keyword(s):  
Deterministic Service

On the aggregation of deterministic service flows

2001 ◽  
Vol 24 (1) ◽  
pp. 2-18 ◽  
Author(s):  
J. Schmitt ◽  
M. Karsten ◽  
R. Steinmetz
Keyword(s):  
Deterministic Service

Development of Deterministic Service Time Traffic Model for Packet Communication

2006 ◽  
Vol 6 (1) ◽  
pp. 160-165 ◽  
Author(s):  
Md. Shahriar Karim ◽  
Md. Imdadul Islam ◽  
Adnan Rab ◽  
Md. Rakibul Hasan ◽  
M.R. Amin
Keyword(s):  
Service Time ◽  
Traffic Model ◽  
Deterministic Service

Adaptive Presentation and Scheduling of Media Streams on Parallel Storage Servers

2011 ◽  
pp. 233-245
Author(s):  
Constantinos Mourlas
Keyword(s):  
Bit Rate ◽  
Key Factors ◽  
Adaptive Software ◽  
Adaptive Presentation ◽  
Parallel Storage ◽  
Constant Bit Rate ◽  
Timing Properties ◽  
Deterministic Service ◽  
Quality Of Presentation

One way to implement adaptive software is to allocate resources dynamically during run-time rather than statically at design time. Design of adaptive software and adaptive execution of processes are key factors that improve versatility of software and decrease maintenance costs. In this chapter we study the development of adaptive software focusing on a design strategy for the implementation of parallel media servers with an adaptable behaviour. This strategy makes the timing properties and the quality of presentation of a set of media streams predictable. The proposed adaptive scheduling approach exploits the performance of parallel environments and seems a promising method that brings the advantages of parallel computation in media servers. The proposed mechanism provides deterministic service for both Constant Bit Rate (CBR) and Variable Bit Rate (VBR) streams. We present an efficient placement strategy for data frames as well as an adaptability strategy that allows appropriate frames to be dropped without sacrificing the ability to present multimedia applications predictably in time.

scholarly journals On the independence of sojourn times in tandem queues

1989 ◽  
Vol 21 (2) ◽  
pp. 488-489 ◽  
Author(s):  
Thomas M. Chen
Keyword(s):  
Tandem Queues ◽  
Sojourn Times ◽  
Deterministic Service ◽  
Service Times

Reich (1957) proved that the sojourn times in two tandem queues are independent when the first queue is M/M /1 and the second has exponential service times. When service times in the first queue are not exponential, it has been generally expected that the sojourn times are not independent. A proof for the case of deterministic service times in the first queue is offered here.

Sign in / Sign up

Export Citation Format

Share Document