(1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.

https://link.springer.com/content/pdf/10.1057%2Fjors.1987.184.pdf

Applied Probability and Queues

Adaptive vector median filtering

From the Publisher:
Image Processing Handbook covers methods for two different purposes:
Improving the visual appearance of images to a human viewerPreparing images for measurement of the features and structures present.

The handbook presents an extensive collection of image processing tools, enabling the user of computer-based system to understand those methods provided in packaged software and to program additions needed for particular applications. Comparisons are presented of different algorithms that may be used for similar purposes, including a selection of representative pictures from light and electron microscopes as well as macroscopic, satellite, and astronomical images.
Image Processing Handbook examines the rapid, powerful developments in graphic information, covering the array of concepts and techniques in high-end imaging software. With balanced, complete descriptions, the text outlines frequency space methods with extensive mathematical presentation and spatial domain processing. This handbook teaches by example -- by seeing what various operations do to representative images, the reader will discover how and why to use them. The text encourages the reader to use its information with a real source of images and a computer-based system as well as to freely experiment with different methods to determine the most appropriate for his or her particular needs.To facilitate the learning process, Reindeer Games in Charlotte, North Carolina, offers The Image Processing Tool Kit, a CD-ROM containing more than 150 images and more than 150 Photoshop-compatible plug-ins that implement the algorithms discussed. This revision of the established standard acts as a singular resource for professionals in the medical, biological, and materials sciences as well as a range of engineering venues, including electrical and computer engineering, optical engineering, telecommunications, and artificial intelligence.

Image Processing Handbook, Fourth Edition

Security, privacy & efficiency of sustainable Cloud Computing for Big Data & IoT

Wireless sensor networks are one of the most promising emerging technologies, providing the opportunity for real-time monitoring of geographical regions (remote and hostile) that are prone to disasters. With a focus on landslide detection, this work reaffirms the capability of wireless sensor networks for disaster mitigation. A complete functional system consisting of 50 geological sensors and 20 wireless sensor nodes was deployed in Idukki, a district in the southwestern region of Kerala State, India, a highly landslide prone area. The wireless sensor network system has, for the past three years, gathered vast amounts of data such as correlated sensor data values on rainfall, moisture, pore pressure and movement, along with other geological, hydrological and soil properties, helping to provide a better understanding of the landslide scenario. Using the wireless sensor networks, system was developed an innovative three level landslide warning system (Early, Intermediate and Imminent). This system has proven its validity by delivering a real warning to the local community during heavy rains in the July 2009 monsoon season. The implementation of this system uses novel data aggregation methods for power optimization in the field deployment. A report on unanticipated challenges that were faced in the field deployment of the wireless sensor networks and the novel solutions devised to overcome them are presented here.

Design, development, and deployment of a wireless sensor network for detection of landslides

In this paper we present three virtualization devices (Xen server, NetFPGA and EZ appliance) which have been used for implementation of data plane functionality in a Future Internet architecture, the IIP System. We give general description of these devices and present implementation of the IIP System node on each device.

Virtualization Devices for Prototyping of Future Internet

Active Queue Management (AQM) is recommended by Internet Engineering Task Force to mitigate the bufferbloat phenomenon in the Internet. In this paper, we show the results of comprehensive measurements carried out in our university network, in which a device with an AQM algorithm, designed and programmed for this purpose, was running. The implemented AQM algorithm was based on the dropping function, i.e. arriving packets were dropped randomly, with the probability being a function of the queue length. Several different dropping function forms, proposed in the networking literature, were used, in addition to the classic FIFO queue (no AQM). The experiment lasted over a month, during which the state of the network was measured and recorded several thousand times. This made the results independent of the natural fluctuations of the users’ behavior and the network load. Conclusions on the general performance improvement offered by the implemented AQM, as well as the differences in the performance between particular forms of the dropping function, were reached. Some of these conclusions differ from those drawn previously from simulations. This underlines the need for carrying measurements of new AQMs in real, operating networks, with complex, natural traffic.

/pdf/aqm-based-on-the-queue-length-a-real-network-study-2owqgrpk.pdf

AQM based on the queue length: A real-network study

To eliminate the bufferbloat phenomenon from the Internet, it is recommended to apply the active queue management in network nodes — for instance, by dropping packets with a probability that is a function of the queue size (dropping function). The positive effects of this mechanism on the queue sizes, queueing delays, TCP flow desynchronization and inter-flow fairness, have been studied in many papers. They did not deal, however, with the statistical structure of packet losses caused by the application of the dropping function. This structure is especially important when real-time time multimedia transmissions are considered — such transmissions are very sensitive to consecutive packet losses. In this paper, we study the impact of the dropping function on the burst ratio, a formally-defined measure of the tendency of packet losses to occur in long series. We also check the tradeoff between the burst ratio and the overall packet loss ratio, using the cost function proposed for voice transmissions. Finally, taking this tradeoff into account, we draw conclusions about best shapes of the dropping function.

On the impact of the dropping function on the packet queueing performance

In this report, a detailed analysis of the packet loss process in a finite-buffer queue fed by the Markovian arrival process (MAP) is shown. The results consist of both transient and stationary characterization of the loss process in terms of the loss ratio, the number of packets lost per time unit and the number of losses in an interval of a given length. In addition to the analytical results, a number of numerical examples based on an IP traffic trace file are presented.

Packet Loss Process in a Queue with Markovian Arrivals

Packet buffers in routers play a major role in congestion control in existing Internet. They compensate for the incoming traffic bursts transmitted by aggressive TCP applications. The appropriate sizing of buffers is important for providing equilibrium between the high link utilization, the loss ratio and the queueing delay. There is a growing need for routers with small buffers in high speed networks. In this paper we investigate the performance of active queue management algorithms with very small buffers. In particular, we show, that the use of very small buffers does not influence throughput on bottlenecked links if mixed (TCP / UDP) traffic is involved. On the other hand a very small buffer may lead to degradation of the inter-flow fairness.

Andrzej Chydzinski

Papers

Virtualization Devices for Prototyping of Future Internet

AQM based on the queue length: A real-network study

On the impact of the dropping function on the packet queueing performance

Packet Loss Process in a Queue with Markovian Arrivals

On the Performance of AQM Algorithms with Small Buffers