DOCSLIB.ORG

Handling Decisions and Traffic Dependencies in Layered

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Handling Decisions and Traffic Dependencies in Layered Handling Decisions and Traffic Dependencies in Layered Queueing Networks by Lianhua Li, B.A.Eng., M.Sc. A thesis submitted to the Faculty of Graduate Studies and Postdoctoral Affairs in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering Carleton University Ottawa, Ontario, Canada c 2016 Lianhua Li ii Abstract A Layered Queueing Network (LQN) is a recognized performance modelling technique for performance prediction and evaluation of distributed systems. However, at present LQNs do not handle models with state-based behaviour such as timeouts and aborts, called ‘decisions’ here. This research extends LQNs by incorporating decisions into the model. The XML input language used to describe LQNs has been extended to handle these decisions. Both the LQN simulator, lqsim, and analytic solver, lqns, were then modified to solve models with decisions. The analytic solver uses decomposition and mean value analysis to solve models. Unfortunately, mean value analysis cannot be used to solve models with state-based behaviour. To overcome this limitation, a new approach called Dynamic Parameter Substitution (DPS) is used where intermediate results found while solving the model are used to alter the input parameters for subsequent iterations of the solution. To accomplish this goal, Layered Queueing eXperiment (LQX) language functions were derived to handle timeout and retry decisions and to handle fair-share queueing. The results from solving models using DPS were compared to results found from hybrid modelling, simulation, and where feasible, Petri nets. This research also improves the accuracy of the LQN analytic solver when solv- ing models with traffic dependencies, namely interlocking and sub-chain dependent behaviour. Interlocking occurs from the decomposition of the model into submodels; a single customer from an upper submodel may appear as two or more customers in lower level submodels. Some forms of interlocks were handled by the previous solu- tions, but with some limitations. Sub-chain dependencies are hidden more deeply in LQN models, and are handled for the first time. Sub-chain dependencies occur when traffic from multiple independent clients share a common intermediate server then diverges to lower level servers when this server is acting as a source of customers. This research presents a generalized solution to handle more general cases of inter- iii locks and sub-chain dependencies. The results of the improved solution have good accuracy compared with simulation results and the problems of the extraneous delays and infeasible utilizations are eliminated. iv Acknowledgements I would like to dedicate this thesis to my parents who gave me endless love and encouragement. I would like to express my sincere gratitude to my supervisor, Professor Greg Franks, for his support and advice throughout the years. His guidance is essential in success of this work. I would like to thank my family and friends for their moral support. In particular, I would like to thank my husband, Park, and my son, Tom, for their support and encouragement. I would like to thank Jennifer Poll for her support and timely information. I would also like to thank Naren Mehta, Jerry Buburuz, Kong Chiv, Danny Lemay and Daren Russ for their support and keeping everything in the lab running smoothly. Contents 1 Introduction 1 1.1 Motivation . 2 1.1.1 Making Decisions . 3 1.1.1.1 Methodologies Comparison . 3 1.1.1.2 Method of Dynamic Parameter Substitutions . 6 1.1.1.3 LQN Decision Patterns . 8 1.1.2 Traffic Dependencies . 8 1.2 Contributions . 10 1.2.1 Traffic Dependencies . 10 1.2.2 Decision Making . 11 1.2.3 Published Papers . 12 1.3 Thesis Organization . 13 2 Background 15 2.1 Model-Based Performance Analysis and Techniques . 15 2.1.1 Model-Based Performance Analysis . 16 2.1.2 Model-Driven Performance Engineering . 16 2.2 Analytic Performance Modelling Techniques . 18 2.2.1 Queueing Networks . 18 2.2.2 Extended Queueing Networks . 20 v CONTENTS vi 2.2.3 State-Based Solution Techniques . 21 2.2.4 Stochastic Process Algebra . 22 2.3 Mean Value Analysis . 22 2.3.1 Exact MVA . 23 2.3.2 Bard-Schweitzer AMVA . 23 2.3.3 Linearizer AMVA . 24 2.3.4 Variants of AMVA . 26 2.4 Layered Queueing Networks . 27 2.4.1 LQN Components . 27 2.4.2 Layered Queueing Networks Solver: LQNS . 30 2.4.3 PARASOL: LQN Simulation Engine . 33 2.4.4 LQN Simulation Tool: LQSIM . 35 2.4.4.1 LQSIM Tasks . 35 2.4.4.2 Multi-Server Tasks . 37 2.4.5 Layered Queueing Experiment Language: LQX . 38 2.5 Hybrid Performance Modelling . 40 2.5.1 Hybrid Simulation/Analytic Modelling . 40 2.5.2 Multi-Formalism Hybrid Performance Modelling . 41 2.5.3 Hybrid Modelling Related to LQN . 42 2.6 Modelling Exception Handling Decisions in Resource Allocations . 43 2.6.1 Wu’s HPMM for Handling Decisions . 44 2.7 Summary ................................. 46 3 Interlocks 47 3.1 Interlocking Phenomenon . 47 3.1.1 Problems in the Current Solver . 50 3.1.1.1 Incorrect Distribution of Waiting Time . 51 3.1.1.2 Interlock With External Contention . 52 CONTENTS vii 3.2 Improved Interlock Calculation . 53 3.2.1 The Lower-Level Adjustment . 54 3.2.1.1 Interlocking Probability . 54 3.2.1.2 Interlocking Ratio and Interlocking Relationship . 57 3.2.1.3 The Lower-Level Adjustment . 59 3.2.2 The Upper-Level Adjustment . 61 3.2.2.1 Calculating Upper-Level Adjustment . 63 3.2.2.2 Existence of Mixed Interlocked Flows . 64 3.2.3 Testing the Improved Solution . 65 3.2.3.1 Split Interlocks . 66 3.2.3.2 Split Interlock with External Contention . 67 3.2.3.3 External Contention to a Common Entry . 68 3.3 Sending Interlocks . 69 3.3.1 Types of Sending Interlocks . 70 3.3.2 Improvements on Sending Interlocks . 72 3.3.2.1 T ype1 and T ype2 Sending Interlocks . 72 3.3.2.2 Sending Interlocks with External Contentions . 74 3.3.2.3 Type3 Sending Interlocks . 75 3.4 Interlocking Effects on Second-Phase Servers . 79 3.4.1 Second-Phase Technique . 79 3.4.1.1 Performance Advantages of Second-Phase Technique 79 3.4.2 Interlocking Effects . 81 3.4.2.1 Multi-Phase Clients . 82 3.4.2.2 Multi-Phase Interlocked Server . 83 3.4.2.3 Multi-Phase Intermediate Server . 84 3.4.3 Improvements . 86 3.4.3.1 Multi-Phase Interlocked Server . 87 CONTENTS viii 3.4.3.2 Multi-Phase Intermediate Servers . 88 3.4.4 Results . 91 3.4.4.1 Multi-Phase Interlocked Server . 91 3.4.4.2 Multi-Phase Intermediate Server . 95 3.4.4.3 Randomized Model with Second-Phase Services . 95 3.5 Verification . 97 3.5.1 The Combined Model . 99 3.5.2 Deeply Layered Interlocking Model . 100 3.6 Summary . 101 4 Sub-Chain Dependencies 103 4.1 Sub-Chain Dependencies . 103 4.1.1 Impacts of Sub-Chain Dependencies . 104 4.2 Improved Chain Calculation . 108 4.2.1 The Maximum Number of Customers . 108 4.2.2 Applying MC to Approximate MVA Solutions . 110 4.2.2.1 Applying MC to Bard-Schweitzer AMVA Solutions . 112 4.2.2.2 Linearizer AMVA Solution . 116 4.2.3 Verification . 117 4.3 Sub-Chain Dependency in Parallel Executions . 122 4.3.1 LQN Activities and Their Precedences . 123 4.3.2 Improvements and Results . 125 4.4 Summary . 126 5 Case Study: An Online Bookstore 128 5.1 RADSBookStore . 128 5.1.1 Traffic Dependencies in RADSbookstore . 129 5.1.1.1 Sub-chain dependency . 129 CONTENTS ix 5.1.1.2 Interlocks . 131 5.1.2 Evaluation . 132 5.2 Conclusions . 133 6 Modelling Decisions in LQN 135 6.1 Decisions in LQN . 135 6.2 LQN Decision Patterns . 138 6.2.1 Queue Pattern . 138 6.2.2 Abort Decision Pattern . 139 6.2.3 Infinite-Retry Decision Pattern . 140 6.2.4 Finite-Retry Decision Pattern . 141 6.2.5 Timeout Decision Pattern . 142 6.2.6 LQN Decision Schema . 143 6.2.6.1 Pattern Template in LQN Input Model . 145 6.3 Decisions in LQSIM . 146 6.3.1 Timeout/Abort Decisions . 147 6.3.2 Retry Decisions . 149 6.3.3 LQSIM Results Verification . 153 6.3.3.1 Verification Through GreatSPN . 153 6.3.3.2 Verification Through CSIM . 159 6.4 Dynamic Parameter Substitutions Using LQX . 164 6.4.1 Method of Dynamic Parameter Substitutions . 164 6.4.2 Abort Decision Pattern . 165 6.4.3 Timeout Decision Pattern . 168 6.4.3.1 Algorithm 1 . 168 6.4.3.2 Algorithm 2 . 172 6.4.3.3 Discussions . 173 6.4.4 Infinite-Retry Decision Pattern . 175 CONTENTS x 6.4.5 DPS Demonstration . 178 6.4.5.1 Abort Pattern . 179 6.4.5.2 Infinite-retry Pattern . 179 6.4.5.3 Timeout Pattern . 182 6.5 Summary . 183 7 Analytic Solution of Fair Share Scheduling 185 7.1 Fair Share Scheduling . 185 7.1.1 Group Shares . 187 7.2 Dynamic Parameter Substitution Using LQX . 188 7.2.1 FS Processor Transformation . 189 7.2.2 Mappings to Dynamic Parameters . 190 7.2.3 Redistributing Surplus Shares . ..
Load more

