Multi-user resource-sharing problem for the Internet

In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore. In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving nodes. Finally, we study the reputation scheme for the overlays and peer-to-peer networks, where resource is not placed on a common station, but spread across the network. The theoretical analysis suggests what behavior will be selected by the end station under such a reputation mechanism.

Novel Application of Genetic Sequencing algorithms to optimisation of hardware resource sharing for DSP

Field programmable gate array (FPGA) technology is a powerful platform for implementing computationally complex, digital signal processing (DSP) systems. Applications that are multi-modal, however, are designed for worse case conditions. In this paper, genetic sequencing techniques are applied to give a more sophisticated decomposition of the algorithmic variations, thus allowing an unified hardware architecture which gives a 10-25% area saving and 15% power saving for a digital radar receiver.

A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

Provably good multiprocessor scheduling with resource sharing

We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Resource Sharing Among Engineering College Libraries Affiliated To Mahatma Gandhi University, Kerala: A Proposed Model

There are around 150 engineering colleges (ECs) in Kerala under the government, aided and self financing (S.F.) sectors. While the college libraries in the government and aided sectors receive several grants, the libraries of S.F. colleges are solely run by their own funds. The rising costs of scholarly publications and strict AICTE stipulations regarding libraries and their collection, pose great difficulties to the libraries in all sectors in finding adequate budgets to provide quality services. Library cooperation/resource sharing helps to overcome this problem to a considerable extent. The present study analysed the facilities and services of the ECs affiliated to M.G.University, Kerala to identify whether there is a need for resource sharing (RS) among these libraries. The satisfaction of the users with their library resources and services were also ascertained. The study put forward a model for RS and the opinion of the librarians and users regarding the same were collected. Structured questionnaires were used to collect the required data. The study revealed that a wide gap exist between the libraries with respect to their facilities and services and many of the S.F. libraries have better infrastructure when compared to the government and aided college libraries. Majority of the respondents opined that RS is necessary to satisfy their information needs. The model of RS proposed by the study was widely accepted by the librarians and users. Based on the opinions and suggestions of the respondents, the study developed the potential model for resource sharing- the Virtual Resource Sharing Centre (VRSC).

Maximizing Resource Sharing in WDM Mesh Networks With Path-Based Protection and Sparse OEO Regeneration

We propose a resource-sharing scheme that supports three kinds of sharing scenarios in a WDM mesh network with path-based protection and sparse OEO regeneration. Several approaches are used to maximize the sharing of wavelength-links and OEO regenerators.

OPAC Design Enhancements and Their Effects on Circulation and Resource Sharing within the Library Consortium Environment

A longitudinal study of three discrete online public access catalog (OPAC) design enhancements examined the possible effects such changes may have on circulation and resource sharing within the automated library consortium environment. Statistical comparisons were made of both circulation and interlibrary loan (ILL) figures from the year before enhancement to the year after implementation. Data from sixteen libraries covering a seven-year period were studied in order to determine the degree to which patrons may or may not utilize increasingly broader OPAC ILL options over time. Results indicated that while ILL totals increased significantly after each OPAC enhancement, such gains did not result in significant corresponding changes in total circulation.

Report of the Council on Library and Network Development on regional organizations for interlibrary cooperation and resource sharing : the development of multitype library systems in Wisconsin.

WI docs. no.: Ed.3/2:3226

Providing fairer resource allocation for multi-tenant cloud-based systems

A fundamental premise in cloud computing is trying to provide a more sophisticated computing resource sharing capability. In order to provide better allocation, the Dominant Resource Fairness (DRF) approach has been developed to address the "fair resource allocation problem" at the application layer for multi-tenant cloud applications. Nevertheless conventional DRF only considers the interplay of CPU and memory, which may result in over allocation of resources to one tenant's application to the detriment of others. In this paper, we propose an improved DRF algorithm with 3-dimensional demand vector to support disk resources as the third dominant shared resource, enhancing fairer resource sharing. Our technique is integrated with LINUX 'group' controls resource utilisation and realises data isolation to avoid undesirable interactions between co-located tasks. Our method ensures all tenants receive system resources fairly, which improves overall utilisation and throughput as well as reducing traffic in an over-crowded system. We evaluate the performance of different types of workload using different algorithms and compare ours to the default algorithm. Results show an increase of 15% resource utilisation and a reduction of 59% completion time on average, indicating that our DRF algorithm provides a better, smoother, fairer high-performance resource allocation scheme for both continuous workloads and batch jobs.

Creating efficiencies in teaching : where are the right resources when you need them?

