Collaborative virtual gaming worlds in higher education

Directory of Open Access Journals (Sweden)

Nicola Whitton

2008-12-01

Full Text Available There is growing interest in the use of virtual gaming worlds in education, supported by the increased use of multi-user virtual environments (MUVEs and massively multiplayer online role-playing games (MMORPGs for collaborative learning. However, this paper argues that collaborative gaming worlds have been in use much longer and are much wider in scope; it considers the range of collaborative gaming worlds that exist and discusses their potential for learning, with particular reference to higher education. The paper discusses virtual gaming worlds from a theoretical pedagogic perspective, exploring the educational benefits of gaming environments. Then practical considerations associated with the use of virtual gaming worlds in formal settings in higher education are considered. Finally, the paper considers development options that are open to educators, and discusses the potential of Alternate Reality Games (ARGs for learning in higher education. In all, this paper hopes to provide a balanced overview of the range of virtual gaming worlds that exist, to examine some of the practical considerations associated with their use, and to consider their benefits and challenges in learning and teaching in the higher education context.

Collaborative Educational Systems in the Virtual Environment

OpenAIRE

Cristian CIUREA; Paul POCATILU

2012-01-01

The work leads to an original approach to the construction of collaborative systems metrics. The approach is based both on research already conducted by the author, on the experimental results obtained, and the foundation taken from the specific literature. The collaborative systems in knowledge-based economy are formalized and their characteristics are identified. The virtual campus structure is described and a comparison with the classical university is achieved. The architecture of virtual...

Elearn: A Collaborative Educational Virtual Environment.

Science.gov (United States)

Michailidou, Anna; Economides, Anastasios A.

Virtual Learning Environments (VLEs) that support collaboration are one of the new technologies that have attracted great interest. VLEs are learning management software systems composed of computer-mediated communication software and online methods of delivering course material. This paper presents ELearn, a collaborative VLE for teaching…

Collaborative virtual environments art exhibition

Science.gov (United States)

Dolinsky, Margaret; Anstey, Josephine; Pape, Dave E.; Aguilera, Julieta C.; Kostis, Helen-Nicole; Tsoupikova, Daria

2005-03-01

This panel presentation will exhibit artwork developed in CAVEs and discuss how art methodologies enhance the science of VR through collaboration, interaction and aesthetics. Artists and scientists work alongside one another to expand scientific research and artistic expression and are motivated by exhibiting collaborative virtual environments. Looking towards the arts, such as painting and sculpture, computer graphics captures a visual tradition. Virtual reality expands this tradition to not only what we face, but to what surrounds us and even what responds to our body and its gestures. Art making that once was isolated to the static frame and an optimal point of view is now out and about, in fully immersive mode within CAVEs. Art knowledge is a guide to how the aesthetics of 2D and 3D worlds affect, transform, and influence the social, intellectual and physical condition of the human body through attention to psychology, spiritual thinking, education, and cognition. The psychological interacts with the physical in the virtual in such a way that each facilitates, enhances and extends the other, culminating in a "go together" world. Attention to sharing art experience across high-speed networks introduces a dimension of liveliness and aliveness when we "become virtual" in real time with others.

The Impact of Virtual Collaboration and Collaboration Technologies on Knowledge Transfer and Team Performance in Distributed Organizations

Science.gov (United States)

Ngoma, Ngoma Sylvestre

2013-01-01

Virtual teams are increasingly viewed as a powerful determinant of competitive advantage in geographically distributed organizations. This study was designed to provide insights into the interdependencies between virtual collaboration, collaboration technologies, knowledge transfer, and virtual team performance in an effort to understand whether…

Virtual Teaming and Collaboration Technology: A Study of Influences on Virtual Project Outcomes

Science.gov (United States)

Broils, Gary C.

2014-01-01

The purpose of this quantitative correlational study was to explore the relationships between the independent variables, contextual factors for virtual teams and collaboration technology, and the dependent variable, virtual project outcomes. The problem leading to the need for the study is a lower success rate for virtual projects compared to…

A study on haptic collaborative game in shared virtual environment

Science.gov (United States)

Lu, Keke; Liu, Guanyang; Liu, Lingzhi

2013-03-01

A study on collaborative game in shared virtual environment with haptic feedback over computer networks is introduced in this paper. A collaborative task was used where the players located at remote sites and played the game together. The player can feel visual and haptic feedback in virtual environment compared to traditional networked multiplayer games. The experiment was desired in two conditions: visual feedback only and visual-haptic feedback. The goal of the experiment is to assess the impact of force feedback on collaborative task performance. Results indicate that haptic feedback is beneficial for performance enhancement for collaborative game in shared virtual environment. The outcomes of this research can have a powerful impact on the networked computer games.

The queue-length in GI/G/s queues

Directory of Open Access Journals (Sweden)

Le Gall Pierre

2000-01-01

Full Text Available The distribution of the queue-length in the stationary symmetrical GI/G/s queue is given with an application to the M/G/s queue, particularly in the case of the combination of several packet traffics, with various constant service times, to dimension the buffer capacity.

Collaborative Virtual 3D Environment for Internet-Accessible Physics Experiments

Directory of Open Access Journals (Sweden)

Bettina Scheucher

2009-08-01

Full Text Available Abstract—Immersive 3D worlds have increasingly raised the interest of researchers and practitioners for various learning and training settings over the last decade. These virtual worlds can provide multiple communication channels between users and improve presence and awareness in the learning process. Consequently virtual 3D environments facilitate collaborative learning and training scenarios. In this paper we focus on the integration of internet-accessible physics experiments (iLabs combined with the TEALsim 3D simulation toolkit in Project Wonderland, Sun's toolkit for creating collaborative 3D virtual worlds. Within such a collaborative environment these tools provide the opportunity for teachers and students to work together as avatars as they control actual equipment, visualize physical phenomenon generated by the experiment, and discuss the results. In particular we will outline the steps of integration, future goals, as well as the value of a collaboration space in Wonderland's virtual world.

Concurrent array-based queue

Science.gov (United States)

Heidelberger, Philip; Steinmacher-Burow, Burkhard

2015-01-06

According to one embodiment, a method for implementing an array-based queue in memory of a memory system that includes a controller includes configuring, in the memory, metadata of the array-based queue. The configuring comprises defining, in metadata, an array start location in the memory for the array-based queue, defining, in the metadata, an array size for the array-based queue, defining, in the metadata, a queue top for the array-based queue and defining, in the metadata, a queue bottom for the array-based queue. The method also includes the controller serving a request for an operation on the queue, the request providing the location in the memory of the metadata of the queue.

Collaboration and dialogue in Virtual reality

DEFF Research Database (Denmark)

Gyldendahl Jensen, Camilla

2017-01-01

“Virtual reality” adds a new dimension to constructivist problem-based learning (PBL) environments in the architectural and building construction educations, where a realistic and lifelike presence in a building enables students to assess and discuss how the various solutions interact with each...... other. Combined with “Building Information Models” (BIM), “Virtual Reality” provides an entirely new opportunity to innovate and optimize the architecture and construction in its early stages, which creates and iterative learning process. There are several studies where virtual simulation tools based...... on predefined tutorials are tested for their ability to facilitate collaborative processes. This study addresses the problem from a new angle by the virtual universe created through the students' own iterative design of a building. The “Virtual reality” system's narrative tale arises spontaneously through...

Collaborative design in virtual environments

CERN Document Server

Wang, Xiangyu

2011-01-01

Collaborative virtual environments (CVEs) are multi-user virtual realities which actively support communication and co-operation. This book offers a comprehensive reference volume to the state-of-the-art in the area of design studies in CVEs. It is an excellent mix of contributions from over 25 leading researcher/experts in multiple disciplines from academia and industry, providing up-to-date insight into the current research topics in this field as well as the latest technological advancements and the best working examples. Many of these results and ideas are also applicable to other areas su

Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues

NARCIS (Netherlands)

Cheung, S.K.; van den Berg, Hans Leo; Boucherie, Richardus J.

2005-01-01

We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for an egalitarian PS queue with $K$ customer classes, we show that the marginal queue length distribution for class $k$ factorizes over the number of other

Queue-length balance equations in multiclass multiserver queues and their generalizations

NARCIS (Netherlands)

Boon, M.A.A.; Boxma, O.J.; Kella, O.; Miyazawa, M.

2017-01-01

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: The distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid

Queue-length balance equations in multiclass multiserver queues and their generalizations

NARCIS (Netherlands)

Boon, M.; Boxma, O.J.; Kella, O.; Miyazawa, M.

2017-01-01

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid

Task distribution mechanism for effective collaboration in virtual environments

International Nuclear Information System (INIS)

Khalid, S.; Ullah, S.; Alam, A.

2016-01-01

Collaborative Virtual Environments (CVEs) are computer generated worlds where two or more users can simultaneously interact with synthetic objects to perform a task. User performance is one of the main issues caused by either loose coordination, less awareness or communication among collaborating users. In this paper, a new model for task distribution is proposed, in which task distribution strategy among multiple users in CVEs is defined. The model assigns the task to collaborating users in CVEs either on static or dynamic basis. In static distribution there exists loose dependency and requires less communication during task realization whereas in dynamic distribution users are more dependent on each other and thus require more communication. In order to study the effect of static and dynamic task distribution strategies on user's performance in CVEs, a collaborative virtual environment is developed where twenty four (24) teams (each consists of two users) perform a task in collaboration under both strategies (static and dynamic). Results reveal that static distribution is more effective and increases users performance in CVEs. The outcome of this work will help the development of effective CVEs in the field of virtual assembly, repair, education and entertainment. (author)

Group-Server Queues

OpenAIRE

Li, Quan-Lin; Ma, Jing-Yu; Xie, Mingzhou; Xia, Li

2017-01-01

By analyzing energy-efficient management of data centers, this paper proposes and develops a class of interesting {\\it Group-Server Queues}, and establishes two representative group-server queues through loss networks and impatient customers, respectively. Furthermore, such two group-server queues are given model descriptions and necessary interpretation. Also, simple mathematical discussion is provided, and simulations are made to study the expected queue lengths, the expected sojourn times ...

Improved ant Colony Optimization for Virtual Teams Building in Collaborative Process Planning

Directory of Open Access Journals (Sweden)

Yingying Su

2014-02-01

Full Text Available Virtual teams have been adopted by organizations to gain competitive advantages in this global economy. Virtual teams are a ubiquitous part of getting work done in almost every organization. For the purpose of building virtual teams in collaborative process planning, the method based on improved ant colony algorithm (IMACO was proposed. The concept of virtual team was illustrated and the necessity of building virtual teams in collaborative process planning was analyzed. The sub tasks with certain timing relationship were described and the model of building virtual teams in collaborative process planning was established, which was solved by improved ant colony algorithm. In this paper applications of the IMACO and ACO are compared and demonstrate that the use of the IMACO algorithm performs better. An example was studied to illustrate the effectiveness of the strategy.

Using virtual worlds as collaborative environments for innovation and design

DEFF Research Database (Denmark)

Ehsani, Ehsan; Chase, Scott Curland

2009-01-01

In this paper we discuss observations and lessons learned in conducting architectural design projects in virtual worlds. By integrating a community of users in virtual worlds into a collaborative architectural design process, organisations can tap the community's creativity and intelligence throu....... Here we propose four modes of collaboration, based on the choices for degree of openness and governance structure, which are illustrated by four case studies....

A study on development of virtual panel and virtual collaboration system

International Nuclear Information System (INIS)

Yoo, H. J.; Park, S. Y.; Lee, M. S.; Hong, J. H.

2001-01-01

The Nuclear I and C group of KEPRI has been peforming research and development on the VRCATS, Virtual Reality based Computer Assisted Training System. For the past two years, we have developed the first VRCATS for Youngkwang 1 nuclear power plant. Currently, we are developing an advanced VRCATS for Uljin 3 nuclear power plant. In this paepr, we will describe virtual panel system and VR based collaborate training system (VRCATS) of the Uljin VRCATS. Since Virtual Panel provides the same environment as the real MCR, trainees can expect the same training effect with Virtual Panel as they do with full scope simulator. i.e., trainees can check key variables and operate the plants and get responses with Virtual Panel. VRCTS provides another realistic training environment for trainees. In VRCATS, for example, operators in a group can work together t handle LOCA (Loss of Coolant Accident) according to emergency operation procedures

Empirical Analysis of Priority on a FCFS Queue Discipline In ...

African Journals Online (AJOL)

Queues are virtually unavoidable phenomenon in Nigerian banking system. While banks stride to meet customers services' satisfaction, customers who do not go immediately into service must wait in line (if any). The queuing discipline in banks has been first-come-first-served (FCFS). What happen to the waiting time ...

A Virtual Collaboration Testbed for C2

National Research Council Canada - National Science Library

Gardner, Sheldon

2000-01-01

.... To be effective in future Network Centric Warfare (NCW), mission planners will need to operate in a virtual environment with seamless sharing and collaboration among participants and the resources they use to do work...

Intelligent Open Data 3D Maps in a Collaborative Virtual World

Directory of Open Access Journals (Sweden)

Juho-Pekka Virtanen

2015-05-01

Full Text Available Three-dimensional (3D maps have many potential applications, such as navigation and urban planning. In this article, we present the use of a 3D virtual world platform Meshmoon to create intelligent open data 3D maps. A processing method is developed to enable the generation of 3D virtual environments from the open data of the National Land Survey of Finland. The article combines the elements needed in contemporary smart city concepts, such as the connection between attribute information and 3D objects, and the creation of collaborative virtual worlds from open data. By using our 3D virtual world platform, it is possible to create up-to-date, collaborative 3D virtual models, which are automatically updated on all viewers. In the scenes, all users are able to interact with the model, and with each other. With the developed processing methods, the creation of virtual world scenes was partially automated for collaboration activities.

The WorkQueue project - a task queue for the CMS workload management system

Science.gov (United States)

Ryu, S.; Wakefield, S.

2012-12-01

We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

The WorkQueue project - a task queue for the CMS workload management system

International Nuclear Information System (INIS)

Ryu, S; Wakefield, S

2012-01-01

We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

The WorkQueue project: A task queue for the CMS workload management system

Energy Technology Data Exchange (ETDEWEB)

Ryu, S. [Fermilab; Wakefield, Stuart [Imperial Coll., London

2012-01-01

We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

A virtual environment for medical radiation collaborative learning.

Science.gov (United States)

Bridge, Pete; Trapp, Jamie V; Kastanis, Lazaros; Pack, Darren; Parker, Jacqui C

2015-06-01

A software-based environment was developed to provide practical training in medical radiation principles and safety. The Virtual Radiation Laboratory application allowed students to conduct virtual experiments using simulated diagnostic and radiotherapy X-ray generators. The experiments were designed to teach students about the inverse square law, half value layer and radiation protection measures and utilised genuine clinical and experimental data. Evaluation of the application was conducted in order to ascertain the impact of the software on students' understanding, satisfaction and collaborative learning skills and also to determine potential further improvements to the software and guidelines for its continued use. Feedback was gathered via an anonymous online survey consisting of a mixture of Likert-style questions and short answer open questions. Student feedback was highly positive with 80 % of students reporting increased understanding of radiation protection principles. Furthermore 72 % enjoyed using the software and 87 % of students felt that the project facilitated collaboration within small groups. The main themes arising in the qualitative feedback comments related to efficiency and effectiveness of teaching, safety of environment, collaboration and realism. Staff and students both report gains in efficiency and effectiveness associated with the virtual experiments. In addition students particularly value the visualisation of "invisible" physical principles and increased opportunity for experimentation and collaborative problem-based learning. Similar ventures will benefit from adopting an approach that allows for individual experimentation while visualizing challenging concepts.

Challenges in Virtual Collaboration. Videoconferencing, Audioconferencing, and Computer-Mediated Communications

National Research Council Canada - National Science Library

Wainfan, Lynne

2004-01-01

...) on group processes and outcomes. Virtual collaborations are collaborations in which the people working together are interdependent in their tasks, share responsibility for outcomes, are geographically dispersed, and rely on mediated...

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

Towards Gesture-Based Multi-User Interactions in Collaborative Virtual Environments

Science.gov (United States)

Pretto, N.; Poiesi, F.

2017-11-01

We present a virtual reality (VR) setup that enables multiple users to participate in collaborative virtual environments and interact via gestures. A collaborative VR session is established through a network of users that is composed of a server and a set of clients. The server manages the communication amongst clients and is created by one of the users. Each user's VR setup consists of a Head Mounted Display (HMD) for immersive visualisation, a hand tracking system to interact with virtual objects and a single-hand joypad to move in the virtual environment. We use Google Cardboard as a HMD for the VR experience and a Leap Motion for hand tracking, thus making our solution low cost. We evaluate our VR setup though a forensics use case, where real-world objects pertaining to a simulated crime scene are included in a VR environment, acquired using a smartphone-based 3D reconstruction pipeline. Users can interact using virtual gesture-based tools such as pointers and rulers.

A cooperative approach to queue allocation of indivisible objects

NARCIS (Netherlands)

Hamers, H.J.M.; Klijn, F.; Slikker, M.; Velzen, van B.

2009-01-01

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining stable

THE PROPOSED MODEL OF COLLABORATIVE VIRTUAL LEARNING ENVIRONMENT FOR INTRODUCTORY PROGRAMMING COURSE

Directory of Open Access Journals (Sweden)

Mahfudzah OTHMAN

2012-01-01

Full Text Available This paper discusses the proposed model of the collaborative virtual learning system for the introductory computer programming course which uses one of the collaborative learning techniques known as the “Think-Pair-Share”. The main objective of this study is to design a model for an online learning system that facilitates the collaborative learning activities in a virtual environment such as online communications and pair or small group discussions. In order to model the virtual learning environment, the RUP methodology has been used where it involves the data collection phase and the analysis and design phase. Fifty respondents have been randomly selected to participate in the data collection phase to investigate the students’ interest and learning styles as well as their learning preferences. The results have shown the needs for the development of online small group discussions that can be used as an alternative learning style for programming courses. The proposed design of the virtual learning system named as the Online Collaborative Learning System or OCLS is being depicted using the object-oriented models which are the use-case model and class diagram in order to show the concise processes of virtual “Think-Pair-Share” collaborative activities. The “Think-Pair-Share” collaborative learning technique that is being used in this model has been chosen because of its simplicity and relatively low-risk. This paper also presents the proposed model of the system’s architecture that will become the guidelines for the physical development of OCLS using the web-based applications.

Delay in a tandem queueing model with mobile queues: An analytical approximation

NARCIS (Netherlands)

Al Hanbali, Ahmad; de Haan, Roland; Boucherie, Richardus J.; van Ommeren, Jan C.W.

In this paper, we analyze the end-to-end delay performance of a tandem queueing system with mobile queues. Due to state-space explosion, there is no hope for a numerical exact analysis for the joint-queue-length distribution. For this reason, we present an analytical approximation that is based on

Online Teacher Development: Collaborating in a Virtual Learning Environment

Science.gov (United States)

Ernest, Pauline; Guitert Catasús, Montse; Hampel, Regine; Heiser, Sarah; Hopkins, Joseph; Murphy, Linda; Stickler, Ursula

2013-01-01

Over recent years, educational institutions have been making increasing use of virtual environments to set up collaborative activities for learners. While it is recognized that teachers play an important role in facilitating learner collaboration online, they may not have the necessary skills to do so successfully. Thus, a small-scale professional…

Complete analysis of MAP/G/1/N queue with single (multiple vacation(s under limited service discipline

Directory of Open Access Journals (Sweden)

U. C. Gupta

2005-01-01

Full Text Available We consider a finite-buffer single-server queue with Markovian arrival process (MAP where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both single- and multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parameters on some important performance measures, like probability of loss, mean queue lengths, mean waiting time, is discussed. The model can be applied in computer communication and networking, for example, performance analysis of token passing ring of LAN and SVC (switched virtual connection of ATM.

discouraged by queue length

Directory of Open Access Journals (Sweden)

P. R. Parthasarathy

2001-01-01

Full Text Available The transient solution is obtained analytically using continued fractions for a state-dependent birth-death queue in which potential customers are discouraged by the queue length. This queueing system is then compared with the well-known infinite server queueing system which has the same steady state solution as the model under consideration, whereas their transient solutions are different. A natural measure of speed of convergence of the mean number in the system to its stationarity is also computed.

An asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length. he joins queue 1 say with probability q and queue 2

COLLABORATION SYSTEM IN VIRTUAL ORGANIZATION

Directory of Open Access Journals (Sweden)

ADINA CRETAN

2011-04-01

Full Text Available The purpose of this work is to provide a collaboration support for small and medium enterprises which cannot or do not want to fulfill a major contract alone. In that case, in order to better meet a higher external demand, the managers are willing to subcontract parts of their contracts even to competitors. This approach is illustrated by a business-to-business interaction, being proposed a sample scenario where partners are autonomous gas stations grouped in a virtual organization.

Toward Virtual Campuses: Collaborative Virtual Labs & Personalized Learning Services in a Real-Life Context

OpenAIRE

Tsekeridou, Sofia; Tiropanis, Thanassis; Christou, Ioannis; Vakilzadeh, Haleh

2008-01-01

Virtual campuses are gradually becoming a reality with the advances in e-learning and Web technologies, distributed systems and broadband communication, as well as the emerging needs of remote Universities for collaboration on offering common programs. The advances in grid-based distributed infrastructures have further significantly contributed to this fact providing optimized and real-time system performance and support for virtual communities even under synchronous distributed multi-user us...

Adaptive Mean Queue Size and Its Rate of Change: Queue Management with Random Dropping

OpenAIRE

Karmeshu; Patel, Sanjeev; Bhatnagar, Shalabh

2016-01-01

The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing the maximum threshold value resulting in frequent dropping of the packets. An adaptive queue management with random dropping (AQMRD) algorithm is proposed which incorporates information not just about the average queue size but also the rate of change of th...

Virtual Teams and E-Collaboration Technology: A Case Study Investigating the Dynamics of Virtual Team Communication

Science.gov (United States)

Mattison, Theresa

2011-01-01

The purpose of this study was to determine to what extent the use of e-collaboration tools when used as a primary channel of communication affected virtual team members' trust and motivation, in a spatially dispersed environment. Structured interviews were conducted with 18 project managers, who were responsible for leading virtual projects…

An investigation of the efficacy of collaborative virtual reality systems for moderated remote usability testing.

Science.gov (United States)

Chalil Madathil, Kapil; Greenstein, Joel S

2017-11-01

Collaborative virtual reality-based systems have integrated high fidelity voice-based communication, immersive audio and screen-sharing tools into virtual environments. Such three-dimensional collaborative virtual environments can mirror the collaboration among usability test participants and facilitators when they are physically collocated, potentially enabling moderated usability tests to be conducted effectively when the facilitator and participant are located in different places. We developed a virtual collaborative three-dimensional remote moderated usability testing laboratory and employed it in a controlled study to evaluate the effectiveness of moderated usability testing in a collaborative virtual reality-based environment with two other moderated usability testing methods: the traditional lab approach and Cisco WebEx, a web-based conferencing and screen sharing approach. Using a mixed methods experimental design, 36 test participants and 12 test facilitators were asked to complete representative tasks on a simulated online shopping website. The dependent variables included the time taken to complete the tasks; the usability defects identified and their severity; and the subjective ratings on the workload index, presence and satisfaction questionnaires. Remote moderated usability testing methodology using a collaborative virtual reality system performed similarly in terms of the total number of defects identified, the number of high severity defects identified and the time taken to complete the tasks with the other two methodologies. The overall workload experienced by the test participants and facilitators was the least with the traditional lab condition. No significant differences were identified for the workload experienced with the virtual reality and the WebEx conditions. However, test participants experienced greater involvement and a more immersive experience in the virtual environment than in the WebEx condition. The ratings for the virtual

Interacting queues in heavy traffic

NARCIS (Netherlands)

J.A. Morrison; S.C. Borst (Sem)

2010-01-01

htmlabstractWe consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction. Specifically, the system consists of one primary queue and several

Modeling Message Queueing Services with Reliability Guarantee in Cloud Computing Environment Using Colored Petri Nets

Directory of Open Access Journals (Sweden)

Jing Li

2015-01-01

Full Text Available Motivated by the need for loosely coupled and asynchronous dissemination of information, message queues are widely used in large-scale application areas. With the advent of virtualization technology, cloud-based message queueing services (CMQSs with distributed computing and storage are widely adopted to improve availability, scalability, and reliability; however, a critical issue is its performance and the quality of service (QoS. While numerous approaches evaluating system performance are available, there is no modeling approach for estimating and analyzing the performance of CMQSs. In this paper, we employ both the analytical and simulation modeling to address the performance of CMQSs with reliability guarantee. We present a visibility-based modeling approach (VMA for simulation model using colored Petri nets (CPN. Our model incorporates the important features of message queueing services in the cloud such as replication, message consistency, resource virtualization, and especially the mechanism named visibility timeout which is adopted in the services to guarantee system reliability. Finally, we evaluate our model through different experiments under varied scenarios to obtain important performance metrics such as total message delivery time, waiting number, and components utilization. Our results reveal considerable insights into resource scheduling and system configuration for service providers to estimate and gain performance optimization.

Optimal control of two queues in series

International Nuclear Information System (INIS)

Moustafa, M.S.; Mohammed, R.M.

1994-08-01

In this paper we give a fairly complete survey of the available results on the control of arrival and service rates for both single queue and networks of queues. We also study two M/M/1 queues in series. At the first queue, the arrival and the service rates are chosen in pair from a finite set whenever the queue lengths at both queues change. Each choice has a switching cost depending on the chosen rates and the queue lengths. At the second queue, the arrival and the service rates are fixed. Our objective is to find a policy for dynamically choosing rates, based on the current rates and queues lengths that minimizes the expected total discounted cost over a finite horizon, numerical results are given. (author). 8 refs, 1 fig

On the optimal use of a slow server in two-stage queueing systems

Science.gov (United States)

Papachristos, Ioannis; Pandelis, Dimitrios G.

2017-07-01

We consider two-stage tandem queueing systems with a dedicated server in each queue and a slower flexible server that can attend both queues. We assume Poisson arrivals and exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming that two servers cannot collaborate to work on the same job and preemptions are not allowed. We formulate the problem as a Markov decision process and derive properties of the optimal allocation for the dedicated (fast) servers. Specifically, we show that the one downstream should not idle, and the same is true for the one upstream when holding costs are larger there. The optimal allocation of the slow server is investigated through extensive numerical experiments that lead to conjectures on the structure of the optimal policy.

Facilitating learning through an international virtual collaborative practice: A case study.

Science.gov (United States)

Wihlborg, Monne; Friberg, Elizabeth E; Rose, Karen M; Eastham, Linda

2018-02-01

Internationalisation of higher education involving information and communication technology such as e-learning opens opportunities for innovative learning approaches across nations and cultures. Describe a case in practice of collaborative and transformative learning in relation to 'internationalisation on home grounds' with the broader learning objective of 'becoming aware and knowledgeable'. A mutually developed project established a virtual international collaborative exchange for faculty and students using a course management software (MOODLE) and open access technology (Adobe CONNECT). Two research universities in Sweden and the United States. Approximately 90 nursing students from each university per semester over several semesters. A collaborative process to develop a joint learning community to construct a virtual module and learning activity involving academics and nursing students in two countries using principles of meaning construction and negotiated learning. Developed possibilities for dealing with the challenges and finding strategies for a future higher education system that opens dialogues worldwide. Virtual international exchanges open innovative communication and learning contexts across nations and cultures. Internationalisation is so much more than students and teachers' mobility. 'Internationalisation on home grounds' (internationalisation for all) should receive more attention to support faculty and student collaboration, learning, and professional development. Copyright © 2017 Elsevier Ltd. All rights reserved.

Reaching across Continents: Engaging Students through Virtual Collaborations

Science.gov (United States)

Wilmot, Natalie Victoria; Rushton, Diane; Zandona Hofmann, Anelise Seleme

2016-01-01

Business schools have the responsibility of preparing students for work in multicultural organisations and global markets. This paper examines a situated learning experience for undergraduates through a virtual collaboration between a UK university and a Brazilian university. This facilitated remote communication using social media and smart…

The WIYN Queue: Theory Meets Reality

Science.gov (United States)

Boroson, T. A.; Harmer, D. L.; Saha, A.; Smith, P. S.; Willmarth, D. W.; Silva, D. R.

1998-07-01

During the past two years NOAO has conducted a queue observing experiment with the 3.5 m WIYN telescope on Kitt Peak, Arizona. The WIYN telescope is ideally suited to queue-scheduled operation in terms of its performance and its instrument complement. The queue scheduling experiment on WIYN was designed to test a number of beliefs and hypotheses about gains in efficiency and scientific effectiveness due to queue scheduling. In addition, the experiment was a test of our implementation strategy and management of community expectations. The queue is run according, to a set of rules that guide decisions about which observation to do next. In practice, scientific rank, suitability of current conditions, and the desire to complete programs all enter into these decisions. As predicted by Monte Carlo simulations, the queue increases the overall efficiency of the telescope, particularly for observations requiring, rare conditions. Together with this improvement for typical programs, the queue enables synoptic, target-of-opportunity, and short programs that could not be scheduled classically. Despite this success, a number of sociological issues determine the community's perception of the WIYN queue.

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

The symmetric longest queue system

NARCIS (Netherlands)

van Houtum, Geert-Jan; Adan, Ivo; van der Wal, Jan

1997-01-01

We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue

Virtual laboratories: Collaborative environments and facilities-on-line

Energy Technology Data Exchange (ETDEWEB)

Thomas, C.E. Jr. [Oak Ridge National Lab., TN (United States). I and C Div.; Cavallini, J.S.; Seweryniak, G.R.; Kitchens, T.A.; Hitchcock, D.A.; Scott, M.A.; Welch, L.C. [Dept. of Energy, Germantown, MD (United States). Mathematical Information, and Computational Sciences Div.; Aiken, R.J. [Dept. of Energy, Germantown, MD (United States). Mathematical Information, and Computational Sciences Div.]|[Lawrence Livermore National Lab., CA (United States); Stevens, R.L. [Argonne National Lab., IL (United States). Mathematics and Computer Sciences Div.

1995-07-01

The Department of Energy (DOE) has major research laboratories in a number of locations in the US, typically co-located with large research instruments or research facilities valued at tens of millions to even billions of dollars. Present budget exigencies facing the entire nation are felt very deeply at DOE, just as elsewhere. Advances over the last few years in networking and computing technologies make virtual collaborative environments and conduct of experiments over the internetwork structure a possibility. The authors believe that development of these collaborative environments and facilities-on-line could lead to a ``virtual laboratory`` with tremendous potential for decreasing the costs of research and increasing the productivity of their capital investment in research facilities. The majority of these cost savings would be due to increased productivity of their research efforts, better utilization of resources and facilities, and avoiding duplication of expensive facilities. A vision of how this might all fit together and a discussion of the infrastructure necessary to enable these developments is presented.

Bad Luck When Joining the Shortest Queue

NARCIS (Netherlands)

Blanc, J.P.C.

2008-01-01

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was

Vacation queueing models theory and applications

CERN Document Server

Tian, Naishuo

2006-01-01

A classical queueing model consists of three parts - arrival process, service process, and queue discipline. However, a vacation queueing model has an additional part - the vacation process which is governed by a vacation policy - that can be characterized by three aspects: 1) vacation start-up rule; 2) vacation termination rule, and 3) vacation duration distribution. Hence, vacation queueing models are an extension of classical queueing theory. Vacation Queueing Models: Theory and Applications discusses systematically and in detail the many variations of vacation policy. By allowing servers to take vacations makes the queueing models more realistic and flexible in studying real-world waiting line systems. Integrated in the book's discussion are a variety of typical vacation model applications that include call centers with multi-task employees, customized manufacturing, telecommunication networks, maintenance activities, etc. Finally, contents are presented in a "theorem and proof" format and it is invaluabl...

A numerical solution for the multi-server queue with hyper-exponential service times

NARCIS (Netherlands)

de Smit, J.H.A.

1983-01-01

In this paper we present a numerical method for the queue GI/H2/s, which is based on general results for GI/Hm/s. We give a complete description of the algorithm which yields exact results for the steady distributions of the actual waiting time, the virtual waiting time and the number of customers

ICT Collaboration Tools for Virtual Teams in Terms of the SECI Model

Directory of Open Access Journals (Sweden)

Monika Davidekova

2017-02-01

Full Text Available Nowadays, the current state of development of information and communication technology (ICT connects individuals across time and space in one common environment, that is accessible for anyone, the virtual world. To collaborate with somebody or to participate in a team activity does not require a physical presence anymore. Virtual settings allow real-time communication and cooperation across any distance at any time with negligible delay. ICT allows formation of virtual teams where those accomplish various functions in work, education and private life. Compared to local teams of physically present individuals, the collaboration in virtual environments is more intensively influenced by significantly impacting factors and requires intensive motivation of the team members, extensive support by their team leader and appropriate technology. Among all the available ICT tools, not each ICT tool is equally suitable for each and every team activity. This paper aims to provide analysis of various ICT tools, to disclose their potential to contribute to team’s quality communication and to reduce drawbacks caused by impersonal environment. Our aim is to optimize the composition of the ICT supporting infrastructure in order to form successful and effective collaboration.

Merging the virtual and the real: A collaborative cross-reality game

OpenAIRE

Bergs, Jessica; Livingstone, Daniel; Loranger, Brian

2016-01-01

In this paper, we present a collaborative cross-reality game for two players, Lab2, which blends tangible board game and immersive virtual reality playing spaces in a gameplay that aims to promote and train collaborative behaviour. As collaborative learning has been stressed as an effective teaching method for many years, Lab2 could assist learners in exploring and further developing their collaborative skills in a playful manner. One player controls a physical game board showing a moveable m...

Collaborative Work in Virtual Learning Environments: Some Reflections and Prospects of Students

Directory of Open Access Journals (Sweden)

Francisco Mora-Vicariol

2016-05-01

Full Text Available The collaborative work in virtual learning environments becomes more relevant at a time when technology is used intensively. This paper shows the results of research conducted at the Universidad Estatal a Distancia (UNED in Costa Rica, about students’ perceptions around the concept and implications of collaborative work in two online courses provided by Dirección de Extensión Universitaria (Dirextu. The aim of this study is to establish the difference between collaborative work and group work as well as knowing the tools that can be used to promote this type of activity in virtual learning environments. The methodology used for this article applied a survey to two groups of students, each belonging to two different virtual courses of the Dirección de Extensión Universitaria (Dirextu. This study was based on quantitative research and applied an instrument with open and closed questions. The analysis process of the results was performed with the help of tables and figures (graphs. Finally, the study exposes a series of conclusions and recommendations among which we highlight the following: students do like collaborative activities because they diversify the teaching modes and improve the learning styles.

A Collaborative VirtualWorkspace for Factory Configuration and Evaluation

Directory of Open Access Journals (Sweden)

Ingo Zinnikus

2014-05-01

Full Text Available The convergence of information technologies (IT has enabled the Digital Enterprise in which engineering, production planning, manufacturing and sales processes are supported by IT-based collaboration, simulation and enactment. As a result, borders between reality and its virtual representations become increasingly blurred. Advanced tools need to support flexibility, specialization and collaborative evolution of the design where the exchange of knowledge between domain experts helps to improve informed decision making. In this paper, we present a collaborative, synchronized web-based framework to create 3D scenarios for product design, simulation and training assisted by animated avatars.

Virtual Laboratory Enabling Collaborative Research in Applied Vehicle Technologies

Science.gov (United States)

Lamar, John E.; Cronin, Catherine K.; Scott, Laura E.

2005-01-01

The virtual laboratory is a new technology, based on the internet, that has had wide usage in a variety of technical fields because of its inherent ability to allow many users to participate simultaneously in instruction (education) or in the collaborative study of a common problem (real-world application). The leadership in the Applied Vehicle Technology panel has encouraged the utilization of this technology in its task groups for some time and its parent organization, the Research and Technology Agency, has done the same for its own administrative use. This paper outlines the application of the virtual laboratory to those fields important to applied vehicle technologies, gives the status of the effort, and identifies the benefit it can have on collaborative research. The latter is done, in part, through a specific example, i.e. the experience of one task group.

Virtual Communities of Collaborative Learning for Higher Education

Science.gov (United States)

Sotomayor, Gilda E.

2014-01-01

This article aims to outline and project three new learning scenarios for Higher Education that, after the emergence of ICT and communication through the Network-lnternet, have appeared under the generic name of virtual communities. To that end, we start from a previous conceptual analysis on collaborative learning, cooperative learning and…

The Completion of Non-Steady-State Queue Model on The Queue System in Dr. Yap Eye Hospital Yogyakarta

Science.gov (United States)

Helmi Manggala Putri, Arum; Subekti, Retno; Binatari, Nikenasih

2017-06-01

Dr Yap Eye Hospital Yogyakarta is one of the most popular reference eye hospitals in Yogyakarta. There are so many patients coming from other cities and many of them are BPJS (Badan Penyelenggara Jaminan Sosial, Social Security Administrative Bodies) patients. Therefore, it causes numerous BPJS patients were in long queue at counter C of the registration section so that it needs to be analysed using queue system. Queue system analysis aims to give queue model overview and determine its effectiveness measure. The data collecting technique used in this research are by interview and observation. After getting the arrival data and the service data of BPJS patients per 5 minutes, the next steps are investigating steady-state condition, examining the Poisson distribution, determining queue models, and counting the effectiveness measure. Based on the result of data observation on Tuesday, February 16th, 2016, it shows that the queue system at counter C has (M/M/1):(GD/∞/∞) queue model. The analysis result in counter C shows that the queue system is a non-steady-state condition. Three ways to cope a non-steady-state problem on queue system are proposed in this research such as bounding the capacity of queue system, adding the servers, and doing Monte Carlo simulation. The queue system in counter C will reach steady-state if the capacity of patients is not more than 52 BPJS patients or adding one more server. By using Monte Carlo simulation, it shows that the effectiveness measure of the average waiting time for BPJS patients in counter C is 36 minutes 65 seconds. In addition, the average queue length of BPJS patients is 11 patients.

Proactive behaviour may lead to failure in virtual project-based collaborative learning

DEFF Research Database (Denmark)

Bjørn, Pernille; Hertzum, Morten

2005-01-01

This paper argues that proactive behaviour, caused by high engagement and motivation of the learners, may lead to failure of collaborative learning. By examining empirical data from real-world text-only virtual negotiations between dispersed participants engaged in project-based collaborative...

Multimodality and Design of Interactive Virtual Environments for Creative Collaboration

DEFF Research Database (Denmark)

Gürsimsek, Remzi Ates

. The three-dimensional representation of space and the resources for non-verbal communication enable the users to interact with the digital content in more complex yet engaging ways. However, understanding the communicative resources in virtual spaces with the theoretical tools that are conventionally used...... perspective particularly emphasizes the role of audio-visual resources in co-creating representations for effective collaboration, and the socio-cultural factors in construction of meaningful virtual environments....

Research on Collaborative Technology in Distributed Virtual Reality System

Science.gov (United States)

Lei, ZhenJiang; Huang, JiJie; Li, Zhao; Wang, Lei; Cui, JiSheng; Tang, Zhi

2018-01-01

Distributed virtual reality technology applied to the joint training simulation needs the CSCW (Computer Supported Cooperative Work) terminal multicast technology to display and the HLA (high-level architecture) technology to ensure the temporal and spatial consistency of the simulation, in order to achieve collaborative display and collaborative computing. In this paper, the CSCW’s terminal multicast technology has been used to modify and expand the implementation framework of HLA. During the simulation initialization period, this paper has used the HLA statement and object management service interface to establish and manage the CSCW network topology, and used the HLA data filtering mechanism for each federal member to establish the corresponding Mesh tree. During the simulation running period, this paper has added a new thread for the RTI and the CSCW real-time multicast interactive technology into the RTI, so that the RTI can also use the window message mechanism to notify the application update the display screen. Through many applications of submerged simulation training in substation under the operation of large power grid, it is shown that this paper has achieved satisfactory training effect on the collaborative technology used in distributed virtual reality simulation.

A Capacity Supply Model for Virtualized Servers

Directory of Open Access Journals (Sweden)

Alexander PINNOW

2009-01-01

Full Text Available This paper deals with determining the capacity supply for virtualized servers. First, a server is modeled as a queue based on a Markov chain. Then, the effect of server virtualization on the capacity supply will be analyzed with the distribution function of the server load.

Synchronous collaboration of virtual and remote laboratories

OpenAIRE

Jara, Carlos A.; Candelas-Herías, Francisco A.; Torres, Fernando; Dormido Bencomo, Sebastián; Esquembre Martínez, Francisco

2009-01-01

Virtual and remote laboratories(VRLs) are e-learning resources which enhance the accessibility of experimental setups providing a distance teaching framework which meets the student's hands-on learning needs. In addition, online collaborative communication represents a practical and a constructivist method to transmit the knowledge and experience from the teacher to students, overcoming physical distance and isolation. Thus, the integration of learning environments in the form of VRLs inside ...

Preventing messaging queue deadlocks in a DMA environment

Science.gov (United States)

Blocksome, Michael A; Chen, Dong; Gooding, Thomas; Heidelberger, Philip; Parker, Jeff

2014-01-14

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate and interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

Virtual Communities of Collaborative Learning for Higher Education

Directory of Open Access Journals (Sweden)

Gilda E. Sotomayor

2014-11-01

Full Text Available This article aims to outline and project three new learning scenarios for Higher Education that, after the emergence of ICT and communication through the Network-lnternet, have come under the generic name of virtual communities. To that end, we start from a previous conceptual analysis on collaborative learning, cooperative learning and related concepts taking place in these communities and serving as a basis for sorting them into three types in particular: communities of educational work of professional practice and scientific knowledge. Virtual communities where the activities undertaken and skills acquired are set as important parts of our personal learning development, wich are necessary to build the Knowledge Society.

Optimal purely functional priority queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Okasaki, Chris

1996-01-01

Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt...... Brodal's data structure to a purely functional setting. In doing so, we both simplify the data structure and clarify its relationship to the binomial queues of Vuillemin, which support all four operations in O(log n) time. Specifically, we derive our implementation from binomial queues in three steps......: first, we reduce the running time of insert to O(1) by eliminating the possibility of cascading links; second, we reduce the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain...

Does Gender Matter? Collaborative Learning in a Virtual Corporate Community of Practice

Science.gov (United States)

Tomcsik, Rachel E.

2010-01-01

The purpose of this study was to investigate how gender identity construction in virtuality and actuality affect collaborative learning in a corporate community of practice. As part of a virtual ethnographic design, participants were employees from a major American corporation who were interested specifically in social networking applications. The…

Fusion virtual laboratory: The experiments' collaboration platform in Japan

Energy Technology Data Exchange (ETDEWEB)

Nakanishi, H., E-mail: nakanisi@nifs.ac.jp [National Institute for Fusion Science, Toki, Gifu 509-5292 (Japan); Kojima, M.; Takahashi, C.; Ohsuna, M.; Imazu, S.; Nonomura, M. [National Institute for Fusion Science, Toki, Gifu 509-5292 (Japan); Hasegawa, M. [RIAM, Kyushu University, Kasuga, Fukuoka 816-8560 (Japan); Yoshikawa, M. [PRC, University of Tsukuba, Tsukuba, Ibaraki 305-8577 (Japan); Nagayama, Y.; Kawahata, K. [National Institute for Fusion Science, Toki, Gifu 509-5292 (Japan)

2012-12-15

'Fusion virtual laboratory (FVL)' is the experiments' collaboration platform covering multiple fusion projects in Japan. Major Japanese fusion laboratories and universities are mutually connected through the dedicated virtual private network, named SNET, on SINET4. It has 3 different categories; (i) LHD remote participation, (ii) bilateral experiments' collaboration, and (iii) remote use of supercomputer. By extending the LABCOM data system developed at LHD, FVL supports (i) and (ii) so that it can deal with not only LHD data but also the data of two remote experiments: QUEST at Kyushu University and GAMMA10 at University of Tsukuba. FVL has applied the latest 'cloud' technology for both data acquisition and storage architecture. It can provide us high availability and performance scalability of the whole system. With a well optimized TCP data transferring method, the unified data access platform for both experimental data and numerical computation results could become realistic on FVL. The FVL project will continue demonstrating the ITER-era international collaboration schemes and the necessary technology.

Dynamic server assignment in a two-queue model

NARCIS (Netherlands)

O.J. Boxma (Onno); D.G. Down

1995-01-01

textabstractWe consider a polling model of two $M/G/1$ queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level $T$ during a service at queue 2;

Dynamic server assignment in a two-queue model

NARCIS (Netherlands)

Boxma, O.J.; Down, D.G.

1997-01-01

We consider a polling model of two M/G/1 queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level T during a service at queue 2; in the latter

Implementing a collaborative virtual environment — specification for a usability metamodel

Directory of Open Access Journals (Sweden)

Maria L Villegas R

2009-01-01

Full Text Available This research presents the results of the first phase of a macro-project for constructing a collaborative virtual environment. It was aimed at selecting a graphical interface from five proposed for such environment, considering each one’s level of usability. Seve- ral standards of usability and user-centered design patterns were studied for specifying interface measurment criteria for speci- fying a usability metamodel; this defined the variables and rules to be taken into accout when measuring graphic user interface (GUI usability level for collaborative virtual environments. The use of metaphors when specifying graphic user interfaces is also briefly looked at as a source of new usability and satisfaction related to such interface use.

Random queues and risk averse users

DEFF Research Database (Denmark)

de Palma, André; Fosgerau, Mogens

2013-01-01

We analyze Nash equilibrium in time of use of a congested facility. Users are risk averse with general concave utility. Queues are subject to varying degrees of random sorting, ranging from strict queue priority to a completely random queue. We define the key “no residual queue” property, which...

A framework using cluster-based hybrid network architecture for collaborative virtual surgery.

Science.gov (United States)

Qin, Jing; Choi, Kup-Sze; Poon, Wai-Sang; Heng, Pheng-Ann

2009-12-01

Research on collaborative virtual environments (CVEs) opens the opportunity for simulating the cooperative work in surgical operations. It is however a challenging task to implement a high performance collaborative surgical simulation system because of the difficulty in maintaining state consistency with minimum network latencies, especially when sophisticated deformable models and haptics are involved. In this paper, an integrated framework using cluster-based hybrid network architecture is proposed to support collaborative virtual surgery. Multicast transmission is employed to transmit updated information among participants in order to reduce network latencies, while system consistency is maintained by an administrative server. Reliable multicast is implemented using distributed message acknowledgment based on cluster cooperation and sliding window technique. The robustness of the framework is guaranteed by the failure detection chain which enables smooth transition when participants join and leave the collaboration, including normal and involuntary leaving. Communication overhead is further reduced by implementing a number of management approaches such as computational policies and collaborative mechanisms. The feasibility of the proposed framework is demonstrated by successfully extending an existing standalone orthopedic surgery trainer into a collaborative simulation system. A series of experiments have been conducted to evaluate the system performance. The results demonstrate that the proposed framework is capable of supporting collaborative surgical simulation.

Transient queue-size distribution in a finite-capacity queueing system with server breakdowns and Bernoulli feedback

Science.gov (United States)

Kempa, Wojciech M.

2017-12-01

A finite-capacity queueing system with server breakdowns is investigated, in which successive exponentially distributed failure-free times are followed by repair periods. After the processing a customer may either rejoin the queue (feedback) with probability q, or definitely leave the system with probability 1 - q. The system of integral equations for transient queue-size distribution, conditioned by the initial level of buffer saturation, is build. The solution of the corresponding system written for Laplace transforms is found using the linear algebraic approach. The considered queueing system can be successfully used in modelling production lines with machine failures, in which the parameter q may be considered as a typical fraction of items demanding corrections. Morever, this queueing model can be applied in the analysis of real TCP/IP performance, where q stands for the fraction of packets requiring retransmission.

Analysis of the shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length, he joins either queue with probability ½. We show

Virtual Collaborative Simulation Environment for Integrated Product and Process Development

Science.gov (United States)

Gulli, Michael A.

1997-01-01

Deneb Robotics is a leader in the development of commercially available, leading edge three- dimensional simulation software tools for virtual prototyping,, simulation-based design, manufacturing process simulation, and factory floor simulation and training applications. Deneb has developed and commercially released a preliminary Virtual Collaborative Engineering (VCE) capability for Integrated Product and Process Development (IPPD). This capability allows distributed, real-time visualization and evaluation of design concepts, manufacturing processes, and total factory and enterprises in one seamless simulation environment.

Merging assistance function with task distribution model to enhance user performance in collaborative virtual environment

International Nuclear Information System (INIS)

Khalid, S.; Alam, A.

2016-01-01

Collaborative Virtual Environments (CVEs) falls under Virtual Reality (VR) where two or more users manipulate objects collaboratively. In this paper we have made some experiments to make assembly from constituents parts scattered in Virtual Environment (VE) based on task distribution model using assistance functions for checking and enhancing user performance. The CVEs subjects setting on distinct connected machines via local area network. In this perspective, we consider the effects of assistance function with oral communication on collaboration, co-presence and users performance. Twenty subjects performed collaboratively an assembly task on static and dynamic based task distribution. We examine the degree of influence of assistance function with oral communications on user's performance based on task distribution model. The results show that assistance functions with oral communication based on task distribution model not only increase user performance but also enhance the sense of copresence and awareness. (author)

Virtual Campus Hub: A single sign-on system for cross-border collaboration

DEFF Research Database (Denmark)

Badger, Merete; Vercoulen, F.; Monaco, L.

2013-01-01

laboratory exercises, examination tools, courses, collaboration tools, and tools to support the incubation of new small or medium size enterprises (SMEs). All of the applications serve as use cases for the demonstration of how the technology behind Virtual Campus Hub works. They can be accessed via...... in connection with joint educational programs and courses. These experiences are gained through a series of virtual events where users from the partners are invited to test each other’s applications. So far, testing of remote laboratory exercises, examination tools and an online course in wind energy has shown......Four technical universities in Europe work together in the EU-funded project Virtual Campus Hub (FP7 RI-283746, www.virtualcampushub.eu) to lower the technical barriers for cross-border collaboration. Universities have many connections to the outside world (e.g. to other universities, to joint...

Queueing for healthcare.

Science.gov (United States)

Palvannan, R Kannapiran; Teow, Kiok Liang

2012-04-01

Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones. This established theory helps us to quantify the appropriate service capacity to meet the patient demand, balancing system utilization and the patient's wait time. It considers four key factors that affect the patient's wait time: average patient demand, average service rate and the variation in both. We illustrate four basic insights that will be useful for managers and doctors who manage healthcare delivery systems, at hospital or department level. Two examples from local hospitals are shown where we have used queueing models to estimate the service capacity and analyze the impact of capacity configurations, while considering the inherent variation in healthcare.

Communication, Collaboration, and Enhancing the Learning Experience: Developing a Collaborative Virtual Enquiry Service in University Libraries in the North of England

Science.gov (United States)

Jolly, Liz; White, Sue

2016-01-01

This article uses the case study of developing a collaborative "out-of-hours" virtual enquiry service by members of the Northern Collaboration Group of academic libraries in the north of England to explore the importance of communication and collaboration between academic library services in enhancing student learning. Set within the…

Development of collaborative-creative learning model using virtual laboratory media for instrumental analytical chemistry lectures

Science.gov (United States)

Zurweni, Wibawa, Basuki; Erwin, Tuti Nurian

2017-08-01

The framework for teaching and learning in the 21st century was prepared with 4Cs criteria. Learning providing opportunity for the development of students' optimal creative skills is by implementing collaborative learning. Learners are challenged to be able to compete, work independently to bring either individual or group excellence and master the learning material. Virtual laboratory is used for the media of Instrumental Analytical Chemistry (Vis, UV-Vis-AAS etc) lectures through simulations computer application and used as a substitution for the laboratory if the equipment and instruments are not available. This research aims to design and develop collaborative-creative learning model using virtual laboratory media for Instrumental Analytical Chemistry lectures, to know the effectiveness of this design model adapting the Dick & Carey's model and Hannafin & Peck's model. The development steps of this model are: needs analyze, design collaborative-creative learning, virtual laboratory media using macromedia flash, formative evaluation and test of learning model effectiveness. While, the development stages of collaborative-creative learning model are: apperception, exploration, collaboration, creation, evaluation, feedback. Development of collaborative-creative learning model using virtual laboratory media can be used to improve the quality learning in the classroom, overcome the limitation of lab instruments for the real instrumental analysis. Formative test results show that the Collaborative-Creative Learning Model developed meets the requirements. The effectiveness test of students' pretest and posttest proves significant at 95% confidence level, t-test higher than t-table. It can be concluded that this learning model is effective to use for Instrumental Analytical Chemistry lectures.

Optimal dispatching in a tandem queue

NARCIS (Netherlands)

van Leeuwen, D.; Núñez Queija, R.

2017-01-01

We investigate a Markovian tandem queueing model in which service to the first queue is provided in batches. The main goal is to choose the batch sizes so as to minimize a linear cost function of the mean queue lengths. This model can be formulated as a Markov Decision Process (MDP) for which the

The Proposed Model of Collaborative Virtual Learning Environment for Introductory Programming Course

Science.gov (United States)

Othman, Mahfudzah; Othman, Muhaini

2012-01-01

This paper discusses the proposed model of the collaborative virtual learning system for the introductory computer programming course which uses one of the collaborative learning techniques known as the "Think-Pair-Share". The main objective of this study is to design a model for an online learning system that facilitates the…

Lévy-driven queues

NARCIS (Netherlands)

Debicki, K.G.; Mandjes, M.R.H.

2012-01-01

This survey addresses the class of queues with Lévy input, which covers the classical M/G/1 queue and the reflected Brownian motion as special cases. First the stationary behavior is treated, with special attention to the case of the input process having one-sided jumps (i.e., spectrally one-sided

The ×-BMAP/G/1 Queueing Model: Queue Contents and Delay Analysis

Directory of Open Access Journals (Sweden)

Bart Steyaert

2011-01-01

Full Text Available We consider a single-server discrete-time queueing system with N sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum.

Fast meldable priority queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting

1995-01-01

We present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations wh...

Priority Queues Resilient to Memory Faults

DEFF Research Database (Denmark)

Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas

2007-01-01

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we...... introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses $O(n)$ space to store $n$ elements. Both insert and deletemin operations are performed in $O(\\log n......+\\delta)$ time amortized, where $\\delta$ is the maximum amount of corruptions tolerated. Our priority queue matches the performance of classical optimal priority queues in the RAM model when the number of corruptions tolerated is $O(\\log n)$. We prove matching worst case lower bounds for resilient priority...

Collaboration and Virtualization in Large Information Systems Projects

Directory of Open Access Journals (Sweden)

Stefan Ioan NITCHI

2009-01-01

Full Text Available A project is evolving through different phases from idea and conception until the experiments, implementation and maintenance. The globalization, the Internet, the Web and the mobile computing changed many human activities, and in this respect, the realization of the Information System (IS projects. The projects are growing, the teams are geographically distributed, and the users are heterogeneous. In this respect, the realization of the large Information Technology (IT projects needs to use collaborative technologies. The distribution of the team, the users' heterogeneity and the project complexity determines the virtualization. This paper is an overview of these aspects for large IT projects. It shortly present a general framework developed by the authors for collaborative systems in general and adapted to collaborative project management. The general considerations are illustrated on the case of a large IT project in which the authors were involved.

Priority Queues Resilient to Memory Faults

DEFF Research Database (Denmark)

Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas

2007-01-01

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we...... introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses $O(n)$ space to store $n$ elements. Both insert and deletemin operations are performed in $O(\\log n...... queues storing only structural information in the uncorruptible registers between operations....

Collaboratively Analysing Open Research Data in Virtual Research Environments–New Visionary Use Cases

NARCIS (Netherlands)

Zuiderwijk-van Eijk, AMG; Matheus, R.

Virtual Research Environments (VREs) offer new opportunities for collaboratively analysing open research data. This workshop builds on a workshop that we gave at CeDEM16 and aims to refine and discuss requirements for collaboratively analysing Open Government Data (OGD) and open research data

Survey on queueing models with standbys support

Directory of Open Access Journals (Sweden)

Kolledath Sreekanth

2018-01-01

Full Text Available This paper is a survey article on queueing models with standbys support. Due to many real life applications of queueing models, it has become an interesting area for researchers and a lot of research work has been exerted so far. It is worthwhile to examine the performance based analysis for queueing modelling system as it provides a valuable insight to the tractability of the system and accelerates its efficiency. The provision of standbys to the queueing modelling of a real system is needed for smooth functioning in the presence of its unavoidable failures. The present survey provides a dig into the research work done, and emphasis the sequential developments on queueing models with standbys support.

A collaborative virtual environment for training of security agents in nuclear emergencies

Energy Technology Data Exchange (ETDEWEB)

Fernandes, Sara I.; Passos, Cláudio A.; Silva, Marcio H.; Carvalho, Paulo Victor R.; Legey, Ana Paula; Mol, Antonio Carlos; Machado, Daniel M.; Cotelli, André; Rocha, Tiago L., E-mail: mol@ien.gov.br [Instituto de Engenharia Nuclear (IEN/CNEN-RJ), Rio de Janeiro, RJ (Brazil). Departamento de Realidade Virtual

2017-07-01

In face the recently observed security menaces related to terrorist actions and natural disasters, there is a need for a major qualification and training of the agents responsible for avoid any problems regarding to abnormal conditions. In the conventional training procedures, however, field simulations are associated to logistical and operational constraints regarded to the execution of the tests which can expose the user to risk. On the other hand, the use of virtual simulations provides an alternative to such limitations besides of promote the qualifying of professionals with a great reliability. For this reason, this paper proposes the development of a collaborative virtual environment that will be used to prepare the security agents on identifying individuals suspected of carrying radioactive materials. The development of the virtual environment consisted on modeling using Autodesk 3ds Max, where the scene itself and the scene objects were modeled besides the terrain creation and basic features programming using the Game Engine Unity 3D. In the Engine Game were included radiation detectors and avatars. The security agents were able to communicate to each other by means of auxiliary external tools like a headset software that makes possible the communication, coordination and cooperation required for an effective collaboration. Experimental tests of the virtual simulations were performed with the participation of CNEN radiological protection agents and collaborators. The tests have shown that the proposed method can contribute to improve the training results of the basic collaborative skills required for a CNEN agent in an emergency situation without the need to expose him to any kind of risk. In face of that, we hope that it can contribute to minimize the demand for qualified security professionals. (author)

A collaborative virtual environment for training of security agents in nuclear emergencies

International Nuclear Information System (INIS)

Fernandes, Sara I.; Passos, Cláudio A.; Silva, Marcio H.; Carvalho, Paulo Victor R.; Legey, Ana Paula; Mol, Antonio Carlos; Machado, Daniel M.; Cotelli, André; Rocha, Tiago L.

2017-01-01

In face the recently observed security menaces related to terrorist actions and natural disasters, there is a need for a major qualification and training of the agents responsible for avoid any problems regarding to abnormal conditions. In the conventional training procedures, however, field simulations are associated to logistical and operational constraints regarded to the execution of the tests which can expose the user to risk. On the other hand, the use of virtual simulations provides an alternative to such limitations besides of promote the qualifying of professionals with a great reliability. For this reason, this paper proposes the development of a collaborative virtual environment that will be used to prepare the security agents on identifying individuals suspected of carrying radioactive materials. The development of the virtual environment consisted on modeling using Autodesk 3ds Max, where the scene itself and the scene objects were modeled besides the terrain creation and basic features programming using the Game Engine Unity 3D. In the Engine Game were included radiation detectors and avatars. The security agents were able to communicate to each other by means of auxiliary external tools like a headset software that makes possible the communication, coordination and cooperation required for an effective collaboration. Experimental tests of the virtual simulations were performed with the participation of CNEN radiological protection agents and collaborators. The tests have shown that the proposed method can contribute to improve the training results of the basic collaborative skills required for a CNEN agent in an emergency situation without the need to expose him to any kind of risk. In face of that, we hope that it can contribute to minimize the demand for qualified security professionals. (author)

Networking support for collaborative virtual reality projects in national, european and international context

OpenAIRE

Hommes, F.; Pless, E.

2004-01-01

The report describes experiences from networking support for two three years virtual reality projects. Networking requirements depending on the virtual reality environment and the planned distributed scenarios are specified and verified in the real network. Networking problems especially due to the collaborative, distributed character of interaction via the Internet are presented.

Design and evaluation of virtual environments mechanisms to support remote collaboration on complex process diagrams

NARCIS (Netherlands)

Poppe, E.; Brown, R.; Recker, J.; Johnson, D.; Vanderfeesten, I.T.P.

2017-01-01

Many organizational analysis tasks are solved by collaborating teams. In technology-mediated collaborations, enabling relevant visual cues is a core issue with existing technology. We explore whether avatars can provide relevant cues in collaborative virtual environments. To do so, we develop a

Equilibrium Arrival Times to Queues

DEFF Research Database (Denmark)

Breinbjerg, Jesper; Østerdal, Lars Peter

We consider a non-cooperative queueing environment where a finite number of customers independently choose when to arrive at a queueing system that opens at a given point in time and serves customers on a last-come first-serve preemptive-resume (LCFS-PR) basis. Each customer has a service time...... requirement which is identically and independently distributed according to some general probability distribution, and they want to complete service as early as possible while minimizing the time spent in the queue. In this setting, we establish the existence of an arrival time strategy that constitutes...... a symmetric (mixed) Nash equilibrium, and show that there is at most one symmetric equilibrium. We provide a numerical method to compute this equilibrium and demonstrate by a numerical example that the social effciency can be lower than the effciency induced by a similar queueing system that serves customers...

Multiserver Queue with Guard Channel for Priority and Retrial Customers

Directory of Open Access Journals (Sweden)

Kazuki Kajiwara

2016-01-01

Full Text Available This paper considers a retrial queueing model where a group of guard channels is reserved for priority and retrial customers. Priority and normal customers arrive at the system according to two distinct Poisson processes. Priority customers are accepted if there is an idle channel upon arrival while normal customers are accepted if and only if the number of idle channels is larger than the number of guard channels. Blocked customers (priority or normal join a virtual orbit and repeat their attempts in a later time. Customers from the orbit (retrial customers are accepted if there is an idle channel available upon arrival. We formulate the queueing system using a level dependent quasi-birth-and-death (QBD process. We obtain a Taylor series expansion for the nonzero elements of the rate matrices of the level dependent QBD process. Using the expansion results, we obtain an asymptotic upper bound for the joint stationary distribution of the number of busy channels and that of customers in the orbit. Furthermore, we develop an efficient numerical algorithm to calculate the joint stationary distribution.

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability 1/2. By

Analysis of queues methods and applications

CERN Document Server

Gautam, Natarajan

2012-01-01

Introduction Analysis of Queues: Where, What, and How?Systems Analysis: Key ResultsQueueing Fundamentals and Notations Psychology in Queueing Reference Notes Exercises Exponential Interarrival and Service Times: Closed-Form Expressions Solving Balance Equations via Arc CutsSolving Balance Equations Using Generating Functions Solving Balance Equations Using Reversibility Reference Notes ExercisesExponential Interarrival and Service Times: Numerical Techniques and Approximations Multidimensional Birth and Death ChainsMultidimensional Markov Chains Finite-State Markov ChainsReference Notes Exerci

The Ulwazi Concept: Virtual interactive and collaborative classrooms of the Future

CSIR Research Space (South Africa)

Beyers, R

2006-08-01

Full Text Available The Ulwazi concept is based on the digital inclusion of geographically separated classrooms being linked by broadband radio connections to enable virtual interactive and collaborative lessons using SMART technologies. What started out as a simple...

Queues and Lévy fluctuation theory

CERN Document Server

Dębicki, Krzysztof

2015-01-01

The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades, including transform-based techniques, martingales, rate-conservation arguments, change-of-measure, importance sampling, and large deviations. On the application side, it demonstrates how Lévy traffic models arise when modelling current queueing-type systems (as communication networks) and includes applications to finance. Queues and Lévy Fluctuation Theory will appeal to graduate/postgraduate students and researchers in mathematics, computer science, and electrical engineering. Basic prerequisites are probability theory and stochastic processes.

A Survey on Priority Queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting

2013-01-01

Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority qu...

The Link Class Project: Collaborative virtual teams between Peru and The Netherlands

OpenAIRE

Mariella Olivos Rossini; Sandra Rincón; Anne-Francoise Rutkowski

2015-01-01

The Link Class Project presented in this article provides an example of established collaborative group activities to negotiate and build a report together in virtual teams composed of students at Universidad ESAN, Lima (Peru) and Tilburg University, Tilburg (Netherlands). It further analyzes the effects of a campus based internationalization strategy supported by the use of technology. Based on previous experiences with virtual classrooms, the authors adhere to the ancient Chinese philosophe...

On the single-server retrial queue

Directory of Open Access Journals (Sweden)

Djellab Natalia V.

2006-01-01

Full Text Available In this work, we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under exponential assumption for retrial times as an approximation in the non-exponential case, we consider an approximate solution for the steady-state queue size distribution.

The development of a collaborative virtual environment for finite element simulation

Science.gov (United States)

Abdul-Jalil, Mohamad Kasim

Communication between geographically distributed designers has been a major hurdle in traditional engineering design. Conventional methods of communication, such as video conferencing, telephone, and email, are less efficient especially when dealing with complex design models. Complex shapes, intricate features and hidden parts are often difficult to describe verbally or even using traditional 2-D or 3-D visual representations. Virtual Reality (VR) and Internet technologies have provided a substantial potential to bridge the present communication barrier. VR technology allows designers to immerse themselves in a virtual environment to view and manipulate this model just as in real-life. Fast Internet connectivity has enabled fast data transfer between remote locations. Although various collaborative virtual environment (CVE) systems have been developed in the past decade, they are limited to high-end technology that is not accessible to typical designers. The objective of this dissertation is to discover and develop a new approach to increase the efficiency of the design process, particularly for large-scale applications wherein participants are geographically distributed. A multi-platform and easily accessible collaborative virtual environment (CVRoom), is developed to accomplish the stated research objective. Geographically dispersed designers can meet in a single shared virtual environment to discuss issues pertaining to the engineering design process and to make trade-off decisions more quickly than before, thereby speeding the entire process. This 'faster' design process will be achieved through the development of capabilities to better enable the multidisciplinary and modeling the trade-off decisions that are so critical before launching into a formal detailed design. The features of the environment developed as a result of this research include the ability to view design models, use voice interaction, and to link engineering analysis modules (such as Finite

Designing of vague logic based multilevel feedback queue scheduler

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-03-01

Full Text Available Multilevel feedback queue scheduler suffers from major issues of scheduling such as starvation for long tasks, fixed number of queues, and static length of time quantum in each queue. These factors directly affect the performance of the scheduler. At many times impreciseness exists in attributes of tasks which make the performance even worse. In this paper, our intent is to improve the performance by providing a solution to these issues. We design a multilevel feedback queue scheduler using a vague set which we call as VMLFQ scheduler. VMLFQ scheduler intelligently handles the impreciseness and defines the optimum number of queues as well as the optimal size of time quantum for each queue. It also resolves the problem of starvation. This paper simulates and analyzes the performance of VMLFQ scheduler with the other multilevel feedback queue techniques using MatLab.

Toward a New Understanding of Virtual Research Collaborations

Directory of Open Access Journals (Sweden)

Arsev Umur Aydinoglu

2013-10-01

Full Text Available Virtual research collaborations (VRCs have become an important method of conducting scientific activity; however, they are often regarded and treated as traditional scientific collaborations. Their success is measured by scholarly productivity and adherence to budget by funding agencies, participating scientists, and scholars. VRCs operate in complex environments interacting with other complex systems. A holistic (or organicist approach is needed to make sense of this complexity. For that purpose, this study proposes using a new perspective, namely, the complex adaptive systems theory that can provide a better understanding of a VRC’s potential creativity, adaptability, resilience, and probable success. The key concepts of complex systems (diversity, interaction, interdependency, feedback, emergence, and adaptation utilized in organization studies are used to discuss the behaviors of VRCs, illustrated with real-life examples.

Markov queue game with virtual reality strategies | Nwobi-Okoye ...

African Journals Online (AJOL)

A non cooperative markov game with several unique characteristics was introduced. Some of these characteristics include: the existence of a single phase multi server queuing model and markovian transition matrix/matrices for each game, introduction of virtual situations (virtual reality) or dummies to improve the chances ...

Perfecting Scientists' Collaboration and Problem-Solving Skills in the Virtual Team Environment

Science.gov (United States)

Jabro, A.; Jabro, J.

2012-04-01

PPerfecting Scientists' Collaboration and Problem-Solving Skills in the Virtual Team Environment Numerous factors have contributed to the proliferation of conducting work in virtual teams at the domestic, national, and global levels: innovations in technology, critical developments in software, co-located research partners and diverse funding sources, dynamic economic and political environments, and a changing workforce. Today's scientists must be prepared to not only perform work in the virtual team environment, but to work effectively and efficiently despite physical and cultural barriers. Research supports that students who have been exposed to virtual team experiences are desirable in the professional and academic arenas. Research supports establishing and maintaining established protocols for communication behavior prior to task discussion provides for successful team outcomes. Research conducted on graduate and undergraduate virtual teams' behaviors led to the development of successful pedagogic practices and assessment strategies.

Fundamentals of queueing theory

CERN Document Server

Gross, Donald; Thompson, James M; Harris, Carl M

2013-01-01

Praise for the Third Edition ""This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented.""-IIE Transactions on Operations Engineering Thoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than pre

Implementation of shared queues

OpenAIRE

Motte, Nicolas

2012-01-01

The transactional framework used to develop Amadeus C++ applications is based on a mechanism of queues to manage the message exchanges between components. These structures are protected from concurrent access thanks to synchronization services provided by Linux. But theses services have a cost in term of performance and they bound the volume of messages transmitted by these queues. In a first step, I have to investigate on the state-of-the-art in term of management algorithms o...

Study of cognitive and technological prerequisites for virtual laboratories and collaborative virtual environments for radiopharmacy

International Nuclear Information System (INIS)

Melo, Roberto Correia de

2009-01-01

This academic work explains a general view of virtual laboratories (VL) and collaborative virtual environments (CVE) (called, together, a VL/CVE set), focusing their technological features and analyzing the common cognitive features of their users. Also is presented a detailed description of VL/CVE VirRAD (Virtual Radiopharmacy), created specially to connect and support the international radiopharmacy community around the world, and is explained an analysis of their users' cognitive profile, under the perspective of two of the most important cognitive theories of the 20th century: multiple intelligences, by Howard Gardner, and mindful learning, by Ellen Langer. Conclusions from this study has been incorporated, as feature enhancements, to a software prototype created based upon VirRAD software solution, and the hardcopy of their screens is exposed at the end of this work. It is also an essential idea that the conclusions of this work are relevant to any VL/CVE environment. (author)

Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case

Directory of Open Access Journals (Sweden)

Charles Knessl

2011-01-01

Full Text Available We consider two coupled queues with a generalized processor sharing service discipline. The second queue has a much smaller Poisson arrival rate than the first queue, while the customer service times are of comparable magnitude. The processor sharing server devotes most of its resources to the first queue, except when it is empty. The fraction of resources devoted to the second queue is small, of the same order as the ratio of the arrival rates. We assume that the primary queue is heavily loaded and that the secondary queue is critically loaded. If we let the small arrival rate to the secondary queue be O(ε, where 0≤ε≪1, then in this asymptotic limit the number of customers in the first queue will be large, of order O(ε-1, while that in the second queue will be somewhat smaller, of order O(ε-1/2. We obtain a two-dimensional diffusion approximation for this model and explicitly solve for the joint steady state probability distribution of the numbers of customers in the two queues. This work complements that in (Morrison, 2010, which the second queue was assumed to be heavily or lightly loaded, leading to mean queue lengths that were O(ε-1 or O(1, respectively.

Mathematical Analysis of Queue with Phase Service: An Overview

Directory of Open Access Journals (Sweden)

Richa Sharma

2014-01-01

Full Text Available We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent.

Near-optimal switching strategies for a tandem queue

NARCIS (Netherlands)

van Leeuwen, D.; Núñez-Queija, R.; Boucherie, R.J.; van Dijk, N.M.

2017-01-01

Motivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as possible,

Near-optimal switching strategies for a tandem queue

NARCIS (Netherlands)

D. van Leeuwen (Daphne); R. Núñez Queija (Rudesindo)

2017-01-01

textabstractMotivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as

Performance optimization of queueing systems with perturbation realization

KAUST Repository

Xia, Li

2012-04-01

After the intensive studies of queueing theory in the past decades, many excellent results in performance analysis have been obtained, and successful examples abound. However, exploring special features of queueing systems directly in performance optimization still seems to be a territory not very well cultivated. Recent progresses of perturbation analysis (PA) and sensitivity-based optimization provide a new perspective of performance optimization of queueing systems. PA utilizes the structural information of queueing systems to efficiently extract the performance sensitivity information from a sample path of system. This paper gives a brief review of PA and performance optimization of queueing systems, focusing on a fundamental concept called perturbation realization factors, which captures the special dynamic feature of a queueing system. With the perturbation realization factors as building blocks, the performance derivative formula and performance difference formula can be obtained. With performance derivatives, gradient-based optimization can be derived, while with performance difference, policy iteration and optimality equations can be derived. These two fundamental formulas provide a foundation for performance optimization of queueing systems from a sensitivity-based point of view. We hope this survey may provide some inspirations on this promising research topic. © 2011 Elsevier B.V. All rights reserved.

Enhanced virtual microscopy for collaborative education

Directory of Open Access Journals (Sweden)

Holloway William J

2011-01-01

Full Text Available Abstract Background Curricular reform efforts and a desire to use novel educational strategies that foster student collaboration are challenging the traditional microscope-based teaching of histology. Computer-based histology teaching tools and Virtual Microscopes (VM, computer-based digital slide viewers, have been shown to be effective and efficient educational strategies. We developed an open-source VM system based on the Google Maps engine to transform our histology education and introduce new teaching methods. This VM allows students and faculty to collaboratively create content, annotate slides with markers, and it is enhanced with social networking features to give the community of learners more control over the system. Results We currently have 1,037 slides in our VM system comprised of 39,386,941 individual JPEG files that take up 349 gigabytes of server storage space. Of those slides 682 are for general teaching and available to our students and the public; the remaining 355 slides are used for practical exams and have restricted access. The system has seen extensive use with 289,352 unique slide views to date. Students viewed an average of 56.3 slides per month during the histology course and accessed the system at all hours of the day. Of the 621 annotations added to 126 slides 26.2% were added by faculty and 73.8% by students. The use of the VM system reduced the amount of time faculty spent administering the course by 210 hours, but did not reduce the number of laboratory sessions or the number of required faculty. Laboratory sessions were reduced from three hours to two hours each due to the efficiencies in the workflow of the VM system. Conclusions Our virtual microscope system has been an effective solution to the challenges facing traditional histopathology laboratories and the novel needs of our revised curriculum. The web-based system allowed us to empower learners to have greater control over their content, as well as the

Optimal control of arrival and service rates in tandem queues

International Nuclear Information System (INIS)

Moustafa, M.S.

1995-08-01

We consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue L (L=1,2,...,n-1) must go on to queue L+1 after finishing service at server L. Customers arriving to queue n leave the system after finishing service at the last server. At queues 2 to n arrival and service rates are fixed. The objective is to minimize the expected discounted cost of the system over finite and infinite horizons. We show that the optimal policy is of threshold type. In order to establish the result, we formulate the optimal control problem as a Linear Programming. (author). 9 refs

Virtuality and efficiency - overcoming past antinomy in the remote collaboration experience

International Nuclear Information System (INIS)

Fernandes, Joao; Bjorkli, Knut; Clavo, David Martin; Baron, Thomas

2010-01-01

Several recent initiatives have been put in place by the CERN IT Department to improve the user experience in remote dispersed meetings and remote collaboration at large in the LHC communities worldwide. We will present an analysis of the factors which were historically limiting the efficiency of remote dispersed meetings and describe the consequent actions which were undertaken at CERN to overcome these limitations. After giving a status update of the different equipment available at CERN to enable the virtual sessions and the various collaborative tools which are currently proposed to users, we will focus on the evolution of this market: how can the new technological trends (among others, HD videoconferencing, Telepresence, Unified Communications, etc.) impact positively the user experience and how to attain the best usage of them. Finally, by projecting ourselves in the future, we will give some hints as to how to answer the difficult question of selecting the next generation of collaborative tools: which set of tools among the various offers (systems like Vidyo H264 SVC, next generation EVO, Groupware offers, standard H323 systems, etc.) is best suited for our environment and how to unify this set for the common user. This will finally allow us to definitively overcome the past antinomy between virtuality and efficiency.

GPS queues with heterogeneous traffic classes

NARCIS (Netherlands)

Borst, Sem; Mandjes, M.R.H.; van Uitert, Miranda

2002-01-01

We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic classes are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for

Collaborative virtual reality environments for computational science and design

International Nuclear Information System (INIS)

Papka, M. E.

1998-01-01

The authors are developing a networked, multi-user, virtual-reality-based collaborative environment coupled to one or more petaFLOPs computers, enabling the interactive simulation of 10 9 atom systems. The purpose of this work is to explore the requirements for this coupling. Through the design, development, and testing of such systems, they hope to gain knowledge that allows computational scientists to discover and analyze their results more quickly and in a more intuitive manner

Celebrating international collaboration: reflections on the first Virtual International Practice Development Conference

Directory of Open Access Journals (Sweden)

Moira Stephens

2016-11-01

Full Text Available This article reports on the first Virtual International Practice Development Conference, held in May 2015 to celebrate International Nurses Day. The article describes key aspects of its planning, offers a flavour of the event itself and sets out an evaluation, including learning points and recommendations to assist with planning similar events in the future. Central to our learning are: The need for practice developers to grasp skills in technology associated with virtual space The need to embrace virtual space itself as another means by which creative and communicative spaces can be established for active learning and practice development activities The potential advantages that international virtual engagement has over face-to-face national or international engagement The delivery of this virtual event made a significant international contribution to global practice development activity within the International Practice Development Collaborative and to enabling practice developers to connect and celebrate on a more global basis. Implications for practice: Virtual space technology skills can assist with sharing and translating practice development research, innovations and critical commentary Virtual space can provide an adjunct to creative and communicative learning spaces Global networking opportunities can be developed and enhanced through the use of virtual space technology Practice developers need to role model the use of virtual technologies

Prospects for Digital Campus with Extensive Applications of Virtual Collaborative Space

Science.gov (United States)

Nishide, Ryo

2011-01-01

This paper proposes extensive applications of virtual collaborative space in order to enhance the efficiency and capability of Digital Campus. The usability of Digital Campus has been experimented in different learning environments and evaluated by questionnaire as that the presence technology and a sense of solidarity influence the participants'…

Queues and Lévy Fluctuation Theory

NARCIS (Netherlands)

Dębicki, K.; Mandjes, M.

2015-01-01

The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades,

The link class project : Collaborative virtual teams between Peru and The Netherlands

NARCIS (Netherlands)

Olivos Rossini, L.M.; Rincon, Sandra; Rutkowski, Anne-Francoise

2015-01-01

The Link Class Project presented in this article provides an example of established collaborative group activities to negotiate and build a report together in virtual teams composed of students at Universidad ESAN, Lima (Peru) and Tilburg University, Tilburg (Netherlands). It further analyzes the

Virtually teaching virtual leadership

DEFF Research Database (Denmark)

Henriksen, Thomas Duus; Nielsen, Rikke Kristine; Børgesen, Kenneth

2017-01-01

This paper seeks to investigate the challenges to virtual collaboration and leadership on basis of findings from a virtual course on collaboration and leadership. The course used for this experiment was designed as a practical approach, which allowed participants to experience curriculum phenomena....... This experimental course provided insights into the challenges involved in virtual processes, and those experiences where used for addressing the challenges that virtual leadership is confronted with. Emphasis was placed on the reduction of undesired virtual distance and its consequences through affinity building....... We found that student scepticism appeared when a breakdown resulted in increasing virtual distance, and raises questions on how leaders might translate or upgrade their understandings of leadership to handling such increased distance through affinity building....

Transient analysis of a queue with queue-length dependent MAP and its application to SS7 network

Directory of Open Access Journals (Sweden)

Bong Dae Choi

1999-01-01

Full Text Available We analyze the transient behavior of a Markovian arrival queue with congestion control based on a double of thresholds, where the arrival process is a queue-length dependent Markovian arrival process. We consider Markov chain embedded at arrival epochs and derive the one-step transition probabilities. From these results, we obtain the mean delay and the loss probability of the nth arrival packet. Before we study this complex model, first we give a transient analysis of an MAP/M/1 queueing system without congestion control at arrival epochs. We apply our result to a signaling system No. 7 network with a congestion control based on thresholds.

Exploiting Virtualization and Cloud Computing in ATLAS

CERN Multimedia

CERN. Geneva

2012-01-01

This work will present the current status of the Virtualization and Cloud Computing R&D project in ATLAS Distributed Computing. First, strategies for deploying PanDA queues on cloud sites will be discussed, including the introduction of a "cloud factory" for managing cloud VM instances. Ne...

Difference and differential equations with applications in queueing theory

CERN Document Server

Haghighi, Aliakbar Montazer

2013-01-01

  A Useful Guide to the Interrelated Areas of Differential Equations, Difference Equations, and Queueing Models Difference and Differential Equations with Applications in Queueing Theory presents the unique connections between the methods and applications of differential equations, difference equations, and Markovian queues. Featuring a comprehensive collection of

Study on the Queue-Length Distribution in Geo/G(MWV/1/N Queue with Working Vacations

Directory of Open Access Journals (Sweden)

Chuanyi Luo

2015-01-01

Full Text Available This paper analyzes a finite buffer size discrete-time Geo/G/1/N queue with multiple working vacations and different input rate. Using supplementary variable technique and embedded Markov chain method, the queue-length distribution solution in the form of formula at arbitrary epoch is obtained. Some performance measures associated with operating cost are also discussed based on the obtained queue-length distribution. Then, several numerical experiments follow to demonstrate the effectiveness of the obtained formulae. Finally, a state-dependent operating cost function is constructed to model an express logistics service center. Regarding the service rate during working vacation as a control variable, the optimization analysis on the cost function is carried out by using parabolic method.

Tandem queue with server slow-down

NARCIS (Netherlands)

Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

2007-01-01

We study how rare events happen in the standard two-node tandem Jackson queue and in a generalization, the socalled slow-down network, see [2]. In the latter model the service rate of the first server depends on the number of jobs in the second queue: the first server slows down if the amount of

Adaptive Filtering Queueing for Improving Fairness

Directory of Open Access Journals (Sweden)

Jui-Pin Yang

2015-06-01

Full Text Available In this paper, we propose a scalable and efficient Active Queue Management (AQM scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ. First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the accepted traffic estimation and the previous fair filtering level, AFQ updates the fair filtering level. Next, AFQ uses a simple packet-dropping algorithm to determine whether arriving packets are accepted or discarded. To enhance AFQ’s feasibility in high-speed networks, we propose a two-layer mapping mechanism to effectively simplify the packet comparison operations. Simulation results demonstrate that AFQ achieves optimal fairness when compared with Rotating Preference Queues (RPQ, Core-Stateless Fair Queueing (CSFQ, CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows (CHOKe and First-In First-Out (FIFO schemes under a variety of traffic conditions.

Queue Length and Server Content Distribution in an Infinite-Buffer Batch-Service Queue with Batch-Size-Dependent Service

Directory of Open Access Journals (Sweden)

U. C. Gupta

2015-01-01

Full Text Available We analyze an infinite-buffer batch-size-dependent batch-service queue with Poisson arrival and arbitrarily distributed service time. Using supplementary variable technique, we derive a bivariate probability generating function from which the joint distribution of queue and server content at departure epoch of a batch is extracted and presented in terms of roots of the characteristic equation. We also obtain the joint distribution of queue and server content at arbitrary epoch. Finally, the utility of analytical results is demonstrated by the inclusion of some numerical examples which also includes the investigation of multiple zeros.

COLLABORATIVE AND SELF-DIRECTED LEARNING IN A VIRTUAL CAMPUS ENVIRONMENT: A POTENTIAL SOLUTION FOR OUR YEARS?

Directory of Open Access Journals (Sweden)

Alina Cristina DAMIAN

2014-02-01

Full Text Available In the current society, where the information flow has a big impact on the learner, and the learning methods differ from student to student, it is important to understand a virtual campus and its benefits. Nobody can doubt the impact of the new technologies on the educational system. In this new reality, universities must learn to work and collaborate with other universities or groups of interest in order to prepare learners to meet the requirements of the 21st century.  The solution can be a virtual campus that offers powerful tools, access to content and services, personal learning environment, enabling the student to acquire information and learn new skills. This article offers on overview of a virtual campus and the prototype of learner that is suitable for it. The accent falls on two of the skills that a learner must have: self directed learning and of course collaborative learning. The first concept refers to the learner’s capabilities to be responsible of his decisions regarding the learning process and to take the initiative while the second one is based on the fact that a virtual campus is built on collaborative processes that engage stakeholders to interact and learn from each other.

An Approach to Active Queue Management in Computer Network

OpenAIRE

Asimkiran Dandapat

2016-01-01

Active queue management is a key technique for reducing the packet drop rate in the internet. This packet dropping mechanism is used in a router to minimize congestion when the packets are dropped before queue gets full. In this paper a new framework of Active queue management namely MYRED is proposed. The goal of this new scheme is to improve the performance of AQM by keeping router queue length optimized. In RED packets are marked or dropped with a statistical probability before packet buff...

A two-queue model with alternating limited service and state-dependent setups

NARCIS (Netherlands)

Winands, E.M.M.; Adan, I.J.B.F.; Houtum, van G.J.J.A.N.; Papadopoulos, C.T.

2005-01-01

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. We obtain the transforms of the queue length and

State-dependent importance sampling for a slowdown tandem queue

NARCIS (Netherlands)

Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

2011-01-01

In this paper we investigate an advanced variant of the classical (Jackson) tandem queue, viz. a two-node system with server slowdown. By this mechanism, the service speed of the upstream queue is reduced as soon as the number of jobs in the downstream queue reaches some pre-specified threshold. We

The curse of the first-in-first-out queue discipline

DEFF Research Database (Denmark)

Platz, Trine Tornøe; Østerdal, Lars Peter Raahave

2017-01-01

We consider a game in which a large number of identical agents choose when to queue up at a single server after it opens. Agents are impatient for service and also incur a cost proportional to time spent in the queue. We show that the first-in–first-out queue discipline and the last......-in–first-out queue discipline both lead to a unique equilibrium arrival distribution. However, among all work-conserving queue disciplines, the first-in–first-out performs the worst in terms of equilibrium utility and welfare, while the last-in–first-out performs the best....

Markovian inventory model with two parallel queues, jockeying and impatient customers

Directory of Open Access Journals (Sweden)

Jeganathan K.

2016-01-01

Full Text Available This article presents a perishable stochastic inventory system under continuous review at a service facility consisting of two parallel queues with jockeying. Each server has its own queue, and jockeying among the queues is permitted. The capacity of each queue is of finite size L. The inventory is replenished according to an (s; S inventory policy and the replenishing times are assumed to be exponentially distributed. The individual customer is issued a demanded item after a random service time, which is distributed as negative exponential. The life time of each item is assumed to be exponential. Customers arrive according to a Poisson process and on arrival; they join the shortest feasible queue. Moreover, if the inventory level is more than one and one queue is empty while in the other queue, more than one customer are waiting, then the customer who has to be received after the customer being served in that queue is transferred to the empty queue. This will prevent one server from being idle while the customers are waiting in the other queue. The waiting customer independently reneges the system after an exponentially distributed amount of time. The joint probability distribution of the inventory level, the number of customers in both queues, and the status of the server are obtained in the steady state. Some important system performance measures in the steady state are derived, so as the long-run total expected cost rate.

The Synergy of applying virtual collaboration tools and problem-based approach for development of knowledge sharing skills : empirical research

OpenAIRE

Schoop, Eric; Kriaučiūnienė, Roma; Brundzaitė, Rasa

2004-01-01

This article analyses the needs and possibilities to educate new type of virtual collaboration skills for the university students, who are currently studying in business and information systems area. We investigate the possibility to incorporate problem-based group learning and computer supported tools into university curricula. The empirical research results are presented, which summarize experiences of using the virtual collaborative learning (VCL) environment, provided by Business informat...

Collaboration Modality, Cognitive Load, and Science Inquiry Learning in Virtual Inquiry Environments

Science.gov (United States)

Erlandson, Benjamin E.; Nelson, Brian C.; Savenye, Wilhelmina C.

2010-01-01

Educational multi-user virtual environments (MUVEs) have been shown to be effective platforms for situated science inquiry curricula. While researchers find MUVEs to be supportive of collaborative scientific inquiry processes, the complex mix of multi-modal messages present in MUVEs can lead to cognitive overload, with learners unable to…

Queueing networks a fundamental approach

CERN Document Server

Dijk, Nico

2011-01-01

This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more general manner.  The handbook is organized into five parts: Part 1 considers exact analytical results such as of product form type. Topics include characterization of product forms by physical balance concepts and simple traffic flow equations, classes of service and queue disciplines that allow a product form, a unified description of product forms for discrete time queueing networks, insights for insensitivity, and aggregation and decomposition results that allow subnetworks to be aggregated into single nodes to reduce computational burden. Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the proces generators, and comparison results and explicit error bounds based on an underlying Markov r...

Designing a Virtual Research Facility to motivate Professional-Citizen Collaboration

Science.gov (United States)

Gay, Pamela

In order to handle the onslaught of data spilling from telescopes on the Earth and on orbit, CosmoQuest has created a virtual research facility that allows the public to collaborate with science teams on projects that would otherwise lack the necessary human resources. This second-generation citizen science site goes beyond asking people to click on images to also engaging them in taking classes, attending virtual seminars, and participating in virtual star parties. These features were introduced to try and expand the diversity of motivations that bring people to the project and to keep them engaged overtime - just as a research center seeks to bring a diversity of people together to work and learn over time. In creating the CosmoQuest Virtual Research Facility, we sought to answer the question, “What would happen if we provided the public with the same kinds of facilities scientists have, and invite them to be our collaborators?” It had already been observed that the public readily attends public science lectures, open houses at science facilities, and education programs such as star parties. It was hoped that by creating a central facility, we could build a community of people learning and doing science in a productive manner. In order to be successful, we needed to first create the facility, then test if people were coming both to learn and to do science, and finally to verify that people were doing legitimate science. During the past 18 months of operations, we have continued to work through each of these stages, as discussed talk. At this early date, progress is on-going, and much research remains to be done, but all indications show that we are on our way to building a community of people learning and doing science. During 2013-2014, a series of studies looked at the motivations of CosmoQuest users, as well as their forms of site interactions. During this talk, we will review these results, as well as the demographics of our user population.

Buffer Management of Multi-Queue QoS Switches with Class Segregation

OpenAIRE

Itoh, Toshiya; Yoshimoto, Seiji

2013-01-01

In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of $m$ queues and $m$ packet values $0 < v_{1} < v_{2} < ... < v_{m}$. Recently, Al-Bawani and Souza [IPL 113(4), pp.145-150, 2013] presented an online algorithm GREEDY for buffer management of multi-queue QoS switches with class segregation and showed thatif $m$ queues have the same size, then the competitive ratio of GREEDY is $...

Discovering queues from event logs with varying levels of information

NARCIS (Netherlands)

Senderovich, A.; Leemans, S,J.J.; Harel, S.; Gal, A.; Mandelbaum, A.; van der Aalst, W.M.P.; Reichert, M.; Reijers, H.A.

2016-01-01

Detecting and measuring resource queues is central to business process optimization. Queue mining techniques allow for the identification of bottlenecks and other process inefficiencies, based on event data. This work focuses on the discovery of resource queues. In particular, we investigate the

NASA's Solar System Exploration Research Virtual Institute: Building Collaboration Through International Partnerships

Science.gov (United States)

Gibbs, K. E.; Schmidt, G. K.

2017-01-01

The NASA Solar System Exploration Research Virtual Institute (SSERVI) is a virtual institute focused on re-search at the intersection of science and exploration, training the next generation of lunar scientists, and community development. As part of the SSERVI mission, we act as a hub for opportunities that engage the larger scientific and exploration communities in order to form new interdisciplinary, research-focused collaborations. This talk will describe the international partner re-search efforts and how we are engaging the international science and exploration communities through workshops, conferences, online seminars and classes, student exchange programs and internships.

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W. H M

1991-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

A course on queueing models

CERN Document Server

Jain, Joti Lal; Böhm, Walter

2006-01-01

The application of engineering principles in divergent fields such as management science and communications as well as the advancement of several approaches in theory and computation have led to growing interest in queueing models, creating the need for a comprehensive text. Emphasizing Markovian structures and the techniques that occur in different models, A Course on Queueing Models discusses recent developments in the field, different methodological tools - some of which are not available elsewhere - and computational techniques.While most books essentially address the classical methods of

Performance optimization of queueing systems with perturbation realization

KAUST Repository

Xia, Li; Cao, Xiren

2012-01-01

After the intensive studies of queueing theory in the past decades, many excellent results in performance analysis have been obtained, and successful examples abound. However, exploring special features of queueing systems directly in performance

Competing for jobs: labor queues and gender sorting in the hiring process.

Science.gov (United States)

Fernandez, Roberto M; Mors, Marie Louise

2008-12-01

While much research has documented the pattern and extent of sex segregation of workers once they are employed, few studies have addressed the pre-hire mechanisms that are posited to produce sex segregation in employment. While the notion of a labor queue-the rank order of the set of people that employers choose among-plays a prominent role in pre-hire accounts of job sex sorting mechanisms, few studies have examined the ways in which job candidates are sorted into labor queues. In this paper, we explore the mechanisms by which labor queues contribute to the gendering of jobs by studying the hiring process for all jobs at a call center. Being placed in a queue has a clear gendering effect on the hiring process: the sex distribution of applicants who are matched to queues and those who are rejected at this phase diverge, and among those assigned to queues, women are prevalent in queues for low pay, low status jobs. The screening process also contributes to the gendering of the population of hires at this firm. Females are more prevalent among hires than they are among candidates at initial queue assignment. Among high status jobs, however, males are more prevalent than females. Moreover, there are important wage implications associated with matching to queues. While there are large between-queue sex differences in the paid wages associated with allocation to queues, once allocated to queues the wage differences between male and female candidates are nil. Consequently, the roots of gender wage inequality in this setting lie in the initial sorting of candidates to labor queues.

A tandem queue with delayed server release

NARCIS (Netherlands)

Nawijn, W.M.

1997-01-01

We consider a tandem queue with two stations. The rst station is an s-server queue with Poisson arrivals and exponential service times. After terminating his service in the rst station, a customer enters the second station to require service at an exponential single server, while in the meantime he

On the dependence structure of Gaussian queues

NARCIS (Netherlands)

Es-Saghouani, A.; Mandjes, M.R.H.

2009-01-01

In this article we study Gaussian queues (that is, queues fed by Gaussian processes, such as fractional Brownian motion (fBm) and the integrated Ornstein-Uhlenbeck (iOU) process), with a focus on the dependence structure of the workload process. The main question is to what extent does the workload

Study of Co-Located and Distant Collaboration with Symbolic Support via a Haptics-Enhanced Virtual Reality Task

Science.gov (United States)

Yeh, Shih-Ching; Hwang, Wu-Yuin; Wang, Jin-Liang; Zhan, Shi-Yi

2013-01-01

This study intends to investigate how multi-symbolic representations (text, digits, and colors) could effectively enhance the completion of co-located/distant collaborative work in a virtual reality context. Participants' perceptions and behaviors were also studied. A haptics-enhanced virtual reality task was developed to conduct…

Increasing available FIFO space to prevent messaging queue deadlocks in a DMA environment

Science.gov (United States)

Blocksome, Michael A [Rochester, MN; Chen, Dong [Croton On Hudson, NY; Gooding, Thomas [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Parker, Jeff [Rochester, MN

2012-02-07

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate an interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

A hardware and software architecture to deal with multimodal and collaborative interactions in multiuser virtual reality environments

Science.gov (United States)

Martin, P.; Tseu, A.; Férey, N.; Touraine, D.; Bourdot, P.

2014-02-01

Most advanced immersive devices provide collaborative environment within several users have their distinct head-tracked stereoscopic point of view. Combining with common used interactive features such as voice and gesture recognition, 3D mouse, haptic feedback, and spatialized audio rendering, these environments should faithfully reproduce a real context. However, even if many studies have been carried out on multimodal systems, we are far to definitively solve the issue of multimodal fusion, which consists in merging multimodal events coming from users and devices, into interpretable commands performed by the application. Multimodality and collaboration was often studied separately, despite of the fact that these two aspects share interesting similarities. We discuss how we address this problem, thought the design and implementation of a supervisor that is able to deal with both multimodal fusion and collaborative aspects. The aim of this supervisor is to ensure the merge of user's input from virtual reality devices in order to control immersive multi-user applications. We deal with this problem according to a practical point of view, because the main requirements of this supervisor was defined according to a industrial task proposed by our automotive partner, that as to be performed with multimodal and collaborative interactions in a co-located multi-user environment. In this task, two co-located workers of a virtual assembly chain has to cooperate to insert a seat into the bodywork of a car, using haptic devices to feel collision and to manipulate objects, combining speech recognition and two hands gesture recognition as multimodal instructions. Besides the architectural aspect of this supervisor, we described how we ensure the modularity of our solution that could apply on different virtual reality platforms, interactive contexts and virtual contents. A virtual context observer included in this supervisor in was especially designed to be independent to the

Building Virtual Collaborative Research Community Using Knowledge Management Approach

Directory of Open Access Journals (Sweden)

Ju-Ling Shih

2010-09-01

Full Text Available Many online communities nowadays are emphasized more on peer interactions and information sharing among members; very few online communities are built with knowledge management in nature supported by knowledge management system (KMS. This study aims to present a community of practice on how to effectively adopt a knowledge management system (KMS to neutralize a cyber collaborative learning community for a research lab in a higher education setting. A longitudinal case for 7 years was used to analyze the retention and extension of participants‟ community of practice experiences. Interviews were conducted for the comparison between experiences and theories. It was found that the transformations of tacit and explicit knowledge are in accordance with the framework of Nonaka‟s model of knowledge management from which we elicit the strategies and suggestions to the adoption and implementation of virtual collaborative research community supported by KMS.

Probability, statistics, and queueing theory

CERN Document Server

Allen, Arnold O

1990-01-01

This is a textbook on applied probability and statistics with computer science applications for students at the upper undergraduate level. It may also be used as a self study book for the practicing computer science professional. The successful first edition of this book proved extremely useful to students who need to use probability, statistics and queueing theory to solve problems in other fields, such as engineering, physics, operations research, and management science. The book has also been successfully used for courses in queueing theory for operations research students. This second edit

COGNITIVE ASPECTS OF COLLABORATION IN 3D VIRTUAL ENVIRONMENTS

Directory of Open Access Journals (Sweden)

V. Juřík

2016-06-01

Full Text Available Human-computer interaction has entered the 3D era. The most important models representing spatial information — maps — are transferred into 3D versions regarding the specific content to be displayed. Virtual worlds (VW become promising area of interest because of possibility to dynamically modify content and multi-user cooperation when solving tasks regardless to physical presence. They can be used for sharing and elaborating information via virtual images or avatars. Attractiveness of VWs is emphasized also by possibility to measure operators’ actions and complex strategies. Collaboration in 3D environments is the crucial issue in many areas where the visualizations are important for the group cooperation. Within the specific 3D user interface the operators' ability to manipulate the displayed content is explored regarding such phenomena as situation awareness, cognitive workload and human error. For such purpose, the VWs offer a great number of tools for measuring the operators’ responses as recording virtual movement or spots of interest in the visual field. Study focuses on the methodological issues of measuring the usability of 3D VWs and comparing them with the existing principles of 2D maps. We explore operators’ strategies to reach and interpret information regarding the specific type of visualization and different level of immersion.

Cognitive Aspects of Collaboration in 3d Virtual Environments

Science.gov (United States)

Juřík, V.; Herman, L.; Kubíček, P.; Stachoň, Z.; Šašinka, Č.

2016-06-01

Human-computer interaction has entered the 3D era. The most important models representing spatial information — maps — are transferred into 3D versions regarding the specific content to be displayed. Virtual worlds (VW) become promising area of interest because of possibility to dynamically modify content and multi-user cooperation when solving tasks regardless to physical presence. They can be used for sharing and elaborating information via virtual images or avatars. Attractiveness of VWs is emphasized also by possibility to measure operators' actions and complex strategies. Collaboration in 3D environments is the crucial issue in many areas where the visualizations are important for the group cooperation. Within the specific 3D user interface the operators' ability to manipulate the displayed content is explored regarding such phenomena as situation awareness, cognitive workload and human error. For such purpose, the VWs offer a great number of tools for measuring the operators' responses as recording virtual movement or spots of interest in the visual field. Study focuses on the methodological issues of measuring the usability of 3D VWs and comparing them with the existing principles of 2D maps. We explore operators' strategies to reach and interpret information regarding the specific type of visualization and different level of immersion.

Upper Bounds on Performance Measures of Heterogeneous // Queues

Directory of Open Access Journals (Sweden)

F. S. Q. Alves

2011-01-01

Full Text Available In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion of the state space that is followed by an approximate reduction of the state space, only considering the most probable states. In most cases tested, we were able to approximate the actual behavior of the system with smaller errors than those obtained from traditional homogeneous multiserver Markovian queues, as shown by GPSS simulations. In addition, we have correlated the quality of the approximation with the degree of heterogeneity of the system, which was evaluated using its Gini index. Finally, we have shown that the bounds are robust and still useful, even considering quite different allocation strategies. A large number of simulation results show the accuracy of the proposed method that is better than that of classical homogeneous multiserver Markovian formulae in many situations.

QUEUEING DISCIPLINES BASED ON PRIORITY MATRIX

Directory of Open Access Journals (Sweden)

Taufik I. Aliev

2014-11-01

Full Text Available The paper deals with queueing disciplines for demands of general type in queueing systems with multivendor load. A priority matrix is proposed to be used for the purpose of mathematical description of such disciplines, which represents the priority type (preemptive priority, not preemptive priority or no priority between any two demands classes. Having an intuitive and simple way of priority assignment, such description gives mathematical dependencies of system operation characteristics on its parameters. Requirements for priority matrix construction are formulated and the notion of canonical priority matrix is given. It is shown that not every matrix, constructed in accordance with such requirements, is correct. The notion of incorrect priority matrix is illustrated by an example, and it is shown that such matrixes do not ensure any unambiguousness and determinacy in design of algorithm, which realizes corresponding queueing discipline. Rules governing construction of correct matrixes are given for canonical priority matrixes. Residence time for demands of different classes in system, which is the sum of waiting time and service time, is considered as one of the most important characteristics. By introducing extra event method Laplace transforms for these characteristics are obtained, and mathematical dependencies are derived on their basis for calculation of two first moments for corresponding characteristics of demands queueing

Working Collaboratively in Virtual Learning Environments: Using Second Life with Korean High School Students in History Class

Science.gov (United States)

Kim, Mi Hwa

2013-01-01

The purpose of this experimental study was to investigate the impact of the use of a virtual environment for learning Korean history on high school students' learning outcomes and attitudes toward virtual worlds (collaboration, engagement, general use of SL [Second Life], and immersion). In addition, this experiment examined the relationships…

The impact of reneging in processor sharing queues

NARCIS (Netherlands)

Gromoll, H.C.; Robert, Ph.; Zwart, B.; Bakker, R.F.

2006-01-01

We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Impatient customers may abandon the queue, or renege, before completing service. The random time representing a customer’s patience has a general distribution and may be dependent on

A unifying property for distribution-sensitive priority queues

DEFF Research Database (Denmark)

Elmasry, Amr Ahmed Abd Elmoneim; Farzan, Arash; Iacono, John

2011-01-01

, before) the last access of x and are still in the priority queue at the time when the corresponding operation is performed. Our priority queue then has both the working-set and the queueish properties; and, more strongly, it satisfies these properties in the worst-case sense. We also argue...... that these bounds are the best possible with respect to the considered measures. Moreover, we modify our priority queue to satisfy a new unifying property - the time-finger property - which encapsulates both the working-set and the queueish properties. In addition, we prove that the working-set bound......We present a priority queue that supports the operations: insert in worst-case constant time, and delete, delete-min, find-min and decrease-key on an element x in worst-case O(lg(min{wx, qx} + 2)) time, where wx (respectively, qx) is the number of elements that were accessed after (respectively...

Cyberinfrastructure and Scientific Collaboration: Application of a Virtual Team Performance Framework with Potential Relevance to Education. WCER Working Paper No. 2010-12

Science.gov (United States)

Kraemer, Sara; Thorn, Christopher A.

2010-01-01

The purpose of this exploratory study was to identify and describe some of the dimensions of scientific collaborations using high throughput computing (HTC) through the lens of a virtual team performance framework. A secondary purpose was to assess the viability of using a virtual team performance framework to study scientific collaborations using…

Impact of Collaborative Work on Technology Acceptance: A Case Study from Virtual Computing

Science.gov (United States)

Konak, Abdullah; Kulturel-Konak, Sadan; Nasereddin, Mahdi; Bartolacci, Michael R.

2017-01-01

Aim/Purpose: This paper utilizes the Technology Acceptance Model (TAM) to examine the extent to which acceptance of Remote Virtual Computer Laboratories (RVCLs) is affected by students' technological backgrounds and the role of collaborative work. Background: RVCLs are widely used in information technology and cyber security education to provide…

How does feedback and peer feedback affect collaborative writing in a virtual learning environment?

NARCIS (Netherlands)

Guasch, Teresa; Espasa, Anna; Alvarez, Ibis; Kirschner, Paul A.

2011-01-01

Guasch, T., Espasa, A., Alvarez, I., & Kirschner, P. A. (2011, 31 May). How does feedback and peer feedback affect collaborative writing in a virtual learning environment? Presentation at a Learning & Cognition meeting, Open Universiteit in the Netherlands, Heerlen, The Netherlands.

Influence of queue propagation and dissipation on route travel times

DEFF Research Database (Denmark)

Raovic, Nevena

into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent queue propagation...... and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation, which would lead to more...... accurate route travel times....

Performance analysis of tandem queues with small buffers

NARCIS (Netherlands)

Vuuren, van M.; Adan, I.J.B.F.; Papadopoulos, C.T.

2005-01-01

In this paper we present an approximation for the performance analysis of single-server tandem queues with small buffers and generally distributed service times. The approximation is based on decomposition of the tandem queue in subsystems, the parameters of which are determined by an iterative

Australia: a matter of Queues and As

Energy Technology Data Exchange (ETDEWEB)

NONE

2007-05-15

Australia has been very much in the news recently, with ship queues at port terminals and storms hitting the Hunter Valley, flooding coal yards and rail links. In December 2006 a 'capacity balancing system' (CBS) introduced by Port Waratah Coal Services to solve queuing problems in Newcastle ports in mid-2004 was discontinued but then the queues started to grow again. A new CBS was introduced and was beginning to take effect when storms struck New South Wales. Port Dalrymple Coal Services has a queue management system but nevertheless there were 58 ships waiting in Dalrymple Bay and Hay Point in late June. A number of coal terminals are undergoing expansion in an attempt to solve the situation. 4 photos.

Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues

OpenAIRE

Lloret-Batlle, Roger; Jayakrishnan, R.

2018-01-01

This article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers. Based on predicted future delays per queue or lane, a VOT-heterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon. The strategic interaction is captured by an n-level Stackelberg model with coalitions, while the cooperative structure ...

A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks

Directory of Open Access Journals (Sweden)

Doo Il Choi

1999-01-01

Full Text Available A queueing system (M/G1,G2/1/K is considered in which the service time of a customer entering service depends on whether the queue length, N(t, is above or below a threshold L. The arrival process is Poisson, and the general service times S1 and S2 depend on whether the queue length at the time service is initiated is

Collaborative and Competitive Strategies in Virtual Teams of e-Entrepreneurs: A pan-European Perspective

Directory of Open Access Journals (Sweden)

Harry Matlay

2009-08-01

Full Text Available Recent advances in Information and Communication Technologies (ICTs and the advent of the Internet have facilitated the emergence and growth of collaborative strategies amongst small e-Businesses (Matlay & Westhead, 2005. In addition, during the last decade or so, team-led entrepreneurship has been identified as a highly profitable alternative to single founder entrepreneurship. Recent research suggests that growth oriented, small e-Businesses operating in international e-Markets are more likely to be founded and managed by teams of e-Entrepreneurs (Matlay & Westhead, 2007. In increasingly globalised and hyper-competitive markets, "virtual teams" of e-Entrepreneurs search, discover and exploit new entrepreneurial opportunities. This type of entrepreneurial team consists of geographically dispersed entrepreneurs who are led by common entrepreneurial interests and interact electronically in order to promote interdependent strategies and fulfil entrepreneurial goals. In this article, an illustrative longitudinal case study of a pan-European virtual team of 24 e-Entrepreneur members is used to evaluate emergent collaborative and competitive strategies in small e-Businesses that are lead and managed by members. Collaborative and competitive strategies of e-Businesses are identified and related outcomes are analysed. Future research opportunities are suggested and pertinent policy recommendations are offered.

Simple and efficient importance sampling scheme for a tandem queue with server slow-down

NARCIS (Netherlands)

Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

2008-01-01

This paper considers importance sampling as a tool for rare-event simulation. The system at hand is a so-called tandem queue with slow-down, which essentially means that the server of the first queue (or: upstream queue) switches to a lower speed when the second queue (downstream queue) exceeds some

The M/G/1 queue with permanent customers

NARCIS (Netherlands)

Boxma, O.J.; Cohen, J.W.

1991-01-01

The authors examine an M/G/1 FCFS (first come, first served) queue with two types of customers: ordinary customers, who arrive according to a Poisson process, and permanent customers, who immediately return to the end of the queue after having received a service. The influence of the permanent

Markov-modulated infinite-server queues driven by a common background process

OpenAIRE

Mandjes , Michel; De Turck , Koen

2016-01-01

International audience; This paper studies a system with multiple infinite-server queues which are modulated by a common background process. If this background process, being modeled as a finite-state continuous-time Markov chain, is in state j, then the arrival rate into the i-th queue is λi,j, whereas the service times of customers present in this queue are exponentially distributed with mean µ −1 i,j ; at each of the individual queues all customers present are served in parallel (thus refl...

A fixed-size batch service queue with vacations

Directory of Open Access Journals (Sweden)

Ho Woo Lee

1996-01-01

Full Text Available The paper deals with batch service queues with vacations in which customers arrive according to a Poisson process. Decomposition method is used to derive the queue length distributions both for single and multiple vacation cases. The authors look at other decomposition techniques and discuss some related open problems.

Quasi-stationary analysis for queues with temporary overload

NARCIS (Netherlands)

Cheung, S.K.; Boucherie, Richardus J.; Núñez-Queija, R.

2010-01-01

Motivated by the high variation in transmission rates for document transfer in the Internet and file down loads from web servers, we study the buffer content in a queue with a fluctuating service rate. The fluctuations are assumed to be driven by an independent stochastic process. We allow the queue

Virtual Collaboration: Advantages and Disadvantages in the Planning and Execution of Operations in the Information Age

National Research Council Canada - National Science Library

Fox, Gregory

2004-01-01

.... In analyzing the specific advantages and disadvantages of one of the systems, virtual collaboration, it becomes clear that commanders and staff at all levels of war are understanding the potential...

Priority Queues with Fractional Service for Tiered Delay QoS

Directory of Open Access Journals (Sweden)

Gary Chang

2015-12-01

Full Text Available Packet scheduling is key to quality of service (QoS capabilities of broadband wired and wireless networks. In a heterogeneous traffic environment, a comprehensive QoS packet scheduler must strike a balance between flow fairness and access delay. Many advanced packet scheduling solutions have targeted fair bandwidth allocation while protecting delay-constrained traffic by adding priority queue(s on top of a fair bandwidth scheduler. Priority queues are known to cause performance uncertainties and, thus, various modifications have been proposed. In this paper, we present a packet queueing engine dubbed Fractional Service Buffer (FSB, which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees. Key performance metrics, such as delay limit and probability of delay limit violation, are derived as a function of key FSB parameters for each delay class in the packet queueing engine using diffusion approximations. OPNET simulations verify these analytical results.

Transforming Virtual Teams

DEFF Research Database (Denmark)

Bjørn, Pernille

2005-01-01

Investigating virtual team collaboration in industry using grounded theory this paper presents the in-dept analysis of empirical work conducted in a global organization of 100.000 employees where a global virtual team with participants from Sweden, United Kingdom, Canada, and North America were...... studied. The research question investigated is how collaboration is negotiated within virtual teams? This paper presents findings concerning how collaboration is negotiated within a virtual team and elaborate the difficulties due to invisible articulation work and managing multiple communities...... in transforming the virtual team into a community. It is argued that translucence in communication structures within the virtual team and between team and management is essential for engaging in a positive transformation process of trustworthiness supporting the team becoming a community, managing the immanent...

Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue

Directory of Open Access Journals (Sweden)

Alexandra Koshman-Kaz

2015-02-01

Full Text Available This article deals with strategic control of information in a single-server model. It considers an M/M/1 system with identical customers. There is a single cut-off number, and the level of congestion is said to be low (high if the queue length is less than (at least this value. The firm can dynamically change the admission fee according to the level of congestion. Arriving customers cannot observe the queue length, but they are informed about the current level of congestion and the admission fee. The article deals with finding the profit maximizing admission fee, using analytical and numerical methods. We observe that such a pricing regime can be used to increase the profit and the proportion of the increase relative to the single price unobservable queue is unbounded. We observe that the profit maximizing threshold is usually quite small and therefore raise a question whether there is a significant difference in profit when rather than being informed about the congestion level, customers only join the system when the server is idle. We also investigate this question considering the classical observable model.

Pricing in M/M/1 queues when cost of waiting in queue differs from cost of waiting in service

Directory of Open Access Journals (Sweden)

Görkem Sarıyer

2016-11-01

Full Text Available Service providers can adjust the entrance price to the state of the demand in real life service systems where the customers' decision to receive the service, is based on this price, state of demand and other system parameters. We analyzed service provider's short and long term pricing problems in unobservable M/M/1 queues having the rational customers, where, for customers, the unit cost of waiting in the queue is higher than unit cost of waiting in the service. We showed that waiting in the queue has a clear negative effect on customers’ utilities, hence the service provider's price values. We also showed that, in the short term, monopolistic pricing is optimal for congested systems with high server utilization levels, whereas in the long term, market capturing pricing is more profitable.

A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

Directory of Open Access Journals (Sweden)

Ekaterina Evdokimova

2017-01-01

Full Text Available This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i overloaded and (ii under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.

Analysis of the asymmetrical shortest two-server queueing model

NARCIS (Netherlands)

J.W. Cohen

1995-01-01

textabstractThis study presents the analytic solution for the asymmetrical two-server queueing model with arriving customers joining the shorter queue for the case with Poisson arrivals and negative exponentially distributed service times. The bivariate generating function of the stationary joint

Adaptive optimization for active queue management supporting TCP flows

NARCIS (Netherlands)

Baldi, S.; Kosmatopoulos, Elias B.; Pitsillides, Andreas; Lestas, Marios; Ioannou, Petros A.; Wan, Y.; Chiu, George; Johnson, Katie; Abramovitch, Danny

2016-01-01

An adaptive decentralized strategy for active queue management of TCP flows over communication networks is presented. The proposed strategy solves locally, at each link, an optimal control problem, minimizing a cost composed of residual capacity and buffer queue size. The solution of the optimal

VirtualECare : group support in collaborative networks organizations for digital homecare

OpenAIRE

Costa, Ricardo André Fernandes; Novais, Paulo; Lima, Luís; Cruz, José Bulas; Neves, José

2009-01-01

Collaborative Work plays an important role in today’s organizations, especially in areas where decisions must be made. However, any decision that involves a collective or group of decision makers is, by itself complex, but is becoming recurrent in recent years. In this work we present the VirtualECare project, an intelligent multi-agent system able to monitor, interact and serve its customers, which are, normally, in need of care services. In last year’s there has been a substantially increas...

A spectral theory approach for extreme value analysis in a tandem of fluid queues

NARCIS (Netherlands)

J.W. Bosman (Joost); R. Núñez Queija (Rudesindo)

2014-01-01

htmlabstractWe consider a model to evaluate performance of streaming media over an unreliable network. Our model consists of a tandem of two fluid queues. The first fluid queue is a Markov modulated fluid queue that models the network congestion, and the second queue represents the play-out buffer.

New Approach for Finding Basic Performance Measures of Single Server Queue

Directory of Open Access Journals (Sweden)

Siew Khew Koh

2014-01-01

Full Text Available Consider the single server queue in which the system capacity is infinite and the customers are served on a first come, first served basis. Suppose the probability density function f(t and the cumulative distribution function F(t of the interarrival time are such that the rate f(t/1-F(t tends to a constant as t→∞, and the rate computed from the distribution of the service time tends to another constant. When the queue is in a stationary state, we derive a set of equations for the probabilities of the queue length and the states of the arrival and service processes. Solving the equations, we obtain approximate results for the stationary probabilities which can be used to obtain the stationary queue length distribution and waiting time distribution of a customer who arrives when the queue is in the stationary state.

Bulk input queues with quorum and multiple vacations

Directory of Open Access Journals (Sweden)

Dshalalow Jewgeni H.

1996-01-01

Full Text Available The authors study a single-server queueing system with bulk arrivals and batch service in accordance to the general quorum discipline: a batch taken for service is not less than r and not greater than R ( ≥ r . The server takes vacations each time the queue level falls below r ( ≥ 1 in accordance with the multiple vacation discipline. The input to the system is assumed to be a compound Poisson process. The analysis of the system is based on the theory of first excess processes developed by the first author. A preliminary analysis of such processes enabled the authors to obtain all major characteristics for the queueing process in an analytically tractable form. Some examples and applications are given.

On the busy period of discretized GI/GI/infinity queue

International Nuclear Information System (INIS)

Dvurecenskij, A.; Ososkov, G.A.

1982-01-01

The problem of determining the distribution of the busy period, i. e., of the time when at least one customer is served, of the discretized queueing system with infinitely many servers is investigated. Moreover, the idle period and the cycle of a queue are studied. The recurrent formulae are determined and in particular case of a queue with the geometric input the simpler recurrent formulae are given. Those problems arise in the discrete blob length determination in track chambers in high energy physics

On finite capacity queueing systems with a general vacation policy

Directory of Open Access Journals (Sweden)

Jacqueline Loris-Teghem

2000-01-01

Full Text Available We consider a Poisson arrival queueing system with finite capacity and a general vacation policy as described in Loris-Teghem [Queueing Systems 3 (1988, 41-52]. From our previous results regarding the stationary queue length distributions immediately after a departure and at an arbitrary epoch, we derive a relation between both distributions which extends a result given in Frey and Takahashi [Operations Research Letters 21 (1997, 95-100] for the particular case of an exhaustive service multiple vacation policy.

User satisfaction with referrals at a collaborative virtual reference service Virtual reference services, Reference services, Referrals, User satisfaction

Directory of Open Access Journals (Sweden)

Nahyun Kwon

2006-01-01

Full Text Available Introduction. This study investigated unmonitored referrals in a nationwide, collaborative chat reference service. Specifically, it examined the extent to which questions are referred, the types of questions that are more likely to be referred than others, and the level of user satisfaction with the referrals in the collaborative chat reference service. Method. The data analysed for this study were 420 chat reference transaction transcripts along with corresponding online survey questionnaires submitted by the service users. Both sets of data were collected from an electronic archive of a southeastern state public library system that has participated in 24/7 Reference of the Metropolitan Cooperative Library System (MCLS. Results. Referrals in the collaborative chat reference service comprised approximately 30% of the total transactions. Circulation-related questions were the most often referred among all question types, possibly because of the inability of 'outside' librarians to access patron accounts. Most importantly, user satisfaction with referrals was found to be significantly lower than that of completed answers. Conclusion. The findings of this study addressed the importance of distinguishing two types of referrals: the expert research referrals conducive to collaborative virtual reference services; and the re-directional local referrals that increase unnecessary question traffic, thereby being detrimental to effective use of collaborative reference. Continuing efforts to conceptualize referrals in multiple dimensions are anticipated to fully grasp complex phenomena underlying referrals.

The effectiveness of integration of virtual patients in a collaborative learning activity.

Science.gov (United States)

Marei, Hesham F; Donkers, Jeroen; Van Merrienboer, Jeroen J G

2018-05-07

Virtual patients (VPs) have been recently integrated within different learning activities. To compare between the effect of using VPs in a collaborative learning activity and using VPs in an independent learning activity on students' knowledge acquisition, retention and transfer. For two different topics, respectively 82 and 76 dental students participated in teaching, learning and assessment sessions with VPs. Students from a female campus and from a male campus have been randomly assigned to condition (collaborative and independent), yielding four experimental groups. Each group received a lecture followed by a learning session using two VPs per topic. Students were administrated immediate and delayed written tests as well as transfer tests using two VPs to assess their knowledge in diagnosis and treatment. For the treatment items of the immediate and delayed written tests, females outperformed males in the collaborative VP group but not in the independent VP group. On the female campus, the use of VPs in a collaborative learning activity is more effective than its use as an independent learning activity in enhancing students' knowledge acquisition and retention. However, the collaborative use of VPs by itself is not enough to produce consistent results across different groups of students and attention should be given to all the factors that would affect students' interaction.

A tandem queue with delayed server release

OpenAIRE

Nawijn, W.M.

1997-01-01

We consider a tandem queue with two stations. The rst station is an s-server queue with Poisson arrivals and exponential service times. After terminating his service in the rst station, a customer enters the second station to require service at an exponential single server, while in the meantime he is blocking his server in station 1 until he completes service in station 2, whereupon the server in station 1 is released. An analysis of the generating function of the simultaneous probability di...

Modelling M/G/1 queueing systems with server vacations using ...

African Journals Online (AJOL)

Simple numerical examples are also provided to illustrate the func- ... M/G/1/N queueing systems with server vacations under a limited service discipline ...... system contents in a discrete-time non-preemptive priority queue with general service.

Computing moving and intermittent queue propagation in highway work zones.

Science.gov (United States)

2012-07-01

Drivers may experience intermittent congestion and moving queue conditions in work zones due to several reasons such as presence of lane closure, roadway geometric changes, higher demand, lower speed, and reduced capacity. The congestion and queue ha...

Note on a tandem queue with delayed server release

NARCIS (Netherlands)

Nawijn, W.M.

2000-01-01

We consider a tandem queue with two stations. The first station is an $s$-server queue with Poisson arrivals and exponential service times. After terminating his service in the first station, a customer enters the second station to require service at a single server, while in the meantime he is

A tandem queue with server slow-down and blocking

NARCIS (Netherlands)

van Foreest, N.D.; van Ommeren, Jan C.W.; Mandjes, M.R.H.; Scheinhardt, Willem R.W.

2005-01-01

We consider two variants of a two-station tandem network with blocking. In both variants the first server ceases to work when the queue length at the second station hits a 'blocking threshold.' In addition, in variant 2 the first server decreases its service rate when the second queue exceeds a

A tandem queue with server slow-down and blocking.

NARCIS (Netherlands)

van Foreest, N.; van Ommeren, J.C.; Mandjes, M.R.H.; Scheinhardt, W.

2005-01-01

We consider two variants of a two-station tandem network with blocking. In both variants the first server ceases to work when the queue length at the second station hits a 'blocking threshold.' In addition, in variant 2 the first server decreases its service rate when the second queue exceeds a

LHCb experience with running jobs in virtual machines

CERN Document Server

McNab, A; Luzzi, C

2015-01-01

The LHCb experiment has been running production jobs in virtual machines since 2013 as part of its DIRAC-based infrastructure. We describe the architecture of these virtual machines and the steps taken to replicate the WLCG worker node environment expected by user and production jobs. This relies on the uCernVM system for providing root images for virtual machines. We use the CernVM-FS distributed filesystem to supply the root partition files, the LHCb software stack, and the bootstrapping scripts necessary to configure the virtual machines for us. Using this approach, we have been able to minimise the amount of contextualisation which must be provided by the virtual machine managers. We explain the process by which the virtual machine is able to receive payload jobs submitted to DIRAC by users and production managers, and how this differs from payloads executed within conventional DIRAC pilot jobs on batch queue based sites. We describe our operational experiences in running production on VM based sites mana...

A novel fair active queue management algorithm based on traffic delay jitter

Science.gov (United States)

Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

2009-11-01

In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

Perbandingan Metode Simple Queues Dan Queues Tree Untuk Optimasi Manajemen Bandwidth Jaringan Komputer Di STMIK PPKIA Pradnya Paramita Malang

OpenAIRE

Syaifuddin, Aris; Yunus, Mahmud; Sundari, Retno

2013-01-01

This research resulted in a comparison between the Simple Queues method and Queues Tree using Mikrotik router that takes a case study in STMIK PPKIA PRADNYA PARAMITA MALANG has been tested to determine which method is the most optimal deal of bandwidth sharing on computer networks. After finding out where the most optimal method will be applied in STMIK PPKIA PRADNYA PARAMITA MALANG to maximize network performance and bandwidth sharing in place, the results of the study lead to the conclusion...

Large Deviation Bounds for a Polling System with Two Queues and Multiple Servers

OpenAIRE

Wei, Fen

2004-01-01

In this paper, we present large deviation bounds for a discrete-time polling system consisting of two-par-allel queues and m servers. The arrival process in each queue is an arbitrary, and possibly correlated, stochastic process. Each server (serves) independently serves the two queues according to a Bernoulli service schedule. Using large deviation techniques, we analyze the tail behavior of the stationary distribution of the queue length processes, and derive upper and lower bounds of the b...

Cognitive Presence in Virtual Collaborative Learning: Assessing and Improving Critical Thinking in Online Discussion Forums

Science.gov (United States)

Beckmann, Jennifer; Weber, Peter

2015-01-01

The paper introduces a virtual collaborative learning setting called "Net Economy," which we established as part of an international learning network of currently seven universities. Using the Community of Inquiry framework as guidance and Canonical Action Research (CAR) as the chosen research design, the discussion forum of the online…

The Supermarket Model with Bounded Queue Lengths in Equilibrium

Science.gov (United States)

Brightwell, Graham; Fairthorne, Marianne; Luczak, Malwina J.

2018-04-01

In the supermarket model, there are n queues, each with a single server. Customers arrive in a Poisson process with arrival rate λ n , where λ = λ (n) \\in (0,1) . Upon arrival, a customer selects d=d(n) servers uniformly at random, and joins the queue of a least-loaded server amongst those chosen. Service times are independent exponentially distributed random variables with mean 1. In this paper, we analyse the behaviour of the supermarket model in the regime where λ (n) = 1 - n^{-α } and d(n) = \\lfloor n^β \\rfloor , where α and β are fixed numbers in (0, 1]. For suitable pairs (α , β ) , our results imply that, in equilibrium, with probability tending to 1 as n → ∞, the proportion of queues with length equal to k = \\lceil α /β \\rceil is at least 1-2n^{-α + (k-1)β } , and there are no longer queues. We further show that the process is rapidly mixing when started in a good state, and give bounds on the speed of mixing for more general initial conditions.

Waiting-time approximations in multi-queue systems with cyclic service

NARCIS (Netherlands)

Boxma, O.J.; Meister, B.W.

1987-01-01

This study is devoted to mean waiting-time approximations in a single-server multi-queue model with cyclic service and zero switching times of the server between consecutive queues. Two different service disciplines are considered: exhaustive service and (ordinary cyclic) nonexhaustive service. For

Secure environment for real-time tele-collaboration on virtual simulation of radiation treatment planning.

Science.gov (United States)

Ntasis, Efthymios; Maniatis, Theofanis A; Nikita, Konstantina S

2003-01-01

A secure framework is described for real-time tele-collaboration on Virtual Simulation procedure of Radiation Treatment Planning. An integrated approach is followed clustering the security issues faced by the system into organizational issues, security issues over the LAN and security issues over the LAN-to-LAN connection. The design and the implementation of the security services are performed according to the identified security requirements, along with the need for real time communication between the collaborating health care professionals. A detailed description of the implementation is given, presenting a solution, which can directly be tailored to other tele-collaboration services in the field of health care. The pilot study of the proposed security components proves the feasibility of the secure environment, and the consistency with the high performance demands of the application.

Slowdown in the $M/M/1$ discriminatory processor-sharing queue

NARCIS (Netherlands)

Cheung, S.K.; Kim, Bara; Kim, Jeongsim

2008-01-01

We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the first and second moments of the slowdown, which

Optimal Control for Bufferbloat Queue Management Using Indirect Method with Parametric Optimization

Directory of Open Access Journals (Sweden)

Amr Radwan

2016-01-01

Full Text Available Because memory buffers become larger and cheaper, they have been put into network devices to reduce the number of loss packets and improve network performance. However, the consequences of large buffers are long queues at network bottlenecks and throughput saturation, which has been recently noticed in research community as bufferbloat phenomenon. To address such issues, in this article, we design a forward-backward optimal control queue algorithm based on an indirect approach with parametric optimization. The cost function which we want to minimize represents a trade-off between queue length and packet loss rate performance. Through the integration of an indirect approach with parametric optimization, our proposal has advantages of scalability and accuracy compared to direct approaches, while still maintaining good throughput and shorter queue length than several existing queue management algorithms. All numerical analysis, simulation in ns-2, and experiment results are provided to solidify the efficiency of our proposal. In detailed comparisons to other conventional algorithms, the proposed procedure can run much faster than direct collocation methods while maintaining a desired short queue (≈40 packets in simulation and 80 (ms in experiment test.

Designing Virtual Worlds

DEFF Research Database (Denmark)

Gürsimsek, Remzi Ates

2014-01-01

The online social platforms known as virtual worlds present their users various affordances for avatar based co-presence, social interaction and provide tools for collaborative content creation, including objects, textures and animations. The users of these worlds navigate their avatars as personal...... the audio-visual characteristics of designing in multi-user virtual environments generate experiential, interpersonal and textual meaning potentials....... mediators in 3D virtual space to collaborate and co-design the digital content. These co-designers are also the residents of these worlds, as they socialize by building inworld friendships. This article presents a social semiotic analysis of the three-dimensional virtual places and artifacts in the virtual...

TinCan: User-Defined P2P Virtual Network Overlays for Ad-hoc Collaboration

Directory of Open Access Journals (Sweden)

Pierre St Juste

2014-10-01

Full Text Available Virtual private networking (VPN has become an increasingly important component of a collaboration environment because it ensures private, authenticated communication among participants, using existing collaboration tools, where users are distributed across multiple institutions and can be mobile. The majority of current VPN solutions are based on a centralized VPN model, where all IP traffic is tunneled through a VPN gateway. Nonetheless, there are several use case scenarios that require a model where end-to-end VPN links are tunneled upon existing Internet infrastructure in a peer-to-peer (P2P fashion, removing the bottleneck of a centralized VPN gateway. We propose a novel virtual network — TinCan — based on peerto-peer private network tunnels. It reuses existing standards and implementations of services for discovery notification (XMPP, reflection (STUN and relaying (TURN, facilitating configuration. In this approach, trust relationships maintained by centralized (or federated services are automatically mapped to TinCan links. In one use scenario, TinCan allows unstructured P2P overlays connecting trusted end-user devices — while only requiring VPN software on user devices and leveraging online social network (OSN infrastructure already widely deployed. This paper describes the architecture and design of TinCan and presents an experimental evaluation of a prototype supporting Windows, Linux, and Android mobile devices. Results quantify the overhead introduced by the network virtualization layer, and the resource requirements imposed on services needed to bootstrap TinCan links.

On response time and cycle time distributions in a two-stage cyclic queue

NARCIS (Netherlands)

Boxma, O.J.; Donk, P.

1982-01-01

We consider a two-stage closed cyclic queueing model. For the case of an exponential server at each queue we derive the joint distribution of the successive response times of a custumer at both queues, using a reversibility argument. This joint distribution turns out to have a product form. The

The evaluation of a formalized queue management system for coronary angiography waiting lists.

Science.gov (United States)

Alter, D A; Newman, Alice M; Cohen, Eric A; Sykora, Kathy; Tu, Jack V

2005-11-01

Lengthy waiting lists for coronary angiography have been described in many health care systems worldwide. The extent to which formal queue management systems may improve the prioritization and survival of patients in the angiography queue is unknown. To prospectively evaluate the performance of a formal queue management system for patients awaiting coronary angiography in Ontario. The coronary angiography urgency scale, a formal queue management system developed in 1993 using a modified Delphi panel, allocates recommended maximum waiting times (RMWTs) in accordance with clinical necessity. By using a provincial clinical registry, 35,617 consecutive patients referred into the coronary angiography queue between April 1, 2001, and March 31, 2002, were prospectively tracked. Cox proportional hazards models were used to examined mortality risk across urgency after adjusting for additional clinical and comorbid factors. Good agreement was determined in urgency ratings between scores from the coronary angiography urgency scale and implicit physician judgement, which was obtained independently at the time of the index referral (weighted kappa = 0.49). The overall mortality in the queue was 0.3% (0.47%, 0.26% and 0.13% for urgent, semiurgent and elective patients, respectively). Urgency, as specified by the coronary angiography urgency scale, was the strongest predictor of death in the queue (Pqueue management system may decrease mortality in the coronary angiography queue. The authors recommend its implementation in health care systems where patients experience excessive waiting time delays for coronary angiography.

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

Ellens, W.; Kovács, P.; Núñez-Queija, R.; Berg, H. van den

2015-01-01

We consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues with independent

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

W. Ellens; P. Kovacs; J.L. van den Berg (Hans); R. Núñez Queija (Rudesindo); A. Busic; M. Gribaudo; P. Reinecke

2015-01-01

htmlabstractWe consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues

Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks

Directory of Open Access Journals (Sweden)

Ku-Hwan Kim

2016-01-01

Full Text Available Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal point of performance between queue length and drop rate is limited. In this paper, we study the problem of managing a long queue of industrial router at substation under heterogeneous smart grid networks. Specifically, we propose an enqueue-dequeue dropping cascade control using a two-loop design method to control both window size and queue length. Moreover, our proposal can be easily implemented into router firmware with provided discrete expressions. Finally, our simulation results are presented to validate the possible benefits that can be gained from cascade control and compare the existing queue management methods as well.

Time Is Not on Our Side: How Radiology Practices Should Manage Customer Queues.

Science.gov (United States)

Loving, Vilert A; Ellis, Richard L; Rippee, Robert; Steele, Joseph R; Schomer, Donald F; Shoemaker, Stowe

2017-11-01

As health care shifts toward patient-centered care, wait times have received increasing scrutiny as an important metric for patient satisfaction. Long queues form when radiology practices inefficiently service their customers, leading to customer dissatisfaction and a lower perception of value. This article describes a four-step framework for radiology practices to resolve problematic queues: (1) analyze factors contributing to queue formation; (2) improve processes to reduce service times; (3) reduce variability; (4) address the psychology of queues. Copyright © 2017 American College of Radiology. Published by Elsevier Inc. All rights reserved.

A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics

Directory of Open Access Journals (Sweden)

Charles Knessl

1999-01-01

Full Text Available We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of rate λ and have service rates equal to μ. When both queues are non-empty, the two systems behave independently of each other. However, when one of the queues becomes empty, the corresponding server helps in the other queue. This is called head-of-the-line processor sharing. We study this model in the heavy traffic limit, where ρ=λ/μ→1. We formulate the heavy traffic diffusion approximation and explicitly compute the time-dependent probability of the diffusion approximation to the joint queue length process. We then evaluate the solution asymptotically for large values of space and/or time. This leads to simple expressions that show how the process achieves its stead state and other transient aspects.

Collaborative Project Work Development in a Virtual Environment with Low-Intermediate Undergraduate Colombian Students (Desarrollo de trabajo colaborativo en un ambiente virtual con estudiantes colombianos de pregrado de nivel intermedio-bajo)

Science.gov (United States)

Salinas Vacca, Yakelin

2014-01-01

This paper reports on an exploratory, descriptive, and interpretive study in which the roles of discussion boards, the students, the teacher, and the monitors were explored as they constructed a collaborative class project in a virtual environment. This research was conducted in the virtual program of a Colombian public university. Data were…

Collaborative enterprise and virtual prototyping (CEVP): a product-centric approach to distributed simulation

Science.gov (United States)

Saunders, Vance M.

1999-06-01

The downsizing of the Department of Defense (DoD) and the associated reduction in budgets has re-emphasized the need for commonality, reuse, and standards with respect to the way DoD does business. DoD has implemented significant changes in how it buys weapon systems. The new emphasis is on concurrent engineering with Integrated Product and Process Development and collaboration with Integrated Product Teams. The new DoD vision includes Simulation Based Acquisition (SBA), a process supported by robust, collaborative use of simulation technology that is integrated across acquisition phases and programs. This paper discusses the Air Force Research Laboratory's efforts to use Modeling and Simulation (M&S) resources within a Collaborative Enterprise Environment to support SBA and other Collaborative Enterprise and Virtual Prototyping (CEVP) applications. The paper will discuss four technology areas: (1) a Processing Ontology that defines a hierarchically nested set of collaboration contexts needed to organize and support multi-disciplinary collaboration using M&S, (2) a partial taxonomy of intelligent agents needed to manage different M&S resource contributions to advancing the state of product development, (3) an agent- based process for interfacing disparate M&S resources into a CEVP framework, and (4) a Model-View-Control based approach to defining `a new way of doing business' for users of CEVP frameworks/systems.

Convolution Model of a Queueing System with the cFIFO Service Discipline

Directory of Open Access Journals (Sweden)

Sławomir Hanczewski

2016-01-01

Full Text Available This article presents an approximate convolution model of a multiservice queueing system with the continuous FIFO (cFIFO service discipline. The model makes it possible to service calls sequentially with variable bit rate, determined by unoccupied (free resources of the multiservice server. As compared to the FIFO discipline, the cFIFO queue utilizes the resources of a multiservice server more effectively. The assumption in the model is that the queueing system is offered a mixture of independent multiservice Bernoulli-Poisson-Pascal (BPP call streams. The article also discusses the results of modelling a number of queueing systems to which different, non-Poissonian, call streams are offered. To verify the accuracy of the model, the results of the analytical calculations are compared with the results of simulation experiments for a number of selected queueing systems. The study has confirmed the accuracy of all adopted theoretical assumptions for the proposed analytical model.

A survey on queues in machining system: Progress from 2010 to 2017

Directory of Open Access Journals (Sweden)

Shekhar C.

2017-01-01

Full Text Available The aim of the present article is to give a historical survey of some important research works related to queues in machining system since 2010. Queues of failed machines in machine repairing problem occur due to the failure of machines at random in the manufacturing industries, where different jobs are performed on machining stations. Machines are subject to failure what may result in significant loss of production, revenue, or goodwill. In addition to the references on queues in machining system, which is also called `Machine Repair Problem' (MRP or `Machine Interference Problem' (MIP, a meticulous list of books and survey papers is also prepared so as to provide a detailed catalog for understanding the research in queueing domain. We have classified the relevant literature according to a year of publishing, methodological, and modeling aspects. The author(s hope that this survey paper could be of help to learners contemplating research on queueing domain.

Algorithm for queueing networks with multi-rate traffic

DEFF Research Database (Denmark)

Iversen, Villy Bæk; Ko, King-Tim

2011-01-01

the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolution algorithm to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general, presumes that we have product form between the nodes. Otherwise, we have the state space explosion. Even so, the detailed state space of each node may become very large because there is no product form between chains inside a node. A prerequisite for product form...

Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

NARCIS (Netherlands)

van Houtum, Geert-Jan; Adan, I.J.B.F.; Wessels, J.; Zijm, Willem H.M.

In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the

Managing Distributed Innovation Processes in Virtual Organizations by Applying the Collaborative Network Relationship Analysis

Science.gov (United States)

Eschenbächer, Jens; Seifert, Marcus; Thoben, Klaus-Dieter

Distributed innovation processes are considered as a new option to handle both the complexity and the speed in which new products and services need to be prepared. Indeed most research on innovation processes was focused on multinational companies with an intra-organisational perspective. The phenomena of innovation processes in networks - with an inter-organisational perspective - have been almost neglected. Collaborative networks present a perfect playground for such distributed innovation processes whereas the authors highlight in specific Virtual Organisation because of their dynamic behaviour. Research activities supporting distributed innovation processes in VO are rather new so that little knowledge about the management of such research is available. With the presentation of the collaborative network relationship analysis this gap will be addressed. It will be shown that a qualitative planning of collaboration intensities can support real business cases by proving knowledge and planning data.

Case Study: “Hair meets Design”: The Application of Storytelling in the Context of Long-Distance Collaboration and Virtual Teamwork

OpenAIRE

Rivera-Chang, Jose

2009-01-01

Virtual teamwork and long distance collaboration is an increasingly attractive option in design education especially when students and other participants, (for example, industry guests or sponsors) cannot meet in the same physical place or classroom. The constant improvement in technology allows this type of electronic communication to be increasingly accepted as an appropriate format for collaboration and evaluation of student projects. This paper discusses the collaboration between membe...

Transient probabilities for queues with applications to hospital waiting list management.

Science.gov (United States)

Joy, Mark; Jones, Simon

2005-08-01

In this paper we study queuing systems within the NHS. Recently imposed government performance targets lead NHS executives to investigate and instigate alternative management strategies, thereby imposing structural changes on the queues. Under such circumstances, it is most unlikely that such systems are in equilibrium. It is crucial, in our opinion, to recognise this state of affairs in order to make a balanced assessment of the role of queue management in the modern NHS. From a mathematical perspective it should be emphasised that measures of the state of a queue based upon the assumption of statistical equilibrium (a pervasive methodology in the study of queues) are simply wrong in the above scenario. To base strategic decisions around such ideas is therefore highly questionable and it is one of the purposes of this paper to offer alternatives: we present some (recent) research whose results generate performance measures and measures of risk, for example, of waiting-times growing unacceptably large; we emphasise that these results concern the transient behaviour of the queueing model-there is no asssumption of statistical equilibrium. We also demonstrate that our results are computationally tractable.

A Social Network Analysis of Teaching and Research Collaboration in a Teachers' Virtual Learning Community

Science.gov (United States)

Lin, Xiaofan; Hu, Xiaoyong; Hu, Qintai; Liu, Zhichun

2016-01-01

Analysing the structure of a social network can help us understand the key factors influencing interaction and collaboration in a virtual learning community (VLC). Here, we describe the mechanisms used in social network analysis (SNA) to analyse the social network structure of a VLC for teachers and discuss the relationship between face-to-face…

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits

Directory of Open Access Journals (Sweden)

Charles Knessl

2013-01-01

Full Text Available We consider two parallel queues, each with independent Poisson arrival rates, that are tended by a single server. The exponential server devotes all of its capacity to the longer of the queues. If both queues are of equal length, the server devotes ν of its capacity to the first queue and the remaining 1−ν to the second. We obtain exact integral representations for the joint probability distribution of the number of customers in this two-node network. Then we evaluate this distribution in various asymptotic limits, such as large numbers of customers in either/both of the queues, light traffic where arrivals are infrequent, and heavy traffic where the system is nearly unstable.

BioQueue: a novel pipeline framework to accelerate bioinformatics analysis.

Science.gov (United States)

Yao, Li; Wang, Heming; Song, Yuanyuan; Sui, Guangchao

2017-10-15

With the rapid development of Next-Generation Sequencing, a large amount of data is now available for bioinformatics research. Meanwhile, the presence of many pipeline frameworks makes it possible to analyse these data. However, these tools concentrate mainly on their syntax and design paradigms, and dispatch jobs based on users' experience about the resources needed by the execution of a certain step in a protocol. As a result, it is difficult for these tools to maximize the potential of computing resources, and avoid errors caused by overload, such as memory overflow. Here, we have developed BioQueue, a web-based framework that contains a checkpoint before each step to automatically estimate the system resources (CPU, memory and disk) needed by the step and then dispatch jobs accordingly. BioQueue possesses a shell command-like syntax instead of implementing a new script language, which means most biologists without computer programming background can access the efficient queue system with ease. BioQueue is freely available at https://github.com/liyao001/BioQueue. The extensive documentation can be found at http://bioqueue.readthedocs.io. li_yao@outlook.com or gcsui@nefu.edu.cn. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Maintenance in Single-Server Queues: A Game-Theoretic Approach

Directory of Open Access Journals (Sweden)

Najeeb Al-Matar

2009-01-01

examine a single-server queue with bulk input and secondary work during server's multiple vacations. When the buffer contents become exhausted the server leaves the system to perform some diagnostic service of a minimum of L jobs clustered in packets of random sizes (event A. The server is not supposed to stay longer than T units of time (event B. The server returns to the system when A or B occurs, whichever comes first. On the other hand, he may not break service of a packet in a middle even if A or B occurs. Furthermore, the server waits for batches of customers to arrive if upon his return the queue is still empty. We obtain a compact and explicit form functional for the queueing process in equilibrium.

The virtual library in action: Collaborative international control of high-energy physics pre-print

International Nuclear Information System (INIS)

Kreitz, P.A.; Addis, L.; Galic, H.; Johnson, T.

1996-02-01

This paper will discuss how control of the grey literature in high-energy physics pre-prints developed through a collaborative effort of librarians and physicists. It will highlight the critical steps in the development process and describe one model of a rapidly evolving virtual library for high-energy physics information. In conclusion, this paper will extend this physics model to other areas of grey literature management

Algorithm for queueing networks with multi-rate traffic

DEFF Research Database (Denmark)

Iversen, Villy Bæk; King-Tim, Ko

2011-01-01

the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolutions to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate the detailed......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general presumes that we have product form between the nodes. Other ways we have the state space explosion. Even so the detailed state space of each node may easily become very large because there is no product form between chains inside a node. A prerequisite for product form...

Optimal Service Capacities in a Competitive Multiple-Server Queueing Environment

Science.gov (United States)

Ching, Wai-Ki; Choi, Sin-Man; Huang, Min

The study of economic behavior of service providers in a competition environment is an important and interesting research issue. A two-server queueing model has been proposed in Kalai et al. [11] for this purpose. Their model aims at studying the role and impact of service capacity in capturing larger market share so as to maximize the long-run expected profit. They formulate the problem as a two-person strategic game and analyze the equilibrium solutions. The main aim of this paper is to extend the results of the two-server queueing model in [11] to the case of multiple servers. We will only focus on the case when the queueing system is stable.

Distributed interactive virtual environments for collaborative experiential learning and training independent of distance over Internet2.

Science.gov (United States)

Alverson, Dale C; Saiki, Stanley M; Jacobs, Joshua; Saland, Linda; Keep, Marcus F; Norenberg, Jeffrey; Baker, Rex; Nakatsu, Curtis; Kalishman, Summers; Lindberg, Marlene; Wax, Diane; Mowafi, Moad; Summers, Kenneth L; Holten, James R; Greenfield, John A; Aalseth, Edward; Nickles, David; Sherstyuk, Andrei; Haines, Karen; Caudell, Thomas P

2004-01-01

Medical knowledge and skills essential for tomorrow's healthcare professionals continue to change faster than ever before creating new demands in medical education. Project TOUCH (Telehealth Outreach for Unified Community Health) has been developing methods to enhance learning by coupling innovations in medical education with advanced technology in high performance computing and next generation Internet2 embedded in virtual reality environments (VRE), artificial intelligence and experiential active learning. Simulations have been used in education and training to allow learners to make mistakes safely in lieu of real-life situations, learn from those mistakes and ultimately improve performance by subsequent avoidance of those mistakes. Distributed virtual interactive environments are used over distance to enable learning and participation in dynamic, problem-based, clinical, artificial intelligence rules-based, virtual simulations. The virtual reality patient is programmed to dynamically change over time and respond to the manipulations by the learner. Participants are fully immersed within the VRE platform using a head-mounted display and tracker system. Navigation, locomotion and handling of objects are accomplished using a joy-wand. Distribution is managed via the Internet2 Access Grid using point-to-point or multi-casting connectivity through which the participants can interact. Medical students in Hawaii and New Mexico (NM) participated collaboratively in problem solving and managing of a simulated patient with a closed head injury in VRE; dividing tasks, handing off objects, and functioning as a team. Students stated that opportunities to make mistakes and repeat actions in the VRE were extremely helpful in learning specific principles. VRE created higher performance expectations and some anxiety among VRE users. VRE orientation was adequate but students needed time to adapt and practice in order to improve efficiency. This was also demonstrated successfully

Strategic behavior and social outcomes in a bottleneck queue

DEFF Research Database (Denmark)

Breinbjerg, J.; Sebald, Alexander; Østerdal, L. P.

2016-01-01

the first-in-first-out (FIFO), last-in-first-out (LIFO), and service-in-random-order (SIRO) queue disciplines and compare these predictions to outcomes from a laboratory experiment. In line with our theoretical predictions, we find that people arrive with greater dispersion when participating under the LIFO......We theoretically and experimentally study the differential incentive effects of three well known queue disciplines in a strategic environment in which a bottleneck facility opens and impatient players decide when to arrive. For a class of three-player games, we derive equilibrium arrivals under...... discipline, whereas they tend to arrive immediately under FIFO and SIRO. As a consequence, shorter waiting times are obtained under LIFO as compared to FIFO and SIRO. However, while our theoretical predictions admit higher welfare under LIFO, this is not recovered experimentally as the queue disciplines...

Virtual network computing: cross-platform remote display and collaboration software.

Science.gov (United States)

Konerding, D E

1999-04-01

VNC (Virtual Network Computing) is a computer program written to address the problem of cross-platform remote desktop/application display. VNC uses a client/server model in which an image of the desktop of the server is transmitted to the client and displayed. The client collects mouse and keyboard input from the user and transmits them back to the server. The VNC client and server can run on Windows 95/98/NT, MacOS, and Unix (including Linux) operating systems. VNC is multi-user on Unix machines (any number of servers can be run are unrelated to the primary display of the computer), while it is effectively single-user on Macintosh and Windows machines (only one server can be run, displaying the contents of the primary display of the server). The VNC servers can be configured to allow more than one client to connect at one time, effectively allowing collaboration through the shared desktop. I describe the function of VNC, provide details of installation, describe how it achieves its goal, and evaluate the use of VNC for molecular modelling. VNC is an extremely useful tool for collaboration, instruction, software development, and debugging of graphical programs with remote users.

Matrix-geometric analysis of the shortest queue problem with threshold jockeying

NARCIS (Netherlands)

Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

1993-01-01

In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these

A single-server queue with batch arrivals and semi-Markov services

NARCIS (Netherlands)

Abhishek,; Boon, M.A.A.; Boxma, O.J.; Núñez-Queija, R.

2017-01-01

We investigate the transient and stationary queue length distributions of a class of service systems with correlated service times. The classical (Formula presented.) queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The

Research into Queueing Network Theory.

Science.gov (United States)

1977-09-01

and Zeigler, B. (1975) "Equilibrium properties of arbitrarily interconnected queueing netowrks ," Tech. Report 75-4, Computer and Communication...Associate. The project was extremely fortunate to secure the services of Dr. Wendel. Dr. Wendel was a project member for one month in the summer of

Deployed Virtual Consulting: The Fusion of Wearable Computing, Collaborative Technology, Augmented Reality and Intelligent Agents to Support Fleet Aviation Maintenance

National Research Council Canada - National Science Library

Nasman, James

2004-01-01

.... By implementing wireless technology in combination with advanced software allowing the virtual collaboration of parties widely separated by geographical distance the Navy can establish a "virUal...

A workout for virtual bodybuilders (design issues for embodiment in multi-actor virtual environments)

Science.gov (United States)

Benford, Steve; Bowers, John; Fahlen, Lennart E.; Greenhalgh, Chris; Snowdon, Dave

1994-01-01

This paper explores the issue of user embodiment within collaborative virtual environments. By user embodiment we mean the provision of users with appropriate body images so as to represent them to others and also to themselves. By collaborative virtual environments we mean multi-user virtual reality systems which support cooperative work (although we argue that the results of our exploration may also be applied to other kinds of collaborative systems). The main part of the paper identifies a list of embodiment design issues including: presence, location, identity, activity, availability, history of activity, viewpoint, action point, gesture, facial expression, voluntary versus involuntary expression, degree of presence, reflecting capabilities, manipulating the user's view of others, representation across multiple media, autonomous and distributed body parts, truthfulness and efficiency. Following this, we show how these issues are reflected in our own DIVE and MASSIVE prototype collaborative virtual environments.

A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles

Science.gov (United States)

2013-09-01

Autonomous Vehicles Joseph DiVita, PhD Robert L. Morris Maria Olinda Rodas SSC Pacific Approved...298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 09–2013 Final A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles Joseph...Mission Area: Command and Control, Queueing Model; Supervisory Control; Unmanned Autonomous Vehicles M. O. Rodas U U U U 38 (619)

Collaborative Environments. Considerations Concerning Some Collaborative Systems

Directory of Open Access Journals (Sweden)

Mihaela I. MUNTEAN

2009-01-01

Full Text Available It is obvious, that all collaborative environments (workgroups, communities of practice, collaborative enterprises are based on knowledge and between collaboration and knowledge management there is a strong interdependence. The evolution of information systems in these collaborative environments led to the sudden necessity to adopt, for maintaining the virtual activities and processes, the latest technologies/systems, which are capable to support integrated collaboration in business services. In these environments, portal-based IT platforms will integrate multi-agent collaborative systems, collaborative tools, different enterprise applications and other useful information systems.

Analysis of the asymmetric shortest queue problem : part 2: numerical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem : Part 1: theoretical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths. be joins the first

Performance Analysis and Optimal Allocation of Layered Defense M/M/N Queueing Systems

Directory of Open Access Journals (Sweden)

Longyue Li

2016-01-01

Full Text Available One important mission of strategic defense is to develop an integrated layered Ballistic Missile Defense System (BMDS. Motivated by the queueing theory, we presented a work for the representation, modeling, performance simulation, and channels optimal allocation of the layered BMDS M/M/N queueing systems. Firstly, in order to simulate the process of defense and to study the Defense Effectiveness (DE, we modeled and simulated the M/M/N queueing system of layered BMDS. Specifically, we proposed the M/M/N/N and M/M/N/C queueing model for short defense depth and long defense depth, respectively; single target channel and multiple target channels were distinguished in each model. Secondly, we considered the problem of assigning limited target channels to incoming targets, we illustrated how to allocate channels for achieving the best DE, and we also proposed a novel and robust search algorithm for obtaining the minimum channel requirements across a set of neighborhoods. Simultaneously, we presented examples of optimal allocation problems under different constraints. Thirdly, several simulation examples verified the effectiveness of the proposed queueing models. This work may help to understand the rules of queueing process and to provide optimal configuration suggestions for defense decision-making.

Apparatus and method for managing digital resources by passing digital resource tokens between queues

Science.gov (United States)

Crawford, H.J.; Lindenstruth, V.

1999-06-29

A method of managing digital resources of a digital system includes the step of reserving token values for certain digital resources in the digital system. A selected token value in a free-buffer-queue is then matched to an incoming digital resource request. The selected token value is then moved to a valid-request-queue. The selected token is subsequently removed from the valid-request-queue to allow a digital agent in the digital system to process the incoming digital resource request associated with the selected token. Thereafter, the selected token is returned to the free-buffer-queue. 6 figs.

Fluid queues and regular variation

NARCIS (Netherlands)

O.J. Boxma (Onno)

1996-01-01

textabstractThis paper considers a fluid queueing system, fed by $N$ independent sources that alternate between silence and activity periods. We assume that the distribution of the activity periods of one or more sources is a regularly varying function of index $zeta$. We show that its fat tail

Incorporating Brokers within Collaboration Environments

Science.gov (United States)

Rajasekar, A.; Moore, R.; de Torcy, A.

2013-12-01

A collaboration environment, such as the integrated Rule Oriented Data System (iRODS - http://irods.diceresearch.org), provides interoperability mechanisms for accessing storage systems, authentication systems, messaging systems, information catalogs, networks, and policy engines from a wide variety of clients. The interoperability mechanisms function as brokers, translating actions requested by clients to the protocol required by a specific technology. The iRODS data grid is used to enable collaborative research within hydrology, seismology, earth science, climate, oceanography, plant biology, astronomy, physics, and genomics disciplines. Although each domain has unique resources, data formats, semantics, and protocols, the iRODS system provides a generic framework that is capable of managing collaborative research initiatives that span multiple disciplines. Each interoperability mechanism (broker) is linked to a name space that enables unified access across the heterogeneous systems. The collaboration environment provides not only support for brokers, but also support for virtualization of name spaces for users, files, collections, storage systems, metadata, and policies. The broker enables access to data or information in a remote system using the appropriate protocol, while the collaboration environment provides a uniform naming convention for accessing and manipulating each object. Within the NSF DataNet Federation Consortium project (http://www.datafed.org), three basic types of interoperability mechanisms have been identified and applied: 1) drivers for managing manipulation at the remote resource (such as data subsetting), 2) micro-services that execute the protocol required by the remote resource, and 3) policies for controlling the execution. For example, drivers have been written for manipulating NetCDF and HDF formatted files within THREDDS servers. Micro-services have been written that manage interactions with the CUAHSI data repository, the Data

Corporate Training in Virtual Worlds

Directory of Open Access Journals (Sweden)

Charles Nebolsky

2004-12-01

Full Text Available This paper presents virtual training worlds that are relatively low-cost distributed collaborative learning environments suitable for corporate training. A virtual training world allows a facilitator, experts and trainees communicating and acting in the virtual environment for practicing skills during collaborative problem solving. Using these environments is beneficial to both trainees and corporations. Two system prototypes – the sales training and the leadership training virtual worlds – are described. The leadership training course design is discussed in details.

Performance study of Active Queue Management methods: Adaptive GRED, REDD, and GRED-Linear analytical model

Directory of Open Access Journals (Sweden)

Hussein Abdel-jaber

2015-10-01

Full Text Available Congestion control is one of the hot research topics that helps maintain the performance of computer networks. This paper compares three Active Queue Management (AQM methods, namely, Adaptive Gentle Random Early Detection (Adaptive GRED, Random Early Dynamic Detection (REDD, and GRED Linear analytical model with respect to different performance measures. Adaptive GRED and REDD are implemented based on simulation, whereas GRED Linear is implemented as a discrete-time analytical model. Several performance measures are used to evaluate the effectiveness of the compared methods mainly mean queue length, throughput, average queueing delay, overflow packet loss probability, and packet dropping probability. The ultimate aim is to identify the method that offers the highest satisfactory performance in non-congestion or congestion scenarios. The first comparison results that are based on different packet arrival probability values show that GRED Linear provides better mean queue length; average queueing delay and packet overflow probability than Adaptive GRED and REDD methods in the presence of congestion. Further and using the same evaluation measures, Adaptive GRED offers a more satisfactory performance than REDD when heavy congestion is present. When the finite capacity of queue values varies the GRED Linear model provides the highest satisfactory performance with reference to mean queue length and average queueing delay and all the compared methods provide similar throughput performance. However, when the finite capacity value is large, the compared methods have similar results in regard to probabilities of both packet overflowing and packet dropping.

A Metrics Approach for Collaborative Systems

Directory of Open Access Journals (Sweden)

Cristian CIUREA

2009-01-01

Full Text Available This article presents different types of collaborative systems, their structure and classification. This paper defines the concept of virtual campus as a collaborative system. It builds architecture for virtual campus oriented on collaborative training processes. It analyses the quality characteristics of collaborative systems and propose techniques for metrics construction and validation in order to evaluate them. The article analyzes different ways to increase the efficiency and the performance level in collaborative banking systems.

Parallel discrete-event simulation of FCFS stochastic queueing networks

Science.gov (United States)

Nicol, David M.

1988-01-01

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

Queue and stack sorting algorithm optimization and performance analysis

Science.gov (United States)

Qian, Mingzhu; Wang, Xiaobao

2018-04-01

Sorting algorithm is one of the basic operation of a variety of software development, in data structures course specializes in all kinds of sort algorithm. The performance of the sorting algorithm is directly related to the efficiency of the software. A lot of excellent scientific research queue is constantly optimizing algorithm, algorithm efficiency better as far as possible, the author here further research queue combined with stacks of sorting algorithms, the algorithm is mainly used for alternating operation queue and stack storage properties, Thus avoiding the need for a large number of exchange or mobile operations in the traditional sort. Before the existing basis to continue research, improvement and optimization, the focus on the optimization of the time complexity of the proposed optimization and improvement, The experimental results show that the improved effectively, at the same time and the time complexity and space complexity of the algorithm, the stability study corresponding research. The improvement and optimization algorithm, improves the practicability.

Fluid queues and regular variation

NARCIS (Netherlands)

Boxma, O.J.

1996-01-01

This paper considers a fluid queueing system, fed by N independent sources that alternate between silence and activity periods. We assume that the distribution of the activity periods of one or more sources is a regularly varying function of index ¿. We show that its fat tail gives rise to an even

LHCb experience with running jobs in virtual machines

Science.gov (United States)

McNab, A.; Stagni, F.; Luzzi, C.

2015-12-01

The LHCb experiment has been running production jobs in virtual machines since 2013 as part of its DIRAC-based infrastructure. We describe the architecture of these virtual machines and the steps taken to replicate the WLCG worker node environment expected by user and production jobs. This relies on the uCernVM system for providing root images for virtual machines. We use the CernVM-FS distributed filesystem to supply the root partition files, the LHCb software stack, and the bootstrapping scripts necessary to configure the virtual machines for us. Using this approach, we have been able to minimise the amount of contextualisation which must be provided by the virtual machine managers. We explain the process by which the virtual machine is able to receive payload jobs submitted to DIRAC by users and production managers, and how this differs from payloads executed within conventional DIRAC pilot jobs on batch queue based sites. We describe our operational experiences in running production on VM based sites managed using Vcycle/OpenStack, Vac, and HTCondor Vacuum. Finally we show how our use of these resources is monitored using Ganglia and DIRAC.

On applications of excess level processes to (N,D-policy bulk queueing systems

Directory of Open Access Journals (Sweden)

Jewgeni H. Dshalalow

1996-01-01

Full Text Available The paper deals with queueing systems in which N- and D-policies are combined into one. This means that an idle or vacationing server will resume his service if the queueing or workload process crosses some specified fixed level N or D, respectively. For the proposed (N,D-policy we study the queueing processes in models with and without server vacations, with compound Poisson input, and with generally distributed service and vacation periods. The analysis of the models is essentially based on fluctuation techniques for two-dimensional marked counting processes newly developed by the author. The results enable us to arrive at stationary distributions for the embedded and continuous time parameter queueing processes in closed analytic forms, enhancing the well-known Kendall formulas and their modifications.

Manajemen Bandwidth Simple Queue dan Queue Tree pada PT. Endorsindo Makmur Selaras

OpenAIRE

Budiman, Arif

2015-01-01

  The purpose of this study is to analyze and optimize the bandwidth management at PT. Endorsindo Makmur Selaras, with the expectation that the distribution of bandwidth can be evenly distributed to each employee so that the employee can improve performance and quality of the company. Research methods used include analysis methods (survey and interview system that runs directly on the user) and to optimize bandwidth management method to configure the proxy using the Queue Tree. The re...

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South AfricaExperiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa

Directory of Open Access Journals (Sweden)

Dudu G. Sokhela

2013-07-01

Full Text Available Background: Comprehensive Primary Health Care (PHC, based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans.Objectives: Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients’ experiences led to satisfaction or dissatisfaction with the Fast Queue service.Method: A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed.Results: Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources

Convergence of a Queueing System in Heavy Traffic with General Abandonment Distributions

Science.gov (United States)

2010-10-08

331–391, 2005. [4] R. Atar . Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. Ann. Appl. Probab., 15...4):2606–2650, 2005. 37 [5] R. Atar , A. Mandelbaum, and M. I. Reiman. Scheduling a multi class queue with many exponential servers: asymptotic

Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks

OpenAIRE

Kim, Ku-Hwan; To, Hoang-Linh; Hwang, Won-Joo; Lee, Jung-Tae

2016-01-01

Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long) queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal...

DecreaseKeys are Expensive for External Memory Priority Queues

OpenAIRE

Eenberg, Kasper; Larsen, Kasper Green; Yu, Huacheng

2016-01-01

One of the biggest open problems in external memory data structures is the priority queue problem with DecreaseKey operations. If only Insert and ExtractMin operations need to be supported, one can design a comparison-based priority queue performing $O((N/B)\\lg_{M/B} N)$ I/Os over a sequence of $N$ operations, where $B$ is the disk block size in number of words and $M$ is the main memory size in number of words. This matches the lower bound for comparison-based sorting and is hence optimal fo...

Virtual Workshop

DEFF Research Database (Denmark)

Buus, Lillian; Bygholm, Ann

In relation to the Tutor course in the Mediterranean Virtual University (MVU) project, a virtual workshop “Getting experiences with different synchronous communication media, collaboration, and group work” was held with all partner institutions in January 2006. More than 25 key-tutors within MVU...

Virtual Interactive Presence in Global Surgical Education: International Collaboration Through Augmented Reality.

Science.gov (United States)

Davis, Matthew Christopher; Can, Dang D; Pindrik, Jonathan; Rocque, Brandon G; Johnston, James M

2016-02-01

Technology allowing a remote, experienced surgeon to provide real-time guidance to local surgeons has great potential for training and capacity building in medical centers worldwide. Virtual interactive presence and augmented reality (VIPAR), an iPad-based tool, allows surgeons to provide long-distance, virtual assistance wherever a wireless internet connection is available. Local and remote surgeons view a composite image of video feeds at each station, allowing for intraoperative telecollaboration in real time. Local and remote stations were established in Ho Chi Minh City, Vietnam, and Birmingham, Alabama, as part of ongoing neurosurgical collaboration. Endoscopic third ventriculostomy with choroid plexus coagulation with VIPAR was used for subjective and objective evaluation of system performance. VIPAR allowed both surgeons to engage in complex visual and verbal communication during the procedure. Analysis of 5 video clips revealed video delay of 237 milliseconds (range, 93-391 milliseconds) relative to the audio signal. Excellent image resolution allowed the remote neurosurgeon to visualize all critical anatomy. The remote neurosurgeon could gesture to structures with no detectable difference in accuracy between stations, allowing for submillimeter precision. Fifteen endoscopic third ventriculostomy with choroid plexus coagulation procedures have been performed with the use of VIPAR between Vietnam and the United States, with no significant complications. 80% of these patients remain shunt-free. Evolving technologies that allow long-distance, intraoperative guidance, and knowledge transfer hold great potential for highly efficient international neurosurgical education. VIPAR is one example of an inexpensive, scalable platform for increasing global neurosurgical capacity. Efforts to create a network of Vietnamese neurosurgeons who use VIPAR for collaboration are underway. Copyright © 2016 Elsevier Inc. All rights reserved.

General bulk service queueing system with N-policy, multiplevacations, setup time and server breakdown without interruption

Science.gov (United States)

Sasikala, S.; Indhira, K.; Chandrasekaran, V. M.

2017-11-01

In this paper, we have considered an MX / (a,b) / 1 queueing system with server breakdown without interruption, multiple vacations, setup times and N-policy. After a batch of service, if the size of the queue is ξ (customers in the queue. After a vacation, if the server finds at least N customers waiting for service, then the server needs a setup time to start the service. After a batch of service, if the amount of waiting customers in the queue is ξ (≥ a) then the server serves a batch of min(ξ,b) customers, where b ≥ a. We derived the probability generating function of queue length at arbitrary time epoch. Further, we obtained some important performance measures.

Dobrushin's approach to queueing network theory

Directory of Open Access Journals (Sweden)

F. I. Karpelevich

1996-01-01

Full Text Available R.L. Dobrushin (1929-1995 made substantial contributions to Queueing Network Theory (QNT. A review of results from QNT which arose from his ideas or were connected to him in other ways is given. We also comment on various related open problems.

Virtual team learning: The role of collaboration process and technology affordance in team decision making

Directory of Open Access Journals (Sweden)

Sean Cordes

2016-12-01

Full Text Available The study examines two dimensions that impact virtual team decision making. One is the influence of collaboration process structure: the sequences, patterns, and routines participants use to interact and solve problems. The other is technology affordance: the strengths and weaknesses of technologies in terms of the usefulness they offer to teams when performing tasks. Some teams used a structured collaboration process with monitoring, coordination, and backup functions during a decision-making discussion. Other teams had no discussion process instructions. In addition, some teams possessed stronger technology affordance including both chat and an editable document. Other teams used chat technology alone, which offered fewer collaboration possibilities. The collaboration process and technology affordance factors were tested in an experiment in which four-person online teams worked as a personnel hiring committee. Information about four job candidates was distributed to create a hidden profile in which some information was shared across all team members, while other information was visible only to specific members. Two hundred and eight students, comprising fifty-two teams completed the study. Teams using the structured collaboration process made more accurate and higher-quality decisions. In addition, scores were higher when technology affordance included both chat and editable document tools, but this influence was not significant.

An asymptotic analysis of closed queueing networks with branching populations

OpenAIRE

Bayer, N.; Coffman, E.G.; Kogan, Y.A.

1995-01-01

textabstractClosed queueing networks have proven to be valuable tools for system performance analysis. In this paper, we broaden the applications of such networks by incorporating populations of {em branching customers: whenever a customer completes service at some node of the network, it is replaced by N>=0 customers, each routed independently to a next node, where N has a given, possibly node-dependent branching distribution. Applications of these branching and queueing networks focus on {e...

Some reflections on the Renewal-theory paradox in queueing theory

Directory of Open Access Journals (Sweden)

Robert B. Cooper

1998-01-01

Full Text Available The classical renewal-theory (waiting time, or inspection paradox states that the length of the renewal interval that covers a randomly-selected time epoch tends to be longer than an ordinary renewal interval. This paradox manifests itself in numerous interesting ways in queueing theory, a prime example being the celebrated Pollaczek-Khintchine formula for the mean waiting time in the M/G/1 queue. In this expository paper, we give intuitive arguments that “explain” why the renewal-theory paradox is ubiquitous in queueing theory, and why it sometimes produces anomalous results. In particular, we use these intuitive arguments to explain decomposition in vacation models, and to derive formulas that describe some recently-discovered counterintuitive results for polling models, such as the reduction of waiting times as a consequence of forcing the server to set up even when no work is waiting.

An introduction to queueing theory modeling and analysis in applications

CERN Document Server

Bhat, U Narayan

2015-01-01

This introductory textbook is designed for a one-semester course on queueing theory that does not require a course on stochastic processes as a prerequisite. By integrating the necessary background on stochastic processes with the analysis of models, the work provides a sound foundational introduction to the modeling and analysis of queueing systems for a wide interdisciplinary audience of students in mathematics, statistics, and applied disciplines such as computer science, operations research, and engineering. This edition includes additional topics in methodology and applications. Key features: • An introductory chapter including a historical account of the growth of queueing theory in more than 100 years. • A modeling-based approach with emphasis on identification of models. • Rigorous treatment of the foundations of basic models commonly used in applications with appropriate references for advanced topics. • Applications in manufacturing and, computer and communication systems. • A chapter on ...

A bulk queueing system under N-policy with bilevel service delay discipline and start-up time

Directory of Open Access Journals (Sweden)

David C. R. Muh

1993-01-01

Full Text Available The author studies the queueing process in a single-server, bulk arrival and batch service queueing system with a compound Poisson input, bilevel service delay discipline, start-up time, and a fixed accumulation level with control operating policy. It is assumed that when the queue length falls below a predefined level r(≥1, the system, with server capacity R, immediately stops service until the queue length reaches or exceeds the second predefined accumulation level N(≥r. Two cases, with N≤R and N≥R, are studied.

Maintaining collaborative, democratic and dialogue-based learning processes in virtual and game-based learning environments

DEFF Research Database (Denmark)

Gyldendahl Jensen, Camilla; Sorensen, Elsebeth Korsgaard

2017-01-01

The incorporation and use of virtual learning platforms, including computer games, in the education sector, challenge these years the complexity of the learning environment regarding maintaining collaborative, democratic and dialogue-based learning processes that support a high degree of reflection....... When virtual learning platforms are used in an educational context, a fundamental paradox appears as the student needs an active and practice-oriented participation identity to learn while at the same time needing to learn to acquire a participation identity. This identity is raised and trained...... by being a continuous part of a community that recalls the scenarios of reality. It is therefore crucial that the learning environment reflects the reality of which the students' professionalism is unfolded. Learning is, therefore, something more and not just the acquisition of knowledge and past actions...

Exclusive queueing model including the choice of service windows

Science.gov (United States)

Tanaka, Masahiro; Yanagisawa, Daichi; Nishinari, Katsuhiro

2018-01-01

In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells. We contrived a logit-based choice algorithm for agents considering the numbers of agents and the distances to all service windows. Simulations were conducted with various parameters of agent choice preference for these two elements and for different floor configurations, including the floor length and the number of service windows. We investigated the model from the viewpoint of transit times and entrance block rates. The influences of the parameters on these factors were surveyed in detail and we determined that there are optimum floor lengths that minimize the transit times. In addition, we observed that the transit times were determined almost entirely by the entrance block rates. The results of the presented model are relevant to understanding queueing systems including the choice of service windows and can be employed to optimize facility design and floor management.

Moving toward queue operations at the Large Binocular Telescope Observatory

Science.gov (United States)

Edwards, Michelle L.; Summers, Doug; Astier, Joseph; Suarez Sola, Igor; Veillet, Christian; Power, Jennifer; Cardwell, Andrew; Walsh, Shane

2016-07-01

The Large Binocular Telescope Observatory (LBTO), a joint scientific venture between the Instituto Nazionale di Astrofisica (INAF), LBT Beteiligungsgesellschaft (LBTB), University of Arizona, Ohio State University (OSU), and the Research Corporation, is one of the newest additions to the world's collection of large optical/infrared ground-based telescopes. With its unique, twin 8.4m mirror design providing a 22.8 meter interferometric baseline and the collecting area of an 11.8m telescope, LBT has a window of opportunity to exploit its singular status as the "first" of the next generation of Extremely Large Telescopes (ELTs). Prompted by urgency to maximize scientific output during this favorable interval, LBTO recently re-evaluated its operations model and developed a new strategy that augments classical observing with queue. Aided by trained observatory staff, queue mode will allow for flexible, multi-instrument observing responsive to site conditions. Our plan is to implement a staged rollout that will provide many of the benefits of queue observing sooner rather than later - with more bells and whistles coming in future stages. In this paper, we outline LBTO's new scientific model, focusing specifically on our "lean" resourcing and development, reuse and adaptation of existing software, challenges presented from our one-of-a-kind binocular operations, and lessons learned. We also outline further stages of development and our ultimate goals for queue.

SEMINAR ABOUT SERIOUS GAMES AND VIRTUAL WORLDS: An Experience of International Collaboration And Reflection

Directory of Open Access Journals (Sweden)

Wolfram LAASER

2011-08-01

Full Text Available The educational possibilities of ICT, dizzying and exponentially growing every day, offer multiple alternatives of mediation for teaching, learning and communication.Thus, the inclusion of video games and virtual worlds into educational context represents a qualitative leap that claims to significantly boost ways of communication and knowledge representation of the scenarios involved. Aware of this reality, in the framework of the Master of Technology Enhanced Learning at the National University of Cordoba, Argentina, a virtual seminar was offered to students to address the issue on the basis of invited lectures of worldwide recognized experts. The format chosen for the seminar allowed the treatment of subjects not only through reading assignments and web quests to be discussed collaboratively but also included the state of the art experience of developers working in the field. The paper describes didactic design and technical solutions of the seminar format.

Strategies for a centralized single product multiclass M/G/1 make-to-stock queue

OpenAIRE

Abouee-Mehrizi, Hossein; Balcıoğlu, Ahmet Barış; Balcioglu, Ahmet Baris; Baron, Opher

2012-01-01

Make-to-stock queues are typically investigated in the M/M/1 settings. For centralized single-item systems with backlogs, the multilevel rationing (MR) policy is established as optimal and the strict priority (SP) policy is a practical compromise, balancing cost and ease of implementation. However, the optimal policy is unknown when service time is general, i.e., for M/G/1 queues. Dynamic programming, the tool commonly used to investigate the MR policy in make-to-stock queues, is less practic...

The Geo/Geo/1+1 Queueing System with Negative Customers

OpenAIRE

Ma, Zhanyou; Guo, Yalin; Wang, Pengcheng; Hou, Yumei

2013-01-01

We study a Geo/Geo/1+1 queueing system with geometrical arrivals of both positive and negative customers in which killing strategies considered are removal of customers at the head (RCH) and removal of customers at the end (RCE). Using quasi-birth-death (QBD) process and matrix-geometric solution method, we obtain the stationary distribution of the queue length, the average waiting time of a new arrival customer, and the probabilities of servers in busy or idle period, respectively. Finally, ...

COLLABORATION AND DIALOGUE IN VIRTUAL REALITY

OpenAIRE

Camilla Gyldendahl Jensen

2017-01-01

“Virtual reality” adds a new dimension to constructivist problem-based learning (PBL) environments in the architectural and building construction educations, where a realistic and lifelike presence in a building enables students to assess and discuss how the various solutions interact with each other. Combined with “Building Information Models” (BIM), “Virtual Reality” provides an entirely new opportunity to innovate and optimize the architecture and construction in its early stages, which cr...

An M/G/1 queue with multiple types of feedback and gated vacations

NARCIS (Netherlands)

O.J. Boxma (Onno); U. Yechiali

1995-01-01

textabstractThis paper considers a single-server queue with Poisson arrivals and multiple customer feedbacks. If the first service attempt of a newly arriving customer is not successful, he returns to the end of the queue for another service attempt, with a different service time distribution. He

Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal

Directory of Open Access Journals (Sweden)

Yang Woo Shin

1999-01-01

Full Text Available We consider a single server Markovian queue with two types of customers; positive and negative, where positive customers arrive in batches and arrivals of negative customers remove positive customers in batches. Only positive customers form a queue and negative customers just reduce the system congestion by removing positive ones upon their arrivals. We derive the LSTs of sojourn time distributions for a single server Markovian queue with positive customers and negative customers by using the first passage time arguments for Markov chains.

Queue Management Practices of Quick ServiceRestaurants (QSR in Lipa City, Philippines

Directory of Open Access Journals (Sweden)

Leoven A. Austria

2015-12-01

Full Text Available –Problems regarding waiting line in quick service restaurants (QSR has been one of the main concerns of industries and scholars nowadays. It is because people today demand not only for qualityfood but also for speed. Quick service restaurant players explore on the approaches to optimize the efficiency of restaurant management. One important area that defines how well and efficient a fast food restaurant delivers its product and services to customers is its waiting line (queue management practices. The study was conducted at Lipa City, involving five popular quick service restaurants named by the researcher as QSR A, B, C, D, and E. It made used of 363customer respondents proportionally obtained from five restaurants.It intended to assess the extent of implementation of the queue management practices of the restaurants and the level of satisfaction of the customers in such practices in terms of customer arrival, waiting line and service facility. The findings revealed the queuing system used and the waiting line structured utilized by the restaurants. The extent of implementation of the queue management practices in the three areas mentioned of the five QSR’s was presented comparatively. Likewise, the level of customer’s satisfaction on the queue management practices was also determined. Significant difference in the extent of implementation and in the level of customer satisfaction were determined if the respondents were grouped according to restaurant’s profile. Recommendations in the improvement of queue were given based on the findings.

Markov-modulated and feedback fluid queues

NARCIS (Netherlands)

Scheinhardt, Willem R.W.

1998-01-01

In the last twenty years the field of Markov-modulated fluid queues has received considerable attention. In these models a fluid reservoir receives and/or releases fluid at rates which depend on the actual state of a background Markov chain. In the first chapter of this thesis we give a short

Fokker-Planck description for the queue dynamics of large tick stocks

Science.gov (United States)

Garèche, A.; Disdier, G.; Kockelkoren, J.; Bouchaud, J.-P.

2013-09-01

Motivated by empirical data, we develop a statistical description of the queue dynamics for large tick assets based on a two-dimensional Fokker-Planck (diffusion) equation. Our description explicitly includes state dependence, i.e., the fact that the drift and diffusion depend on the volume present on both sides of the spread. “Jump” events, corresponding to sudden changes of the best limit price, must also be included as birth-death terms in the Fokker-Planck equation. All quantities involved in the equation can be calibrated using high-frequency data on the best quotes. One of our central findings is that the dynamical process is approximately scale invariant, i.e., the only relevant variable is the ratio of the current volume in the queue to its average value. While the latter shows intraday seasonalities and strong variability across stocks and time periods, the dynamics of the rescaled volumes is universal. In terms of rescaled volumes, we found that the drift has a complex two-dimensional structure, which is a sum of a gradient contribution and a rotational contribution, both stable across stocks and time. This drift term is entirely responsible for the dynamical correlations between the ask queue and the bid queue.

Queueing in a spent fuel transportation system - preliminary analysis of implications for system design

International Nuclear Information System (INIS)

Cashwell, J.W.; Wood, T.W.

1985-01-01

Compliance with the Nuclear Waste Policy Act of 1982 (PL 97-425) will require the transportation of large volumes of spent fuel to a central receiving facility (either a geologic repository or a monitored retrievable storage facility). Decisions on the transport mode and technology will evolve over the next several years, in anticipation of the deployment of a receiving facility in the late 1990s. Regardless of the particular transportation mode or modes and the details of cask technology, the transport system from many diverse sources to a single point will generate an essentially random arrival pattern. This random arrival pattern will lead to the formation of queues at the receiving facility. As is normal in any queueing system, the waiting time distribution caused by this queueing will depend on the receiving facility input processing rate and the characteristics of the traffic. Since this is a cyclic system, there is also a reverse effect in which (for a given size cask fleet) average wait time affects traffic intensity. Both effects must be accounted for to properly represent the system. This paper develops a simple analytic queueing model which accounts for both of these effects simultaneously. Since both effects are determined by receiving facility input rates and cask fleet size and characteristics, two major sets of system design parameters are linked by the queueing process. The model is used with estimated traffic and service parameters to predict the severity of queueing under plausible reference system conditions, and to establish shadow prices for the trade off between larger cask fleets and more efficient receiving facilities. Since many of the parameter values used in this estimation are quite preliminary, these results are presented primarily in the context of demonstrating the utility of the queueing model for future trade off studies

Virtual Worlds for Virtual Organizing

Science.gov (United States)

Rhoten, Diana; Lutters, Wayne

The members and resources of a virtual organization are dispersed across time and space, yet they function as a coherent entity through the use of technologies, networks, and alliances. As virtual organizations proliferate and become increasingly important in society, many may exploit the technical architecture s of virtual worlds, which are the confluence of computer-mediated communication, telepresence, and virtual reality originally created for gaming. A brief socio-technical history describes their early origins and the waves of progress followed by stasis that brought us to the current period of renewed enthusiasm. Examination of contemporary examples demonstrates how three genres of virtual worlds have enabled new arenas for virtual organizing: developer-defined closed worlds, user-modifiable quasi-open worlds, and user-generated open worlds. Among expected future trends are an increase in collaboration born virtually rather than imported from existing organizations, a tension between high-fidelity recreations of the physical world and hyper-stylized imaginations of fantasy worlds, and the growth of specialized worlds optimized for particular sectors, companies, or cultures.

Approximations for the waiting time distribution in an M/G/c priority queue

NARCIS (Netherlands)

Al Hanbali, Ahmad; Alvarez, Elisa; van der Heijden, Matthijs C.

2013-01-01

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the

Queue balancing of load and expedition service in a cement industry in Brazil

Directory of Open Access Journals (Sweden)

David Custódio de Sena

2013-11-01

Full Text Available The load and weight process in a cement industry is one of logistic step that shows the biggest time of occurrence, increasing the queues. This study aims to do a scenarios to solve this queue problem. This way, it pretends to find an better resources distribuition.

A robust and high-performance queue management controller for large round trip time networks

Science.gov (United States)

Khoshnevisan, Ladan; Salmasi, Farzad R.

2016-05-01

Congestion management for transmission control protocol is of utmost importance to prevent packet loss within a network. This necessitates strategies for active queue management. The most applied active queue management strategies have their inherent disadvantages which lead to suboptimal performance and even instability in the case of large round trip time and/or external disturbance. This paper presents an internal model control robust queue management scheme with two degrees of freedom in order to restrict the undesired effects of large and small round trip time and parameter variations in the queue management. Conventional approaches such as proportional integral and random early detection procedures lead to unstable behaviour due to large delay. Moreover, internal model control-Smith scheme suffers from large oscillations due to the large round trip time. On the other hand, other schemes such as internal model control-proportional integral and derivative show excessive sluggish performance for small round trip time values. To overcome these shortcomings, we introduce a system entailing two individual controllers for queue management and disturbance rejection, simultaneously. Simulation results based on Matlab/Simulink and also Network Simulator 2 (NS2) demonstrate the effectiveness of the procedure and verify the analytical approach.

Application of queueing models to multiprogrammed computer systems operating in a time-critical environment

Science.gov (United States)

Eckhardt, D. E., Jr.

1979-01-01

A model of a central processor (CPU) which services background applications in the presence of time critical activity is presented. The CPU is viewed as an M/M/1 queueing system subject to periodic interrupts by deterministic, time critical process. The Laplace transform of the distribution of service times for the background applications is developed. The use of state of the art queueing models for studying the background processing capability of time critical computer systems is discussed and the results of a model validation study which support this application of queueing models are presented.

On a first passage problem in general queueing systems with multiple vacations

Directory of Open Access Journals (Sweden)

Jewgeni H. Dshalalow

1992-01-01

Full Text Available The author studies a generalized single-server queueing system with bulk arrivals and batch service, where the server takes vacations each time the queue level falls below r(≥1 in accordance with the multiple vacation discipline. The input to the system is assumed to be a compound Poisson process modulated by the system and the service is assumed to be state dependent. One of the essential part in the analysis of the system is the employment of new techniques related to the first excess level processes. A preliminary analysis of such processes and recent results of the author on modulated processes enabled the author to obtain all major characteristics for the queueing process explicitly. Various examples and applications are discussed.

Pricing Analysis in Geo/Geo/1 Queueing System

Directory of Open Access Journals (Sweden)

Yan Ma

2015-01-01

Full Text Available This paper studies the equilibrium behavior of customers and optimal pricing strategies of servers in a Geo/Geo/1 queueing system. Two common pricing mechanisms are considered. The first one is called ex-post payment (EPP scheme where the server collects tolls proportional to queue times, and the second one is called ex-ante payment (EAP scheme where the server charges a flat fee for the total service. The server sets the toll price to maximize its own profit. It is found that, under a customer’s choice equilibrium, the two toll mechanisms are equivalent from the economic point of view. Finally, we present several numerical experiments to investigate the effects of system parameters on the equilibrium customer joining rate and servers’ profits.

Intellectual Data Analysis Method for Evaluation of Virtual Teams

Directory of Open Access Journals (Sweden)

Sandra Strigūnaitė

2013-01-01

Full Text Available The purpose of the article is to present a method for virtual team performance evaluation based on intelligent team member collaboration data analysis. The motivation for the research is based on the ability to create an evaluation method that is similar to ambiguous expert evaluations. The concept of the hierarchical fuzzy rule based method aims to evaluate the data from virtual team interaction instances related to implementation of project tasks. The suggested method is designed for project managers or virtual team leaders to help in virtual teamwork evaluation that is based on captured data analysis. The main point of the method is the ability to repeat human thinking and expert valuation process for data analysis by applying fuzzy logic: fuzzy sets, fuzzy signatures and fuzzy rules. The fuzzy set principle used in the method allows evaluation criteria numerical values to transform into linguistic terms and use it in constructing fuzzy rules. Using a fuzzy signature is possible in constructing a hierarchical criteria structure. This structure helps to solve the problem of exponential increase of fuzzy rules including more input variables. The suggested method is aimed to be applied in the virtual collaboration software as a real time teamwork evaluation tool. The research shows that by applying fuzzy logic for team collaboration data analysis it is possible to get evaluations equal to expert insights. The method includes virtual team, project task and team collaboration data analysis. The advantage of the suggested method is the possibility to use variables gained from virtual collaboration systems as fuzzy rules inputs. Information on fuzzy logic based virtual teamwork collaboration evaluation has evidence that can be investigated in the future. Also the method can be seen as the next virtual collaboration software development step.

Queueing models for token and slotted ring networks. Thesis

Science.gov (United States)

Peden, Jeffery H.

1990-01-01

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

The Internet and medical collaboration using virtual reality.

Science.gov (United States)

Liang, Wen Yau; O'Grady, Peter

2003-01-01

Computed Tomography (CT) provides a large amount of data but the presentation of the data to a physician can be less than satisfactory. Ideally, the image data should be available to physicians in interactive 3D to allow for improved visualization, planning and diagnosis. A virtual reality representation that not only allows for the manipulation of the image but also allows for the user to, in effect, move inside the image remotely would be ideal. In this paper the research associated with virtual reality is discussed. A formalism is then presented to create, from the CT data, the virtual reality world in the Virtual Reality Modeling Language. An implementation is described of this formalism that uses the Internet to allow for users in remote locations to view and manipulate the virtual worlds.

Open problems in Gaussian fluid queueing theory

NARCIS (Netherlands)

Dȩbicki, K.; Mandjes, M.

2011-01-01

We present three challenging open problems that originate from the analysis of the asymptotic behavior of Gaussian fluid queueing models. In particular, we address the problem of characterizing the correlation structure of the stationary buffer content process, the speed of convergence to

Towards a Model of Collaborative Intention

DEFF Research Database (Denmark)

Razmerita, Liana; Kirchner, Kathrin; Hockerts, Kai

2018-01-01

outcome expectancy and communal support expectancy. Additionally, we reveal that collaborative outcome expectancy is predicated on individuals’ belief about his/her ability to collaborate whereas communal support expectancy is impacted by the individual’s perception of communal influence.......Disentangling factors that affect one’s intention to collaborate is an important endeavor for management education, especially for globally dispersed groups of students. Drawing on a synthesis of four theories, we advance a model of collaboration intentions that embodies both individual...... and communal level drivers of individuals’ intention to participate in virtual collaboration. The model is validated based on data collected from 2,517 participants in a Massive Online Open Course (MOOC). Results demonstrate that attitudes towards virtual collaboration are predicted by both collaborative...

Sojourn time tails in the single server queue with heavy-tailed service times

NARCIS (Netherlands)

Boxma, O.J.; Denisov, D.E.

2009-01-01

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 - a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution

Virtual Reality Based Collaborative Design by Children with High-Functioning Autism: Design-Based Flexibility, Identity, and Norm Construction

Science.gov (United States)

Ke, Fengfeng; Lee, Sungwoong

2016-01-01

This exploratory case study examined the process and potential impact of collaborative architectural design and construction in an OpenSimulator-based virtual reality (VR) on the social skills development of children with high-functioning autism (HFA). Two children with a formal medical diagnosis of HFA and one typically developing peer, aged…

On the Discrete-Time GeoX/G/1 Queues under N-Policy with Single and Multiple Vacations

Directory of Open Access Journals (Sweden)

Sung J. Kim

2013-01-01

Full Text Available We consider the discrete-time GeoX/G/1 queue under N-policy with single and multiple vacations. In this queueing system, the server takes multiple vacations and a single vacation whenever the system becomes empty and begins to serve customers only if the queue length is at least a predetermined threshold value N. Using the well-known property of stochastic decomposition, we derive the stationary queue-length distributions for both vacation models in a simple and unified manner. In addition, we derive their busy as well as idle-period distributions. Some classical vacation models are considered as special cases.

Sojourn time tails in the single server queue with heavy-tailed service times

NARCIS (Netherlands)

Boxma, O.J.; Denisov, D.E.

2011-01-01

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1-a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is

Labour costs and queueing theory in retailing

NARCIS (Netherlands)

J.B.G. Frenk (Hans); A.R. Thurik (Roy); C.A. Bout

1991-01-01

textabstractIn this paper approximation results for the M/G/s queueing model are used to derive an empirically verified shop type dependent non-homogeneous relation between labour volume and sales in retail trade. Moreover, we formulate the retailer's labour management as a formal minimization

Virtual communities as educational potential of collaborative learning through ICT

Directory of Open Access Journals (Sweden)

M.ª Ángeles REBOLLO CATALÁN

2013-01-01

Full Text Available This paper presents some results of an educational innovation based on the use of ICT as a learning environment. The main aim of this study is to describe an experience based collaborative learning in virtual communities of learning and reciprocal teaching and assessing students’ knowledge. For that, we design an educational proposal with three didactic units, which includes a kit of tasks and resources for learning. This study adopts a quantitative and qualitative methodology, applying attitudes scales, interviews and analysis of messages from online discussion forums. The study involved 56 students in first year of Pedagogy. We apply a Likert scale and a semantic differential about the learning experience and the methodology used. Also we conducted semi-structured group interviews to understand the perceptions and students’ evaluations about the methodology. The results show a very positive assessment about the learning experience and the methodology used. Peer interaction is focused on resolving technical queries, although there are also other forms of collaboration focused on joint interpretation and understanding of learning activities and assessment of the learning process. The results show that the intervention centers on teacher feedback and monitoring of learning tasks, reinforcing positive actions of the students and guiding the learning process. Finally, as to the benefits received by students, the results show that not only is development of social and communication skills, but also conceptual and emotional changes related to the subject.

SAM: Support Vector Machine Based Active Queue Management

International Nuclear Information System (INIS)

Shah, M.S.

2014-01-01

Recent years have seen an increasing interest in the design of AQM (Active Queue Management) controllers. The purpose of these controllers is to manage the network congestion under varying loads, link delays and bandwidth. In this paper, a new AQM controller is proposed which is trained by using the SVM (Support Vector Machine) with the RBF (Radial Basis Function) kernal. The proposed controller is called the support vector based AQM (SAM) controller. The performance of the proposed controller has been compared with three conventional AQM controllers, namely the Random Early Detection, Blue and Proportional Plus Integral Controller. The preliminary simulation studies show that the performance of the proposed controller is comparable to the conventional controllers. However, the proposed controller is more efficient in controlling the queue size than the conventional controllers. (author)

Game-Based Virtual Worlds as Decentralized Virtual Activity Systems

Science.gov (United States)

Scacchi, Walt

There is widespread interest in the development and use of decentralized systems and virtual world environments as possible new places for engaging in collaborative work activities. Similarly, there is widespread interest in stimulating new technological innovations that enable people to come together through social networking, file/media sharing, and networked multi-player computer game play. A decentralized virtual activity system (DVAS) is a networked computer supported work/play system whose elements and social activities can be both virtual and decentralized (Scacchi et al. 2008b). Massively multi-player online games (MMOGs) such as World of Warcraft and online virtual worlds such as Second Life are each popular examples of a DVAS. Furthermore, these systems are beginning to be used for research, deve-lopment, and education activities in different science, technology, and engineering domains (Bainbridge 2007, Bohannon et al. 2009; Rieber 2005; Scacchi and Adams 2007; Shaffer 2006), which are also of interest here. This chapter explores two case studies of DVASs developed at the University of California at Irvine that employ game-based virtual worlds to support collaborative work/play activities in different settings. The settings include those that model and simulate practical or imaginative physical worlds in different domains of science, technology, or engineering through alternative virtual worlds where players/workers engage in different kinds of quests or quest-like workflows (Jakobsson 2006).

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa.

Science.gov (United States)

Sokhela, Dudu G; Makhanya, Nonhlanhla J; Sibiya, Nokuthula M; Nokes, Kathleen M

2013-07-05

Comprehensive Primary Health Care (PHC), based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients' experiences led to satisfaction or dissatisfaction with the Fast Queue service. A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources. Effective health communication strategies contribute to positive

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa

Directory of Open Access Journals (Sweden)

Dudu G. Sokhela

2013-07-01

Full Text Available Background: Comprehensive Primary Health Care (PHC, based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Objectives: Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients’ experiences led to satisfaction or dissatisfaction with the Fast Queue service. Method: A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Results: Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources

The Effectiveness Analysis of Waiting Processes in the Different Branches of a Bank by Queue Model

Directory of Open Access Journals (Sweden)

Abdullah ÖZÇİL

2015-06-01

Full Text Available Despite the appreciable increase in the number of bank branches every year, nowadays queues for services don’t decrease and even become parts of our daily lives. By minimizing waiting processes the least, increasing customer satisfaction should be one of branch managers’ main goals. A quick and also customer oriented service with high quality is the most important factor for customer loyalty. In this study, Queueing theory, one of Operation Research techniques, is handled and in application, the data are obtained related to waiting in queue of customer in six different branches of two banks operating in Denizli and then they are analyzed by Queueing theory and also calculated the average effectiveness of the system. The study’s data are obtained by six branches of two banks called as A1, A2, A3, B1, B2 and B3. At the end of study it is presented to the company some advices that can bring benefits to the staff and customers. In this study, Queueing theory, one of Operation Research techniques, is handled and in application, the data are obtained related to waiting in queue of customer in three different branches of a bank operating in Denizli and then they are analyzed by Queueing theory and also calculated the average effectiveness of the system. The study’s data are obtained by three branches of the bank called A1, A2 and A3. At last it is presented to the company some advices that can bring more benefits to the staff and clients.

Queueing in a spent fuel transportation system: a preliminary analysis of implications for system design

International Nuclear Information System (INIS)

Cashwell, J.W.; Wood, T.W.

1985-03-01

Compliance with the Nuclear Waste Policy Act of 1982 (PL 97-425) will require the transportation of large volumes of spent fuel to a central receiving facility (Either a geologic repository or a monitored retrievable storage facility). Decisions on the transport mode and technology will evolve over the next several years, in anticipation of the deployment of a receiving facility in the late 1990s. Regardless of the particular transportation mode or modes and the details of cask technology, the transport system from many diverse sources to a single point will generate an essentially random arrival pattern. This random arrival pattern will lead to the formation of queues at the receiving facility. As is normal in any queueing system, the waiting time distribution caused by this queueing will depend on the receiving facility input processing rate and the characteristics of the traffic. Since this is a cyclic system, there is also a reverse effect in which (for a given size cask fleet) average wait time affects traffic intensity. Both effects must be accounted for to properly represent the system. This paper develops a simple analytic queueing model which accounts for both of these effects simultaneously. Since both effects are determined by receiving facility input and cask fleet size characteristics, two major sets of system design parameters are linked by the queueing process. The model is used with estimated traffic and service parameters to predict the severity of queueing under plausible reference system conditions, and to establish ''shadow prices'' for the trade off between larger cask fleets and more efficient receiving facilities. Since many of the parameter values used in this estimation are quite preliminary, these results are presented primarily in the context of demonstrating the utility of the queueing model for future trade off studies. 5 refs., 5 figs., 2 tabs

Active Queue Management in TCP Networks Based on Fuzzy-Pid Controller

Directory of Open Access Journals (Sweden)

Hossein ASHTIANI

2012-01-01

Full Text Available We introduce a novel and robust active queue management (AQM scheme based on a fuzzy controller, called hybrid fuzzy-PID controller. In the TCP network, AQM is important to regulate the queue length by passing or dropping the packets at the intermediate routers. RED, PI, and PID algorithms have been used for AQM. But these algorithms show weaknesses in the detection and control of congestion under dynamically changing network situations. In this paper a novel Fuzzy-based proportional-integral derivative (PID controller, which acts as an active queue manager (AQM for Internet routers, is proposed. These controllers are used to reduce packet loss and improve network utilization in TCP/IP networks. A new hybrid controller is proposed and compared with traditional RED based controller. Simulations are carried out to demonstrate the effectiveness of the proposed method and show that, the new hybrid fuzzy PID controller provides better performance than random early detection (RED and PID controllers

Worst-case efficient external-memory priority queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Katajainen, Jyrki

1998-01-01

A priority queue Q is a data structure that maintains a collection of elements, each element having an associated priority drawn from a totally ordered universe, under the operations Insert, which inserts an element into Q, and DeleteMin, which deletes an element with the minimum priority from Q....... In this paper a priority-queue implementation is given which is efficient with respect to the number of block transfers or I/Os performed between the internal and external memories of a computer. Let B and M denote the respective capacity of a block and the internal memory measured in elements. The developed...... data structure handles any intermixed sequence of Insert and DeleteMin operations such that in every disjoint interval of B consecutive priorityqueue operations at most clogM/B N/M I/Os are performed, for some positive constant c. These I/Os are divided evenly among the operations: if B ≥ clogM/B N...

Approximations for the waiting-time distribution in an M/P H/c priority queue

NARCIS (Netherlands)

Al Hanbali, Ahmad; Alvarez, Elisa; van der Heijden, Matthijs C.

2015-01-01

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/PH/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate

Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks

NARCIS (Netherlands)

Nicola, V.F.; Zaburnenko, T.S.

2006-01-01

In this paper we propose state-dependent importance sampling heuristics to estimate the probability of population overflow in Markovian networks of series and parallel queues. These heuristics capture state-dependence along the boundaries (when one or more queues are empty) which is critical for

Utilising a Collaborative Macro-Script to Enhance Student Engagement: A Mixed Method Study in a 3D Virtual Environment

Science.gov (United States)

Bouta, Hara; Retalis, Symeon; Paraskeva, Fotini

2012-01-01

This study examines the effect of using an online 3D virtual environment in teaching Mathematics in Primary Education. In particular, it explores the extent to which student engagement--behavioral, affective and cognitive--is fostered by such tools in order to enhance collaborative learning. For the study we used a purpose-created 3D virtual…

Design and analysis of a model predictive controller for active queue management.

Science.gov (United States)

Wang, Ping; Chen, Hong; Yang, Xiaoping; Ma, Yan

2012-01-01

Model predictive (MP) control as a novel active queue management (AQM) algorithm in dynamic computer networks is proposed. According to the predicted future queue length in the data buffer, early packets at the router are dropped reasonably by the MPAQM controller so that the queue length reaches the desired value with minimal tracking error. The drop probability is obtained by optimizing the network performance. Further, randomized algorithms are applied to analyze the robustness of MPAQM successfully, and also to provide the stability domain of systems with uncertain network parameters. The performances of MPAQM are evaluated through a series of simulations in NS2. The simulation results show that the MPAQM algorithm outperforms RED, PI, and REM algorithms in terms of stability, disturbance rejection, and robustness. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.

Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity

NARCIS (Netherlands)

Boxma, O.J.

1984-01-01

For the M/G/1 queue we study the joint distribution of the number of customers x present immediately before an arrival epoch and of the residual service time ¿ of the customer in service at this epoch. The correlation coefficient (x, ¿) is shown to be positive (negative) when the service time

ANALYSIS OF FUZZY QUEUES: PARAMETRIC PROGRAMMING APPROACH BASED ON RANDOMNESS - FUZZINESS CONSISTENCY PRINCIPLE

Directory of Open Access Journals (Sweden)

Dhruba Das

2015-04-01

Full Text Available In this article, based on Zadeh’s extension principle we have apply the parametric programming approach to construct the membership functions of the performance measures when the interarrival time and the service time are fuzzy numbers based on the Baruah’s Randomness- Fuzziness Consistency Principle. The Randomness-Fuzziness Consistency Principle leads to defining a normal law of fuzziness using two different laws of randomness. In this article, two fuzzy queues FM/M/1 and M/FM/1 has been studied and constructed their membership functions of the system characteristics based on the aforesaid principle. The former represents a queue with fuzzy exponential arrivals and exponential service rate while the latter represents a queue with exponential arrival rate and fuzzy exponential service rate.

Single-server queues with spatially distributed arrivals

NARCIS (Netherlands)

Kroese, Dirk; Schmidt, Volker

1994-01-01

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion

Sojourn time asymptotics in processor-sharing queues

NARCIS (Netherlands)

Borst, S.C.; Núñez Queija, R.; Zwart, B.

2006-01-01

Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of attention in the queueing literature. While the PS paradigm emerged in the sixties as an idealization of round-robin scheduling in time-shared computer systems, it has recently captured renewed interest as

Adaptive Importance Sampling Simulation of Queueing Networks

NARCIS (Netherlands)

de Boer, Pieter-Tjerk; Nicola, V.F.; Rubinstein, N.; Rubinstein, Reuven Y.

2000-01-01

In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a

Infrastructures for collaboration in virtual organisations

NARCIS (Netherlands)

Wognum, P.M.; Faber, Edward Christianus Cornelis

2002-01-01

Many organisations are currently forced to collaborate with others in renewing their products and processes to stay competitive, to enter new or to retain their current markets, or to get easy access to new knowledge. Management of collaboration between two or more organisations is, however, still

DROP TAIL AND RED QUEUE MANAGEMENT WITH SMALL BUFFERS:STABILITY AND HOPF BIFURCATION

Directory of Open Access Journals (Sweden)

Ganesh Patil

2011-06-01

Full Text Available There are many factors that are important in the design of queue management schemes for routers in the Internet: for example, queuing delay, link utilization, packet loss, energy consumption and the impact of router buffer size. By considering a fluid model for the congestion avoidance phase of Additive Increase Multiplicative Decrease (AIMD TCP, in a small buffer regime, we argue that stability should also be a desirable feature for network performance. The queue management schemes we study are Drop Tail and Random Early Detection (RED. For Drop Tail, the analytical arguments are based on local stability and bifurcation theory. As the buffer size acts as a bifurcation parameter, variations in it can readily lead to the emergence of limit cycles. We then present NS2 simulations to study the effect of changing buffer size on queue dynamics, utilization, window size and packet loss for three different flow scenarios. The simulations corroborate the analysis which highlights that performance is coupled with the notion of stability. Our work suggests that, in a small buffer regime, a simple Drop Tail queue management serves to enhance stability and appears preferable to the much studied RED scheme.

A single-server queue with random accumulation level

Directory of Open Access Journals (Sweden)

Jewgeni H. Dshalalow

1991-01-01

The author establishes an ergodicity criterion for both the queueing process with continuous time parameter and the imbedded process. Under this criterion, the author obtains explicit formulas for the stationary distributions of both processes by using semi-regenerative techniques.

Matrix-Geometric Method for Queueing Model with State-Dependent Arrival of an Unreliable Server and PH Service

Directory of Open Access Journals (Sweden)

M.ReniSagaya Raj

2016-03-01

Full Text Available In this paper, we consider a state-dependent queueing system in which the system is subject to random breakdowns. Customer arrive at the system randomly following a Poisson process with state-dependent rates. Service times follows PH distribution and repair times are exponentially distributed. The server may fail to service with probability depending on the number of customer completed since the last repair. The main result of this paper is the matrix-geometric solution of the steady-state queue length from which many performance measurements of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period, system utilization are obtained. Numerical examples are presented for both cases.

Collaborative engineering for complex products

CSIR Research Space (South Africa)

Erasmus, J

2015-10-01

Full Text Available stream_source_info Erasmus_2015.pdf.txt stream_content_type text/plain stream_size 6206 Content-Encoding UTF-8 stream_name Erasmus_2015.pdf.txt Content-Type text/plain; charset=UTF-8 Collaborative engineering... with collaboration and cooperation • Now they compete on implementation (application) instead of standards (infrastructure) Reyes, V., 2014. Dealing with automotive software complexity with virtual prototyping – Part 1: Virtual HIL development basics (accessed 9...

An Evaluation of Concurrent Priority Queue Algorithms

Science.gov (United States)

1991-02-01

path pronlem are testedi A! -S7 ?o An Evaluation of Concurrent Priority Queue Algorithms bv Qin Huang BS. Uiversity - of Science andi Technology of China...who have always supported me through my entire career and made my life more enjoyable. This research was supported in part by the Advanced Research

Virtual Globes and Glacier Research: Integrating research, collaboration, logistics, data archival, and outreach into a single tool

Science.gov (United States)

Nolan, M.

2006-12-01

Virtual Globes are a paradigm shift in the way earth sciences are conducted. With these tools, nearly all aspects of earth science can be integrated from field science, to remote sensing, to remote collaborations, to logistical planning, to data archival/retrieval, to PDF paper retriebal, to education and outreach. Here we present an example of how VGs can be fully exploited for field sciences, using research at McCall Glacier, in Arctic Alaska.

Global and local asymptotics for the busy period of an M/G/1 queue

NARCIS (Netherlands)

Denisov, D.E.; Shneer, V.

2010-01-01

We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. Our analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of an M/G/1 queue.

Virtual Teams and Knowledge Communication

DEFF Research Database (Denmark)

Lehtonen, Miikka; Kampf, Constance Elizabeth

2014-01-01

How does culture affect virtual teams and the knowledge communication processes in which they engage? As virtual spaces are increasingly used to support teams and establish collaboration in cross-cultural projects, the notion of cross-cultural communication can be understood as shifting from...... contextual perspective to a semiotic perspective. That is to say, although the team members are using the same vocabulary they might attach different meanings to and have different knowledge about them thus highlighting the importance of approaching virtual teams and collaboration from a semiotic perspective....... To look at how knowledge about virtual work is established in a multinational context, we interviewed members of a team that connects Finland and India. Results reveal five objects shared between the team members with varying knowledge about them. By making these differences in knowledge visible through...

Future of virtuality in-the-making

DEFF Research Database (Denmark)

Gürsimsek, Remzi Ates

2011-01-01

Blog post by Remzi Ates Gürsimsek, researcher at Roskilde University and visiting scholar at Stanford University's H-STAR Institute. His field of interest is collaborative design and innovation in virtual worlds.......Blog post by Remzi Ates Gürsimsek, researcher at Roskilde University and visiting scholar at Stanford University's H-STAR Institute. His field of interest is collaborative design and innovation in virtual worlds....

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

Science.gov (United States)

Li, Lian-Hui; Mo, Rong

2015-01-01

The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC) is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS) improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

Evolving Capabilities for Virtual Globes

Science.gov (United States)

Glennon, A.

2006-12-01

Though thin-client spatial visualization software like Google Earth and NASA World Wind enjoy widespread popularity, a common criticism is their general lack of analytical functionality. This concern, however, is rapidly being addressed; standard and advanced geographic information system (GIS) capabilities are being developed for virtual globes--though not centralized into a single implementation or software package. The innovation is mostly originating from the user community. Three such capabilities relevant to the earth science, education, and emergency management communities are modeling dynamic spatial phenomena, real-time data collection and visualization, and multi-input collaborative databases. Modeling dynamic spatial phenomena has been facilitated through joining virtual globe geometry definitions--like KML--to relational databases. Real-time data collection uses short scripts to transform user-contributed data into a format usable by virtual globe software. Similarly, collaborative data collection for virtual globes has become possible by dynamically referencing online, multi-person spreadsheets. Examples of these functions include mapping flows within a karst watershed, real-time disaster assessment and visualization, and a collaborative geyser eruption spatial decision support system. Virtual globe applications will continue to evolve further analytical capabilities, more temporal data handling, and from nano to intergalactic scales. This progression opens education and research avenues in all scientific disciplines.

Astronomical Virtual Observatories Through International Collaboration

Directory of Open Access Journals (Sweden)

Masatoshi Ohishi

2010-03-01

Full Text Available Astronomical Virtual Observatories (VOs are emerging research environment for astronomy, and 16 countries and a region have funded to develop their VOs based on international standard protocols for interoperability. The 16 funded VO projects have established the International Virtual Observatory Alliance (http://www.ivoa.net/ to develop the standard interoperable interfaces such as registry (meta data, data access, query languages, output format (VOTable, data model, application interface, and so on. The IVOA members have constructed each VO environment through the IVOA interfaces. National Astronomical Observatory of Japan (NAOJ started its VO project (Japanese Virtual Observatory - JVO in 2002, and developed its VO system. We have succeeded to interoperate the latest JVO system with other VOs in the USA and Europe since December 2004. Observed data by the Subaru telescope, satellite data taken by the JAXA/ISAS, etc. are connected to the JVO system. Successful interoperation of the JVO system with other VOs means that astronomers in the world will be able to utilize top-level data obtained by these telescopes from anywhere in the world at anytime. System design of the JVO system, experiences during our development including problems of current standard protocols defined in the IVOA, and proposals to resolve these problems in the near future are described.

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

Science.gov (United States)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

7. Data Structures: Lists, Queues, Stacks and Arrays

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 6. Algorithms - Data Structures: Lists, Queues, Stacks and Arrays. R K Shyamasundar. Series Article Volume 2 Issue 6 June 1997 pp 39-46. Fulltext. Click here to view fulltext PDF. Permanent link:

Managing collaboration in the nanoManipulator

DEFF Research Database (Denmark)

Hudson, Thomas C.; Helser, Aren T.; Sonnenwald, Diane H.

2004-01-01

We designed, developed, deployed, and evaluated the Collaborative nanoManipulator (CnM), a distributed, collaborative virtual environment system supporting remote scientific collaboration between users of the nanoManipulator interface to atomic force microscopes. This paper describes the entire...

Virtual Team Governance: Addressing the Governance Mechanisms and Virtual Team Performance

Science.gov (United States)

Zhan, Yihong; Bai, Yu; Liu, Ziheng

As technology has improved and collaborative software has been developed, virtual teams with geographically dispersed members spread across diverse physical locations have become increasingly prominent. Virtual team is supported by advancing communication technologies, which makes virtual teams able to largely transcend time and space. Virtual teams have changed the corporate landscape, which are more complex and dynamic than traditional teams since the members of virtual teams are spread on diverse geographical locations and their roles in the virtual team are different. Therefore, how to realize good governance of virtual team and arrive at good virtual team performance is becoming critical and challenging. Good virtual team governance is essential for a high-performance virtual team. This paper explores the performance and the governance mechanism of virtual team. It establishes a model to explain the relationship between the performance and the governance mechanisms in virtual teams. This paper is focusing on managing virtual teams. It aims to find the strategies to help business organizations to improve the performance of their virtual teams and arrive at the objectives of good virtual team management.

Buffer Overflow Period in a MAP Queue

Directory of Open Access Journals (Sweden)

Andrzej Chydzinski

2007-01-01

Full Text Available The buffer overflow period in a queue with Markovian arrival process (MAP and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations.

Secure Virtual Enclaves

National Research Council Canada - National Science Library

Shands, Deborah

2002-01-01

The Secure Virtual Enclaves (SVE) collaboration infrastructure allows multiple organizations to share their distributed application resources, while respecting organizational autonomy over local resources...

BOB-RED queue management for IEEE 802.15.4 wireless sensor networks

Directory of Open Access Journals (Sweden)

Wu Jean-Lien

2011-01-01

Full Text Available Abstract Multimedia services over resource constrained wireless sensor networks (WSNs face a performance bottleneck issue from the gateway node to the sink node. Therefore, the queue management at the gateway node is crucial for diversified messages conveyed from the front nodes to the sink node. In this article, beacon order-based random early detection (BOB-RED queue management is proposed. BOB-RED is a dynamic adaptation scheme based on adjusting beacon interval and superframe duration in the IEEE 802.15.4 MAC superframe accompanied with RED queue management scheme to increase the transmission efficiency of multimedia over WSNs. We focus on the performance improvement upon different traffic loads over WSNs. Evaluation metrics include end-to-end delay, packet delivery ratio, and energy consumption in IEEE 802.15.4 beacon enabled mode. Simulation results show that BOB-RED can effectively decrease end-to-end delay and energy consumption compared to the DropTail scheme.

Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process

NARCIS (Netherlands)

Boxma, O.J.; Prabhu, B.J.

2009-01-01

We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is accepted or rejected. We analyse two different models for impatience : (i) based on workload, and (ii) based on queue length. For the

A discrete single server queue with Markovian arrivals and phase type group services

Directory of Open Access Journals (Sweden)

Attahiru Sule Alfa

1995-01-01

Full Text Available We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.

Model Integrating Fuzzy Argument with Neural Network Enhancing the Performance of Active Queue Management

Directory of Open Access Journals (Sweden)

Nguyen Kim Quoc

2015-08-01

Full Text Available The bottleneck control by active queue management mechanisms at network nodes is essential. In recent years, some researchers have used fuzzy argument to improve the active queue management mechanisms to enhance the network performance. However, the projects using the fuzzy controller depend heavily on professionals and their parameters cannot be updated according to changes in the network, so the effectiveness of this mechanism is not high. Therefore, we propose a model combining the fuzzy controller with neural network (FNN to overcome the limitations above. Results of the training of the neural networks will find the optimal parameters for the adaptive fuzzy controller well to changes of the network. This improves the operational efficiency of the active queue management mechanisms at network nodes.

Study on Collaborative Object Manipulation in Virtual Environment

Science.gov (United States)

Mayangsari, Maria Niken; Yong-Moo, Kwon

This paper presents comparative study on network collaboration performance in different immersion. Especially, the relationship between user collaboration performance and degree of immersion provided by the system is addressed and compared based on several experiments. The user tests on our system include several cases: 1) Comparison between non-haptics and haptics collaborative interaction over LAN, 2) Comparison between non-haptics and haptics collaborative interaction over Internet, and 3) Analysis of collaborative interaction between non-immersive and immersive display environments.

Feasibility of a virtual learning collaborative to implement an obesity QI project in 29 pediatric practices.

Science.gov (United States)

John, Tamara; Morton, Michaela; Weissman, Mark; O'Brien, Ellen; Hamburger, Ellen; Hancock, Yolandra; Moon, Rachel Y

2014-04-01

Quality improvement (QI) activities are required to maintain board certification in pediatrics. However, because of lack of training and resources, pediatricians may feel overwhelmed by the need to implement QI activities. Pediatricians also face challenges when caring for overweight and obese children. To create a virtual (online) QI learning collaborative through which pediatric practices could easily develop and implement a continuous QI process. Prospective cohort. Pediatric practices that were part of the Children's National Health Network were invited to participate, with the option to receive continuing medical education and maintenance of certification credits. s) Practices conducted baseline and monthly chart audits, participated in educational webinars and selected monthly practice changes, using Plan-Do-Study-Act cycles. Practices reported activities monthly and periodic feedback was provided to practices about their performance. s) Improvement in (i) body mass index (BMI) percentile documentation, (ii) appropriate nutritional and activity counseling and (iii) follow-up management for high-risk patients. Twenty-nine practices (120 providers) participated, and 24 practices completed all program activities. Monthly chart audits demonstrated continuous improvement in documentation of BMI, abnormal weight diagnosis, nutrition and activity screening and counseling, weight-related health messages and follow-up management of overweight and obese patients. Impact of QI activities on visit duration and practice efficiency was minimal. A virtual learning collaborative was successful in providing a framework for pediatricians to implement a continuous QI process and achieve practice improvements. This format can be utilized to address multiple health issues.

Collaboration in Augmented Reality

NARCIS (Netherlands)

Lukosch, S.; Billinghurst, M.; Alem, L.; Kiyokawa, K.

2015-01-01

Augmented Reality (AR) is a technology that allows users to view and interact in real time with virtual images seamlessly superimposed over the real world. AR systems can be used to create unique collaborative experiences. For example, co-located users can see shared 3D virtual objects that they

Semigroup Method on a MX/G/1 Queueing Model

Directory of Open Access Journals (Sweden)

Alim Mijit

2013-01-01

Full Text Available By using the Hille-Yosida theorem, Phillips theorem, and Fattorini theorem in functional analysis we prove that the MX/G/1 queueing model with vacation times has a unique nonnegative time-dependent solution.

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

Directory of Open Access Journals (Sweden)

Lian-Hui Li

Full Text Available The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

An adversarial queueing model for online server routing

NARCIS (Netherlands)

Bonifaci, V.

2007-01-01

In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing

Customer-oriented finite perturbation analysis for queueing networks

NARCIS (Netherlands)

Heidergott, B.F.

2000-01-01

We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which can be a service time parameter or a buffer size, and we are interested in sensitivity analysis of J ( ) with respect to . We introduce a new method, called customer-oriented finite perturbation

Integrated service resource reservation using queueing networks theory

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Iversen, Villy Bæk; Kardaras, Georgios

2014-01-01

This study analyses multi-server multi-service queueing networks with service protection. To guarantee each service a certain quality-of-service and at the same time ensure high utilisation of servers, a minimum capacity is reserved each service. In addition, all services share the remaining non...

Transient error approximation in a Lévy queue

NARCIS (Netherlands)

Mathijsen, B.; Zwart, A.P.

2017-01-01

Motivated by a capacity allocation problem within a finite planning period, we conduct a transient analysis of a single-server queue with Lévy input. From a cost minimization perspective, we investigate the error induced by using stationary congestion measures as opposed to time-dependent measures.

Efficient Simulation of Population Overflow in Parallel Queues

NARCIS (Netherlands)

Nicola, V.F.; Zaburnenko, T.S.

2006-01-01

In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the “optimal��? state-dependent change of measure without the need for dif��?cult mathematical analysis or costly

Share (And Not) Share Alike: Improving Virtual Team Climate and Decision Performance

Science.gov (United States)

Cordes, Sean

2017-01-01

Virtual teams face unique communication and collaboration challenges that impact climate development and performance. First, virtual teams rely on technology mediated communication which can constrain communication. Second, team members lack skill for adapting process to the virtual setting. A collaboration process structure was designed to…

The Effect of Queueing Strategy on Network Traffic

International Nuclear Information System (INIS)

Zhang Xue-Jun; Guan Xiang-Min; Sun Deng-Feng; Tang Shao-Ting

2013-01-01

In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based (DIB) queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out (FIFO) queueing strategy, DIB can effectively balance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems. (condensed matter: structural, mechanical, and thermal properties)

A spectral approach to compute the mean performance measures of the queue with low-order BMAP input

Directory of Open Access Journals (Sweden)

Ho Woo Lee

2003-01-01

Full Text Available This paper targets engineers and practitioners who want a simple procedure to compute the mean performance measures of the Batch Markovian Arrival process (BMAP/G/1 queueing system when the parameter matrices order is very low. We develop a set of system equations and derive the vector generating function of the queue length. Starting from the generating function, we propose a spectral approach that can be understandable to those who have basic knowledge of M/G/1 queues and eigenvalue algebra.

Self-Interested Routing in Queueing Networks

OpenAIRE

Ali K. Parlaktürk; Sunil Kumar

2004-01-01

We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

A queueing model for error control of partial buffer sharing in ATM

Directory of Open Access Journals (Sweden)

Ahn Boo Yong

1999-01-01

Full Text Available We model the error control of the partial buffer sharing of ATM by a queueing system M 1 , M 2 / G / 1 / K + 1 with threshold and instantaneous Bernoulli feedback. We first derive the system equations and develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time of each class of cells. An algorithm is developed for finding the optimal threshold and queue capacity for a given quality of service.

On the calculation of steady-state loss probabilities in the GI/G/2/0 queue

Directory of Open Access Journals (Sweden)

Igor N. Kovalenko

1994-01-01

Full Text Available This paper considers methods for calculating the steady-state loss probability in the GI/G/2/0 queue. A previous study analyzed this queue in discrete time and this led to an efficient, numerical approximation scheme for continuous-time systems. The primary aim of the present work is to provide an alternative approach by analyzing the GI/ME/2/0 queue; i.e., assuming that the service time can be represented by a matrix-exponential distribution. An efficient computational scheme based on this method is developed and some numerical examples are studied. Some comparisons are made with the discrete-time approach, and the two methods are seen to be complementary.

A GA-based PID active queue management control design for TCP/IP networks

Energy Technology Data Exchange (ETDEWEB)

Kuo, H-H; Chen, C-K; Liao, T-L [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China); Yan, J-J [Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan (China)], E-mail: tlliao@mail.ncku.edu.tw

2008-02-15

In this paper, a genetic algorithm-based (GA-based) proportional-integral-derivative (PID) controller as an active queue manager for Internet routers is proposed to reduce packet loss and improve network utilization in TCP/IP networks. Based on the window-based nonlinear dynamics, the TCP network was modeled as a time-delayed system with a saturated input due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks. An improved genetic algorithm is employed to derive optimal or near optimal PID control gains such that a performance index of integrated-absolute error (IAE) in terms of the error between the router queue length and the desired queue length is minimized. The performance of the proposed control scheme was evaluated in various network scenarios via a series of numerical simulations. The simulation results confirm that the proposed scheme outperforms other AQM schemes.

A GA-based PID active queue management control design for TCP/IP networks

International Nuclear Information System (INIS)

Kuo, H-H; Chen, C-K; Liao, T-L; Yan, J-J

2008-01-01

In this paper, a genetic algorithm-based (GA-based) proportional-integral-derivative (PID) controller as an active queue manager for Internet routers is proposed to reduce packet loss and improve network utilization in TCP/IP networks. Based on the window-based nonlinear dynamics, the TCP network was modeled as a time-delayed system with a saturated input due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks. An improved genetic algorithm is employed to derive optimal or near optimal PID control gains such that a performance index of integrated-absolute error (IAE) in terms of the error between the router queue length and the desired queue length is minimized. The performance of the proposed control scheme was evaluated in various network scenarios via a series of numerical simulations. The simulation results confirm that the proposed scheme outperforms other AQM schemes

Sojourn-time approximations in queueing networks with feedback

NARCIS (Netherlands)

Gijsen, B.M.M.; van der Mei, R.D.; Engelberts, P.; van den Berg, J.L.; van Wingerden, K.M.C.

2006-01-01

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

Sojourn time approximations in queueing networks with feedback

NARCIS (Netherlands)

Gijsen, B.M.M.; Mei, R.D. van der; Engelberts, P.; Berg, J.L. van den; Wingerden, K.M.C. van

2006-01-01

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

Sojourn-time approximations in queueing networks with feedback

NARCIS (Netherlands)

Gijsen, B.M.M.; van der Mei, R.D.; van den Berg, Hans Leo; van Wingerden, K.M.C.

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

The Development Of Virtual Educational Environments

Directory of Open Access Journals (Sweden)

Ken STEVENS

2007-04-01

Full Text Available The introduction of inter-school electronic networks has added a new dimension to education in Canada that has many implications for students who attend schools in rural communities. Collaborative internet-based teaching and learning and the creation of virtual classes within regional intranets now complement traditional on-site instruction in many schools that are located beyond major centres of population. Five stages in the advent of virtual educational environments can be identified starting with the introduction of computers in schools as a foundation for the development of collaborative teaching and learning environments. Inter-school collaboration in rural Canada and the extension of curriculum options for senior students has, in turn, provided a basis for the integration of virtual classes and traditional face to face instruction. Instruction in classes that are electronically-linked to other classes requires different skills from traditional face to face teaching and the development of new strategies and protocols. The implications of open and flexible teaching and learning for the future organization of classes, the preparation of teachers, articulation with higher education and in particular, regional economic development are now significant educational policy issues. The linking of virtual and face to face classes through cybercells is a possible next step in the development of virtual educational environments.

Virtual Organizations: Trends and Models

Science.gov (United States)

Nami, Mohammad Reza; Malekpour, Abbaas

The Use of ICT in business has changed views about traditional business. With VO, organizations with out physical, geographical, or structural constraint can collaborate with together in order to fulfill customer requests in a networked environment. This idea improves resource utilization, reduces development process and costs, and saves time. Virtual Organization (VO) is always a form of partnership and managing partners and handling partnerships are crucial. Virtual organizations are defined as a temporary collection of enterprises that cooperate and share resources, knowledge, and competencies to better respond to business opportunities. This paper presents an overview of virtual organizations and main issues in collaboration such as security and management. It also presents a number of different model approaches according to their purpose and applications.

Scaling and comparison of fluid limits of queues applied to call centers with time-varying parameters

NARCIS (Netherlands)

Jiménez, T.; Koole, G.M.

2004-01-01

Temporary overload situations in queues can be approximated by fluid queues. We strengthen earlier results on the comparison of multi-server tandem systems with their fluid limits. At the same time we give conditions under which economies of scale hold. We apply the results to call centers. ©

Supporting collaboration with trust virtual organization

NARCIS (Netherlands)

Lin, A.; Vullings, E.; Dalziel, J.

2008-01-01

This chapter introduces the trust virtual organization as a means of facilitating authentication and authorization for sharing distributed and protected contents and services. It indicates that sharing institutional protected services and deliverables has proven a hurdle since user accounts are

Collaborative use of virtual patients after a lecture enhances learning with minimal investment of cognitive load.

Science.gov (United States)

Marei, Hesham F; Donkers, Jeroen; Al-Eraky, Mohamed M; Van Merrienboer, Jeroen J G

2018-05-25

The use of virtual patients (VPs), due to their high complexity and/or inappropriate sequencing with other instructional methods, might cause a high cognitive load, which hampers learning. To investigate the efficiency of instructional methods that involved three different applications of VPs combined with lectures. From two consecutive batches, 171 out of 183 students have participated in lecture and VPs sessions. One group received a lecture session followed by a collaborative VPs learning activity (collaborative deductive). The other two groups received a lecture session and an independent VP learning activity, which either followed the lecture session (independent deductive) or preceded it (independent inductive). All groups were administrated written knowledge acquisition and retention tests as well as transfer tests using two new VPs. All participants completed a cognitive load questionnaire, which measured intrinsic, extraneous and germane load. Mixed effect analysis of cognitive load and efficiency using the R statistical program was performed. The highest intrinsic and extraneous load was found in the independent inductive group, while the lowest intrinsic and extraneous load was seen in the collaborative deductive group. Furthermore, comparisons showed a significantly higher efficiency, that is, higher performance in combination with lower cognitive load, for the collaborative deductive group than for the other two groups. Collaborative use of VPs after a lecture is the most efficient instructional method, of those tested, as it leads to better learning and transfer combined with lower cognitive load, when compared with independent use of VPs, either before or after the lecture.

Performance analysis of manufacturing systems : queueing approximations and algorithms

NARCIS (Netherlands)

Vuuren, van M.

2007-01-01

Performance Analysis of Manufacturing Systems Queueing Approximations and Algorithms This thesis is concerned with the performance analysis of manufacturing systems. Manufacturing is the application of tools and a processing medium to the transformation of raw materials into finished goods for sale.

Dynamic Performance Optimization for Cloud Computing Using M/M/m Queueing System

Directory of Open Access Journals (Sweden)

Lizheng Guo

2014-01-01

Full Text Available Successful development of cloud computing has attracted more and more people and enterprises to use it. On one hand, using cloud computing reduces the cost; on the other hand, using cloud computing improves the efficiency. As the users are largely concerned about the Quality of Services (QoS, performance optimization of the cloud computing has become critical to its successful application. In order to optimize the performance of multiple requesters and services in cloud computing, by means of queueing theory, we analyze and conduct the equation of each parameter of the services in the data center. Then, through analyzing the performance parameters of the queueing system, we propose the synthesis optimization mode, function, and strategy. Lastly, we set up the simulation based on the synthesis optimization mode; we also compare and analyze the simulation results to the classical optimization methods (short service time first and first in, first out method, which show that the proposed model can optimize the average wait time, average queue length, and the number of customer.

Fluid queues driven by a birth and death process with alternating flow rates

OpenAIRE

P. R. Parthasarathy; K. V. Vijayashree; R. B. Lenin

2004-01-01

Fluid queue driven by a birth and death process (BDP) with only one negative effective input rate has been considered in the literature. As an alternative, here we consider a fluid queue in which the input is characterized by a BDP with alternating positive and negative flow rates on a finite state space. Also, the BDP has two alternating arrival rates and two alternating service rates. Explicit expression for the distribution function of the buffer occupancy is obtained. The case where the s...

To Enhance Collaborative Learning and Practice Network Knowledge with a Virtualization Laboratory and Online Synchronous Discussion

Directory of Open Access Journals (Sweden)

Wu-Yuin Hwang

2014-09-01

Full Text Available Recently, various computer networking courses have included additional laboratory classes in order to enhance students’ learning achievement. However, these classes need to establish a suitable laboratory where each student can connect network devices to configure and test functions within different network topologies. In this case, the Linux operating system can be used to operate network devices and the virtualization technique can include multiple OSs for supporting a significant number of students. In previous research, the virtualization application was successfully applied in a laboratory, but focused only on individual assignments. The present study extends previous research by designing the Networking Virtualization-Based Laboratory (NVBLab, which requires collaborative learning among the experimental students. The students were divided into an experimental group and a control group for the experiment. The experimental group performed their laboratory assignments using NVBLab, whereas the control group completed them on virtual machines (VMs that were installed on their personal computers. Moreover, students using NVBLab were provided with an online synchronous discussion (OSD feature that enabled them to communicate with others. The laboratory assignments were divided into two parts: Basic Labs and Advanced Labs. The results show that the experimental group significantly outperformed the control group in two Advanced Labs and the post-test after Advanced Labs. Furthermore, the experimental group’s activities were better than those of the control group based on the total average of the command count per laboratory. Finally, the findings of the interviews and questionnaires with the experimental group reveal that NVBLab was helpful during and after laboratory class.

Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

Science.gov (United States)

Chen, Dong; Gara, Alana; Heidelberger, Philip; Kumar, Sameer; Ohmacht, Martin; Steinmacher-Burow, Burkhard; Wisniewski, Robert

2014-09-16

Implementation primitives for concurrent array-based stacks, queues, double-ended queues (deques) and wrapped deques are provided. In one aspect, each element of the stack, queue, deque or wrapped deque data structure has its own ticket lock, allowing multiple threads to concurrently use multiple elements of the data structure and thus achieving high performance. In another aspect, new synchronization primitives FetchAndIncrementBounded (Counter, Bound) and FetchAndDecrementBounded (Counter, Bound) are implemented. These primitives can be implemented in hardware and thus promise a very fast throughput for queues, stacks and double-ended queues.

Age Replacement and Service Rate Control of Stochastically Degrading Queues

National Research Council Canada - National Science Library

Chapin, Patrick

2004-01-01

This thesis considers the problem of optimally selecting a periodic replacement time for a multiserver queueing system in which each server is subject to degradation as a function of the mean service...

A queueing model with randomized depletion of inventory

NARCIS (Netherlands)

Albrecher, H.-J.; Boxma, O.J.; Essifi, R.; Kuijstermans, A.C.M.

2015-01-01

In this paper we study an M/M/1 queue, where the server continues to work during idle periods and builds up inventory. This inventory is used for new arriving service requirements, but it is completely emptied at random epochs of a Poisson process, whose rate depends on the current level of the

Application of Queueing Theory to the Analysis of Changes in Outpatients' Waiting Times in Hospitals Introducing EMR.

Science.gov (United States)

Cho, Kyoung Won; Kim, Seong Min; Chae, Young Moon; Song, Yong Uk

2017-01-01

This research used queueing theory to analyze changes in outpatients' waiting times before and after the introduction of Electronic Medical Record (EMR) systems. We focused on the exact drawing of two fundamental parameters for queueing analysis, arrival rate (λ) and service rate (µ), from digital data to apply queueing theory to the analysis of outpatients' waiting times. We used outpatients' reception times and consultation finish times to calculate the arrival and service rates, respectively. Using queueing theory, we could calculate waiting time excluding distorted values from the digital data and distortion factors, such as arrival before the hospital open time, which occurs frequently in the initial stage of a queueing system. We analyzed changes in outpatients' waiting times before and after the introduction of EMR using the methodology proposed in this paper, and found that the outpatients' waiting time decreases after the introduction of EMR. More specifically, the outpatients' waiting times in the target public hospitals have decreased by rates in the range between 44% and 78%. It is possible to analyze waiting times while minimizing input errors and limitations influencing consultation procedures if we use digital data and apply the queueing theory. Our results verify that the introduction of EMR contributes to the improvement of patient services by decreasing outpatients' waiting time, or by increasing efficiency. It is also expected that our methodology or its expansion could contribute to the improvement of hospital service by assisting the identification and resolution of bottlenecks in the outpatient consultation process.

Virtual Data in CMS Analysis

CERN Document Server

Arbree, A; Bourilkov, D; Cavanaugh, R J; Graham, G; Rodríguez, J; Wilde, M; Zhao, Y

2003-01-01

The use of virtual data for enhancing the collaboration between large groups of scientists is explored in several ways: - by defining ``virtual'' parameter spaces which can be searched and shared in an organized way by a collaboration of scientists in the course of their analysis - by providing a mechanism to log the provenance of results and the ability to trace them back to the various stages in the analysis of real or simulated data - by creating ``check points'' in the course of an analysis to permit collaborators to explore their own analysis branches by refining selections, improving the signal to background ratio, varying the estimation of parameters, etc. - by facilitating the audit of an analysis and the reproduction of its results by a different group, or in a peer review context. We describe a prototype for the analysis of data from the CMS experiment based on the virtual data system Chimera and the object-oriented data analysis framework ROOT. The Chimera system is used to chain together several s...

Virtual Collaboration for a Distributed Enterprise

Science.gov (United States)

2013-01-01

aircraft SIGINT signals intelligence UAV unmanned aerial vehicle VoIP voice over Internet protocol 1 1. The Need for Effective Virtual...Z., and Robert H. Anderson, Toward an Ethics and Etiquette for Electronic Mail, Santa Monica, Calif.: RAND Corporation, R-3283-NSF/RC, 1985. As of

Collaboration and Dialogue in Virtual Reality

Science.gov (United States)

Jensen, Camilla Gyldendahl

2017-01-01

"Virtual reality" adds a new dimension to problem-based learning (PBL) environments in the architecture and building construction educations, where a realistic and lifelike presence in a building enables students to assess and discuss how the various solutions interact with each other. Combined with "Building Information…

Report on dynamic speed harmonization and queue warning algorithm design.

Science.gov (United States)

2014-02-01

This report provides a detailed description of the algorithms that will be used to generate harmonized recommended speeds : and queue warning information in the proposed Intelligent Network Flow Optimization (INFLO) prototype. This document : describ...

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

Directory of Open Access Journals (Sweden)

Florin-Catalin ENACHE

2015-10-01

Full Text Available The growing character of the cloud business has manifested exponentially in the last 5 years. The capacity managers need to concentrate on a practical way to simulate the random demands a cloud infrastructure could face, even if there are not too many mathematical tools to simulate such demands.This paper presents an introduction into the most important stochastic processes and queueing theory concepts used for modeling computer performance. Moreover, it shows the cases where such concepts are applicable and when not, using clear programming examples on how to simulate a queue, and how to use and validate a simulation, when there are no mathematical concepts to back it up.

A Discrete-Time Queue with Balking, Reneging, and Working Vacations

Directory of Open Access Journals (Sweden)

Veena Goswami

2014-01-01

Full Text Available This paper presents an analysis of balking and reneging in finite-buffer discrete-time single server queue with single and multiple working vacations. An arriving customer may balk with a probability or renege after joining according to a geometric distribution. The server works with different service rates rather than completely stopping the service during a vacation period. The service times during a busy period, vacation period, and vacation times are assumed to be geometrically distributed. We find the explicit expressions for the stationary state probabilities. Various system performance measures and a cost model to determine the optimal service rates are presented. Moreover, some queueing models presented in the literature are derived as special cases of our model. Finally, the influence of various parameters on the performance characteristics is shown numerically.

Comparative study on collaborative interaction in non-immersive and immersive systems

Science.gov (United States)

Shahab, Qonita M.; Kwon, Yong-Moo; Ko, Heedong; Mayangsari, Maria N.; Yamasaki, Shoko; Nishino, Hiroaki

2007-09-01

This research studies the Virtual Reality simulation for collaborative interaction so that different people from different places can interact with one object concurrently. Our focus is the real-time handling of inputs from multiple users, where object's behavior is determined by the combination of the multiple inputs. Issues addressed in this research are: 1) The effects of using haptics on a collaborative interaction, 2) The possibilities of collaboration between users from different environments. We conducted user tests on our system in several cases: 1) Comparison between non-haptics and haptics collaborative interaction over LAN, 2) Comparison between non-haptics and haptics collaborative interaction over Internet, and 3) Analysis of collaborative interaction between non-immersive and immersive display environments. The case studies are the interaction of users in two cases: collaborative authoring of a 3D model by two users, and collaborative haptic interaction by multiple users. In Virtual Dollhouse, users can observe physics law while constructing a dollhouse using existing building blocks, under gravity effects. In Virtual Stretcher, multiple users can collaborate on moving a stretcher together while feeling each other's haptic motions.

Terminal Appointment System Design by Non-stationary M(t)/Ek/c(t) Queueing Model and Genetic Algorithm

DEFF Research Database (Denmark)

Chen, Gang; Govindan, Kannan; Yang, Zhong-Zhen

2013-01-01

Long truck queue is a common problem at big marine container terminals, where the resources and equipment are usually scheduled to serve ships prior to trucks. To reduce truck queues, some container terminals adopt terminal appointment system (TAS) to manage truck arrivals. This paper addresses two...

A scheme for evaluating a local queue warning system.

NARCIS (Netherlands)

Botma, H. & Oei, H.-L.

2018-01-01

This article outlines a method of evaluating a 'local queue warning system', in principle intended only to warn drivers of unexpected congestion at known discontinuities of the road geomctry (bottleneck) and give them advisory speed indications. A prerequisite for installing this system is therefore

Approximations for Markovian multi-class queues with preemptive priorities

NARCIS (Netherlands)

van der Heijden, Matthijs C.; van Harten, Aart; Sleptchenko, Andrei

2004-01-01

We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach

Exploiting Virtualization and Cloud Computing in ATLAS

International Nuclear Information System (INIS)

Harald Barreiro Megino, Fernando; Van der Ster, Daniel; Benjamin, Doug; De, Kaushik; Gable, Ian; Paterson, Michael; Taylor, Ryan; Hendrix, Val; Vitillo, Roberto A; Panitkin, Sergey; De Silva, Asoka; Walker, Rod

2012-01-01

The ATLAS Computing Model was designed around the concept of grid computing; since the start of data-taking, this model has proven very successful in the federated operation of more than one hundred Worldwide LHC Computing Grid (WLCG) sites for offline data distribution, storage, processing and analysis. However, new paradigms in computing, namely virtualization and cloud computing, present improved strategies for managing and provisioning IT resources that could allow ATLAS to more flexibly adapt and scale its storage and processing workloads on varied underlying resources. In particular, ATLAS is developing a “grid-of-clouds” infrastructure in order to utilize WLCG sites that make resources available via a cloud API. This work will present the current status of the Virtualization and Cloud Computing R and D project in ATLAS Distributed Computing. First, strategies for deploying PanDA queues on cloud sites will be discussed, including the introduction of a “cloud factory” for managing cloud VM instances. Next, performance results when running on virtualized/cloud resources at CERN LxCloud, StratusLab, and elsewhere will be presented. Finally, we will present the ATLAS strategies for exploiting cloud-based storage, including remote XROOTD access to input data, management of EC2-based files, and the deployment of cloud-resident LCG storage elements.

The truncated Hyper-Poisson queues: Hk/Ma,b/C/N with balking, reneging and general bulk service rule

Directory of Open Access Journals (Sweden)

Shawky A.I.

2008-01-01

Full Text Available The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I units arrive according to a hyper-Poisson distribution with k independent branches, (II the queue discipline is FIFO; and (III the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .

The M/M/1 queue with inventory, lost sale and general lead times

DEFF Research Database (Denmark)

Saffari, Mohammad; Asmussen, Søren; Haji, Rasoul

We consider an M/M/1 queueing system with inventory under the (r,Q) policy and with lost sales, in which demands occur according to a Poisson process and service times are exponentially distributed. All arriving customers during stockout are lost. We derive the stationary distributions of the joint...... queue length (number of customers in the system) and on-hand inventory when lead times are random variables and can take various distributions. The derived stationary distributions are used to formulate long-run average performance measures and cost functions in some numerical examples....

Integrating Diverse Data Systems for International Collaboration

Science.gov (United States)

Fox, Peter

2014-05-01

International collaborations, especially ones that arise with little or no financial resources, still face challenges in opening up data collections via a wide variety of differing and often non-interoperable means. In turn, this hampers the collaborative process, slows or even prevents scientific exchange. Early efforts that proposed a centralized, and project specific data archive encountered many difficulties, ranging from little or no adoption, to the inability to provide required documentation and metadata to make the datasets findable or usable. In time, virtualized approaches appeared to gain traction, for e.g. virtual observatories. In this contribution, we report on several international collaboration case studies with distributed data systems; their needs, successes, challenges and failures and synthesize a set of suggested practices to inform future international collaboration efforts.

A spatiotemporal model for the LTE uplink: Spatially interacting tandem queues approach

KAUST Repository

Gharbieh, Mohammad

2017-07-31

With the proliferation of the Internet-of-things (IoT), there is an undeniable consensus that cellular LTE networks will have to support a dramatically larger number of uplink connections. This is true since most of the devices to be added incur machine-type communications which is dominantly upstream. Can current LTE network withstand this challenge? To answer this question, the joint performance of random access process and the uplink data transmission should be investigated. These two problems have been classically treated in the literature in a disjoint fashion. In this paper, they are jointly analyzed as an inseparable couple. To do that, a tandem queuing model is adopted whereby devices are represented as spatially interacting queues. The interaction between queues is governed by the mutual inter-cell and intra-cell interference. To that end, a joint stochastic geometry and queueing theory model is exploited to study this problem and a spatiotemporal analytical model is developed accordingly. Network stability and scalability are two prime performance criteria for performance assessment. In light of these two criteria, the developed model is poised to offer valuable insights into efficient access and resource allocation strategies.

Adaptive Queue Management with Restraint on Non-Responsive Flows

Directory of Open Access Journals (Sweden)

Lan Li

2003-12-01

Full Text Available This paper proposes an adaptive queue management scheme (adaptive RED to improve Random Early Detection (RED on restraining non-responsive flows. Due to a lack of flow control mechanism, non-responsive flows can starve responsive flows for buffer and bandwidth at the gateway. In order to solve the disproportionate resource problem, RED framework is modified in this way: on detecting when the non-responsive flows starve the queue, packet-drop intensity (Max_p in RED can be adaptively adjusted to curb non-responsive flows for resource fair-sharing, such as buffer and bandwidth fair-sharing. Based on detection of traffic behaviors, intentionally restraining nonresponsive flows is to increase the throughput and decrease the drop rate of responsive flows. Our experimental results based on adaptive RED shows that the enhancement of responsive traffic and the better sharing of buffer and bandwidth can be achieved under a variety of traffic scenarios.

An MX/GI/1/N queue with close-down and vacation times

Directory of Open Access Journals (Sweden)

Andreas Frey

1999-01-01

Full Text Available An MX/GI/1/N finite capacity queue with close-down time, vacation time and exhaustive service discipline is considered under the partial batch acceptance strategy as well as under the whole batch acceptance strategy. Applying the supplementary variable technique the queue length distribution at an arbitrary instant and at a departure epoch is obtained under both strategies, where no assumption on the batch size distribution is made. The loss probabilities and the Laplace-Stieltjes transforms of the waiting time distribution of the first customer and of an arbitrary customer of a batch are also given. Numerical examples give some insight into the behavior of the system.

Queueing network model for obstetric patient flow in a hospital.

Science.gov (United States)

Takagi, Hideaki; Kanai, Yuta; Misue, Kazuo

2016-03-03

A queueing network is used to model the flow of patients in a hospital using the observed admission rate of patients and the histogram for the length of stay for patients in each ward. A complete log of orders for every movement of all patients from room to room covering two years was provided to us by the Medical Information Department of the University of Tsukuba Hospital in Japan. We focused on obstetric patients, who are generally hospitalized at random times throughout the year, and we analyzed the patient flow probabilistically. On admission, each obstetric patient is assigned to a bed in one of the two wards: one for normal delivery and the other for high-risk delivery. Then, the patient may be transferred between the two wards before discharge. We confirm Little's law of queueing theory for the patient flow in each ward. Next, we propose a new network model of M/G/ ∞ and M/M/ m queues to represent the flow of these patients, which is used to predict the probability distribution for the number of patients staying in each ward at the nightly census time. Although our model is a very rough and simplistic approximation of the real patient flow, the predicted probability distribution shows good agreement with the observed data. The proposed method can be used for capacity planning of hospital wards to predict future patient load in each ward.

E-colloboration: the reality of virtuality

NARCIS (Netherlands)

Rutkowski, A.F.; Vogel, D.R.; Genuchten, van M.J.I.M.; Bemelmans, T.M.A.; Favier, M.

2002-01-01

With the development of new technologies, and particularly information and communication technologies (ICTs), teams have evolved to encompass new forms of interaction and collaboration. By focusing on the communicative dimensions of global virtual teams, this paper demonstrates that e-collaboration

A queueing theory description of fat-tailed price returns in imperfect financial markets

Science.gov (United States)

Lamba, H.

2010-09-01

In a financial market, for agents with long investment horizons or at times of severe market stress, it is often changes in the asset price that act as the trigger for transactions or shifts in investment position. This suggests the use of price thresholds to simulate agent behavior over much longer timescales than are currently used in models of order-books. We show that many phenomena, routinely ignored in efficient market theory, can be systematically introduced into an otherwise efficient market, resulting in models that robustly replicate the most important stylized facts. We then demonstrate a close link between such threshold models and queueing theory, with large price changes corresponding to the busy periods of a single-server queue. The distribution of the busy periods is known to have excess kurtosis and non-exponential decay under various assumptions on the queue parameters. Such an approach may prove useful in the development of mathematical models for rapid deleveraging and panics in financial markets, and the stress-testing of financial institutions.

Next generation environment for collaborative research

International Nuclear Information System (INIS)

Collados, D.; Denis, G.; Galvez, P.; Newman, H.

2001-01-01

Collaborative environments supporting point to point and multipoint video-conferencing, document and application sharing across both local and wide area networks, video on demand (broadcast and playback) and interactive text facilities will be a crucial element for the development of the next generation of HEP experiments by geographically dispersed collaborations. The 'Virtual Room Video conferencing System' (VRVS) has been developed since 1995, in order to provide a low cost, bandwidth-efficient, extensible means for video conferencing and remote collaboration over networks within the High Energy and Nuclear Physics communities. The VRVS provides worldwide videoconferencing service and collaborative environment to the research and education communities. VRVS uses the Internet2 and ESnet high-performance networks infrastructure to deploy its Web-based system, which now includes more than 5790 registered hosts running VRVS software in more than 50 different countries. VRVS hosts an average of 100-multipoint videoconference and collaborative sessions worldwide every month. There are around 35 reflectors that manage the traffic flow, at HENP labs and universities in the US and Europe. So far, there are 7 Virtual Rooms for World Wide Conferences (involving more than one continent), and 4 Virtual Rooms each for intra-continental conferences in the US, Europe and Asia. VRVS continues to expand and implement new digital video technologies, including H.323 ITU standard integration, MPEG-2 videoconferencing integration, shared environments, and Quality of Service

The M/G/1 queue with quasi-restricted accessibility

NARCIS (Netherlands)

Boxma, O.J.; Perry, D.; Stadje, W.; Zacks, S.

2009-01-01

We consider single-server queues of the M/G/1 kind with a special kind of partial customer rejection called quasi-restricted accessibility (QRA). Under QRA, the actual service time assigned to an arriving customer depends on his service requirement, say x, the current workload, say w, and a

Study of cognitive and technological prerequisites for virtual laboratories and collaborative virtual environments for radiopharmacy; Estudo de pressupostos tecnologicos e cognitivos para aperfeicoamento de laboratorios virtuais e ambientes colaborativos virtuais para radiofarmacia

Energy Technology Data Exchange (ETDEWEB)

Melo, Roberto Correia de

2009-07-01

This academic work explains a general view of virtual laboratories (VL) and collaborative virtual environments (CVE) (called, together, a VL/CVE set), focusing their technological features and analyzing the common cognitive features of their users. Also is presented a detailed description of VL/CVE VirRAD (Virtual Radiopharmacy), created specially to connect and support the international radiopharmacy community around the world, and is explained an analysis of their users' cognitive profile, under the perspective of two of the most important cognitive theories of the 20th century: multiple intelligences, by Howard Gardner, and mindful learning, by Ellen Langer. Conclusions from this study has been incorporated, as feature enhancements, to a software prototype created based upon VirRAD software solution, and the hardcopy of their screens is exposed at the end of this work. It is also an essential idea that the conclusions of this work are relevant to any VL/CVE environment. (author)

MX/G/1 unreliable retrial queue with option of additional service and Bernoulli vacation

Directory of Open Access Journals (Sweden)

Charan Jeet Singh

2016-03-01

Full Text Available In this paper, retrial queue with unreliable server and bulk arrivals is investigated. The server is capable of providing m-optional services and any one of these available services, may be rendered to the customer after the first essential service if the customer opts for the same. It is assumed that the server may fail while rendering any phase of service and undergoes for the immediate repair. After the completion of the service of a customer, the server may either take a vacation for a random period or may continue to provide the service to the other customers waiting in the queue. The supplementary variables corresponding to service time, repair time and retrial time are incorporated to determine the queue size distribution. To examine the effect of different parameters on the performance measures of the system, the numerical illustration is given which is supported by numerical simulation and sensitivity analysis.

Asymetric Telecollaboration in Virtual Reality

OpenAIRE

PORSSUT, Thibault; CHARDONNET, Jean-Rémy

2017-01-01

International audience; We present a first study where we combine two asymetric virtual reality systems for telecollaboration purposes: a CAVE system and a head-mounted display (HMD), using a server-client type architecture. Experiments on a puzzle game in limited time, alone and in collaboration, show that combining asymetric systems reduces cognitive load. Moreover, the participants reported preferring working in collaboration and showed to be more efficient in collaboration. These results ...

Green Virtualization for Multiple Collaborative Cellular Operators

KAUST Repository

Farooq, Muhammad Junaid; Ghazzai, Hakim; Yaacoub, Elias; Kadri, Abdullah; Alouini, Mohamed-Slim

2017-01-01

This paper proposes and investigates a green virtualization framework for infrastructure sharing among multiple cellular operators whose networks are powered by a combination of conventional and renewable sources of energy. Under the proposed

Analysis of a multi-server queueing model of ABR

NARCIS (Netherlands)

R. Núñez Queija (Rudesindo); O.J. Boxma (Onno)

1996-01-01

textabstractIn this paper we present a queueing model for the performance a-na-ly-sis of ABR traffic in ATM networks. We consider a multi-channel service station with two types of customers, the first having preemptive priority over the second. The arrivals occur according to two independent Poisson

Transient analysis of one-sided Lévy-driven queues

NARCIS (Netherlands)

Starreveld, N.J.; Bekker, R.; Mandjes, M.

2016-01-01

In this article, we analyze the transient behavior of the workload process in a Lévy-driven queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of spectrally

Transient analysis of one-sided Lévy-driven queues

NARCIS (Netherlands)

Starreveld, N.J.; R. Bekker (Rene); M.R.H. Mandjes (Michel)

2016-01-01

textabstractIn this article, we analyze the transient behavior of the workload process in a Lévy-driven queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of

The Jackson Queueing Network Model Built Using Poisson Measures. Application To A Bank Model

Directory of Open Access Journals (Sweden)

Ciuiu Daniel

2014-07-01

Full Text Available In this paper we will build a bank model using Poisson measures and Jackson queueing networks. We take into account the relationship between the Poisson and the exponential distributions, and we consider for each credit/deposit type a node where shocks are modeled as the compound Poisson processes. The transmissions of the shocks are modeled as moving between nodes in Jackson queueing networks, the external shocks are modeled as external arrivals, and the absorption of shocks as departures from the network.

Chaotic queue-based genetic algorithm for design of a self-tuning fuzzy logic controller

Science.gov (United States)

Saini, Sanju; Saini, J. S.

2012-11-01

This paper employs a chaotic queue-based method using logistic equation in a non-canonical genetic algorithm for optimizing the performance of a self-tuning Fuzzy Logic Controller, used for controlling a nonlinear double-coupled system. A comparison has been made with a standard canonical genetic algorithm implemented on the same plant. It has been shown that chaotic queue-method brings an improvement in the performance of the FLC for wide range of set point changes by a more profound initial population spread in the search space.

Optimization of Signal Timing of Intersections by Internal Metering of Queue Time Ratio of Vehicles in Network Scale

Directory of Open Access Journals (Sweden)

Mina Ghanbarikarekani

2016-06-01

Full Text Available Optimization of signal timing in urban network is usually done by minimizing the delay times or queue lengths. Sincethe effect of each intersection on the whole network is not considered in the mentioned methods, traffic congestion may occur in network links. Therefore, this paper has aimed to provide a timing optimization algorithm for traffic signals using internal timing policy based on balancing queue time ratio of vehicles in network links. In the proposed algorithm, the difference between the real queue time ratio and the optimum one for each link of intersection was minimized. To evaluate the efficiency of the proposed algorithm on traffic performance, the proposed algorithm was applied in a hypothetical network. By comparing the simulating software outputs, before and after implementing the algorithm, it was concluded that the queue time ratio algorithm has improved the traffic parameters by increasing the flow as well as reducing the delay time and density of the network.

Decomposability queueing and computer system applications

CERN Document Server

Courtois, P J

1977-01-01

Decomposability: Queueing and Computer System Applications presents a set of powerful methods for systems analysis. This 10-chapter text covers the theory of nearly completely decomposable systems upon which specific analytic methods are based.The first chapters deal with some of the basic elements of a theory of nearly completely decomposable stochastic matrices, including the Simon-Ando theorems and the perturbation theory. The succeeding chapters are devoted to the analysis of stochastic queuing networks that appear as a type of key model. These chapters also discuss congestion problems in

Cost Comparison of B-1B Non-Mission-Capable Drivers Using Finite Source Queueing with Spares

Science.gov (United States)

2012-09-06

COMPARISON OF B-1B NON-MISSION-CAPABLE DRIVERS USING FINITE SOURCE QUEUEING WITH SPARES GRADUATE RESEARCH PAPER Presented to the Faculty...step into the lineup making large-number approximations unusable. Instead, a finite source queueing model including spares is incorporated...were reported as flying time accrued since last occurrence. Service time was given in both start-stop format and MX man-hours utilized. Service time was

Scientific Visualization for Atmospheric Data Analysis in Collaborative Virtual Environments

Science.gov (United States)

Engelke, Wito; Flatken, Markus; Garcia, Arturo S.; Bar, Christian; Gerndt, Andreas

2016-04-01

1 INTRODUCTION The three year European research project CROSS DRIVE (Collaborative Rover Operations and Planetary Science Analysis System based on Distributed Remote and Interactive Virtual Environments) started in January 2014. The research and development within this project is motivated by three use case studies: landing site characterization, atmospheric science and rover target selection [1]. Currently the implementation for the second use case is in its final phase [2]. Here, the requirements were generated based on the domain experts input and lead to development and integration of appropriate methods for visualization and analysis of atmospheric data. The methods range from volume rendering, interactive slicing, iso-surface techniques to interactive probing. All visualization methods are integrated in DLR's Terrain Rendering application. With this, the high resolution surface data visualization can be enriched with additional methods appropriate for atmospheric data sets. This results in an integrated virtual environment where the scientist has the possibility to interactively explore his data sets directly within the correct context. The data sets include volumetric data of the martian atmosphere, precomputed two dimensional maps and vertical profiles. In most cases the surface data as well as the atmospheric data has global coverage and is of time dependent nature. Furthermore, all interaction is synchronized between different connected application instances, allowing for collaborative sessions between distant experts. 2 VISUALIZATION TECHNIQUES Also the application is currently used for visualization of data sets related to Mars the techniques can be used for other data sets as well. Currently the prototype is capable of handling 2 and 2.5D surface data as well as 4D atmospheric data. Specifically, the surface data is presented using an LoD approach which is based on the HEALPix tessellation of a sphere [3, 4, 5] and can handle data sets in the order of

Walkable self-overlapping virtual reality maze and map visualization demo

DEFF Research Database (Denmark)

Serubugo, Sule; Skantarova, Denisa; Evers, Nicolaj

2017-01-01

This paper describes our demonstration of a walkable self-overlapping maze and its corresponding map to facilitate asymmetric collaboration for room-scale virtual reality setups in public places.......This paper describes our demonstration of a walkable self-overlapping maze and its corresponding map to facilitate asymmetric collaboration for room-scale virtual reality setups in public places....

EEG analysis in a telemedical virtual world

NARCIS (Netherlands)

Jovanov, E.; Starcevic, D.; Samardzic, A.; Marsh, A.; Obrenovic, Z.

1999-01-01

Telemedicine creates virtual medical collaborative environments. We propose here a novel concept of virtual medical devices (VMD) for telemedical applications. VMDs provide different views on biomedical recordings and efficient signal analysis. In this paper we present a telemedical EEG analysis

Arrival first queueing networks with applications in kanban production systems

NARCIS (Netherlands)

Boucherie, R.J.; Chao, X.; Miyazawa, M.

2001-01-01

In this paper we introduce a new class of queueing networks called {\\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

Arrival first queueing networks with applications in kanban production systems

NARCIS (Netherlands)

Boucherie, Richardus J.; Chao, X.; Miyazawa, M.

2003-01-01

In this paper, we introduce a new class of queueing networks called arrival first networks. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

Transient analysis of one-sided Lévy-driven queues

NARCIS (Netherlands)

Starreveld, N.; Bekker, R.; Mandjes, M.R.H.

2015-01-01

In this paper we analyze the transient behavior of the workload process in a Lévy input queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of spectrally one-sided

Python for Scientific Computing Education: Modeling of Queueing Systems

Directory of Open Access Journals (Sweden)

Vladimiras Dolgopolovas

2014-01-01

Full Text Available In this paper, we present the methodology for the introduction to scientific computing based on model-centered learning. We propose multiphase queueing systems as a basis for learning objects. We use Python and parallel programming for implementing the models and present the computer code and results of stochastic simulations.

Collaborative Interactive Visualization Exploratory Concept

Science.gov (United States)

2015-06-01

virtual reality, spatial computing, virtual assistants that are capable of operating at high cognitive levels, extensible work spaces, conferencing ...process of communication using electronic assets and accompanying software designed for use in remote locations. Recent technological advancements in...collaborative possibilities. Newest generations of hand-held electronic devices feature video, audio, and on- screen drawing in addition to capabilities

Freeway Traffic Density and On-Ramp Queue Control via ILC Approach

Directory of Open Access Journals (Sweden)

Ronghu Chi

2014-01-01

Full Text Available A new queue length information fused iterative learning control approach (QLIF-ILC is presented for freeway traffic ramp metering to achieve a better performance by utilizing the error information of the on-ramp queue length. The QLIF-ILC consists of two parts, where the iterative feedforward part updates the control input signal by learning from the past control data in previous trials, and the current feedback part utilizes the tracking error of the current learning iteration to stabilize the controlled plant. These two parts are combined in a complementary manner to enhance the robustness of the proposed QLIF-ILC. A systematic approach is developed to analyze the convergence and robustness of the proposed learning scheme. The simulation results are further given to demonstrate the effectiveness of the proposed QLIF-ILC.

A discrete-time queueing system with changes in the vacation times

Directory of Open Access Journals (Sweden)

Atencia Ivan

2016-06-01

Full Text Available This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

Predictive functional control for active queue management in congested TCP/IP networks.

Science.gov (United States)

Bigdeli, N; Haeri, M

2009-01-01

Predictive functional control (PFC) as a new active queue management (AQM) method in dynamic TCP networks supporting explicit congestion notification (ECN) is proposed. The ability of the controller in handling system delay along with its simplicity and low computational load makes PFC a privileged AQM method in the high speed networks. Besides, considering the disturbance term (which represents model/process mismatches, external disturbances, and existing noise) in the control formulation adds some level of robustness into the PFC-AQM controller. This is an important and desired property in the control of dynamically-varying computer networks. In this paper, the controller is designed based on a small signal linearized fluid-flow model of the TCP/AQM networks. Then, closed-loop transfer function representation of the system is derived to analyze the robustness with respect to the network and controller parameters. The analytical as well as the packet-level ns-2 simulation results show the out-performance of the developed controller for both queue regulation and resource utilization. Fast response, low queue fluctuations (and consequently low delay jitter), high link utilization, good disturbance rejection, scalability, and low packet marking probability are other features of the developed method with respect to other well-known AQM methods such as RED, PI, and REM which are also simulated for comparison.

Virtual Vision

Science.gov (United States)

Terzopoulos, Demetri; Qureshi, Faisal Z.

Computer vision and sensor networks researchers are increasingly motivated to investigate complex multi-camera sensing and control issues that arise in the automatic visual surveillance of extensive, highly populated public spaces such as airports and train stations. However, they often encounter serious impediments to deploying and experimenting with large-scale physical camera networks in such real-world environments. We propose an alternative approach called "Virtual Vision", which facilitates this type of research through the virtual reality simulation of populated urban spaces, camera sensor networks, and computer vision on commodity computers. We demonstrate the usefulness of our approach by developing two highly automated surveillance systems comprising passive and active pan/tilt/zoom cameras that are deployed in a virtual train station environment populated by autonomous, lifelike virtual pedestrians. The easily reconfigurable virtual cameras distributed in this environment generate synthetic video feeds that emulate those acquired by real surveillance cameras monitoring public spaces. The novel multi-camera control strategies that we describe enable the cameras to collaborate in persistently observing pedestrians of interest and in acquiring close-up videos of pedestrians in designated areas.

Remote Collaborative 3D Printing - Process Investigation

Science.gov (United States)

2016-04-01

COLLABORATIVE 3D PRINTING - PROCESS INVESTIGATION Cody M. Reese, PE CAD MODEL PRINT MODEL PRINT PREVIEW PRINTED PART AERIAL VIRTUAL This...REMOTE COLLABORATIVE 3D PRINTING - PROCESS INVESTIGATION 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER Cody M. Reese...release; distribution is unlimited. 13. SUPPLEMENTARY NOTES 14. ABSTRACT The Remote Collaborative 3D Printing project is a collaboration between

Realistic terrain visualization based on 3D virtual world technology

Science.gov (United States)

Huang, Fengru; Lin, Hui; Chen, Bin; Xiao, Cai

2010-11-01

The rapid advances in information technologies, e.g., network, graphics processing, and virtual world, have provided challenges and opportunities for new capabilities in information systems, Internet applications, and virtual geographic environments, especially geographic visualization and collaboration. In order to achieve meaningful geographic capabilities, we need to explore and understand how these technologies can be used to construct virtual geographic environments to help to engage geographic research. The generation of three-dimensional (3D) terrain plays an important part in geographical visualization, computer simulation, and virtual geographic environment applications. The paper introduces concepts and technologies of virtual worlds and virtual geographic environments, explores integration of realistic terrain and other geographic objects and phenomena of natural geographic environment based on SL/OpenSim virtual world technologies. Realistic 3D terrain visualization is a foundation of construction of a mirror world or a sand box model of the earth landscape and geographic environment. The capabilities of interaction and collaboration on geographic information are discussed as well. Further virtual geographic applications can be developed based on the foundation work of realistic terrain visualization in virtual environments.

Fast distributed strategic learning for global optima in queueing access games

KAUST Repository

Tembine, Hamidou

2014-01-01

In this paper we examine combined fully distributed payoff and strategy learning (CODIPAS) in a queue-aware access game over a graph. The classical strategic learning analysis relies on vanishing or small learning rate and uses stochastic

An energy-efficient MAC protocol using dynamic queue management for delay-tolerant mobile sensor networks.

Science.gov (United States)

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

An Energy-Efficient MAC Protocol Using Dynamic Queue Management for Delay-Tolerant Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Yugui Qu

2011-02-01

Full Text Available Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

Simple product-form bounds for queueing networks with finite clusters

NARCIS (Netherlands)

van Dijk, N.M.; van der Sluis, E.

2001-01-01

Queueing networks are studied with finite capacity constraints for clusters of stations. First, by an instructive tandem cluster example it is shown how a product-form modification method for networks with finite stations can be extended to networks with finite clusters. Next, a general result is

Estimation of the workload correlation in a Markov fluid queue

NARCIS (Netherlands)

Kaynar, B.; Mandjes, M.R.H.

2013-01-01

This paper considers a Markov fluid queue, focusing on the correlation function of the stationary workload process. A simulation-based computation technique is proposed, which relies on a coupling idea. Then an upper bound on the variance of the resulting estimator is given, which reveals how the

The priority queue as an example of hardware/software codesign

DEFF Research Database (Denmark)

Høeg, Flemming; Mellergaard, Niels; Staunstrup, Jørgen

1994-01-01

The paper identifies a number of issues that are believed to be important for hardware/software codesign. The issues are illustrated by a small comprehensible example: a priority queue. Based on simulations of a real application, we suggest a combined hardware/software realization of the priority...

Response times in a two-node queueing network with feedback

NARCIS (Netherlands)

van der Mei, R.D.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, J.L.

2002-01-01

The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

Response times in a two-node queueing network with feedback

NARCIS (Netherlands)

van der Mei, R.D.; Gijsen, B.M.M.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, Hans Leo

The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

Waiting time distribution in M/D/1 queueing systems

DEFF Research Database (Denmark)

Iversen, Villy Bæk; Staalhagen, Lars

1999-01-01

The well-known formula for the waiting time distribution of M/D/1 queueing systems is numerically unsuitable when the load is close to 1.0 and/or the results for a large waiting time are required. An algorithm for any load and waiting time is presented, based on the state probabilities of M/D/1...

Upper Bound for Queue length in Regulated Burst Service Scheduling

Directory of Open Access Journals (Sweden)

Mahmood Daneshvar Farzanegan

2016-01-01

Full Text Available Quality of Service (QoS provisioning is very important in next computer/communication networks because of increasing multimedia services. Hence, very investigations are performed in this area. Scheduling algorithms effect QoS provisioning. Lately, a scheduling algorithm called Regulated Burst Service Scheduling (RBSS suggested by author in [1] to provide a better service to bursty and delay sensitive services such as video. One of the most significant feature in RBSS is considering burstiness of arrival traffic in scheduling algorithm. In this paper, an upper bound of queue length or buffer size and service curve are calculated by Network Calculus analysis for RBSS. Because in RBSS queue length is a parameter that is considered in scheduling arbitrator, analysis results a differential inequality to obtain service curve. To simplify, arrival traffic is assumed to be linear that is defined in the paper clearly. This paper help to analysis delay in RBSS for different traffic with different specifications. Therefore, QoS provisioning will be evaluated.

Elements of queueing theory palm martingale calculus and stochastic recurrences

CERN Document Server

Baccelli, François

2003-01-01

The Palm theory and the Loynes theory of stationary systems are the two pillars of the modern approach to queuing. This book, presenting the mathematical foundations of the theory of stationary queuing systems, contains a thorough treatment of both of these. This approach helps to clarify the picture, in that it separates the task of obtaining the key system formulas from that of proving convergence to a stationary state and computing its law. The theory is constantly illustrated by classical results and models: Pollaczek-Khintchin and Tacacs formulas, Jackson and Gordon-Newell networks, multiserver queues, blocking queues, loss systems etc., but it also contains recent and significant examples, where the tools developed turn out to be indispensable. Several other mathematical tools which are useful within this approach are also presented, such as the martingale calculus for point processes, or stochastic ordering for stationary recurrences. This thoroughly revised second edition contains substantial addition...

Two parallel finite queues with simultaneous services and Markovian arrivals

Directory of Open Access Journals (Sweden)

S. R. Chakravarthy

1997-01-01

Full Text Available In this paper, we consider a finite capacity single server queueing model with two buffers, A and B, of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B. Messages are processed according to the following rules: 1. When buffer A(B has a message and buffer B(A is empty, then one message from A(B is processed by the server. 2. When both buffers, A and B, have messages, then two messages, one from A and one from B, are processed simultaneously by the server. The service times are assumed to be exponentially distributed with parameters that may depend on the type of service. This queueing model is studied as a Markov process with a large state space and efficient algorithmic procedures for computing various system performance measures are given. Some numerical examples are discussed.

Collaborative Oceanography and Virtual Experiments

Science.gov (United States)

2013-09-30

Observing Laboratory ( EOL ), but also contains an internal architecture which will allow it to evolve into a collaborative communication tool...an additional 50,988 "common" products were generated (241 plot types), along with 47,600 overlays (101 plot types). From 52 non- EOL sources...24,471 products were collected, and from 1486 EOL data collections, 643,263 "federated" products were indexed and made available through itop.org

Virtual data in CMS analysis

International Nuclear Information System (INIS)

Arbree, A.

2003-01-01

The use of virtual data for enhancing the collaboration between large groups of scientists is explored in several ways: by defining ''virtual'' parameter spaces which can be searched and shared in an organized way by a collaboration of scientists in the course of their analysis; by providing a mechanism to log the provenance of results and the ability to trace them back to the various stages in the analysis of real or simulated data; by creating ''check points'' in the course of an analysis to permit collaborators to explore their own analysis branches by refining selections, improving the signal to background ratio, varying the estimation of parameters, etc.; by facilitating the audit of an analysis and the reproduction of its results by a different group, or in a peer review context. We describe a prototype for the analysis of data from the CMS experiment based on the virtual data system Chimera and the object-oriented data analysis framework ROOT. The Chimera system is used to chain together several steps in the analysis process including the Monte Carlo generation of data, the simulation of detector response, the reconstruction of physics objects and their subsequent analysis, histogramming and visualization using the ROOT framework

Asymptotic inference for waiting times and patiences in queues with abandonment

DEFF Research Database (Denmark)

Gorst-Rasmussen, Anders; Hansen, Martin Bøgsted

2009-01-01

Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about waiting time and patience distributions in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent...

Wikis, blogs and podcasts: a new generation of Web-based tools for virtual collaborative clinical practice and education

Directory of Open Access Journals (Sweden)

Maramba Inocencio

2006-08-01

Full Text Available Abstract Background We have witnessed a rapid increase in the use of Web-based 'collaborationware' in recent years. These Web 2.0 applications, particularly wikis, blogs and podcasts, have been increasingly adopted by many online health-related professional and educational services. Because of their ease of use and rapidity of deployment, they offer the opportunity for powerful information sharing and ease of collaboration. Wikis are Web sites that can be edited by anyone who has access to them. The word 'blog' is a contraction of 'Web Log' – an online Web journal that can offer a resource rich multimedia environment. Podcasts are repositories of audio and video materials that can be "pushed" to subscribers, even without user intervention. These audio and video files can be downloaded to portable media players that can be taken anywhere, providing the potential for "anytime, anywhere" learning experiences (mobile learning. Discussion Wikis, blogs and podcasts are all relatively easy to use, which partly accounts for their proliferation. The fact that there are many free and Open Source versions of these tools may also be responsible for their explosive growth. Thus it would be relatively easy to implement any or all within a Health Professions' Educational Environment. Paradoxically, some of their disadvantages also relate to their openness and ease of use. With virtually anybody able to alter, edit or otherwise contribute to the collaborative Web pages, it can be problematic to gauge the reliability and accuracy of such resources. While arguably, the very process of collaboration leads to a Darwinian type 'survival of the fittest' content within a Web page, the veracity of these resources can be assured through careful monitoring, moderation, and operation of the collaborationware in a closed and secure digital environment. Empirical research is still needed to build our pedagogic evidence base about the different aspects of these tools in

BIM-based Multiuser Collaborative Virtual Environments for end user involvement

DEFF Research Database (Denmark)

Sørensen, Jesper Bendix; Svidt, Kjeld

2017-01-01

This paper examines the potential of utilizing virtual mock-ups in end user involvement processes. To access if virtual mock-ups can optimize existing processes, current workflows using physical full-scale mock-ups on several projects are explored. Requirements regarding the traditional workflows...

An M/M/2 Queueing System with Heterogeneous Servers Including One with Working Vacation

Directory of Open Access Journals (Sweden)

A. Krishnamoorthy

2012-01-01

Full Text Available This paper analyzes an M/M/2 queueing system with two heterogeneous servers, one of which is always available but the other goes on vacation in the absence of customers waiting for service. The vacationing server, however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady state using matrix geometric method. Busy period of the system is analyzed and mean waiting time in the stationary regime computed. Conditional stochastic decomposition of stationary queue length is obtained. An illustrative example is also provided.

Simple approximations for the batch-arrival MX/G/1 queue

NARCIS (Netherlands)

van Ommeren, Jan C.W.

1990-01-01

In this paper we consider the MX/G/I queueing system with batch arrivals. We give simple approximations for the waiting-time probabilities of individual customers. These approximations are checked numerically and they are found to perform very well for a wide variety of batch-size and service-timed

Remote Collaboration With Mixed Reality Displays

DEFF Research Database (Denmark)

Müller, Jens; Rädle, Roman; Reiterer, Harald

2017-01-01

HCI research has demonstrated Mixed Reality (MR) as being beneficial for co-located collaborative work. For remote collaboration, however, the collaborators' visual contexts do not coincide due to their individual physical environments. The problem becomes apparent when collaborators refer...... to physical landmarks in their individual environments to guide each other's attention. In an experimental study with 16 dyads, we investigated how the provisioning of shared virtual landmarks (SVLs) influences communication behavior and user experience. A quantitative analysis revealed that participants used...

Asymptotic inference for waiting times and patiences in queues with abandonment

DEFF Research Database (Denmark)

Gorst-Rasmussen, Anders; Hansen, Martin Bøgsted

Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about the waiting time and patience distribution in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent...

ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT

Directory of Open Access Journals (Sweden)

M. Usha

2014-09-01

Full Text Available Design of an Active Queue Management scheme at the Access Point to address the problem of congestion control, packet delay variation and packet loss rate is discussed. The proposed mechanism calculates and adjusts redundancy rate adaptively at the access point by considering both network traffic load and wireless channel condition. Real-time applications such as Mobile learning and smart learning need the special treatment and require differentiated QoS to satisfy the client who is ready to pay more than others. Maintaining the jitter value of the multimedia packets below the threshold is essential to guarantee the desirable quality of the video at the receiver. The work initially concentrates on minimizing the packet loss of such priority flows and they have to be given place in the queue even at the time of buffer overflow. Thus the proposed work uses push-out policy to provide differentiated services to the multimedia flow which achieves considerable improvement in the video quality at the receiver. The considerable decrease in packet loss rate and special treatment in the queue of the access point lowers the packet delay variation of the multimedia flow. The results show that the AQM used at the access point effectively achieves low packet loss, low jitter using differentiated FEC rate calculation without generating congestion in the wireless network.

The recommender system for virtual items in MMORPGs based on a novel collaborative filtering approach

Science.gov (United States)

Li, S. G.; Shi, L.

2014-10-01

The recommendation system for virtual items in massive multiplayer online role-playing games (MMORPGs) has aroused the interest of researchers. Of the many approaches to construct a recommender system, collaborative filtering (CF) has been the most successful one. However, the traditional CFs just lure customers into the purchasing action and overlook customers' satisfaction, moreover, these techniques always suffer from low accuracy under cold-start conditions. Therefore, a novel collaborative filtering (NCF) method is proposed to identify like-minded customers according to the preference similarity coefficient (PSC), which implies correlation between the similarity of customers' characteristics and the similarity of customers' satisfaction level for the product. Furthermore, the analytic hierarchy process (AHP) is used to determine the relative importance of each characteristic of the customer and the improved ant colony optimisation (IACO) is adopted to generate the expression of the PSC. The IACO creates solutions using the Markov random walk model, which can accelerate the convergence of algorithm and prevent prematurity. For a target customer whose neighbours can be found, the NCF can predict his satisfaction level towards the suggested products and recommend the acceptable ones. Under cold-start conditions, the NCF will generate the recommendation list by excluding items that other customers prefer.

The asymptotic variance of departures in critically loaded queues

NARCIS (Netherlands)

Al Hanbali, Ahmad; Mandjes, M.R.H.; Nazarathy, Y.; Whitt, W.

2011-01-01

We consider the asymptotic variance of the departure counting process D(t) of the GI/G/1 queue; D(t) denotes the number of departures up to time t. We focus on the case where the system load ϱ equals 1, and prove that the asymptotic variance rate satisfies limt→∞varD(t) / t = λ(1 - 2 / π)(ca2 +

A two-station queue with dependent preparation and service times

NARCIS (Netherlands)

Vlasiou, M.; Adan, I.J.B.F.; Boxma, O.J.

2009-01-01

We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the

On the control of queueing systems with aging state information

NARCIS (Netherlands)

Onderwater, M.; Bhulai, S.; van der Mei, R.D.

2015-01-01

We investigate control of a queueing system in which a component of the state space is subject to aging. The controller can choose to forward incoming queries to the system (where it needs time for processing), or respond with a previously generated response (incurring a penalty for not providing a

Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.

Science.gov (United States)

Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan

2017-06-01

In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.

Operational behavior of the MAP/G/1 queue under N-policy with a single vacation and set-up

Directory of Open Access Journals (Sweden)

Ho Woo Lee

2002-01-01

Full Text Available This paper considers the MAP/G/1 queue under N-policy with a single vacation and set-up. We derive the vector generating functions of the queue length at an arbitrary time and at departures in decomposed forms. We also derive the Laplace-Stieltjes transform of the waiting time. Computation algorithms for mean performance measures are provided.

Virtual Reference, Real Money: Modeling Costs in Virtual Reference Services

Science.gov (United States)

Eakin, Lori; Pomerantz, Jeffrey

2009-01-01

Libraries nationwide are in yet another phase of belt tightening. Without an understanding of the economic factors that influence library operations, however, controlling costs and performing cost-benefit analyses on services is difficult. This paper describes a project to develop a cost model for collaborative virtual reference services. This…

Simulated Social Touch in a Collaborative Game

NARCIS (Netherlands)

Huisman, Gijs; Kolkmeijer, Jan; Heylen, Dirk; Auvray, Malika; Duriez, Christian

In this paper we present a study in which participants played a collaborative augmented reality game together with two virtual agents, visible in the same augmented reality space. During interaction one of the virtual agents touches the user on the arm, by means of a vibrotactile display. We

Virtual labs in Leonardo da Vinci

Directory of Open Access Journals (Sweden)

Stanislaw Nagy

2006-10-01

Full Text Available This paper discusses the problem of virtual lab capabilities in the e-learning. Using combination of web conferencing and "virtual labs" capabilities, a new quality distance learning teaching is now in preparation and will be included in the course teaching to produce interactive, online simulations for the natural gas engineering studies. The activities are designed to enhance the existing curriculum and to include online assessments. A special care is devoted to the security problem between a server and a client computer. Several examples of the virtual labs related to the PVT thermodynamics, fluid flow, the natural gas well-testing, and thev gas network flow are prepared and tested. A major challenge for the 'CELGAS' system is in managing the delicate balance between the student collaboration and the isolation. Students may be encouraged to collaborate and work with each other, simulating their exploration of the lab material.

Queue-based modelling and detection of parameters involved in stroke outcome

DEFF Research Database (Denmark)

Vilic, Adnan; Petersen, John Asger; Wienecke, Troels

2017-01-01

We designed a queue-based model, and investigated which parameters are of importance when predicting stroke outcome. Medical record forms have been collected for 57 ischemic stroke patients, including medical history and vital sign measurement along with neurological scores for the first twenty...

The MAP, M/G1,G2/1 queue with preemptive priority

Directory of Open Access Journals (Sweden)

Bong Dae Choi

1997-01-01

Full Text Available We consider the MAP, M/G1,G2/1 queue with preemptive resume priority, where low priority customers arrive to the system according to a Markovian arrival process (MAP and high priority customers according to a Poisson process. The service time density function of low (respectively: high priority customers is g1(x (respectively: g2(x. We use the supplementary variable method with Extended Laplace Transforms to obtain the joint transform of the number of customers in each priority queue, as well as the remaining service time for the customer in service in the steady state. We also derive the probability generating function for the number of customers of low (respectively, high priority in the system just after the service completion epochs for customers of low (respectively, high priority.

Efficient simulation of finite horizon problems in queueing and insurance risk

DEFF Research Database (Denmark)

Rojas-Nandayapa, Leonardo; Asmussen, Søren

Let ψ(u, t) be the probability that the workload in an initially empty M/G/1 queue exceeds u at time t < ∞, or, equivalently, the ruin probability in the classical Crámer-Lundberg model. Assuming service times/claim sizes to be subexponential, various Monte Carlo estimators for ψ(u, t) are sugges......Let ψ(u, t) be the probability that the workload in an initially empty M/G/1 queue exceeds u at time t classical Crámer-Lundberg model. Assuming service times/claim sizes to be subexponential, various Monte Carlo estimators for ψ(u, t......) are suggested. A key idea behind the estimators is conditional Monte Carlo. Variance estimates are derived in the regularly varying case, the efficiencies are compared numerically and also one of the estimators is shown to have bounded relative error. In part, also extensions to general Lévy processes are treated....

Fast distributed strategic learning for global optima in queueing access games

KAUST Repository

Tembine, Hamidou

2014-08-24

In this paper we examine combined fully distributed payoff and strategy learning (CODIPAS) in a queue-aware access game over a graph. The classical strategic learning analysis relies on vanishing or small learning rate and uses stochastic approximation tool to derive steady states and invariant sets of the underlying learning process. Here, the stochastic approximation framework does not apply due to non-vanishing learning rate. We propose a direct proof of convergence of the process. Interestingly, the convergence time to one of the global optima is almost surely finite and we explicitly characterize the convergence time. We show that pursuit-based CODIPAS learning is much faster than the classical learning algorithms in games. We extend the methodology to coalitional learning and proves a very fast formation of coalitions for queue-aware access games where the action space is dynamically changing depending on the location of the user over a graph.

Architecture for Collaborative Learning Activities in Hybrid Learning Environments

OpenAIRE

Ibáñez, María Blanca; Maroto, David; García Rueda, José Jesús; Leony, Derick; Delgado Kloos, Carlos

2012-01-01

3D virtual worlds are recognized as collaborative learning environments. However, the underlying technology is not sufficiently mature and the virtual worlds look cartoonish, unlinked to reality. Thus, it is important to enrich them with elements from the real world to enhance student engagement in learning activities. Our approach is to build learning environments where participants can either be in the real world or in its mirror world while sharing the same hybrid space in a collaborative ...

Tools for building virtual laboratories

International Nuclear Information System (INIS)

Agarwal, Debora; Johnston, William E.; Loken, Stewart; Tierney, Brian

1996-01-01

There is increasing interest in making unique research facilities facilities accessible on the Internet. Computer systems, scientific databases and experimental apparatus can be used by international collaborations of scientists using high-speed networks and advanced software tools to support collaboration. We are building tools including video conferencing and electronic white boards that are being used to create examples of virtual laboratories. This paper describes two pilot projects which provide testbeds for the tools. The first is a virtual laboratory project providing remote access to LBNL's Advanced Light Source. The second is the Multidimensional Applications and Gigabit internet work Consortium (MAGIC) testbed which has been established to develop a very high-speed, wide-are network to deliver realtime data at gigabit-per-second rates. (author)