@article{kumar_garrett_nainar_palmero_pignataro_viniotis_2022, title={Leveraging Experience Telemetry: Architecture and Data Models}, ISSN={["2162-3414"]}, DOI={10.1109/ICIN53892.2022.9758132}, abstractNote={Network Telemetry is the process of collecting operational measurements and other related data from the network infrastructure using industry-developed standards. These data are consumed by various management applications to provide analytics and insights for network operators. In this paper, we provide a use case and motivation behind the need for a standards-based method to collect non-operational telemetry data such as business related metrics from the infrastructure, in order to improve the end-user experience. We present an architecture and data models for the new telemetry framework known as Experience Telemetry. Finally, we supply qualitative methods for analyzing the merits of the standard data model.}, journal={25TH CONFERENCE ON INNOVATION IN CLOUDS, INTERNET AND NETWORKS (ICIN 2022)}, author={Kumar, Sudhendu and Garrett, John and Nainar, Nagendra Kumar and Palmero, Marisol and Pignataro, Carlos and Viniotis, Yannis}, year={2022}, pages={141–145} }
 @article{gandhi_viniotis_2020, title={Guarantees for Mix-flows in Inter-Datacenter WANs in Single and Federated Clouds}, ISSN={["0742-1303"]}, DOI={10.1109/LCN48667.2020.9314789}, abstractNote={Inter-datacenter WANs connect geo-distributed datacenters and carry a considerable amount of traffic, generally a mix of flows. There has been little work done to provide custom guarantees depending on the nature of traffic requirements in such environments. In this paper we address this problem by proposing Vritti, an adaptable spatial-temporal system for traffic engineering in inter-datacenter WAN environments applicable to single and federated clouds. With Vritti, cloud providers can offer tailor-made guarantees to users with widely differing requirements (in terms of hard, soft or no deadlines) and traffic characteristics (in terms of known or unknown traffic volumes). We use linear programming to mathematically formulate the problem with the objective of maximizing utility. We propose two online algorithms to generate admission control, scheduling and routing decisions. Our simulations show that Vritti can effectively meet deadline transfers and provide fairness to non-deadline transfers in both single and federated cloud environments.}, journal={PROCEEDINGS OF THE 2020 IEEE 45TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2020)}, author={Gandhi, Shruti and Viniotis, Yannis}, year={2020}, pages={244–255} }
 @article{singh_atrey_sichitiu_viniotis_2019, title={Clearer than Mud: Extending Manufacturer Usage Description (MUD) for Securing IoT Systems}, volume={11519}, ISBN={["978-3-030-23356-3"]}, ISSN={["1611-3349"]}, DOI={10.1007/978-3-030-23357-0_4}, abstractNote={Internet of Things (IoT) devices, expected to increase exponentially over the next several years, are easy targets for attackers. To make these devices more secure, the IETF’s draft of Manufacturer Usage Description (MUD) provides a means for the manufacturer of an IoT device to specify its intended purpose and communication patterns in terms of access control lists (ACLs), thereby defining the device’s normal behaviour. However, MUD may not be sufficient to comprehensively capture the normal behaviour specification, as it cannot incorporate variable operational settings that depend on the environment. Further, MUD only supports limited features. Our approach overcomes these limitations by allowing the administrator to define the normal behaviour by choosing combinations from a wider set of features that includes physical layer parameters, values of packet headers, and flow statistics. We developed and implemented a learning-based system that captures and demodulates wireless packets from IoT devices over a period of time, extracts the features specified in the normal behaviour specification, and uses a learning algorithm to create a normal model of each device. Our implementation also enforces these normal models by detecting violations and taking appropriate actions, in terms of ACLs on an Internet Gateway, against the misbehaving devices. Hence, our framework makes the specification tighter and clearer than what is possible with MUD alone, thereby making IoT systems more secure.}, journal={INTERNET OF THINGS - ICIOT 2019}, author={Singh, Simran and Atrey, Ashlesha and Sichitiu, Mihail L. and Viniotis, Yannis}, year={2019}, pages={43–57} }
 @article{baron_spathis_amorim_viniotis_ammar_2019, title={Mobility As an Alternative Communication Channel: A Survey}, volume={21}, ISSN={["1553-877X"]}, DOI={10.1109/COMST.2018.2841192}, abstractNote={We review the research literature investigating systems in which mobile entities can carry data while they move. These entities can be either mobile by nature (e.g., human beings and animals) or mobile by design (e.g., trains, airplanes, and cars). The movements of such entities equipped with storage capabilities create a communication channel which can help overcome the limitations or the lack of conventional data networks. Common limitations include the mismatch between the capacity offered by these networks and the traffic demand or their limited deployment owing to environmental factors. Application scenarios include offloading traffic off legacy networks for capacity improvement, bridging connectivity gaps, or deploying ad hoc networks in challenging environments for coverage enhancement.}, number={1}, journal={IEEE COMMUNICATIONS SURVEYS AND TUTORIALS}, author={Baron, Benjamin and Spathis, Promethee and Amorim, Marcelo Dias and Viniotis, Yannis and Ammar, Mostafa H.}, year={2019}, pages={289–314} }
 @article{halabian_lambadaris_viniotis_2019, title={Optimal Server Assignment in Multi-Server Queueing Systems with Random Connectivities}, volume={21}, ISSN={["1976-5541"]}, DOI={10.1109/JCN.2019.000023}, abstractNote={In this paper, we provide complementary results on delay-optimal server allocation in multi-queue multi-server (MQMS) systems with random connectivities. More specifically, we consider an MQMS system where each queue is limited to get service by at most one server during each time slot. It is known that maximum weighted matching (MWM) is a throughput-optimal server assignment policy for such a system. In this paper, using dynamic coupling argument we prove that for a system with i.i.d. Bernoulli arrivals and connectivities, MWM minimizes, in stochastic ordering sense, a range of cost functions of the queue lengths such as total queue occupancy (which implies minimization of average queueing delay). Finally, we propose a low complexity heuristic server assignment policy for MQMS systems namely least connected server first/longest connected queue (LCSF/LCQ) and through simulations we show that it performs very closely compared with the optimal policy in terms of average queueing delay.}, number={4}, journal={JOURNAL OF COMMUNICATIONS AND NETWORKS}, author={Halabian, Hassan and Lambadaris, Ioannis and Viniotis, Yannis}, year={2019}, month={Aug}, pages={405–415} }
 @article{gandhi_viniotis_2018, title={Joint Virtual Machine Placement and Path Selection in a Virtualized Datacenter Environment}, DOI={10.1145/3154273.3154325}, abstractNote={Today's multi-tenant shared datacenter environments guarantee compute resources over a best-effort intra-datacenter network. Bursty traffic in such a network implies higher delays and losses for tenants. This may result in unpredictable network performance, potentially hurting the tenant's overall application performance. Motivated by these concerns, in this work we propose a Service Level Agreement (SLA) that along with compute capacity, explicitly guarantees intra-datacenter network bandwidth to the tenants in a virtualized, multi-tenant datacenter environment. We design a modified greedy approach that uses virtual machine placement and path selection to solve the joint resource allocation problem. In recent years, several algorithms have been proposed for resource allocation problems to meet a specific SLA. However they do not provide any practical recommendations for the realization of these solutions from a datacenter designer's standpoint. Another main contribution of our work is the design of a rigorous simulation setup to derive a definitive set of guidelines for the datacenter designer implementing the proposed SLA. The guideline answers questions of key practical importance to datacenter designers and enables derivation of effective estimates about the switch fabric and server capacity to be bought and installed, as a function of tenant demands.}, journal={ICDCN'18: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING}, author={Gandhi, Shruti and Viniotis, Yannis}, year={2018} }
 @article{baron_spathis_rivano_amorim_viniotis_ammar_2017, title={Centrally Controlled Mass Data Offloading Using Vehicular Traffic}, volume={14}, ISSN={["1932-4537"]}, DOI={10.1109/tnsm.2017.2672878}, abstractNote={With over 300 billion vehicle trips made in the United States and 64 billion in France per year, network operators have the opportunity to utilize the existing road and highway network as an alternative data network to offload large amounts of delay-tolerant traffic. To enable the road network as a large-capacity transmission system, we exploit the existing mobility of vehicles equipped with wireless and storage capacities together with a collection of offloading spots. An offloading spot is a data storage equipment located where vehicles usually park. Data is transloaded from a conventional data network to the closest offloading spot and then shipped by vehicles along their line of travel. The subsequent offloading spots act as data relay boxes where vehicles can drop off data for later pick-up by other vehicles, depending on their direction of travel. The main challenges of this offloading system are how to compute the road path matching the performance requirements of a data transfer and how to configure the sequence of offloading spots involved in the transfer. We propose a scalable and adaptive centralized architecture built on software-defined networking that maximizes the utilization of the flow of vehicles connecting consecutive offloading spots. We simulate the performance of our system using real roads traffic counts for France. Results show that the centralized controlled offloading architecture can achieve an efficient and fair allocation of concurrent data transfers between major cities in France.}, number={2}, journal={IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT}, author={Baron, Benjamin and Spathis, Promethee and Rivano, Herve and Amorim, Marcelo Dias and Viniotis, Yannis and Ammar, Mostafa H.}, year={2017}, month={Jun}, pages={401–415} }
 @inproceedings{singh_viniotis_2016, title={An SLA-based resource allocation for IoT applications in cloud environments}, DOI={10.1109/ciot.2016.7872913}, abstractNote={In an IoT cloud, the message broker service allows point to multi-point communication between IoT devices and applications. The service is governed by Service Level Agreements (SLA) that specify, among other requirements, the volume of messages served during an enforcement period. For simplicity, current SLAs do not provide detailed information about message arrival patterns, making enforcement of the SLA a difficult problem for the providers. In this paper, we propose a new, two-step SLA by introducing sub-periods for measurement and control within the total enforcement period. Our proposed SLA retains the simplicity of the current SLA and provides additional controls for the providers to enforce it. We present the conformance of the new SLA as a resource allocation problem for cloud providers and propose a buffering, scheduling and rate limiting mechanism to enforce it. We verify that the solution achieves conformance, analyze the tradeoffs of the solution and evaluate via simulation the effects of system parameters such as capacity, number of sub-periods and enforcement period.}, booktitle={2016 Cloudification of the Internet of Things (CIOT)}, author={Singh, A. and Viniotis, Y.}, year={2016} }
 @inproceedings{singh_viniotis_2016, title={Resource allocation for IoT applications in cloud environments}, DOI={10.1109/iccnc.2017.7876218}, abstractNote={In an IoT cloud, the message broker service offered to customers allows customer's devices and applications to connect and interact with cloud applications and other devices. The service is governed by Service Level Agreements (SLA) that specify, among other requirements, the volume of messages served during an enforcement period. For simplicity, SLAs do not take into account detailed information about message arrival patterns or service times, making enforcement of the SLA a challenging problem for the providers. In this paper, we propose a resource allocation mechanism (that uses buffering, scheduling and rate limiting) to meet the SLA. We verify that the solution achieves conformance, analyze the tradeoffs of the solution and evaluate via simulation the effects of system parameters such as capacity and enforcement period.}, booktitle={2017 international conference on computing, networking and communications (icnc)}, author={Singh, A. and Viniotis, Y.}, year={2016}, pages={719–723} }
 @article{baron_campista_spathis_costa_amorim_duarte_pujolle_viniotis_2016, title={Virtualizing vehicular node resources: Feasibility study of virtual machine migration}, volume={4}, ISSN={["2214-2096"]}, DOI={10.1016/j.vehcom.2016.04.001}, abstractNote={With emerging geo-distributed services, there is a need to coordinate the use of resources offered by field-area networks. In the case of vehicular networks, such resources include the processing, sensing, and storage capabilities offered to service providers for urban sensing or intelligent transportation. In this paper, we propose to virtualize the resources embedded on the vehicular nodes to allow multiple tenants to coexist and deploy their services on the same underlying mobile substrate. Virtualization is the task of an infrastructure provider that controls the mobile substrate and allocates sliced resources to the tenants. A service results from a collection of virtual machines hosted on the mobile nodes allocated by the infrastructure provider. Efficient utilization of the node resources may trigger virtual machine migrations. We study the problem of virtual machine migrations through V2V communications between mobile nodes. To evaluate the impact of such migrations on the resource allocation process, we use the real traces of a bus transit system to simulate a vehicular network where virtual machines migrate via V2V communications. Our results show that virtual machines of several hundreds of Megabytes can migrate between moving buses. We then discuss design principles and research issues toward the full virtualization of opportunistic networks.}, journal={VEHICULAR COMMUNICATIONS}, author={Baron, Benjamin and Campista, Miguel and Spathis, Promethee and Costa, Luis Henrique M. K. and Amorim, Marcelo Dias and Duarte, Otto Carlos M. B. and Pujolle, Guy and Viniotis, Yannis}, year={2016}, month={Apr}, pages={39–46} }
 @article{wang_krim_viniotis_2014, title={Analysis and Control of Beliefs in Social Networks}, volume={62}, ISSN={["1941-0476"]}, DOI={10.1109/tsp.2014.2352591}, abstractNote={In this paper, we investigate the problem of how beliefs diffuse among members of social networks. We propose an information flow model (IFM) of belief that captures how interactions among members affect the diffusion and eventual convergence of a belief. The IFM model includes a generalized Markov Graph (GMG) model as a social network model, which reveals that the diffusion of beliefs depends heavily on two characteristics of the social network characteristics, namely degree centralities and clustering coefficients. We apply the IFM to both converged belief estimation and belief control strategy optimization. The model is compared with an IFM including the Barabási-Albert model, and is evaluated via experiments with published real social network data.}, number={21}, journal={IEEE TRANSACTIONS ON SIGNAL PROCESSING}, author={Wang, Tian and Krim, Hamid and Viniotis, Yannis}, year={2014}, month={Nov}, pages={5552–5564} }
 @article{wang_krim_viniotis_2013, title={A Generalized Markov Graph Model: Application to Social Network Analysis}, volume={7}, ISSN={["1941-0484"]}, DOI={10.1109/jstsp.2013.2246767}, abstractNote={In this paper we propose a generalized Markov Graph model for social networks and evaluate its application in social network synthesis, and in social network classification. The model reveals that the degree distribution, the clustering coefficient distribution as well as a newly discovered feature, a crowding coefficient distribution, are fundamental to characterizing a social network. The application of this model to social network synthesis leads to a capacity to generate networks dominated by the degree distribution and the clustering coefficient distribution. Another application is a new social network classification method based on comparing the statistics of their degree distributions and clustering coefficient distributions as well as their crowding coefficient distributions. In contrast to the widely held belief that a social network graph is solely defined by its degree distribution, the novelty of this paper consists in establishing the strong dependence of social networks on the degree distribution, the clustering coefficient distribution and the crowding coefficient distribution, and in demonstrating that they form minimal information to classify social networks as well as to design a new social network synthesis tool. We provide numerous experiments with published data and demonstrate very good performance on both counts.}, number={2}, journal={IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING}, author={Wang, Tian and Krim, Hamid and Viniotis, Yannis}, year={2013}, month={Apr}, pages={318–332} }
 @article{jarma_boloor_amorim_viniotis_callaway_2013, title={Dynamic Service Contract Enforcement in Service-Oriented Networks}, volume={6}, ISSN={["1939-1374"]}, DOI={10.1109/tsc.2011.45}, abstractNote={In recent years, service-oriented architectures (SOA) have emerged as the main solution for the integration of legacy systems with new technologies in the enterprise world. A service is usually governed by a client service contract (CSC) that specifies, among other requirements, the rate at which a service should be accessed, and limits it to no more than a number of service requests during an observation period. Several approaches, using both static and dynamic credit-based strategies, have been developed to enforce the rate specified in the CSC. Existing approaches have problems related to starvation, approximations used in calculations, and rapid credit consumption under certain conditions. In this paper, we propose and validate DoWSS, a doubly weighted algorithm for service traffic shaping. We show via simulation that DoWSS possesses several advantages: It eliminates the approximation issues, prevents starvation, and contains the rapid credit consumption issue in existing credit-based approaches.}, number={1}, journal={IEEE TRANSACTIONS ON SERVICES COMPUTING}, author={Jarma, Yesid and Boloor, Keerthana and Amorim, Marcelo Dias and Viniotis, Yannis and Callaway, Robert D.}, year={2013}, pages={130–142} }
 @inproceedings{saovapakhiran_devetsikiotis_michailidis_viniotis_2012, title={Average delay SLAs in cloud computing}, DOI={10.1109/icc.2012.6364548}, abstractNote={In this paper, we conduct feasibility studies on the average delay space for Cloud computing, and we propose a heuristic method to control the vector of average delays, subject to predefined delay constraints. Our work is strongly motivated by the fact that delay control plays a critical role to improve Service Level Agreements (SLA) between users and Cloud service providers, which is necessary for empowering online business. Specifically, our main contributions are two-fold: First, the feasible regions of various routing algorithms for the system's dispatcher are investigated in depth. Second, a simple heuristic algorithm is designed, to move the average delay point along the feasible direction until achieving the delay constraints. Average delay is dependent on multiple factors such as job size, inter-arrival time, flow rate, and the dispatching rules of the system. Therefore, we vary their distribution, parameters and routing rules to examine how the feasible regions move or change. After establishing the feasible delay space, then by moving along the feasible directions, we show that a simple heuristic algorithm can achieve the delay constraints for a two queue system.}, booktitle={2012 ieee international conference on communications (icc)}, author={Saovapakhiran, B. and Devetsikiotis, M. and Michailidis, G. and Viniotis, Y.}, year={2012} }
 @article{al-zubaidy_lambadaris_viniotis_2012, title={Optimal scheduling in multi-server queues with random connectivity and retransmissions}, volume={35}, ISSN={["1873-703X"]}, DOI={10.1016/j.comcom.2012.05.007}, abstractNote={We investigate an optimal scheduling problem in a discrete-time, multiserver system of parallel queues. The servers are connected to the queues in a random fashion and scheduled packets complete service successfully with a given probability. This model is suitable for the study of dynamic packet scheduling problems in wireless systems. We study first a two-server system of two infinite-capacity queues with homogeneous arrival, service and connectivity assumptions. We use coupling arguments to prove that a “Most Balancing” scheduling policy is optimal, in a stochastic ordering sense, for this system. We then consider a finite-capacity, non-homogeneous, multi-server and multi-queue system. We develop a dynamic programming model to determine numerically the scheduling policy that optimizes a range of cost functions, including average total queue sizes. We also compare the performance of the optimal policy to that of a few other policies via simulations.}, number={13}, journal={COMPUTER COMMUNICATIONS}, author={Al-Zubaidy, Hussein and Lambadaris, Ioannis and Viniotis, Yannis}, year={2012}, month={Jul}, pages={1626–1638} }
 @inproceedings{boloor_chirkova_salo_viniotis_2011, title={Analysis of response time percentile service level agreements in SOA-based applications}, DOI={10.1109/glocom.2011.6133866}, abstractNote={A large number of enterprise, web-based, distributed software applications are designed on Service Oriented Architecture (SOA) principles and hosted in large scale datacenters managed by cloud providers. Typically, Service Level Agreements (SLAs) are negotiated between the consumers of the cloud platform services and the cloud provider. In this work, we consider SLAs that involve percentiles of response times as part of the performance metrics; the SLAs stipulate that a penalty be charged to the cloud provider if the SLA targets are not met. The main motivation for considering such SLAs is their potential for price differentiation. We focus our analysis on the effects the penalty function has on the achieved response time percentiles. In particular, we analyze the effect of three commonly deployed choices (linear, exponential or step-wise functions) to relate the penalty charged and the achieved percentile. This analysis is NP-hard, so we employ a heuristic algorithm that is based on simulated annealing. Our results indicate that the linear penalty charging function is ``best'' in the sense that it maximizes the achieved response time percentiles.}, booktitle={2011 ieee global telecommunications conference (globecom 2011)}, author={Boloor, K. and Chirkova, R. and Salo, T. and Viniotis, Y.}, year={2011} }
 @inproceedings{boloor_chirkova_salo_viniotis_2010, title={Heuristic-based request scheduling subject to a percentile response time SLA in a distributed cloud}, DOI={10.1109/glocom.2010.5683946}, abstractNote={We consider geographically distributed data centers forming a collectively managed cloud computing system hosting multiple applications, each subject to Service Level Agreements (SLA). The Service Level Agreements for each application require the response time of a certain percentile of the input requests to be less than a specified value, with the non-conforming requests being charged a penalty. We present a novel approach of heuristic-based request scheduling at each server, in each of the geographically distributed data centers, to globally minimize the penalty charged to the cloud computing system. We evaluate two variants of our heuristic-based approach, one based on the simulated annealing method of neighborhood searches and another based on gi-FIFO scheduling, which has been analytically proven to be the best schedule for percentile goals in a single machine, multi-class problem. We also compare our approaches with First In First Out (FIFO) and Weighted Round Robin (WRR) scheduling policies.}, booktitle={2010 ieee global telecommunications conference globecom 2010}, author={Boloor, K. and Chirkova, R. and Salo, T. and Viniotis, Y.}, year={2010} }
 @article{taggart_viniotis_sichitiu_2009, title={Modeling the effect of node synchronization times in ultra-wideband wireless networks}, volume={66}, ISSN={["1872-745X"]}, DOI={10.1016/j.peva.2008.10.008}, abstractNote={Ultra-wideband wireless (UWB) can provide the physical layer for high-throughput personal area networks. When UWB is used for communication between many nodes, relatively long acquisition times are needed when dropping and re-establishing wireless links between the nodes. This paper describes the development and use of mathematical and simulation models to investigate the impact of dropping and reacquiring links between nodes on average packet delay; we also consider the performance of the alternative strategy of forwarding packets through intermediate nodes without breaking the established wireless links. The work presented here assumes that no specific MAC layer protocol, such as WiMedia UWB MAC, is in operation. The paper describes the models, explains the selection of modeling parameters used, compares the average packet delay for a network of three simple UWB nodes and for a ring of ten UWB nodes and explains the use of these results for network design engineers.}, number={3-5}, journal={PERFORMANCE EVALUATION}, author={Taggart, Christopher S. and Viniotis, Yannis and Sichitiu, Mihail L.}, year={2009}, month={Mar}, pages={223–239} }
 @article{de amorim_ziviani_viniotis_tassiulas_2008, title={PRACTICAL ASPECTS OF MOBILITY IN WIRELESS SELF-ORGANIZING NETWORKS}, volume={15}, ISSN={["1536-1284"]}, DOI={10.1109/mwc.2008.4749741}, abstractNote={Wireless and mobile computing have advanced significantly in the last decade. In particular, we now face the challenge to spontaneously establish wireless self-organizing networks, such as ad hoc, disruption-tolerant, sensor, and wireless mesh networks. These spontaneous self-organizing networks have been the focus of intensive research activity in recent years. Spontaneous networks arise from the cooperation of mobile devices in an ad hoc fashion requiring no previous infrastructure in place. A key point to couple research and real-life applications in this context is to understand how mobility (of devices, users, and applications) impacts practical networking aspects.}, number={6}, journal={IEEE WIRELESS COMMUNICATIONS}, author={De Amorim, Marcelo Dias and Ziviani, Artur and Viniotis, Yannis and Tassiulas, Leandros}, year={2008}, month={Dec}, pages={6–7} }
 @article{amorim_benbadis_fdida_sichitiu_viniotis_2006, title={Dissecting the routing architecture of self-organizing networks}, volume={13}, ISSN={["1558-0687"]}, DOI={10.1109/MWC.2006.275204}, abstractNote={The proper operation of self-organizing networks (SONs) relies on the autonomous behavior of their individual nodes. Routing in such networks has been a challenging task since their conception, due to their nontraditional characteristics and design requirements. Although a large amount of routing architectures and protocols for SONs has been proposed, very little work has been done on the fundamental characteristics that make a routing strategy efficient for a particular network and/or design requirement. Contrary to traditional techniques where the routing architecture is structured as a single unit, we suggest in this article that routing be thought of as a combination of four main architectural components, namely, addressing, dissemination, discovery, and forwarding. This logical decomposition offers significant advantages from both the analysis and the design perspectives. We conclude from our observations that routing architectures should be scenario-driven, in the sense that the configuration parameters are not necessarily universally good for all application scenarios}, number={6}, journal={IEEE WIRELESS COMMUNICATIONS}, author={Amorim, Marcelo and Benbadis, Farid and Fdida, Serge and Sichitiu, Mihail L. and Viniotis, Yannis}, year={2006}, month={Dec}, pages={98–104} }
 @article{oothongsap_viniotis_vouk_2006, title={Theoretical analysis of the SABUL congestion control algorithm}, volume={31}, ISSN={["1572-9451"]}, DOI={10.1007/s11235-006-6516-8}, number={2-3}, journal={TELECOMMUNICATION SYSTEMS}, author={Oothongsap, P and Viniotis, Y and Vouk, M}, year={2006}, month={Mar}, pages={115–139} }
 @article{carneiro viana_amorim_viniotis_fdida_rezende_2006, title={Twins: A dual addressing space representation for self-organizing networks}, volume={17}, ISSN={["1558-2183"]}, DOI={10.1109/TPDS.2006.179}, abstractNote={As the size of mobile self-organizing networks increases, the efficiency of location services must increase as well so that addressing/routing scalability does not become an issue. In this paper, we propose a novel architecture, called Twins, tailored for self-organizing networks. Twins architecture involves addressing and locating nodes in large networks, forwarding packets between them, and managing in the presence of mobility/topology changes. Twins defines a logical multidimensional space for addressing and forwarding, while location service and management operations make use of a one-dimensional space. To improve scalability and performance, forwarding is hop-by-hop with greedy next-hop choice and the location service uses a rendezvous paradigm to distribute information among nodes. In this paper, we describe the Twins architecture and present a performance evaluation to assess scalability, fairness in the overhead distribution among nodes, and routing robustness.}, number={12}, journal={IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS}, author={Carneiro Viana, Aline and Amorim, Marcelo and Viniotis, Yannis and Fdida, Serge and Rezende, Jose}, year={2006}, month={Dec}, pages={1468–1481} }
 @inbook{ridoux_fladenmuller_viniotis_salamatian_2005, title={Trellis-based virtual regular addressing structures in self-organized networks}, volume={3462}, ISBN={3540258094}, DOI={10.1007/11422778_41}, abstractNote={Self–Organized Networks are multi-hop networks that do not rely on any infrastructure. Moreover, their topology is supposed to be flat since all nodes are equally in charge of address allocation and routing functions. Their time–changing topology breaks the association between Identification and Location that is present in the IP address. Moreover, mobility can not be handled easily when the addressing space is based on a tree description. In this paper we propose the use of Virtual Regular Structures to provide desired properties for Self0–Organized Networks. Our approach opens new ways to build addressing spaces and enables an implementation based on trellis graphs. We propose a construction heuristic and evaluate its performance via simulations. We also analyze the robustness of the proposed approach with regards to mobility.}, booktitle={Networking 2005: Networking technologies, services, and protocols: Performance of computer and communication networks: Mobile and wireless communication systems: 4th International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2-6, 2005: Proceedings (Lecture notes in computer science; 3462)}, publisher={Berlin; New York: Springer}, author={Ridoux, J. and Fladenmuller, A. and Viniotis, Y. and Salamatian, K.}, year={2005}, pages={511–522} }
 @inbook{oothongsap_viniotis_vouk_2004, title={Experimental analysis of the SABUL congestion control algorithm}, volume={3042}, ISBN={3540219595}, DOI={10.1007/978-3-540-24693-0_131}, abstractNote={Several new protocols such as RBUDP, User-Level UDP, Tsunami, and SABUL, have been proposed as alternatives to TCP for high-speed data transfer. The purpose of this paper is to analyze experimentally the effects of SABUL congeston control algorithm on SABUL and performance metrics such as bandwidth utilization, self-fairness, and aggressiveness. Our results confirm some expected behavior of SABUL and reveal some less expected one. Our experiments also indicate that SABUL implementation and design can result in an even more erratic behavior and degraded performance under high-congestion conditions.}, booktitle={Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings}, publisher={Berlin; New York: Springer}, author={Oothongsap, P. and Viniotis, Y. and Vouk, M.}, year={2004}, pages={1433–1439} }
 @article{luh_viniotis_2002, title={Threshold control policies for heterogeneous server systems}, volume={55}, ISSN={["1432-2994"]}, DOI={10.1007/s001860100168}, number={1}, journal={MATHEMATICAL METHODS OF OPERATIONS RESEARCH}, author={Luh, HP and Viniotis, I}, year={2002}, month={Mar}, pages={121–142} }
 @inbook{wright_viniotis_2000, title={Buffer size requirements for delay sensitive traffic considering discrete effects and service-latency in ATM switches}, volume={1815}, ISBN={354067506X}, DOI={10.1007/3-540-45551-5_6}, abstractNote={Various approaches to buffer size and management for output buffering in ATM switches supporting delay sensitive traffic are reviewed. Discrete worst case arrival and service functions are presented. Using this format, bounds are developed for buffer size under zero cell loss for leaky bucket constrained sources. Tight bounds are developed for the case of discrete arrival functions with fluid servers and fluid arrival functions with discrete servers. A bound on the buffer size is also proposed for the case of discrete arrival and service process. While this bound is not exact, the maximum gain that could be achieved by a tighter bound is bounded. In some cases it is possible to reduce the buffer size requirements through over allocation of link bandwidth. Feasibility conditions for this scenario are developed.}, booktitle={Networking 2000: Broadband communications, high performance networking, and performance of communication networks / IFIP-TC6/European Commission International Conference, Paris, France, May 2000, proceedings}, publisher={Berlin; New York: Springer}, author={Wright, S. and Viniotis, Y.}, year={2000}, pages={61–73} }
 @article{sharma_viniotis_1999, title={Convergence of a dynamic policy for buffer management in shared buffer ATM switches}, volume={36-7}, ISSN={["0166-5316"]}, DOI={10.1016/S0166-5316(99)00021-8}, abstractNote={Lack of effective buffer management can lead to severe cell loss in shared buffer ATM switches. With the aim of reducing cell loss, we study a class of non-anticipative buffer management policies that always admit cells to the buffer while there is space in it and may pushout a cell when the buffer becomes full. We propose a dynamic algorithm that operates without any knowledge of the arrival process; we consider a two-class system and show that the algorithm is optimal when the arrivals to each class are a superposition of identically distributed and independent Bernoulli processes.}, journal={PERFORMANCE EVALUATION}, author={Sharma, S and Viniotis, Y}, year={1999}, month={Aug}, pages={249–266} }
 @article{sharma_viniotis_1999, title={Optimal buffer management policies for shared-buffer ATM switches}, volume={7}, ISSN={["1063-6692"]}, DOI={10.1109/90.793030}, abstractNote={Shared-buffer ATM switches can have severe cell loss under asymmetrical or heavy loading conditions, which makes buffer management essential. In this paper, we study the shared-buffer system under the class of all work-conserving pushout policies and derive the properties of the optimal policy, which gives the least-average expected total cell loss probability. In a 2/spl times/2 system with independent identically distributed Bernoulli arrivals, we show that the optimal policy can be characterized by a single threshold. In the case of correlated arrivals, modeled by a discrete batch Markovian arrival process, the optimal policy has multiple thresholds, one for each phase of the arrival process. For the N/spl times/N shared buffer ATM switch, we are unable to prove optimality of any policy, but we study the system via simulations. We provide a dynamic buffer management policy and compare its performance with that of static threshold-type policies.}, number={4}, journal={IEEE-ACM TRANSACTIONS ON NETWORKING}, author={Sharma, S and Viniotis, Y}, year={1999}, month={Aug}, pages={575–587} }
 @book{viniotis_1998, title={Probability and random processes for electrical engineers}, ISBN={0070674914}, publisher={Boston, MA: WCB/McGraw-Hill}, author={Viniotis, Y.}, year={1998} }
 @article{balakrishnan_puliafito_trivedi_viniotis_1997, title={Buffer losses vs. deadline violations for ABR traffic in an ATM switch: A computational approach}, volume={7}, ISSN={["1018-4864"]}, DOI={10.1023/A:1019164110511}, number={1-3}, journal={TELECOMMUNICATION SYSTEMS}, author={Balakrishnan, M and Puliafito, A and Trivedi, K and Viniotis, Y}, year={1997}, pages={105–123} }
 @article{salama_reeves_viniotis_1997, title={Evaluation of multicast routing algorithms for real-time communication on high-speed networks}, volume={15}, ISSN={["1558-0008"]}, DOI={10.1109/49.564132}, abstractNote={Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. Simulations also reveal that one of the unconstrained algorithms, reverse path multicasting (RPM), is quite inefficient when applied to asymmetric networks. We study how combining routing with resource reservation and admission control improves the RPM's efficiency in managing the network resources. The performance of one semiconstrained heuristic, MSC, three constrained Steiner tree (CST) heuristics, Kompella, Pasquale, and Polyzos (1992), constrained adaptive ordering (CAO), and bounded shortest multicast algorithm (BSMA), and one constrained shortest path tree (CSPT) heuristic, the constrained Dijkstra heuristic (CDKS) are also studied. Simulations show that the semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QoS requirements of real-time traffic. However, the cost performance of the heuristics varies. The BSMA's MC trees are lower in cost than all other constrained heuristics. Finally, we compare the execution times of all algorithms, unconstrained, semiconstrained, and constrained.}, number={3}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={Salama, HF and Reeves, DS and Viniotis, Y}, year={1997}, month={Apr}, pages={332–345} }
 @article{rajala_vouk_nilsson_miller_schrag_burke_brawner_viniotis_perros_1997, title={Technology for support of network-based education workflows in North Carolina: NC State-Fujitsu education partnership final report for the period June 1, 1996-December 31, 1996}, number={3}, journal={TR (Center for Advanced Computing and Communication)}, author={Rajala, S. A. and Vouk, M. A. and Nilsson, A. A. and Miller, T. K. and Schrag, R. L. and Burke, J. R. and Brawner, C. E. and Viniotis, I. and Perros, H. G.}, year={1997} }