Works (32)

Updated: August 16th, 2024 13:37

2022 article

Leveraging Experience Telemetry: Architecture and Data Models

25TH CONFERENCE ON INNOVATION IN CLOUDS, INTERNET AND NETWORKS (ICIN 2022), pp. 141–145.

By: S. Kumar n, J. Garrett, N. Nainar, M. Palmero, C. Pignataro* & Y. Viniotis n

author keywords: Telemetry; Experience Telemetry; ML/AI; Risk Assessment; Analytics; Data Models
TL;DR: 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 is provided. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: Web Of Science
Added: July 5, 2022

2020 article

Guarantees for Mix-flows in Inter-Datacenter WANs in Single and Federated Clouds

PROCEEDINGS OF THE 2020 IEEE 45TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2020), pp. 244–255.

By: S. Gandhi n & Y. Viniotis n

author keywords: Inter-datacenter WAN; mix-flows; tailor-made guarantees; deadlines
TL;DR: This paper proposes Vritti, an adaptable spatial-temporal system for traffic engineering in inter-datacenter WAN environments applicable to single and federated clouds, and proposes two online algorithms to generate admission control, scheduling and routing decisions. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 2, 2021

2019 article

Clearer than Mud: Extending Manufacturer Usage Description (MUD) for Securing IoT Systems

INTERNET OF THINGS - ICIOT 2019, Vol. 11519, pp. 43–57.

By: S. Singh n, A. Atrey n, M. Sichitiu n & Y. Viniotis n

author keywords: Internet of Things; Security; Manufacturer Usage Description (MUD); Clustering
TL;DR: 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. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: July 13, 2020

2019 journal article

Mobility As an Alternative Communication Channel: A Survey

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 21(1), 289–314.

By: B. Baron, P. Spathis, M. Amorim, Y. Viniotis n & M. Ammar*

author keywords: Mobility; data transfers; offloading; disruption-tolerant networks; ad-hoc networks; challenged networks
TL;DR: This work reviews the research literature investigating systems in which mobile entities can carry data while they move and suggests application scenarios including offloading traffic off legacy networks for capacity improvement, bridging connectivity gaps, or deploying ad hoc networks in challenging environments for coverage enhancement. (via Semantic Scholar)
Source: Web Of Science
Added: March 11, 2019

2019 journal article

Optimal Server Assignment in Multi-Server Queueing Systems with Random Connectivities

JOURNAL OF COMMUNICATIONS AND NETWORKS, 21(4), 405–415.

By: H. Halabian n, I. Lambadaris n & Y. Viniotis n

author keywords: Delay-optimal server allocation; dynamic coupling; maximum weighted matching; multi-server queueing systems
TL;DR: Using dynamic coupling argument it is proved 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). (via Semantic Scholar)
Source: Web Of Science
Added: September 30, 2019

2018 article

Joint Virtual Machine Placement and Path Selection in a Virtualized Datacenter Environment

ICDCN'18: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING.

By: S. Gandhi n & Y. Viniotis n

author keywords: Datacenter; Service Level Agreement; CPU Time; Uplink Bandwidth; Virtual Machine Placement; Path Selection
TL;DR: This work designs a modified greedy approach that uses virtual machine placement and path selection to solve the joint resource allocation problem and designs a rigorous simulation setup to derive a definitive set of guidelines for the datacenter designer implementing the proposed SLA. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: February 4, 2019

2017 journal article

Centrally Controlled Mass Data Offloading Using Vehicular Traffic

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 14(2), 401–415.

By: B. Baron, P. Spathis, H. Rivano, M. Amorim, Y. Viniotis & M. Ammar*

author keywords: Offloading; software-defined networking; vehicular data backhaul
TL;DR: This work proposes a scalable and adaptive centralized architecture built on software-defined networking that maximizes the utilization of the flow of vehicles connecting consecutive offloading spots and shows that the centralized controlled offloading architecture can achieve an efficient and fair allocation of concurrent data transfers between major cities in France. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2017 conference paper

Resource allocation for IoT applications in cloud environments

2017 international conference on computing, networking and communications (icnc), 719–723.

By: A. Singh n & Y. Viniotis n

TL;DR: This paper proposes a resource allocation mechanism (that uses buffering, scheduling and rate limiting) to meet the Service Level Agreements (SLA) and proves that the solution achieves conformance, analyzes the tradeoffs of the solution and evaluates via simulation the effects of system parameters such as capacity and enforcement period. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2016 conference paper

An SLA-based resource allocation for IoT applications in cloud environments

2016 Cloudification of the Internet of Things (CIOT).

By: A. Singh n & Y. Viniotis n

TL;DR: This paper proposes a new, two-step SLA by introducing sub-periods for measurement and control within the total enforcement period, and presents the conformance of the new SLA as a resource allocation problem for cloud providers and proposes a buffering, scheduling and rate limiting mechanism to enforce it. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2016 journal article