Recommended publications
  • On the Solution of Cooperating Stochastic Models
    Scuola Dottorale di Ateneo Graduate School Dottorato di ricerca in Informatica Ciclo XXVI Anno di discussione 2013 On the Solution of Cooperating Stochastic Models SETTORE SCIENTIFICO DISCIPLINARE DI AFFERENZA: INF/01 Tesi di Dottorato di Gian-Luca Dei Rossi, matricola 955834 Coordinatore del Dottorato Tutore del Dottorando Prof. Riccardo Focardi Prof.ssa Simonetta Balsamo To the future readers of this thesis, for their patience. Abstract Stochastic models are widely used in the performance evaluation community. In particular, Markov processes, and more precisely, Continuous Time Markov Chains (CTMCs), often serve as underlying stochastic processes for models written in higher-level formalisms, such as Queueing Networks, Stochastic Petri Nets and Stochastic Process Algebras. While compositionality, i.e., the ability to express a complex model as a combination of simpler components, is a key feature of most of those formalisms, CTMCs, by themselves, don't allow for mechanisms to ex- press the interaction with other CTMCs. In order to mitigate this problem various lower-level formalisms have been proposed in literature, e.g., Stochastic Automata Networks (SANs) [146], Communicating Markov Processes [46], Interactive Markov chains [100] and the labelled transition systems derived from PEPA models [101]. However, while the compositionality of those formalism is a useful property which makes the modelling phase easier, exploiting it to get solutions more efficiently is a non-trivial task. Ideally one should be able to either detect a product-form solution and analyse the components in isolation or, if a product form cannot be detected, use other techniques to reduce the complexity of the solution, e.g., reducing the state space of either the single components or the joint process.
    [Show full text]
  • VU Research Portal
    VU Research Portal Queueing Networks with Shared Resources van der Weij, W. 2009 document version Publisher's PDF, also known as Version of record Link to publication in VU Research Portal citation for published version (APA) van der Weij, W. (2009). Queueing Networks with Shared Resources. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. E-mail address: [email protected] Download date: 02. Oct. 2021 Queueing Networks with Shared Resources Wemke van der Weij, 1982 Queueing Networks with Shared Resources ISBN 978-90-8659-298-2 THOMAS STIELTJES INSTITUTE FOR MATHEMATICS The research in this thesis has been carried out in the context of E-Quality Center of Excellence, and has been partly supported by the Basic Research in Informatics for Creating the Knowledge Society (BRICKS) project on Quality of Service in Communication Networks. c W. van der Weij, Amsterdam 2009.
    [Show full text]
  • Extending Layered Queueing Network with Hybrid Sub Models Representing Exceptions and D Ecision Making
    Extending Layered Queueing Network with Hybrid Sub­ models Representing Exceptions and Decision Making by Pengfei Wu B. Eng., M.A. Sc. A thesis submitted to the Faculty of Graduate and Postdoctoral Affairs in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering Ottawa-Carleton Institute for Electrical and Computer Engineering (OCIECE) Department of Systems and Computer Engineering Carle ton University Ottawa, Ontario, Canada, K1S 5B6 May 2013 © Copyright 2013, Pengfei Wu Library and Archives Bibliotheque et Canada Archives Canada Published Heritage Direction du 1+1 Branch Patrimoine de I'edition 395 Wellington Street 395, rue Wellington Ottawa ON K1A0N4 Ottawa ON K1A 0N4 Canada Canada Your file Votre reference ISBN: 978-0-494-94539-1 Our file Notre reference ISBN: 978-0-494-94539-1 NOTICE: AVIS: The author has granted a non­ L'auteur a accorde une licence non exclusive exclusive license allowing Library and permettant a la Bibliotheque et Archives Archives Canada to reproduce, Canada de reproduire, publier, archiver, publish, archive, preserve, conserve, sauvegarder, conserver, transmettre au public communicate to the public by par telecommunication ou par I'lnternet, preter, telecommunication or on the Internet, distribuer et vendre des theses partout dans le loan, distrbute and sell theses monde, a des fins commerciales ou autres, sur worldwide, for commercial or non­ support microforme, papier, electronique et/ou commercial purposes, in microform, autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriete du droit d'auteur ownership and moral rights in this et des droits moraux qui protege cette these.
    [Show full text]
  • Sudan University of Science and Technology College of Graduate Studies
    Sudan University of Science and Technology College of Graduate Studies Model-Based Prediction of Resource Utilization and Performance Risks التنبؤ المبني على نموذج ﻹستغﻻل الموارد و مخاطر اﻻداء A Dissertation Submitted to the College of Graduation Studies, Faculty of Computer Science and Information Technology, Sudan University of Science and Technology In Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Software Performance Prediction By Haitham Abdel Moniem Mohamed Supervisor Hany Ammar, Professor May, 2018 اﻵيــــــــــــــــــــــة ii Dedication I would like to dedicate my work to My family, My teachers, and My friends …. iii ACKNOLEGEMENT Firstly, Alhamdulillah Secondly, I would like to express my deepest thanks, respect, and appreciation to Prof. Hany Ammar, my supervisor for his ideas, inspiration, encouragement, support, and patient. Many thanks for Sudan University of Science and Technology for hospitality, generosity, and attention. I also place my sincere thanks to Future University for helping, supporting, and funding my PhD. Haitham A.Moniem iv ABSTRACT The growing complexity of modern software systems makes the prediction of performance a challenging activity. Many drawbacks incurred by using the traditional performance prediction techniques such as simulation, guessing, and depending on previous experience. Moreover, performance assessment and prediction is time consuming activity and may produce inaccurate results especially in complex and large scale software applications. To contribute to solving these problems, we adopt a model-based approach for resource utilization and performance risk prediction. The steps of the approach can be stated as follows: Firstly, we model the software system into annotated UML diagrams. Secondly, performance model is derived from the annotated UML diagrams in order to be evaluated.
    [Show full text]
  • Improving Trade-Offs Between Multiple Metrics in Parallel Queueing Systems
    Imperial College London Department of Computing Improving Trade-Offs between Multiple Metrics in Parallel Queueing Systems Tommi Topi Kalevi Pesu Submitted in part fulfilment of the requirements for the degree of Doctor of Philosophy in Computing of Imperial College London and the Diploma of Imperial College London, 1 July 2019 Abstract Parallel Queueing Networks can be used to model and optimise systems in many different en- vironments, such as distributed storage facilities, multi-core processors, RAID systems, supply chains and public services such as hospitals. The various stakeholders involved with the systems will often measure the performance of such systems using a wide range of metrics that often conflict with each other. Metrics of interest include task response time, subtask dispersion and energy consumption. Subtask dispersion is a recent metric, which is the difference in time of the first and last subtask to complete. The trade-offs between metrics can be controlled in various ways. Within this context, this thesis makes four primary contributions, the first of which of is to compare various delay- padding techniques in split{merge and fork{join parallel queueing models, with respect to task response time and subtask dispersion. We compare seven techniques from the literature, including some of our own, against each other across multiple case studies, in order to determine their strengths and weaknesses. Our results indicate that dynamic delay padding in a fork{join setting is currently the most promising technique for improving the trade-off between subtask dispersion and task response time. Our second contribution is to extend existing delay-padding techniques to work in a class of multi-layered parallel queueing environments, specifically Hidden Stochastic PERT Networks.
    [Show full text]
  • Layered Queueing Networks – Performance Modelling, Analysis and Optimisation
    Layered queueing networks : performance modelling, analysis and optimisation Citation for published version (APA): Dorsman, J. L. (2015). Layered queueing networks : performance modelling, analysis and optimisation. Technische Universiteit Eindhoven. https://doi.org/10.6100/IR784295 DOI: 10.6100/IR784295 Document status and date: Published: 01/01/2015 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Proceedings of the 2020 Winter Simulation Conference K.-H. Bae, B
    Proceedings of the 2020 Winter Simulation Conference K.-H. Bae, B. Feng, S. Kim, S. Lazarova-Molnar, Z. Zheng, T. Roeder, and R. Thiesing, eds. INTEGRATED PERFORMANCE EVALUATION OF EXTENDED QUEUEING NETWORK MODELS WITH LINE Giuliano Casale Department of Computing Imperial College London SW7 2AZ, London, UK ABSTRACT Despite the large literature on queueing theory and its applications, tool support to analyze these models is mostly focused on discrete-event simulation and mean-value analysis (MVA). This circumstance diminishes the applicability of other types of advanced queueing analysis methods to practical engineering problems, for example analytical methods to extract probability measures useful in learning and inference. In this tool paper, we present LINE 2.0, an integrated software package to specify and analyze extended queueing network models. This new version of the tool is underpinned by an object-oriented language to declare a fairly broad class of extended queueing networks. These abstractions have been used to integrate in a coherent setting over 40 different simulation-based and analytical solution methods, facilitating their use in applications. 1 INTRODUCTION Queueing network models have been extensively used in performance analysis and optimization of software applications, computer networks, call centers, logistics, and business processes, among others. Despite a rich literature, limited work has however been carried out towards offering modelling and simulation tools that integrate different analysis paradigms in a coherent way. LINE (http://line-solver.sf.net/) is a MATLAB package to specify and analyze extended queueing network models. With its version 2.0, the tool now offers an object-oriented language to declare and analyze a fairly general class of queueing network models featuring class-switching, layering, state-dependent routing, non-exponential service, caching, and random environments.
    [Show full text]
  • Simplifying Layered Queueing Network Models
    Simplifying Layered Queueing Network Models by Farhana Islam Thesis Submitted to the Faculty of Graduate and Postdoctoral Affairs in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering Carleton University Ottawa, Ontario © 2018, Farhana Islam Abstract The amount of detail to include in a performance model is usually regarded as a judgment to be made by an expert modeler and the question “how much detail is necessary?” is seldom asked and is difficult to answer. However, if a simpler model gives essentially the same performance predictions, it may be more useful than a detailed model. It may solve more quickly, for instance, and may be easier to understand. Or a model for a complex sub- system such as a database server may be usefully simplified so it can be included in larger system models. This research proposes an aggregation process for layered queuing models that reduces the number of queues (called tasks and hosts/processors, in layered models) while preserving the total execution demand and the bottleneck characteristics (the highest saturated resource(s)) of the detailed model. This thesis demonstrates how the simplification process can greatly reduce the number of tasks and processors with a very small relative error. The application of proposed simplification process is applied on a number of case studies. A Java application called “LQN model simplifier” was built that takes an LQN model as input and generates a series of simplified models after applying simplification operations to the original model. ii Acknowledgements Behind this journey, there are a lot of dedication, effort, patience and hard work.
    [Show full text]
  • Layered Queueing Network Solver and Simulator User Manual
    Layered Queueing Network Solver and Simulator User Manual Greg Franks Peter Maly Murray Woodside Dorina C. Petriu Alex Hubbard Martin Mroz Department of Systems and Computer Engineering Carleton University Ottawa ON K1S 5B6 {cmw,greg}@sce.carleton.ca January 30, 2013 Revision: 11145 Contents 1 The Layered Queueing Network Model 1 1.1 ModelElements................................... ........... 3 1.1.1 Processors .................................... ........ 3 1.1.2 Groups ........................................ ...... 4 1.1.3 Tasks ......................................... ...... 4 1.1.4 Entries ....................................... ....... 5 1.1.5 Activities .................................... ......... 5 1.1.6 Precedence .................................... ........ 8 1.1.7 Requests ...................................... ....... 9 1.2 MultiplicityandReplication . ................. 9 1.3 ABriefHistory ................................... ........... 10 2 Results 11 2.1 Header.......................................... ......... 11 2.1.1 AnalyticSolver(lqns) . ............ 13 2.1.2 Simulator(lqsim)... .... .... ... .... .... .... .... ........... 13 2.2 Type1ThroughputBounds. ............. 13 2.3 MeanDelayforaRendezvous . ............. 15 2.4 VarianceofDelayforaRendezvous . ................ 15 2.5 MeanDelayforaSend-No-ReplyRequest . ................. 15 2.6 VarianceofDelayforaSend-No-ReplyRequest . .................... 15 2.7 ArrivalLossProbabilities. ................. 15 2.8 MeanDelayforaJoin............................... ...........
    [Show full text]
  • Automated Design Space Exploration for Component-Based Real-Time Distributed Systems
    Automated design space exploration for component-based real-time distributed systems Citation for published version (APA): Triantafyllidis, K. (2017). Automated design space exploration for component-based real-time distributed systems. Technische Universiteit Eindhoven. Document status and date: Published: 18/04/2017 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]