Dean H. Lorenz

Dean H. Lorenz

Auto-generated profile, based on publicly available information

Dean H. Lorenz

IBM Research, Haifa, Israel

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2001 in Operations Research Letters
Verified
Journal Article
Closed access
DLDean H. Lorenz
Dean H. Lorenz
DRDanny Raz
Danny Raz

1 January 1998 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
DLD.H. Lorenz
D.H. Lorenz
AOA. Orda
A. Orda
This work considers the problem of routing connections with Qo!3 requirements across networks, when the information available for ma:king routing decisions is inaccurate. This uncertainty about the actual stale of a network component arises naturally in a number of different en- vironments, which are reviewed in the paper. The goal of the route selection process is then to identify a path that is most likely to satisfy the QoS re- quirements. For end-to-end delay guarantees, this problem is intractable. However, we show that by decomposing the end-to-end constraint into local delay constraints, efficient and tractable solutions can be established. 'We first consider the simpler problem of decomposing the end-to-end constraint into local constraints, for a given path. We show that, for general distributions, this problem is also intractable. Nonetheless, by defining a certain class of probability distributions, which posses a certain convexity property, and restricting ourselves to that class, we are able to establish efficient and exact solutions. Moreover, we show that typical distributions would belong to that class. 'We then consider the general problem, of combined path optimization ancl delay decomposition. We present an efficient solution scheme for the abo,ve class of probability d~tributions. Our solution is similar to that of the restricted shortest-path problem, which renders itself to near-optimal approximations of polynomial complexity. We also show that yet simpler solutions exist in the special case of uniform distributions.

1 June 2011
Verified
Conference Paper
Closed access
EBEyal Bin
Eyal Bin
OBOfer Biran
Ofer Biran
OBOdellia Boni
Odellia Boni
EHErez Hadad
Erez Hadad
EKEliot K. Kolodner
Eliot K. Kolodner
DLDean H. Lorenz
Dean H. Lorenz
The placement of virtual machines (VMs) on a cluster of hosts under multiple constraints, including administrative (security, regulations) resource-oriented (capacity, energy), and QoS-oriented (performance) is a highly complex task. We define a new high-availability property for a VM; when a VM is marked as k-resilient, as long as there are up to k host failures, it should be guaranteed that it can be relocated to a non-failed host without relocating other VMs. Together with Hardware Predictive Failure Analysis and live migration, which enable VMs to be evacuated from a host before it fails, this property allows the continuous running of YMs on the cluster despite host failures. The complexity of the constraints associated with k-resiliency, which are naturally expressed by Second Order logic statements, prevented their integration into the placement computation until now. We present a novel algorithm which enables this integration by transforming the k-resiliency constraints to rules consumable by a generic Constraint Programming engine, prove that it guarantees the required resiliency and describe the implementation. We provide some preliminary results and compare our high availability support with naive solutions.

13 March 2019 in IEEE Transactions on Broadcasting
Verified
Journal Article
Closed access
QWQi Wang
Qi Wang
Jose Alcaraz CaleroJose Alcaraz Calero
Jose Alcaraz Calero
RRRuben Ricart-Sanchez
Ruben Ricart-Sanchez
MWMaria Barros Weiss
Maria Barros Weiss
AGAnastasius Gavras
Anastasius Gavras
CLCipriano Lomba
Cipriano Lomba

1 June 2018
Verified
Conference Paper
Closed access
QWQi Wang
Qi Wang
Jose Alcaraz CaleroJose Alcaraz Calero
Jose Alcaraz Calero
MWMaria Barros Weiss
Maria Barros Weiss
AGAnastasius Gavras
Anastasius Gavras
PNPedro Miguel Neves
Pedro Miguel Neves
PWPaul Walsh
Paul Walsh
Network slicing has emerged as a major new networking paradigm for meeting the diverse requirements of various vertical businesses in virtualised and softwarised 5G networks. SliceNet is a project of the EU 5G Infrastructure Public Private Partnership (5G PPP) and focuses on network slicing as a cornerstone technology in 5G networks, and addresses the associated challenges in managing, controlling and orchestrating the new services for users especially vertical sectors, thereby maximising the potential of 5G infrastructures and their services by leveraging advanced software networking and cognitive network management. This paper presents the vision of the SliceNet project, highlighting the gaps in existing work and challenges, the proposed overall architecture, proposed technical approaches, and use cases.

27 November 2002
Verified
Conference Paper
Closed access
DLD.H. Lorenz
D.H. Lorenz
AOA. Orda
A. Orda