@article {vassiliadis2011d,
	title = {Modelling and performance study of finite-buffered blocking multistage interconnection networks supporting natively 2-class priority routing traffic},
	journal = {Journal of Network and Computer Applications},
	volume = {36(2)},
	number = {2},
	year = {2013},
	month = {mar},
	pages = {723{\textendash}737},
	publisher = {Elsevier BV},
	abstract = {Contemporary networks accommodate handling of multiple priorities, aiming to provide suitable QoS levels to different traffic classes. In the presence of multiple priorities, a scheduling algorithm is employed to select each time the next packet to transmit over the data link. Class-based Weighted Fair Queuing (CBWFQ) scheduling and its variations, is widely used as a scheduling technique, since it is easy to implement and prevents the low-priority queues from being completely neglected during periods of high-priority traffic. By using this scheduling, low-priority queues have the opportunity to transmit packets even though the high-priority queues are not empty. In this paper, the modeling, analysis and performance evaluation of a single-buffered, dual priority multistage interconnection network (MIN) operating under the CBWFQ scheduling policy is presented. Performance evaluation is conducted through simulation, and the performance measures obtained can be valuable assets for MIN designers, in order to minimize the overall deployment costs and delivering efficient systems.},
	doi = {10.1016/j.jnca.2012.12.016},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@article {vassiliadis2010c,
	title = {Modelling and performance evaluation of a novel internal priority routing scheme for finite-buffered multistage interconnection networks},
	journal = {International Journal of Parallel, Emergent and Distributed Systems},
	volume = {26(5)},
	year = {2011},
	pages = {381{\textendash}397},
	abstract = {In this paper, the modelling, analysis and performance evaluation of a novel architecture for internal priority finite-buffered Multistage Interconnection Networks (MINs) is presented. We model the proposed architecture giving the details of its operation and describing its states and detailing conditions and effects of state transition; we also provide a formal model for evaluating its performance. The proposed architecture{\textquoteright}s performance is subsequently analyzed under the uniform traffic condition, considering various offered loads, buffer-lengths and MIN sizes, using simulations. We compare the internal priority scheme vs. the non priority (or single priority) scheme, by gathering metrics for the two most important network performance factors, namely packet throughput and the mean time a packet needs to traverse the network. We demonstrate and quantify the improvements on MIN performance stemming from the introduction of priorities in terms of throughput and a combined performance indicator which depicts the overall performance of the MIN. These performance measures can be valuable assets for designers of parallel multiprocessor systems and networks in order to minimize the overall deployment costs and delivering efficient systems.},
	doi = {10.1080/17445760.2010.539218},
	url = {https://www.tandfonline.com/doi/abs/10.1080/17445760.2010.539218},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis and E. Glavas}
}