Virtualizing vehicular node resources: Feasibility study of virtual machine migration

VEHICULAR COMMUNICATIONS, 4, 39–46.

By: B. Baron, M. Campista*, P. Spathis, L. Costa*, M. Amorim*, O. Duarte*, G. Pujolle, Y. Viniotis n

author keywords: Vehicular network; Virtualization; Virtual machine migration
TL;DR: This paper uses the real traces of a bus transit system to simulate a vehicular network where virtual machines migrate via V2V communications between mobile nodes and shows that virtual machines of several hundreds of Megabytes can migrate between moving buses. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2014 journal article

Analysis and Control of Beliefs in Social Networks

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 62(21), 5552–5564.

By: T. Wang n, H. Krim n & Y. Viniotis n

author keywords: Complex networks; information flow; machine learning
TL;DR: An information flow model (IFM) of belief that captures how interactions among members affect the diffusion and eventual convergence of a belief is proposed and applied to both converged belief estimation and belief control strategy optimization. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2013 journal article

A Generalized Markov Graph Model: Application to Social Network Analysis

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 7(2), 318–332.

By: T. Wang n, H. Krim n & Y. Viniotis n

author keywords: Complex networks; pattern recognition; classification; Markov graph model
TL;DR: A generalized Markov Graph model for social networks is proposed and it is revealed 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. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2013 journal article

Dynamic Service Contract Enforcement in Service-Oriented Networks

IEEE TRANSACTIONS ON SERVICES COMPUTING, 6(1), 130–142.

By: Y. Jarma, K. Boloor*, M. Amorim, Y. Viniotis & R. Callaway

author keywords: Service-oriented networks; web services; service traffic shaping; contract enforcement; middleware appliances; appliance cluster; credit-based algorithm
TL;DR: DoWSS, a doubly weighted algorithm for service traffic shaping, is proposed and validated and it is shown 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. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2012 conference paper

Average delay SLAs in cloud computing

2012 ieee international conference on communications (icc).

TL;DR: A heuristic method to control the vector of average delays, subject to predefined delay constraints, is proposed, and it is shown that a simple heuristic algorithm can achieve the delay constraints for a two queue system. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2012 journal article

Optimal scheduling in multi-server queues with random connectivity and retransmissions

COMPUTER COMMUNICATIONS, 35(13), 1626–1638.

By: H. Al-Zubaidy*, I. Lambadaris* & Y. Viniotis n

author keywords: Optimal scheduling; Stochastic coupling arguments; Stochastic dominance; Most Balancing algorithms; Random connectivity
TL;DR: A dynamic programming model is developed to determine numerically the scheduling policy that optimizes a range of cost functions, including average total queue sizes, for an optimal scheduling problem in a discrete-time, multiserver system of parallel queues. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2011 conference paper

Analysis of response time percentile service level agreements in SOA-based applications

2011 ieee global telecommunications conference (globecom 2011).

By: K. Boloor n, R. Chirkova n, T. Salo* & Y. Viniotis n

TL;DR: This work considers 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. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2010 conference paper

Heuristic-based request scheduling subject to a percentile response time SLA in a distributed cloud

2010 ieee global telecommunications conference globecom 2010.

By: K. Boloor n, R. Chirkova n, T. Salo* & Y. Viniotis n

TL;DR: This work presents 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. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2009 article

Modeling the effect of node synchronization times in ultra-wideband wireless networks

Taggart, C. S., Viniotis, Y., & Sichitiu, M. L. (2009, March). PERFORMANCE EVALUATION, Vol. 66, pp. 223–239.

By: C. Taggart n, Y. Viniotis n & M. Sichitiu n

author keywords: Ultra-wideband; Average delay; Simulation; Servers with vacations
TL;DR: The development and use of mathematical and simulation models are described to investigate the impact of dropping and reacquiring links between nodes on average packet delay and the performance of the alternative strategy of forwarding packets through intermediate nodes without breaking the established wireless links is considered. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2008 article

PRACTICAL ASPECTS OF MOBILITY IN WIRELESS SELF-ORGANIZING NETWORKS

De Amorim, M. D., Ziviani, A., Viniotis, Y., & Tassiulas, L. (2008, December). IEEE WIRELESS COMMUNICATIONS, Vol. 15, pp. 6–7.

TL;DR: This work addresses the challenge to spontaneously establish wireless self-organizing networks, such as ad hoc, disruption-tolerant, sensor, and wireless mesh networks, by understanding how mobility impacts practical networking aspects. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2006 journal article

Dissecting the routing architecture of self-organizing networks

IEEE WIRELESS COMMUNICATIONS, 13(6), 98–104.

By: M. Amorim*, F. Benbadis*, S. Fdida*, M. Sichitiu* & Y. Viniotis n

