Ad hoc networks are self forming, auto configuring without any kind of pre-existing infrastructure. With the dearth of pre-defined topology there is no router or controlling device. Two mobile nodes can exchange data directly if they are in the defined range of each other. If not, nodes can communicate via a multi-hop route with the help of other mobile nodes. In this paper we have proposed an ...

A buffer is a main-memory area used to reduce access to disks. The buffer holds pages from secondary storage files. A process requesting a page causes a fault if the page is not in the buffer: the requested page is read into the buffer. If no buffer space is available, a page in the buffer is replaced by the requested one. The solution of many relational queries (e.g. joins) require the repeate...

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...

The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the constraints or both are usually not available in closed-form, making the problem even harder. A good approximation for the performance measures is thus essential for a successful buffer allocation algorithm. A recently p...

An Early Quantum Task (EQT) is a Quantum EDF task that has shrunk its first period into one quantum time slot. Its purpose is to be executed as soon as possible, without causing deadline overflow of other tasks. We will derive the conditions under which an EQT can be admitted and can have an immediate start. The advantage of scheduling EQTs is shown by its use in a buffered multi-media server. ...

We design and analyze an approximation method for advection-diffusion-reaction equations where the (generalized) degrees of freedom are polynomials of order k 0 at mesh faces. The method hinges on local discrete reconstruction operators for the diffusive and advective derivatives and a weak enforcement of boundary conditions. Fairly general meshes with polytopal and nonmatching cells are suppor...

We present a new smoothness indicator that evaluates the local smoothness of a function inside of a stencil. The corresponding weighted essentially non-oscillatory (WENO) finite difference scheme can provide the fifth convergence order in smooth regions. The proposed WENO scheme provides at least the same or improved behavior over the classical fifth-order WENO scheme [9] and other fifth-order ...

Networks have become multipath: mobile devices have multiple radio interfaces, datacenters have redundant paths andmultihoming is the norm for big server farms. Meanwhile, TCP is still only single-path. Is it possible to extend TCP to enable it to support multiple paths for current applications on today’s Internet? The answer is positive. We carefully review the constraints—partly due to variou...