公开(公告)号：US4991172A

公开(公告)日：1991-02-05

申请号：US264402

申请日：1988-10-28

申请人： Israel Cidon ,  Inder S. Gopal

发明人： Israel Cidon ,  Inder S. Gopal

IPC分类号： H04L12/433 ,  H04L12/56

CPC分类号： H04L12/5601 ,  H04L12/433 ,  H04L49/107 ,  H04L49/3081 ,  H04L2012/5612

摘要： A method of transmitting high speed (1 Gbits/sec), packetized, integrated voice/data through a communications network. This invention, more specifically, deals with the word by word transmission of packets on a parallel transmission bus.

公开(公告)号：US5016247A

公开(公告)日：1991-05-14

申请号：US390122

申请日：1989-08-07

申请人： Israel Cidon ,  Inder S. Gopal

发明人： Israel Cidon ,  Inder S. Gopal

IPC分类号： H04J3/17 ,  H04Q11/04

CPC分类号： H04J3/17

摘要： A telecommunication system performs multihop TASI over every hop with a single instance of speech activity detection for each voice call. The system utilizes a Time-Space-Time circuit switch interposed between an input and an output trunk. The input time stage is configured to collect call samples from the input trunk and to map the physical slots associated with the samples to the switch slots of the conventional space switch portion of the circuit switch portion of the circuit switch. In-b signalling of the active state of a switch slot is provided by the input time stage to the output time stage via the space switch. The output time stage is configured to assign physical slots on the outgoing trunk to active switch slots and to discard inactive switch slots.

公开(公告)号：US5367517A

公开(公告)日：1994-11-22

申请号：US992277

申请日：1992-12-16

申请人： Israel Cidon ,  Inder S. Gopal ,  Roch A. Guerin

发明人： Israel Cidon ,  Inder S. Gopal ,  Roch A. Guerin

IPC分类号： H04Q3/00 ,  H04L12/56 ,  H04Q11/04

CPC分类号： H04L12/5602 ,  H04Q11/0478 ,  H04L2012/5632 ,  H04L2012/5634

摘要： A fast bandwidth reservation method and system used in packet-switched networks that reserve bandwidth for a data transfer over links in a path between a source node, at least one intermediate node, and a destination node with minimal latency where the source node desires to send data to the destination node along the specific path using at least a minimum bandwidth and up to a maximum bandwidth. The goal of the method and system is to reserve bandwidth for a data transfer in the minimal amount of time. No link on the path between the source node and destination node has more bandwidth allocated for the source node than the minimum allocated for the previous forward links on the path. Links on the path between the source node and destination node have their bandwidth allocation for the data transfer adjusted based on the final minimum bandwidth allocated for the data transfer.

摘要翻译： 一种分组交换网络中使用的快速带宽预留方法和系统，其保留用于在源节点，至少一个中间节点和目的地节点之间的路径上的链路​​上的数据传输的带宽，其中源节点希望发送 使用至少最小带宽和最大带宽，沿特定路径向目标节点发送数据。 该方法和系统的目标是在最少的时间内为数据传输预留带宽。 源节点和目标节点之间的路径上没有链接为源节点分配的带宽要比分配给路径上的前一个前向链路的最小带宽。 源节点和目标节点之间的路径上的链路​​具有根据为数据传输分配的最终最小带宽进行数据传输的带宽分配。

公开(公告)号：US5309433A

公开(公告)日：1994-05-03

申请号：US900635

申请日：1992-06-18

申请人： Israel Cidon ,  David W. Davenport ,  Jeffrey H. Derby ,  John G. Dudley ,  Inder S. Gopal ,  James P. Janniello ,  Marc A. Kaplan ,  Francis R. Koperda ,  Shay Kutten ,  Kenneth H. Potter, Jr.

发明人： Israel Cidon ,  David W. Davenport ,  Jeffrey H. Derby ,  John G. Dudley ,  Inder S. Gopal ,  James P. Janniello ,  Marc A. Kaplan ,  Francis R. Koperda ,  Shay Kutten ,  Kenneth H. Potter, Jr.

IPC分类号： H04L12/18 ,  H04L12/56 ,  H04J3/26