TL;DR: This article suggests that routing should be thought of as a combination of four main architectural components, namely, addressing, dissemination, discovery, and forwarding, and concludes that routing architectures should be scenario-driven. (via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 article

Theoretical analysis of the SABUL congestion control algorithm

Oothongsap, P., Viniotis, Y., & Vouk, M. (2006, March). TELECOMMUNICATION SYSTEMS, Vol. 31, pp. 115–139.

By: P. Oothongsap n, Y. Viniotis n & M. Vouk n

TL;DR: This paper proposes simple deterministic and stochastic models of SABUL congestion control algorithm and uses the models to assess performance metrics such as bandwidth utilization, self-fairness, aggressiveness and average packet losses. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2006 journal article

Twins: A dual addressing space representation for self-organizing networks

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 17(12), 1468–1481.

By: A. Carneiro Viana, M. Amorim*, Y. Viniotis n, S. Fdida* & J. Rezende*

author keywords: distributed networks; network topology; wireless communication; protocol architecture; routing protocols
TL;DR: A novel architecture, called Twins, tailored for self-organizing networks, is proposed and a performance evaluation to assess scalability, fairness in the overhead distribution among nodes, and routing robustness is presented. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2005 chapter

Trellis-based virtual regular addressing structures in self-organized networks

In 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) (Vol. 3462, pp. 511–522).

By: J. Ridoux*, A. Fladenmuller*, Y. Viniotis n & K. Salamatian

TL;DR: This paper proposes the use of Virtual Regular Structures to provide desired properties for Self0–Organized Networks and proposes a construction heuristic and evaluates its performance via simulations to evaluate the robustness of the proposed approach with regards to mobility. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018

2004 chapter

Experimental analysis of the SABUL congestion control algorithm

In 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 (Vol. 3042, pp. 1433–1439).

By: P. Oothongsap n, Y. Viniotis n & M. Vouk n

TL;DR: The results confirm some expected behavior of SABUL and reveal some less expected one, and indicate that SABul implementation and design can result in an even more erratic behavior and degraded performance under high-congestion conditions. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2002 journal article

Threshold control policies for heterogeneous server systems

MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 55(1), 121–142.

By: H. Luh* & I. Viniotis*

author keywords: queueing; Linear Programming; Dynamic Programming; Markov processes
TL;DR: It is shown that any optimal, nonpreemptive policy is of threshold type, i.e., it assigns a customer to server Si, if this server is the fastest server available and the number of customers in the queue is mi or more. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2000 chapter

Buffer size requirements for delay sensitive traffic considering discrete effects and service-latency in ATM switches

In Networking 2000: Broadband communications, high performance networking, and performance of communication networks / IFIP-TC6/European Commission International Conference, Paris, France, May 2000, proceedings (Vol. 1815, pp. 61–73).

By: S. Wright* & Y. Viniotis n

TL;DR: Using this format, bounds are developed for buffer size under zero cell loss for leaky bucket constrained sources and a bound on the buffer size is proposed for the case of discrete arrival and service process. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

1999 journal article

Convergence of a dynamic policy for buffer management in shared buffer ATM switches

PERFORMANCE EVALUATION, 36-7, 249–266.

By: S. Sharma* & Y. Viniotis n

author keywords: ATM shared buffer switches; cell loss; dynamic pushout algorithms; convergence of Markov chains; buffer management
TL;DR: A dynamic algorithm is proposed that operates without any knowledge of the arrival process of 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. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

1999 journal article

Optimal buffer management policies for shared-buffer ATM switches

IEEE-ACM TRANSACTIONS ON NETWORKING, 7(4), 575–587.

By: S. Sharma & Y. Viniotis n

author keywords: ATM switches; buffer management; optimal; policies.
TL;DR: This paper 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. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

1998 book

Probability and random processes for electrical engineers

Boston, MA: WCB/McGraw-Hill.

By: Y. Viniotis

Source: NC State University Libraries
Added: August 6, 2018

1997 article

Buffer losses vs. deadline violations for ABR traffic in an ATM switch: A computational approach

TELECOMMUNICATION SYSTEMS, Vol. 7, pp. 105–123.

By: M. Balakrishnan, A. Puliafito*, K. Trivedi* & Y. Viniotis n

TL;DR: A stochastic Petri net model assuming periodic burst arrivals for VBR and Poisson arrival processes for the Data and ABR traffic types at the burst level is developed and solved analytically (numerically) using a decomposition approach. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

1997 journal article

Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 15(3), 332–345.

By: H. Salama n, D. Reeves n & Y. Viniotis n

author keywords: admission control; multicast routing; quality of service; reverse path multicasting
TL;DR: 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, and semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QS requirements ofreal-time traffic. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

1997 journal article

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

TR (Center for Advanced Computing and Communication), (3).

By: S. Rajala, M. Vouk, A. Nilsson, T. Miller, R. Schrag, J. Burke, C. Brawner, I. Viniotis, H. Perros

Source: NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.