Dilip D. Kandlur

Learn More
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the <sc>ietf</sc> has been considering the deployment of active queue management techniques such as <sc>Red</sc> [14]. While active queue management can potentially reduce packet loss rates in the Internet, we show that current techniques are ineffective(More)
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF is considering the deployment of active queue management techniques such as RED [13]. While active queue management can potentially reduce packet loss rates in the Internet, this paper shows that current techniques are ineffective in preventing(More)
This paper describes and evaluates Stochastic Fair Blue(SFB), a novel technique for enforcing fairness among a large number of flows. SFB scalably detects and rate-limits non-responsive flows through the use of a marking probability derived from the BLUE queue management algorithm and a Bloom filter. Using analysis and simulation, SFB is shown to(More)
The Internet today provides no support for privacy or authentication of multicast packets. However, an increasing number of applications will require secure multicast services in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the(More)
Multimedia storage servers provide access to multimedia objects including text, images, audio, and video. The design of such servers fundamentally di ers from conventional servers due to: (1) the real-time storage and retrieval requirements, as well as (2) the large storage space and data transfer rate requirements of digital multimedia. In this paper, we(More)
This paper presents a new formulation of DASD (direct access storage device) disk arm scheduling schemes for multimedia storage management. The formulation, referred to as grouped sweeping scheduling (GSS), provides a framework for minimizing the buffer space required in the retrieval of multimedia streams. In GSS, the set ofn media streams that are to be(More)
family of 6-regular graphs, called hexagonal meshes or H-meshes, is considered n H as a multiprocessor interconnection network. Processing nodes on the periphery of a-mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped H-mesh is shown to be of O(p), where p is the number of nodes in the 1/2 o t H-mesh. An elegant,(More)
In a video-on-demand (VOD) system, it is desirable to provide the user with interactive browsing functions such as &#8220;fast forward&#8221; and &#8220;fast backward.&#8221; However, these functions usually require a significant amount of additional resources from the VOD system in terms of storage space, retrieval throughput, network bandwidth, etc.(More)
Communication in real-time systems has to be predictable, because unpredictable delays in the delivery of messages can adversely aaect the execution of tasks dependent on these messages. In this paper, we develop a scheme for providing predictable inter-process communication in real-time systems with (partially connected) point{to{point interconnection(More)