中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

29 records (took 0.031 seconds)

    21.
    发明专利
    未知

    公开(公告)号：DE69323963D1

    公开(公告)日：1999-04-22

    申请号：DE69323963

    申请日：1993-10-19

    Applicant: IBM

    Inventor： DERBY JEFFREY HASKELL ,  DRAKE JOHN ELLIS ,  SANDICK HALDON J ,  DOERINGER WILLIBALD A ,  DYKEMAN DOUGLAS H ,  VU KEN VAN

    IPC: H04L12/56

    Abstract: The process for determining the best communication route from a source end station to a destination end station is distributed over both source and destination network nodes. Network nodes, at the interface between a wide area network (WAN) and each subnetwork, contain access agents to control the communication flow between the wide area network and an end station in the subnetwork. The task of selecting the best route between two end stations is distributed between the access agents at the WAN interface in the first subnetwork, and the access agents at the WAN interface in the second subnetwork. Each access agent at one WAN interface obtains the best route from itself to the end station in its subnetwork. Each access agent at the other WAN interface finds the best route from each access agent at the first WAN interface through itself to the end station in its subnetwork. One designated access agent collects all the best route information. This best route information is concatenated, and the route with the least weight is selected as the best route between end stations.

    22.
    发明专利
    未知

    公开(公告)号：DE69333395T2

    公开(公告)日：2004-12-09

    申请号：DE69333395

    申请日：1993-11-19

    Applicant: IBM

    Inventor： DERBY JEFFREY HASKELL ,  DOERINGER WILLIBALD AUGUST ,  DYKEMAN HAROLD DOUGLAS ,  LI LIANG ,  SANDICK HALDON JULES ,  VU KEN VAN

    IPC: H04L12/46 ,  H04L12/66 ,  H04L29/06

    Abstract: A system for interconnecting widely separated local area networks (LANs) by means of a wide area network (WAN) utilizes network level facilities to establish a connection through the wide area network and to create connection table entries at the WAN access point which allow subsequent data frames to be transmitted through the wide area network without such network level operations. More particularly, the various LANs are combined into search groups, represented by address prefixes, to which LAN-initiated connection requests can be broadcast and which can respond so as to establish the data path connections. This system has the connection flexibility of a prior art router and, at the same time, the low overhead of a prior art bridge.

    25.
    发明专利
    未知

    公开(公告)号：DE69327692T2

    公开(公告)日：2000-07-06

    申请号：DE69327692

    申请日：1993-08-24

    Applicant: IBM

    Inventor： AHMADI HAMID ,  GUERIN ROCH A ,  DERBY JEFFREY HASKELL ,  GUN LEVENT ,  MARIN GERALD ARNOLD ,  NAGHSHINEH MAMOUD ,  SOHRABY KHOSROW

    IPC: H04L29/06 ,  H04L12/56

    Abstract: A congestion control system for packet communications networks in which access to the network is controlled to prevent such congestion. Packets within the pre-specified statistical description of each packet source are marked as high priority ("green" packets) while packets exceeding the pre-specified characteristics are marked with a lower priority ("red" packets). The overall red packet rate is limited to prevent red packet saturation of the network. The introduction of red packets into the network is subjected to a degree of hysteresis to provide better interaction with higher layer error recovery protocols. The amount of hysteresis introduced into the red packet marking can be fixed or varied, depending on the statistics of the incoming data packets at the entry point to the network.

    26.
    发明专利
    未知

    公开(公告)号：DE69325957D1

    公开(公告)日：1999-09-16

    申请号：DE69325957

    申请日：1993-05-19

    Applicant: IBM

    Inventor： CIDON ISRAEL ,  DAVENPORT DAVID WILLIAM ,  DERBY JEFFREY HASKELL ,  DUDLEY JOHN GARY ,  GOPAL INDER SARAT ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KOPERDA FRANK RICHARD ,  POTTER KENNETH HARVEY ,  KUTTEN SHAY

    IPC: H04L12/18 ,  H04L12/56

    Abstract: A packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be broadcast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the broadcast subset. A second portion of the routing field contains the broadcast subset identifier which can then be used to deliver the packet to all of the members of the broadcast subset. Provision is made to backtrack deliver the packet to the last node identified before the broadcast subset if that last node is itself a member of the subset.

    27.
    发明专利
    未知

    公开(公告)号：AT183349T

    公开(公告)日：1999-08-15

    申请号：AT93480059

    申请日：1993-05-19

    Applicant: IBM

    Inventor： CIDON ISRAEL ,  DAVENPORT DAVID WILLIAM ,  DERBY JEFFREY HASKELL ,  DUDLEY JOHN GARY ,  GOPAL INDER SARAT ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KOPERDA FRANK RICHARD ,  POTTER KENNETH HARVEY JR ,  KUTTEN SHAY

    IPC: H04L12/18 ,  H04L12/56

    Abstract: A packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be broadcast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the broadcast subset. A second portion of the routing field contains the broadcast subset identifier which can then be used to deliver the packet to all of the members of the broadcast subset. Provision is made to backtrack deliver the packet to the last node identified before the broadcast subset if that last node is itself a member of the subset.

Patent Agency Ranking