Michael Devetsikiotis - Academia.edu (original) (raw)

Uploads

Papers by Michael Devetsikiotis

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems

For adaptive resource allocation to maintain its crucial timing requirements in large-scale netwo... more For adaptive resource allocation to maintain its crucial timing requirements in large-scale networks, fast analysis and synthesis algorithms are required in order to process freshly collected traffic data. In this paper we build on previous work to introduce a general measurement-based self-sizing framework for resource allocation in label-switched networks. Furthermore, we study the scaling behavior of the simulated annealing variant

2012 IEEE Global Communications Conference (GLOBECOM)

IEEE Transactions on Services Computing

IEEE Internet of Things Journal

Energies

Charging station location decisions are a critical element in mainstream adoption of electric veh... more Charging station location decisions are a critical element in mainstream adoption of electric vehicles (EVs). The consumer confidence in EVs can be boosted with the deployment of carefully-planned charging infrastructure that can fuel a fair number of trips. The charging station (CS) location problem is complex and differs considerably from the classical facility location literature, as the decision parameters are additionally linked to a relatively longer charging period, battery parameters, and available grid resources. In this study, we propose a three-layered system model of fast charging stations (FCSs). In the first layer, we solve the flow capturing location problem to identify the locations of the charging stations. In the second layer, we use a queuing model and introduce a resource allocation framework to optimally provision the limited grid resources. In the third layer, we consider the battery charging dynamics and develop a station policy to maximize the profit by setting maximum charging levels. The model is evaluated on the Arizona state highway system and North Dakota state network with a gravity data model, and on the City of Raleigh, North Carolina, using real traffic data. The results show that the proposed hierarchical model improves the system performance, as well as the quality of service (QoS), provided to the customers. The proposed model can efficiently assist city planners for CS location selection and system design.

The Fourth IEEE Workshop on High-Performance Communication Systems

Teletraffic Science and Engineering, 2001

Ieee Transactions on Wireless Communications, 2008

Computer Networks the International Journal of Computer and Telecommunications Networking, Jun 21, 2005

Computer Networks the International Journal of Computer and Telecommunications Networking, Oct 22, 2002

Iecon 2014 40th Annual Conference of the Ieee Industrial Electronics Society, Oct 1, 2014

ABSTRACT The paper proposes a new idea, called “Interactive Energy”, for the dynamic pricing and ... more ABSTRACT The paper proposes a new idea, called “Interactive Energy”, for the dynamic pricing and dispatching of the charging services of Electric Vehicles (EVs) in a micro-grid. In the proposed approach, the customers can choose their recharge time through an interactive application able to indicate different recharge times and related prices in function of the real time conditions of the micro-grid. The available power at each charging station is conditioned to the grid conditions and the prices change as a function of the requested energy, power and local renewable energy produced in the micro-grid. In the paper, a statistical model is proposed and applied for analyzing the impact that the proposed system can have on the power grid. The proposed system can gain ground with the ongoing battery improvements: the recharging times for EVs could become comparable to the present fuel stop times at the gas station through the continuous improvement of the battery technologies.

In this paper, we discuss a generalized measurement-based adaptive scheduling framework for dynam... more In this paper, we discuss a generalized measurement-based adaptive scheduling framework for dynamic resource allocation in flexible heterogeneous networks, in order to ensure efficient service level performance under inherently variable traffic conditions. We formulate our generalized optimization model based on the notion of a "profit center" with an arbitrary number of service classes, nonlinear revenue and cost functions and general performance constraints. Subsequently, and under the assumption of a linear pricing model and average queue delay requirements, we develop a fast, low complexity algorithm for online dynamic resource allocation, and examine its properties. Finally, the proposed scheme is validated through an extensive simulation study.

Ieee Globecom 2008 2008 Ieee Global Telecommunications Conference, 2008

For voice/video applications that are based on Peerto-Peer (P2P) models, ensuring the end-to-end ... more For voice/video applications that are based on Peerto-Peer (P2P) models, ensuring the end-to-end Quality of Service (QoS) is crucial, especially if users are paying fees. In this paper we propose an End-to-end Performance Inference Technique (EPIT) that uses a prediction-based approach to map the ingress traffic levels of the P2P network to the end-to-end QoS in the network. Furthermore, by coupling Simulated Annealing (SA) with EPIT, we describe a traffic engineering solution in such a way that the QoS constraints are met while traffic flows into the network are maximized.

2012 IEEE Global Communications Conference (GLOBECOM), 2012

In Self-sizing networks the allocation of resources changes dynamically according to traffic chan... more In Self-sizing networks the allocation of resources changes dynamically according to traffic changes. In this paper, a procedure for dynamic bandwidth allocation based on fuzzy optimization is proposed. The procedure is compared to a non-fuzzy one and it is shown that the use of the proposed procedure leads to higher flexiblity in coping with traffic changes. Resumo. Neste artigo, introduz-se um modelo de otimização combinatória para a resolução do Problema de Particionamento de Banda, em Redes Auto-Ajustáveis, que são redes capazes de se reajustarem dinamicamente ao tráfego servido. Para o particionamento de banda, foram estudadas técnicas de otimização fuzzy, que demonstraram uma capacidade maior de se adaptar a variabilidade, e aos aumentos de demanda, existentes no tráfego de uma rede de alta velocidade. Experimentos que simulam redes auto-ajustáveis multiserviço de alta velocidade foram realizados com o modelo proposto.

1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 1999

The author has granted a non-L'auteur a accordé une licence non exclusive licence allowing the ex... more The author has granted a non-L'auteur a accordé une licence non exclusive licence allowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, loan, distribute or sell reproduire, prêter, distribuer ou copies of this thesis in rnicrofom, vendre des copies de cette thèse sous paper or electronic formats. la forme de microfichelfilm, de reproduction sur papier ou sur format électronique. The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fiom it Ni la thèse ni des extraits substantiels may be printed or othewise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son pesmission. autorisation.