@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 {Vasiliadis-2013x,
	title = {Performance Tuning of Dual-priority Delta Networks through Queuing Scheduling Disciplines},
	journal = {Journal of Communications Software and Systems},
	volume = {9(4)},
	number = {4},
	year = {2013},
	month = {12/2013},
	pages = {222-235},
	publisher = {Croatian Communications and Information Society},
	abstract = {Differentiated Services (DiffServ) and other scheduling strategies are now widespread in the traditional, {\textquotedblleft}best effort{\textquotedblright} Internet. These Internet Architectures offer Quality of Service (QoS) guarantees for important customers at the same time as supporting less critical applications of lower priority. Strict priority queuing (PQ), weighted round robin (WRR), and class-based weighted fair queuing (CBWFQ) are three common scheduling disciplines for differentiation of services in telecommunication networks. In this paper, a comparative performance study of the above PQ, WRR and CBWFQ queuing scheduling policies applied on a double-buffered, 6-stage Multistage Interconnection Network (MIN) that natively supports a 2-class priority mechanism is presented and analyzed using simulation experiments. We also consider a 10-stage MIN, to validate that the conclusions drawn from the 6-stage MIN apply to MINs of different sizes. The findings of this paper can be used by MIN designers to optimally configure their networks.},
	doi = {10.24138/jcomss.v9i4.143},
	url = {https://hrcak.srce.hr/180111},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@article {vassiliadis-hind2012,
	title = {Class-Based Weighted Fair Queuing Scheduling on Dual-Priority Delta Networks},
	journal = {Journal of Network and Computer Applications},
	volume = {2012},
	number = {XX},
	year = {2012},
	pages = {13 pages},
	abstract = {In this paper, we model, analyze and evaluate the performance of a 2-class priority architecture for finite-buffered Multistage Interconnection Networks (MINs). The MIN operation modelling is based on a state diagram, which includes the possible MIN states, transitions and conditions under which each transition occurs. Equations expressing state and transition probabilities are subsequently given, providing a formal model for evaluating the MIN{\textquoteright}s performance. The proposed architecture{\textquoteright}s performance is subsequently analyzed using simulations; operational parameters, including buffer length, MIN size, offered load and ratios of high priority packets which are varied across experiments to gain insight on how each parameter affects the overall MIN performance. The 2-class priority MIN performance is compared against the performance of single priority MINs, detailing the performance gains and losses for packets of different priorities. Performance is assessed by means of the two most commonly used factors, namely packet throughput and packet delay, while a performance indicator combining both individual factors is introduced, computed and discussed. The findings of this study can be used by network and interconnection system designers in order to deliver efficient systems while minimizing the overall cost. The performance evaluation model can also be applied to other network types, providing the necessary data for network designers to select optimal values for network operation parameters.},
	doi = {10.1155/2012/859694},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@article {vassiliadis-jpeds2012,
	title = {Class-based weighted fair queuing scheduling on quad-priority Delta Networks},
	journal = {International Journal of Parallel, Emergent and Distributed Systems},
	volume = {27},
	number = {5},
	year = {2012},
	month = {oct},
	pages = {435{\textendash}457},
	publisher = {Informa UK Limited},
	abstract = {Contemporary networks support multiple priorities, aiming to differentiate the QoS levels offered to individual traffic classes. Support for multiple priorities necessitates the introduction of a scheduling algorithm, 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 starvation, i.e. receiving no service during periods of high-priority traffic. CBWFQ effectively thus offers low-priority queues the opportunity to transmit packets even though the high-priority queues are not empty. In this paper, we present the modeling and performance evaluation of a single-buffered, four-priority multistage interconnection network (MIN) operating under the CBWFQ scheduling policy. Performance evaluation is conducted through simulation, and the performance metrics obtained can be used by MIN designers to set the appropriate queue weights according to the expected traffic and the desired QoS levels for each priority class, delivering efficient thus systems.},
	doi = {10.1080/17445760.2012.712694},
	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}
}
@article {vasiliadis2011a,
	title = {Performance Analysis of Dual-Priority Multilayer Multistage Interconnection Networks under Multicast Environment},
	journal = {Journal of Networks},
	volume = {June},
	year = {2011},
	pages = {858{\textendash}871},
	abstract = {Next-generation network architectures strive to achieve high bandwidth and ultralow latency for the packets traversing the offered end-to-end paths. Multistage Interconnection Networks (MINs) are often employed for implementing NGNs, but while MINs are fairly flexible in handling varieties of traffic loads, they tend to quickly saturate under broadcast and multicast traffic, especially at increasing size networks. As a response to this issue, multilayer MINs have been proposed, however their performance prediction and evaluation has not been studied sufficiently insofar. In this paper, we evaluate and discuss the performance of multilayer MINs under multicast traffic, considering also two levels of packet priorities, since support for multiple QoS levels is an indispensible requirement for NGNs. Different offered loads and buffer size configurations are examined in this context, and performance results are given for the two most important network performance factors, namely packet throughput and delay. We also introduce and calculate a universal performance fac{\textlnot}tor, which includes the importance aspect of each of the above main performance factors. The findings of this study can be used by NGN system designers in order to predict the performance of each configuration and adjust the design of their communication infrastructure to the traffic requirements at hand.},
	keywords = {banyan networks, multicast traffic, multilayer networks, Multistage interconnection networks, performance analysis},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@article {vasiliadis11,
	title = {Performance Analysis of Multi-Layered Multi-Priority Asymetric-Sized Delta Networks},
	journal = {Journal of Computer Systems, Networks, and Communications},
	volume = {to appear},
	year = {2011},
	pages = {12},
	abstract = {In this paper the performance of multi-layered asymmetric-sized finite-buffered Delta Networks supporting multi-class routing traffic is presented and analyzed in the uniform traffic conditions under various loads using simulations. The rationale behind introducing asymmetric-sized buffered systems is to have a better exploitation of available buffer spaces, while the implementation of multi-layered architecture is applied in order to further improve the overall performance of network. The findings of this performance evaluation can be used by network designers for drawing optimal configurations while setting up the network, so as to best meet the performance and cost requirements under the anticipated traffic load and quality of service specifications.},
	doi = {10.1155/2011/723102},
	url = {https://www.hindawi.com/journals/jcnc/2011/723102/},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@article {vasiliadis2010a,
	title = {Improving performance of a wireless multimedia traffic-oriented network through prediction of routing},
	journal = {International Journal on Information Technologies \& Security},
	volume = {3},
	year = {2010},
	pages = {3-16},
	abstract = {Wireless Local Area Networks (WLANs) have developed into a viable technology to support multimedia traffic and are expected to support multimedia services with guaranteed Quality of Service (QoS) for diverse traffic types (video, audio, and data). In this paper, we consider the incorporation of prediction into a generic distance-vector routing protocol for WLANs, evaluate the performance of the resulting routing scheme. Our study considers the enhancement of Distributed Bellman-Ford algorithm, which is a widely used algorithm, and assesses the effectiveness of the enhanced version on top of a fourth generation system (4-G). In order to compare the performance of the standard protocol against that of the prediction-enhanced version, we gather metrics for the two most important network performance factors, namely packet throughput and delay under different mobility and traffic conditions, using the simulation environment of NS-2. Both medium- and high-mobility configurations have been considered in this study.},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@article {vasiliadis2011b,
	title = {Performance Study of Multi-Layered Multistage Interconnection Networks under Hotspot Traffic Conditions},
	journal = {Journal of Computer Systems, Networks, and Communications},
	volume = {2010},
	year = {2010},
	pages = {11 pages},
	abstract = {The performance of Multistage Interconnection Networks (MINs) under hotspot traffic, where some percentage of the traffic is targeted at single nodes, which are also called hot-spots, is of crucial interest. The prioritizing of packets has already been proposed at previous works as alleviation to the tree saturation problem, leading to a scheme that natively supports 2-class priority traffic. In order to prevent hotspot traffic from degrading uniform traffic we expand previous studies by introducing multi-layer Switching Elements (SEs) at last stages in an attempt to balance between MIN performance and cost. In this paper the performance evaluation of dual-priority, double-buffered, multi-layer MINs under single hotspot setups is presented and analyzed using simulation experiments. The findings of this paper can be used by MIN designers to optimally configure their networks},
	keywords = {Hotspot traffic, multi-layer networks, Multistage interconnection networks, Performance evaluation},
	doi = {10.1155/2010/403056},
	url = {https://www.hindawi.com/journals/jcnc/2010/403056/},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {Vasiliadis2009395,
	title = {Performance evaluation of multicast routing over multilayer multistage interconnection networks},
	booktitle = {Proceedings of the 2009 5th Advanced International Conference on Telecommunications, AICT 2009},
	year = {2009},
	note = {cited By (since 1996) 0},
	month = {5},
	pages = {395-403},
	abstract = {Multilayer MINs have emerged mainly due to the increased need for routing capacity in the presence of multicast and broadcast traffic, their performance prediction and evaluation however has not been studied sufficiently insofar. In this paper, we use simulation to evaluate the performance of multilayer MINs with switching elements of different buffer sizes and under different offered loads. The findings of this paper can be used by MIN designers to optimally configure their networks. Β{\textcopyright} 2009 IEEE.},
	keywords = {Broadcast traffic, Buffer sizes, Interconnection networks, Multicast routing, Multicasting, Multicasts, Multilayers, Multistage interconnection network, Network routing, Performance evaluation, Performance prediction, Switching elements},
	doi = {10.1109/AICT.2009.72},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349732883\&partnerID=40\&md5=e85525a7b36de8d84ea1ae52110ff1f9},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis and E. Glavas}
}
@conference {Vasiliadis200924,
	title = {Routing and performance evaluation of dual priority Delta networks under hotspot environment},
	booktitle = {Proceedings - 2009 1st International Conference on Advances in Future Internet, AFIN 2009},
	year = {2009},
	note = {cited By (since 1996) 0},
	month = {6},
	pages = {24-30},
	abstract = {Large swings in the demand for content are commonplace within the Internet. Although Multistage Interconnection Networks (MINs) are fairly flexible in handling varieties of traffic loads, their performance considerably degrades by hotspot traffic, especially at increasing size networks. As alleviation to the tree saturation problem, the prioritizing of packets is proposed leading to a scheme that natively supports multi priority traffic. In this paper the performance evaluation of double-buffered Delta Networks under single hotspot setups, with different offered loads, and 2-class routing traffic is presented and analyzed using simulation experiments. Performance comparison of dual vs. single priority scheme is outlined under hotspot environment, by calculating a universal performance factor, which effectively includes the importance aspect of each of the two most important performance metrics, namely packet throughput and delay. The findings of this paper can be used by MIN designers to optimally configure their networks. Β{\textcopyright} 2009 IEEE.},
	keywords = {Computer simulation, Delta networks, Hot spot, Hotspot traffic, Interconnection networks, Internet, Multistage interconnection network, Multistage interconnection networks, Packet throughput, Performance comparison, Performance evaluation, Performance factors, Performance metrics, Priority schemes, Routing traffic, Saturation problems, Simulation, Simulation experiments, Traffic loads},
	doi = {10.1109/AFIN.2009.12},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350757772\&partnerID=40\&md5=f661e197254166cf6cf723546a5e5b88},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {vassiliadis2008d,
	title = {Evaluation Study of a Wireless Multimedia Traffic-Oriented Network Model},
	booktitle = {INTERNATIONAL ELECTRONIC CONFERENCE ON COMPUTER SCIENCE. AIP Conference Proceedings, Volume 1060},
	year = {2008},
	month = {7},
	pages = {379-384},
	abstract = {In this paper, a wireless multimedia traffic-oriented network scheme over a fourth generation system (4-G) is presented and analyzed. We conducted an extensive evaluation study for various mobility configurations in order to incorporate the behavior of the IEEE 802.11b standard over a test-bed wireless multimedia network model. In this context, the Quality of Services (QoS) over this network is vital for providing a reliable high-bandwidth platform for data-intensive sources like video streaming. Therefore, the main issues concerned in terms of QoS were the metrics for bandwidth of both dropped and lost packets and their mean packet delay under various traffic conditions. Finally, we used a generic distance-vector routing protocol which was based on an implementation of Distributed Bellman-Ford algorithm. The performance of the test-bed network model has been evaluated by using the simulation environment of NS-2.},
	doi = {10.1063/1.3037098},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {Vasiliadis200823,
	title = {Improving performance of finite-buffered blocking delta networks with 2-class priority routing through asymmetric-sized buffer queues},
	booktitle = {Proceedings - 4th Advanced International Conference on Telecommunications, AICT 2008},
	year = {2008},
	note = {cited By (since 1996) 1},
	month = {6},
	pages = {23-29},
	abstract = {In this paper the performance of asymmetric-sized finite-buffered Delta Networks with 2-class routing traffic is presented and analyzed in the uniform traffic conditions under various loads using simulations. We compare the performance of 2-class priority mechanism against the single priority one, by gathering metrics for the two most important network performance factors, namely packet throughput and delay. We also introduce and calculate a universal performance factor, which includes the importance aspect of each of the above main performance factors. We found that the use of asymmetric-sized buffered systems leads to better exploitation of network capacity, while the increments in delays can be tolerated. The goal of this paper is to help network designers in performance prediction before actual network implementation and in understanding the impact of each parameter factor. Β{\textcopyright} 2008 IEEE.},
	keywords = {Computer networks, Delta networks, International conferences, Performance factors},
	doi = {10.1109/AICT.2008.13},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-50949090335\&partnerID=40\&md5=1a38fdae7e54da27ace165ed90b5a386},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {Vasiliadis200890,
	title = {Performance Evaluation of Distance Vector Routing Protocol on a Wireless Circular Model},
	booktitle = {Proceedings of the IEEE sponsored International Joint Conference CISSE 2007},
	year = {2008},
	month = {12},
	pages = {323-328},
	publisher = {Springer Netherlands},
	organization = {Springer Netherlands},
	abstract = {In this paper, a wireless Circular Model over a generic distance-vector routing protocol is presented and analyzed. The performance of this model over the Distance Vector protocol, which is an implementation of Distributed Bellman-Ford algorithm, has been evaluated by using the simulation environment of NS-2. We conducted an extensive evaluation study for various mobility schemes in order to incorporate the behavior of nodes and the routing protocol in a real-life hotspot situation In the test-bed model, while the number of source nodes was allowed to arbitrarily vary, there was exactly one destination node, closely modeling thus real-life situations where a single hotspot/access point exists. Finally, different constant bit rates (CBR) were used in order to estimate the throughput of receiving, dropping rates, the number of lost packets, as well as the average packet delay under various traffic conditions. This study is aimed to help wireless network designers in choosing the best suited routing protocols for their networks, through making explicit performance figures for common network setups.},
	doi = {10.1007/978-1-4020-8737-0},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis},
	editor = {Tarek Sobh and Khaled Elleithy and Ausif Mahmood and Mohammad A. Karim}
}
@conference {Vasiliadis200856,
	title = {Routing and performance analysis of double-buffered omega networks supporting multi-class priority traffic},
	booktitle = {Proc. - The 3rd Int. Conf. Systems and Networks Communications, ICSNC 2008 - Includes I-CENTRIC 2008: Int. Conf. Advances in Human-Oriented and Personalized Mechanisms, Technologies, and Services},
	year = {2008},
	note = {cited By (since 1996) 1},
	month = {10},
	pages = {56-63},
	abstract = {In this paper the modeling of Omega Networks supporting multi-class routing traffic is presented and their performance is analyzed. We compare the performance of multi-class priority mechanism against the single priority one, by gathering metrics for the two most important network performance factors, namely packet throughput and delay under uniform traffic conditions and various offered loads, using simulations. Moreover, two different test-bed setups were used in order to investigate and analyze the performance of all priority-class traffic, under different Quality of Service (QoS) configurations. In the considered environment, Switching Elements (SEs) that natively support multi-class priority routing traffic are used for constructing the MIN, while we also consider double-buffered SEs, two configuration parameters that have not been addressed insofar. The rationale behind introducing a multiple-priority scheme is to provide different QoS guarantees to traffic from different applications, which is a highly desired feature for many IP network operators, and particularly for enterprise networks. Β{\textcopyright} 2008 IEEE.},
	keywords = {Computer networks, Configuration parameters, Enterprise networks, Ip networks, Metropolitan area networks, Network performances, Packet throughputs, Performance analyses, Priority schemes, Qos guarantees, Quality of service, Routing traffics, Set-ups, Systems engineering, Uniform traffics},
	doi = {10.1109/ICSNC.2008.10},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-58149096344\&partnerID=40\&md5=11b2d45a47554d3556034866c2f3ac49},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis and E. Glavas}
}
@conference {Vasiliadis2007,
	title = {Performance Analysis of dual priority single-buffered blocking Multistage Interconnection Networks},
	booktitle = {3rd International Conference on Networking and Services, ICNS 2007},
	year = {2007},
	month = {6},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper a novel architecture of dual priority single-buffered blocking Multistage Interconnection Networks (MINs) is presented. We analyzed their performance in the uniform traffic condition under various loads using simulations. We compared the dual priority architecture against a single priority MIN, 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 demonstrated the gain of the high priority packets against the low priority packets under different configuration schemas. In this paper we focus on studying the influence of the priority bit in the header field of transmitted packets on the performance of high and low priority traffic of a MIN. Performance prediction before actual network implementation and understanding the impact of parameter settings in a MIN setup are valuable assets for network designers for minimizing overall deployment costs and delivering efficient networks. Β{\textcopyright} 2007 IEEE.},
	keywords = {Computer architecture, Interconnection networks, International conferences, Low priority (LP), Metrics (CO), Multistage interconnection networks Multistage interconnection netowrk (MIN), Network architecture, Network designers, Network performances, Novel architecture, Packet throughput, Parameter estimation, Parameter settings, Performance analyses, Performance predictions, Schemas, Systems engineering, telecommunication, Telecommunication networks, Uniform traffic},
	doi = {10.1109/ICNS.2007.92},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-47049115567\&partnerID=40\&md5=148ac10a4b9facdaf1066911f87f5bb5},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {Vasiliadis2007a,
	title = {Performance evaluation of two-priority network schema for single-buffered delta networks},
	booktitle = {IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC},
	year = {2007},
	note = {cited By (since 1996) 0},
	month = {9},
	abstract = {In this paper a novel two-priority network schema is presented, and exemplified through its application on singlebuffered Delta Networks in packet switching environments. Network operations considered include conflict resolution and communication strategies. The proposed scheme is evaluated and compared against the single-priority scheme. Performance evaluation was conducted through simulation, due to the complexity of the model, and uniform traffic conditions were considered. Metrics were gathered for the two most important network performance factors, namely packet throughput and the mean time a packet needs to traverse the network. The model can also be uniformly applied to several representative networks providing a basis for fair comparison and the necessary data for network designers to select optimal values for network operation parameters. Β{\textcopyright} 2007 IEEE.},
	keywords = {Computer simulation, Mobile radio systems, Network operations, Packet switching, Single-buffered delta networks, Telecommunication networks, Telecommunication traffic},
	doi = {10.1109/PIMRC.2007.4394153},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44349140122\&partnerID=40\&md5=d8cd4384e09916ce753625ec5f2c8549},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis and E. Glavas}
}
@conference {Vasiliadis2007937,
	title = {The role of priority mechanisms on performance metrics of double-buffered switching elements},
	booktitle = {AIP Conference Proceedings - ICCMSE 2007},
	volume = {963},
	number = {2},
	year = {2007},
	note = {cited By (since 1996) 0},
	month = {9},
	pages = {937-942},
	abstract = {The main concerns in designing the multistage switching fabrics are speed, throughput, delay and variance of delay for a given bandwidth. The rationale behind using various priority mechanisms is either to offer different quality of service levels to packets or to optimize performance parameters of the network, e.g. minimize internal blocking in the Switching Elements (SEs). We investigated the performance parameters of an enhanced priority (EP) mechanism versus a single priority (SP) one. In the EP scheme, packet priority was computed dynamically and was directly proportional to the transmission queue length of the SE that the packet is currently stored in. Finally, we extended the idea of the priority scheme by proposing a multi-priority (MP) mechanism. In the MP scheme, each SE has two transmission queues per link, with one queue dedicated to high priority packets and the other dedicated to low priority ones. We simulated a multistage network under the uniform traffic condition and concluded that the proposed double-buffered SEs provide higher throughput, and decreased latency. Β{\textcopyright} 2007 American Institute of Physics.},
	doi = {10.1063/1.2836247},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-71449122900\&partnerID=40\&md5=3cde25f68a16c221bd7e6ac466752465},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {Vasiliadis2006b,
	title = {Performance analysis of blocking banyan switches},
	booktitle = {Proceedings of the IEEE sponsored International Joint Conference on Computer, Information and System Sciences and Engineering - CIS2E 06},
	year = {2006},
	month = {12},
	abstract = {Banyan Networks are a major class of Multistage Interconnection Networks (MINs). They have been widely used as efficient interconnection structures for parallel computer systems, as well as switching nodes for high-speed communication networks. The performance of them is mainly determined by their communication throughput and their mean packet delay. In this paper we use a model that is based on a universal performance factor, which includes the importance aspect of each of the above main performance factors (throughput and delay) in the design process of a MIN. The model can also uniformly be applied to several representative networks. The complexity of the model requires to be investigated by time-consuming simulations. In this paper we study a typical (8X8) Baseline Banyan Switch that consists of (2X2) Switching Elements (SEs). The objective of this simulation is to determine the optimal buffer size for the MIN stages under different conditions.},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
@conference {Vasiliadis2006a,
	title = {Performance Analysis of Multistage Interconnection Networks determining optimal parameters for data-intensive business applications},
	booktitle = {Proceedings of the 7th IBIMA Conference},
	year = {2006},
	month = {12},
	abstract = {Multistage Interconnection Networks (MINs) are frequently used for connecting processors in parallel computing systems or constructing high speed networks such as ATM (based on Asynchronous Transfer Mode) and Gigabit Ethernet Switches. New applications require distributed computing implementations, but old networks are too slow to allow efficient use of remote resources. Moreover, multimedia are considered as applications with high bandwidth requirements. Some of them are also sensitive to packet loss and claim reliable data transmission. Specific applications require bulk data transfers for database replication or load balancing and therefore packet loss minimization is necessary in order to increase the performance of them. The demand for high performance multimedia services such as full motion video on demand is becoming an increasingly important driving force in the communication market in the Digital Age. Thus, the performance of MINs is a crucial factor, which we have to take into account in the design of new applications. Their performance is mainly determined by their communication throughput and cell latency, which have to be investigated either by time-consuming simulations or approximated by mathematical models. In this paper we investigate the performance of MINs in order to determine optimal values for hardware parameters under diferent operating conditions.},
	author = {D.C. Vasiliadis and G.E. Rizos and Costas Vassilakis}
}
