Patents Assigned to BCK Networks, Inc.
  • Stream basis set division multiplexing
    Patent number: 8767734
    Abstract: A source-address independent, multi-path routing method for use in a communication network is disclosed. A network node uses an information packet's destination address to determine a plurality of neighbors it has a proportional likelihood to forward that packet to, such that packets can be sent over multiple paths to a destination node without undesirable looping. Multiple-neighbor proportional forwarding routing tables are determined by computing a directed graph of multiple optimal paths to each destination node. Optimal paths and forwarding proportions are based on link capacities. The multi-path routing method provides maximized throughput, reduced congestion and superior load balancing over single-path routing. Source-address independence also overcomes a major problem of more traditional source-address dependent multi-path routing methods. The source-address independent, multi-path routing method can be implemented in mixed networks where some nodes do not implement the method.
    Type: Grant
    Filed: October 5, 2009
    Date of Patent: July 1, 2014
    Assignee: BCK Networks, Inc.
    Inventors: Raghava Kondepudy, Saibal Banerjee, Gano Broto Chatterji
  • Multi-neighbor proportional forwarding in a network
    Patent number: 8432830
    Abstract: A source-address independent, multi-path routing method for use in a communication network is disclosed. A network node uses an information packet's destination address to determine a plurality of neighbors it has a proportional likelihood to forward that packet to, such that packets can be sent over multiple paths to a destination node without undesirable looping. Multiple-neighbor proportional forwarding routing tables are determined by computing a directed graph of multiple optimal paths to each destination node. Optimal paths and forwarding proportions are based on link capacities. The multi-path routing method provides maximized throughput, reduced congestion and superior load balancing over single-path routing. Source-address independence also overcomes a major problem of more traditional source-address dependent multi-path routing methods. The source-address independent, multi-path routing method can be implemented in mixed networks where some nodes do not implement the method.
    Type: Grant
    Filed: October 5, 2009
    Date of Patent: April 30, 2013
    Assignee: BCK Networks, Inc.
    Inventors: Saibal Banerjee, Raghava Kondepudy, Gano Broto Chatterji
  • Routing table for non-uniform random neighbor selection
    Patent number: 8396066
    Abstract: A source-address independent, multi-path routing method for use in a communication network is disclosed. A network node uses an information packet's destination address to determine a plurality of neighbors it has a proportional likelihood to forward that packet to, such that packets can be sent over multiple paths to a destination node without undesirable looping. Multiple-neighbor proportional forwarding routing tables are determined by computing a directed graph of multiple optimal paths to each destination node. Optimal paths and forwarding proportions are based on link capacities. The multi-path routing method provides maximized throughput, reduced congestion and superior load balancing over single-path routing. Source-address independence also overcomes a major problem of more traditional source-address dependent multi-path routing methods. The source-address independent, multi-path routing method can be implemented in mixed networks where some nodes do not implement the method.
    Type: Grant
    Filed: October 5, 2009
    Date of Patent: March 12, 2013
    Assignee: BCK Networks, Inc.
    Inventors: Saibal Banerjee, Gano Broto Chatterji, Raghava Kondepudy