Patents by Inventor Danilo Florissi

Danilo Florissi has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20050210133
    Abstract: A method and apparatus for determining the number and location of monitoring entities in a distributed system is disclosed. The method comprising the steps of automatically generating a causality mapping model of the dependences between causing events at the nodes of the distributed system and the detectable events associated with a subset of the nodes, the model suitable for representing the execution of at least one system operation, reducing the number of detectable events in the model, wherein the reduced number of detectable events is suitable for substantially representing the execution of the at least one system operation; and placing at least one of the at least one monitoring entities at selected ones of the nodes associated with the detectable events in the reduced model. In another aspect, the processing described herein is in the form of a computer-readable medium suitable for providing instruction to a computer or processing system for executing the processing claimed.
    Type: Application
    Filed: March 11, 2005
    Publication date: September 22, 2005
    Inventors: Danilo Florissi, Patricia Florissi, Udi Kleers, Shmuel Kliger, Eyal Yardeni, Yechiam Yemini
  • Publication number: 20020163889
    Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.
    Type: Application
    Filed: February 1, 2001
    Publication date: November 7, 2002
    Inventors: Yechiam Yemini, Michael D. Grossberg, Danilo Florissi
  • Publication number: 20020091855
    Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.
    Type: Application
    Filed: February 1, 2001
    Publication date: July 11, 2002
    Inventors: Yechiam Yemini, Michael D. Grossberg, Danilo Florissi
  • Publication number: 20020031131
    Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.
    Type: Application
    Filed: February 1, 2001
    Publication date: March 14, 2002
    Inventors: Yechiam Yemini, Michael D. Grossberg, Danilo Florissi
  • Publication number: 20020028656
    Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.
    Type: Application
    Filed: February 1, 2001
    Publication date: March 7, 2002
    Inventors: Yechiam Yemini, Michael D. Grossberg, Danilo Florissi
  • Publication number: 20020029287
    Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.
    Type: Application
    Filed: February 1, 2001
    Publication date: March 7, 2002
    Inventors: Yechiam Yemini, Michael D. Grossberg, Danilo Florissi
  • Patent number: 5418779
    Abstract: In a switched network wherein a multiplicity of switching nodes are interconnected with communications links, communications traffic within the network is switched according to different routing trees each associated with a switching node as the destination node. The routing tree specifies a subset of incoming links from which each node receives the traffic and an outgoing link to which the node transfers the received traffic. Each switching node allocates time bands for implementing the different routing trees one at a time. However, nonoverlapping routing trees which share no common link can be implemented at the same time to increase the traffic throughput.
    Type: Grant
    Filed: March 16, 1994
    Date of Patent: May 23, 1995
    Assignee: The Trustee of Columbia University of New York
    Inventors: Yechiam Yemini, Danilo Florissi