Early career engineering academics are encouraged to join and contribute to established research groups at the leading edge of their discipline. This is often facilitated by various staff development and support programs. Given that academics are often appointed primarily on the basis of their research skills and outputs, such an approach is justified and is likely to result in advancing the individual academic’s career. It also enhances their capacity to attract competitive research funding, while contributing to the overall research performance of their institution, with further potential for an increased share of government funding. In contrast, there is much less clarity of direction or availability of support mechanisms for those academics in their role as teachers. Following a general induction to teaching and learning at their institution, they would commonly think about preparing some lecture materials, whether for delivery in a face-to-face or on-line modality. Typically they would look for new references and textbooks to act as a guide for preparing the content. They would probably find out how the course has been taught before, and what laboratory facilities and experiments have been used. In all of these and other related tasks, the majority of newly appointed academics are guided strongly by their own experiences as students, rather than any firm knowledge of pedagogical principles. At a time of increased demands on academics’ time, and high expectations of performance and productivity in both research and teaching, it is essential to examine possible actions to support academics in enhancing their teaching performance in effective and efficient ways. Many resources have been produced over the years in engineering schools around the world, with very high intellectual and monetary costs. In Australia, the last few years have seen a surge in the number of ALTC/OLT projects and fellowships addressing a range of engineering education issues and providing many resources. There are concerns however regarding the extent to which these resources are being effectively utilised. Why are academics still re-inventing the wheel and creating their own version of teaching resources and pedagogical practice? Why do they spend so much of their precious time in such an inefficient way? A symposium examining the above issues was conducted at the AAEE2012 conference, and some pointers to possible responses to the above questions were obtained. These are explored in this paper and supplemented by the responses to a survey of a group of engineering education leaders on some of the aspects of these research questions. The outcomes of the workshop and survey results have been analysed in view of the literature and the ALTC/OLT sponsored learning and teaching projects and resources. Other factors are discussed, including how such resources can be found, how their quality might be evaluated, and how assessment may be appropriately incorporated, again using readily available resources. This study found a strong resonance between resources reuse with work on technology acceptance (Davis, 1989), suggesting that technology adoption models could be used to encourage resource sharing. Efficient use of outstanding learning materials is an enabling approach. The paper provides some insights on the factors affecting the re-use of available resources, and makes some recommendations and suggestions on how the issue of resources re-use might be incorporated in the process of applying and completing engineering education projects.

Building distributed leadership for effective supervision of creative practice higher research degrees : final report 2014

Building distributed leadership for effective supervision of creative practice higher research degrees is an Office for Learning and Teaching (OLT) funded project, conducted in partnership between Queensland University of Technology, The University of Melbourne, Auckland University of Technology, University of New South Wales and University of Western Sydney. The project was initiated to develop a cooperative approach to establishing an understanding of the contextual frameworks of the emergent field of creative practice higher degrees by research (HDRs); capturing early insights of administrators and supervisors; gathering exemplars of good practices; and establishing an in-common understanding of effective approaches to supervision. To this end, the project has produced: • A literature review, to provide a research foundation for creative practice higher research degree supervision (Chapter 3). • A contextual review of disciplinary frameworks for HDR programs, produced through surveys of postgraduate research administrators (Section 4.1), and an analysis of institutional materials and academic development programs for supervisors (Section 4.2). • A National Symposium, Effective Supervision of Creative Arts Research Degrees (ESCARD), at QUT in Brisbane in February 2013, with 62 delegates from 20 Australasian Universities, at which project findings were disseminated, and delegates presented case studies and position papers, and participated in discussions on key issues for supervisors (Appendix 1). • Resources, including a booklet for supervisors: 12 Principles for the Effective Supervision of Creative Practice Higher Research Degrees, which encapsulates attitudes, insights and good practices of experienced and new supervisors. It was produced through a content analysis of interviews with twenty-five supervisors in creative disciplines (visual and performing arts, music, new media, creative writing and design) (Printed booklet, PDF, Appendix 3). • A project website to disseminate project outcomes , which holds project findings, relevant references, and a repository of case studies and position papers by supervisors and program administrators. • A call for papers for a special issue ‘Supervising Practice: Perspectives on the Supervision of Creative Practice Research Higher Degrees’ of ACCESS Journal: Critical Perspectives on Communication, Cultural & Policy Studies (ERA ranked A quality) in 2014 (Appendix 2). • A community of supervisory practice initiated through project partnerships, a national symposium where supervisors from across Australasia met in dialogue for the first time, resource sharing, and joint publishing opportunities. • A set of recommendations for supervision capacity building and academic development, produced through the triangulation of literature and contextual reviews, analysis of institutional frameworks, interviews with supervisors and national dialogues. It is anticipated that the project’s outcomes will support experienced and new supervisors in this emergent field, and so benefit HDR students, and will enable creative disciplines to build supervision capacity, and so to accommodate growth in postgraduate enrolments. Funded as a pilot project, the project set out to establish a robust research base to provide a foundation for future work involving sharing good practices, resource building, and designing effective approaches to academic development for supervisors. Recommendations that were produced out of this project include the need to extend beyond generic, formal training for supervisors to academic development that harnesses and extends distributed leadership; focuses on local, disciplinary contexts; has a strong emphasis on case studies; provides diverse resources; and facilitates dialogue between supervisors. Recommendations also include developing frameworks for mentoring new supervisors and building a national network to facilitate cross-institutional discourse, disseminate good practices, and share insights into the management of risk factors, ethical issues, and preparing candidates for examination. As a pilot investigation, the outcomes of this project lay the ground for this future work.