In this work, we present a Colored Petri Net (CPN) model used for prototyping and modeling a complex switching scheme for ATM switches based on the combined I/O buffering technique. The new scheme is evaluated here within an overall setting that includes the traffic regulations enforced by the leaky bucket algorithm. It is based on splitting the traffic coming into input lines into two priority...

For the problem of finding the shortest paths from a prescribed vertex to the other vertices in a given network with nonnegative arc lengths, we investigate practical efficiencies of typical existing algorithms, i.e., the label-correcting method with a FIFO and that of a two-way sequence, and the label-setting method with a heap and that with a 1or 2-level bucket system. We propose also a new m...

Differentiated Service Model (Diffserv) is currently a popular research topic as a low-cost method to bring QoS to today’s Internet, especially in the backbone. Simulation is the best way to study Diffserv before deploying it to the real Internet. In this paper, we introduce the techniques and methodologies that we used to design and implement Diffserv enabled routers by using OPNET. We have im...

A lifting-linearization method based on the Koopman operator and Dual Faceted Linearization is applied to control of a robotic excavator. In excavation, bucket interacts with surrounding soil in highly nonlinear complex manner. Here, we propose represent bucket-soil dynamics set linear state equations higher-dimensional space. The space independent variables augmented by adding associated eleme...

1 Supported in part by a grant from the Texas Advanced Research Program. Abstract-The token protocols of FDDI and FDDI-M support both synchronous and asynchronous traffic. However, FDDI suffers from a token-lateness problem, and FDDI-M may starve asynchronous traffic. To remove these two weaknesses, we propose the on-time timed-token protocol. Its main feature is the addition of information to ...

The paper addresses the problem of computing lower bounds on the optimal costs associated with each unary assignment of a value to a variable in combinatorial optimization problems. This problem is instrumental in a variety of domains, in particular in proba-bilistic reasoning. Our aim is to use such lower bounds as a look-ahead procedure guiding search algorithms for optimal solutions. In part...

Increasing demands on a network with an excessive downloads will saturate its capacity. There are different congestion control mechanisms which helps a network to operate in an optimal region of low delay with high throughput and thereby preventing the network from becoming congested. In this paper, the leaky bucket algorithm is used to control transmission rate in a network. It can be used to ...

In the process of automating an earthmoving machine, we have developed a model of soil-tool interaction that predicts resistive forces experienced at the tool during digging. The predicted forces can be used to model the closed loop behavior of a controller that servoes the joints of the excavator so as to fill the bucket. In this paper, we extend the state of the art in two ways. First, we pre...

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. In particular, it can be used for any combinatorial optimization task such as finding most probable configurations in a Bayesian network. In this paper we present a new algorithm elim-m-opt, extending bucket elimination for the task of finding m best solut...