EUROPEAN CONFERENCE ON QUEUEING THEORY 2016

International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"

A systematic review of the role of bisphosphonates in metastatic disease

Objectives: To identify evidence for the role of bisphosphonates in malignancy for the treatment of hypercalcaemia, prevention of skeletal morbidity and use in the adjuvant setting. To perform an economic review of current literature and model the cost effectiveness of bisphosphonates in the treatment of hypercalcaemia and prevention of skeletal morbidity Data sources: Electronic databases (1966-June 2001). Cochrane register. Pharmaceutical companies. Experts in the field. Handsearching of abstracts and leading oncology journals (1999-2001). Review methods: Two independent reviewers assessed studies for inclusion, according to predetermined criteria, and extracted relevant data. Overall event rates were pooled in a meta-analysis, odds ratios ( OR) were given with 95% confidence intervals (CI). Where data could not be combined, studies were reported individually and proportions compared using chi- squared analysis. Cost and cost-effectiveness were assessed by a decision analytic model comparing different bisphosphonate regimens for the treatment of hypercalcaemia; Markov models were employed to evaluate the use of bisphosphonates to prevent skeletal-related events (SRE) in patients with breast cancer and multiple myeloma. Results: For acute hypercalcaemia of malignancy, bisphosphonates normalised serum calcium in >70% of patients within 2-6 days. Pamidronate was more effective than control, etidronate, mithramycin and low-dose clodronate, but equal to high dose clodronate, in achieving normocalcaemia. Pamidronate prolongs ( doubles) the median time to relapse compared with clodronate or etidronate. For prevention of skeletal morbidity, bisphosphonates compared with placebo, significantly reduced the OR for fractures (OR [95% CI], vertebral, 0.69 [0.57-0.84], non-vertebral, 0.65 [0.54-0.79], combined, 0.65 [0.55-0.78]) radiotherapy 0.67 [0.57-0.79] and hypercalcaemia 0.54 [0.36-0.81] but not orthopaedic surgery 0.70 [0.46-1.05] or spinal cord compression 0.71 [0.47-1.08]. However, reduction in orthopaedic surgery was significant in studies that lasted over a year 0.59 [0.39-0.88]. Bisphosphonates significantly increased the time to first SRE but did not affect survival. Subanalyses were performed for disease groups, drugs and route of administration. Most evidence supports the use of intravenous aminobisphosphonates. For adjuvant use of bisphosphonates, Clodronate, given to patients with primary operable breast cancer and no metastatic disease, significantly reduced the number of patients developing bone metastases. This benefit was not maintained once regular administration had been discontinued. Two trials reported significant survival advantages in the treated groups. Bisphosphonates reduce the number of bone metastases in patients with both early and advanced breast cancer. Bisphosphonates are well tolerated with a low incidence of side-effects. Economic modelling showed that for acute hypercalcaemia, drugs with the longest cumulative duration of normocalcaemia were most cost-effective. Zoledronate 4 mg was the most costly, but most cost-effective treatment. For skeletal morbidity, Markov models estimated that the overall cost of bisphosphonate therapy to prevent an SRE was pound250 and pound1500 per event for patients with breast cancer and multiple myeloma, respectively. Bisphosphonate treatment is sometimes cost-saving in breast cancer patients where fractures are prevented. Conclusions: High dose aminobisphosphonates are most effective for the treatment of acute hypercalcaemia and delay time to relapse. Bisphosphonates significantly reduce SREs and delay the time to first SRE in patients with bony metastatic disease but do not affect survival. Benefit is demonstrated after administration for at least 6-12 months. The greatest body of evidence supports the use of intravenous aminobisphosphonates. Further evidence is required to support use in the adjuvant setting

Public health training in Europe. Development of European masters degrees in public health.

BACKGROUND: Changing political and economic relations in Europe mean that there are new challenges for public health and public health training. There have been several attempts to develop training at the master's level in public health which is focused on meeting the new needs. These have failed due to being too inflexible to allow participation by schools of public health. METHODS: A project funded by the European Union involving public health trainers has developed a new approach which allows participating schools to retain their national differences and work within local rules and traditions, but which aims to introduce the European dimension into public health training. This paper reports the conclusions of this project. CONCLUSIONS: A network of schools wishing to develop European Master's degrees is being established and other schools offering good quality programmes will be able to join

Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy

In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a class of $O(n^{2.5} \log n)$-complexity hybrid scheduling policies are recently developed to guarantee both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in the general non-asymptotic setting), their practical complexity is typically high. To address this issue, we develop a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with a \lower complexity $2n^2+2n$, and rigorously prove that D-SSG not only achieves throughput optimality, but also guarantees near-optimal asymptotic delay performance. Specifically, we show that the rate-function attained by D-SSG for any delay-violation threshold $b$, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold $b-1$. Thus, we are able to achieve a reduction in complexity (from $O(n^{2.5} \log n)$ of the hybrid policies to $2n^2 + 2n$) with a minimal drop in the delay performance. More importantly, in practice, D-SSG generally has a substantially lower complexity than the hybrid policies that typically have a large constant factor hidden in the $O(\cdot)$ notation. Finally, we conduct numerical simulations to validate our theoretical results in various scenarios. The simulation results show that D-SSG not only guarantees a near-optimal rate-function, but also empirically is virtually indistinguishable from delay-optimal policies.Comment: Accepted for publication by the IEEE/ACM Transactions on Networking, February 2014. A preliminary version of this work was presented at IEEE INFOCOM 2013, Turin, Italy, April 201

A review of connection admission control algorithms for ATM networks

The emergence of high-speed networks such as those with ATM integrates large numbers of services with a wide range of characteristics. Admission control is a prime instrument for controlling congestion in the network. As part of connection services to an ATM system, the Connection Admission Control (CAC) algorithm decides if another call or connection can be admitted to the Broadband Network. The main task of the CAC is to ensure that the broadband resources will not saturate or overflow within a very small probability. It limits the connections and guarantees Quality of Service for the new connection. The algorithm for connection admission is crucial in determining bandwidth utilisation efficiency. With statistical multiplexing more calls can be allocated on a network link, while still maintaining the Quality of Service specified by the connection with traffic parameters and type of service. A number of algorithms for admission control for Broadband Services with ATM Networks are described and compared for performance under different traffic loads. There is a general description of the ATM Network as an introduction. Issues to do with source distributions and traffic models are explored in Chapter 2. Chapter 3 provides an extensive presentation of the CAC algorithms for ATM Broadband Networks. The ideas about the Effective Bandwidth are reviewed in Chapter 4, and a different approach to admission control using online measurement is presented in Chapter 5. Chapter 6 has the numerical evaluation of four of the key algorithms, with simulations. Finally Chapter 7 has conclusions of the findings and explores some possibilities for further work

Optimal distributed policies for choosing among multiple servers

Includes bibliographical references (p. 13-14).Cover title.Research supported by the Army Research Office. DAAL01-86-K-0171 Research supported by the NSF. ECS-8552419by George D. Stamoulis and John N. Tsitsiklis