CPC分类号： H04L45/48 ,  H04L12/18 ,  H04L45/00 ,  H04L45/16 ,  H04L49/203 ,  H04L2012/5646

摘要： A packet communications system provides for point-to-point packet routing and multicast 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 multicast 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 multicast subset. A second portion of the routing field contains the multicast subset identifier which can then be used to deliver the packet to all of the members of the multicast subset. Provision is made to backtrack deliver the packet to the last node identified before the multicast subset if that last node is itself a member of the subset.

摘要翻译： 分组通信系统使用根据两种不同协议处理的分组报头中的路由字段来提供点到点分组路由和组播分组路由到网络中有限的节点子集。 提供了第三协议，其中即使从不是子集的成员的节点启动时，分组也可以被多播到受限子集。 路由字段包括第一部分，其包含将分组递送到多播子集所必需的路由标签。 路由字段的第二部分包含多播子集标识符，然后可以将该组播子集标识符传递给组播子集的所有成员。 如果最后一个节点本身是子集的成员，则将配置回溯到将分组递送到多播子集之前识别的最后一个节点。

公开(公告)号：US5051985A

公开(公告)日：1991-09-24

申请号：US575258

申请日：1990-08-30

申请人： Israel Cidon ,  Inder S. Gopal

发明人： Israel Cidon ,  Inder S. Gopal

IPC分类号： H04L12/433 ,  H04L12/56

CPC分类号： H04L12/433

摘要： This invention is a fast contention resolution unit for resolving contention among a plurality of adapters for access to a communications network. Included in the fast contention resolution unit is an apparatus for transmitting a token about a ring from one cell to another cell bypassing intermediate cells whose associated adapters do not have a request to gain access to the communications network.

摘要翻译： 本发明是用于解决用于接入通信网络的多个适配器之间争用的快速争用解决单元。 包括在快速争用解决单元中的装置是用于从一个小区向另一个小区发送关于环的令牌的装置，旁路其相关联的适配器不具有访问通信网络的请求的中间小区。

公开(公告)号：US5459725A

公开(公告)日：1995-10-17

申请号：US215534

申请日：1994-03-22

申请人： Rachel A. Bodner ,  Chee-Seng Chow ,  Israel Cidon ,  John G. Dudley ,  Allan K. Edwards ,  Inder S. Gopal ,  Chandra P. Immanuel ,  Marc A. Kaplan ,  Shay Kutten ,  Theodore E. Tedijanto

发明人： Rachel A. Bodner ,  Chee-Seng Chow ,  Israel Cidon ,  John G. Dudley ,  Allan K. Edwards ,  Inder S. Gopal ,  Chandra P. Immanuel ,  Marc A. Kaplan ,  Shay Kutten ,  Theodore E. Tedijanto

IPC分类号： H04L1/00 ,  H04L1/16 ,  H04L1/18 ,  H04L12/18 ,  H04L1/12

CPC分类号： H04L12/1868 ,  H04L1/1685 ,  H04L1/188 ,  H04L12/1854 ,  H04L2001/0093 ,  H04L2001/125

摘要： A packet communications network in which multicast transmissions are made reliable by transmitting acknowledgements to all neighbors of every receiving node, including the source node. This allows the relinquishment of message holding buffers as soon as all near neighbors acknowledge receipt of the message after only tile longest round trip time to the nearest neighbors, rather than the round trip to the furthest destination. Moreover, highly reliable ancillary point-to-point transmission facilities can be used to retransmit multicast messages indicated as being lost by failure of acknowledgment. Finally, network partitions occurring during the multicast procedure do not necessarily lose the multicast message to the remote partitions since any node receiving the message can insure delivery to all other nodes in that partition.

摘要翻译： 一种分组通信网络，其中通过向包括源节点的每个接收节点的所有邻居发送确认使多播传输变得可靠。 一旦所有邻近的邻居都确认在最近的往返时间最长的往返时间之后确认接收到消息，而不是最远的目的地的往返行程，则可以放弃信息保持缓冲区。 此外，高度可靠的辅助点对点传输设施可以用于重传由确认失败指示为丢失的多播消息。 最后，在多播过程中发生的网络分区不一定会丢失到远程分区的多播消息，因为接收消息的任何节点都可以确保传送到该分区中的所有其他节点。

