A queuing subsystem is proposed to the round robin receiver/transmitter (RT ) optical code-division multiple-access (OCDMA) protocol. The corresponding state diagram and its mathematical model are outlined. We prove that significant improvement in terms of system throughput and blocking probability can be achieved by only adding a single buffer at each user node. Furthermore, the modified RT pr...

Abstract: This study is carried out to describe the behaviour of vehicles flow on the road, in the presence of blocking effects. A non-linear three dimensional system of ordinary differential equations is used to describe vehicles flow on the road. The study classify total vehicles population on the road into three compartments as Free – Slow – Released vehicles. The formulated model is well-po...

Available throughput performance studies for mobile ad hoc networks (MANETs) suffer from two major limitations: they mainly focus on the scaling law study of throughput, while the exact throughput of such networks remains largely unknown; they usually consider the infinite buffer scenarios, which are not applicable to the practical networks with limited buffer. As a step to address these limita...

The effect of the size of local buffer packet memory on the throughput of FDDI adapters is examined. The analysis focuses on transmit buffer size and covers both the loaded and unloaded FDDI ring cases. A hypothetical EISA FDDI adapter design is used as a vehicle to demonstrate the throughput characteristics of different local buffer memory sizes. Calculations are done to size the buffer with r...

A PDA is used mainly for downloading data from a stationary server such as a desktop PC in an infrastructure network based on wireless LAN. Thus, the overall performance depends heavily on the performance of such downloading with PDA. Unfortunately, for a PDA the time taken to receive data from a PC is longer than the time taken to send it by 53%. Thus, we measured and analyzed all possible fac...

Kernel heap buffer overflow vulnerabilities have been exposed for decades, but there is still no practical countermeasure that can be applied to the OS kernel. Previous solutions either suffer from high performance overhead or compatibility problems with the existing kernel and hardware. In this paper, we present Kruiser, a concurrent kernel heap buffer overflow monitor. Unlike conventional met...

This thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at an...

In this paper we describe an approximate method for the analysis of an open network of finite capacity queues. Finite buffer capacities at the nodes introduce blocking of jobs that finish service at a node and find that the destination node is full at that time. When this happens, we assume that the blocked job is held at the server of the queue where it just completed service, blocking that se...

Many embedded devices used to control critical infrastructure assets are based on the Harvard architecture. This architecture separates data and program memory into independent address spaces, unlike the von Neumann architecture, which uses a single address space for data and program code. Buffer overflow attacks in desktop and server platforms based on the von Neumann model have been studied e...