scispace - formally typeset
A

Andy Grimes

Researcher at University of Rochester

Publications -  4
Citations -  587

Andy Grimes is an academic researcher from University of Rochester. The author has contributed to research in topics: Datagram & Connectionless communication. The author has an hindex of 2, co-authored 4 publications receiving 587 citations.

Papers
More filters
Patent

Network having secure fast packet switching and guaranteed quality of service

TL;DR: In this paper, the authors present an approach and method for establishing virtual connections through a switched data communications network which provides higher speed, lower cost, integrated services, and manageability.
Patent

Method of transmitting data packets in a packet switched communications network

TL;DR: In this article, the authors propose an approach and method for establishing virtual connections through a packet switched data communications network, where each end system has a unique physical layer address and each switch has a connection database of valid connections between different ports on the switch and a switching mechanism for establishing temporary connections.
Patent

Method and system for allocating a bandwidth-limited shared resource

TL;DR: In this paper, a method and a system for allocating a bandwidth-limited, shared resource among a plurality of competing devices, comprising: means (414) for dividing an available time of the resource into a multiplicity of time segments, which are then allocated among the competing devices in a predetermined order to provide a first level of arbitration, and a list of devices having a predetermined rank in the list.
Patent

Methods for routing DTAT packets, using a spanning tree

TL;DR: In this article, a plurality of traversals are made of different paths moving outwardly from a starting point in a search to find an optimum path to a destination point based on a multiplicity of metrics, with the following steps: initializing a vector of metrics at the starting point where a value of each metric in the vector is a best value; traversing an arc to a next node along a path from the starting-point to the destination point; and at an end of each traversal, modifying the vector to produce a traversal value which accumulates from a best