公开(公告)号：US5539882A

公开(公告)日：1996-07-23

申请号：US372867

申请日：1995-01-13

申请人： Inder S. Gopal ,  Roch A. Guerin ,  Kumar N. Sivarajan

发明人： Inder S. Gopal ,  Roch A. Guerin ,  Kumar N. Sivarajan

IPC分类号： H04L12/403 ,  G06F13/368

CPC分类号： H04L12/403

摘要： A polling procedure providing the capabilities to assign and dynamically modify a user's communication parameters (i.e., response allocation and polling rate) based on the user's bandwidth requirements. In addition, the polling procedure instructs the users to delay their responses as a function of round-trip propagation delay and remaining response allocation for previously polled users to ensure that poll responses from separate users do not overlap.

公开(公告)号：US5148479A

公开(公告)日：1992-09-15

申请号：US672226

申请日：1991-03-20

申请人： Raymond F. Bird ,  Inder S. Gopal ,  Philippe A. Janson ,  Shay Kutten ,  Refik A. Molva ,  Marcel M. Yung

发明人： Raymond F. Bird ,  Inder S. Gopal ,  Philippe A. Janson ,  Shay Kutten ,  Refik A. Molva ,  Marcel M. Yung

IPC分类号： H04L9/06 ,  G06F21/00 ,  G09C1/00 ,  H04L9/14 ,  H04L9/32 ,  H04L12/22

CPC分类号： H04L63/08 ,  G06F21/445 ,  H04L9/002 ,  H04L9/3218 ,  H04L9/3271 ,  G06F2221/2103

摘要： An arrangement of authenticating communications network users and means for carrying out the arrangement. A first challenge N1 is transmitted from a first user A to a second user B. In response to the first challenge, B transmits a first response and second challenge N2 to A. A verifies the first response. A then generates and transmits a second response to the second challenge to B, where the second response is verified. The first response must be of a minimum formf(S1, N1, . . . ),and the second response must be of the minimum formg(S2, N2, . . . ).S1 and S2 are shared secrets between A and B. f() and g() are selected such that the equationf'(s1,N1', . . . )=g(S2, N2)cannot be solved for N1' without knowledge of S1 and S2. f'() and N1' represent expressions on a second reference connection. Preferably, the function f() may include the direction D1 of the flow of the message containing f(), as in f(s1, N1, D1, . . . ). In such a case, f() is selected such that the equationf'(S,N1',D1', . . . )=f(S, N2, D1, . . . )cannot be solved for N1' without knowledge of S1 and S2 and D1' is the flow direction indicator of the message containing f'() on the reference connection.

公开(公告)号：US4914571A

公开(公告)日：1990-04-03

申请号：US62269

申请日：1987-06-15

申请人： Alan E. Baratz ,  Inder S. Gopal ,  James P. Gray ,  George A. Grover ,  Jeffrey M. Jaffe ,  Jean A. Lorrain ,  Melinda R. Pollard ,  Diane P. Pozefsky ,  Mark Pozefsky ,  Lee M. Rafalow

发明人： Alan E. Baratz ,  Inder S. Gopal ,  James P. Gray ,  George A. Grover ,  Jeffrey M. Jaffe ,  Jean A. Lorrain ,  Melinda R. Pollard ,  Diane P. Pozefsky ,  Mark Pozefsky ,  Lee M. Rafalow

IPC分类号： G06F13/00 ,  G06F9/50 ,  H04L29/00

CPC分类号： H04L29/00

摘要： A LOCATE search dynamically locates resources (e.g., logical units (LUs) and transaction program and files associated with LUs) in a computer network so that a session can be established between the origin and the destination of the search.In a network which includes end nodes associated with server nodes, a resource contained in any node is located by a requesting node. The requesting node initiates a search of the resources residing within itself. If the resource does not reside in the requesting node, the server node searches the resources known to the server node that reside anywhere in the nework. If the resource is not known by the server node, it searchers all resources that reside in its associated end nodes. If the resource does not reside in the associated end nodes, either a request is sent to a central directory if one exists or a search of all resources in the network is made.