•  
  •  
 

Author Country (or Countries)

Poland

Abstract

In this paper we deal with a scheduling algorithm that creates several virtual links on one physical link by switching the service between the virtual links. The switching is done in such a way that the physical link is available for each virtual link for a constant time, what provides full performance isolation between virtual links. Firstly, we present a detailed analysis of the scheduler, including formulas for the queue sizes associated with virtual links and their packet loss ratios. Then we show numerical examples of performance characteristics of created virtual links. We also compare them with adequate non-virtual links in order to demonstrate what is the cost of virtualization.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.12785/amis/080601

Share

COinS