Method and system of requesting resources in a packet-switched network
with minimal latency
    3.
    发明授权
    Method and system of requesting resources in a packet-switched network with minimal latency 失效
    以最小延迟在分组交换网络中请求资源的方法和系统

    公开(公告)号:US5367517A

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

    申请号:US992277

    申请日:1992-12-16

    IPC分类号: H04Q3/00 H04L12/56 H04Q11/04

    摘要: 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.

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

    Contention resolution in a communications ring
    4.
    发明授权
    Contention resolution in a communications ring 失效
    通信环中的争用解决方案

    公开(公告)号:US5051985A

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

    申请号:US575258

    申请日:1990-08-30

    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.

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

    Multihop time assigned speech interpolation (TASI) system for
telecommunication networks
    6.
    发明授权
    Multihop time assigned speech interpolation (TASI) system for telecommunication networks 失效
    用于电信网络的多跳时间分配语音插值(TASI)系统

    公开(公告)号:US5016247A

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

    申请号:US390122

    申请日:1989-08-07

    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.

    Method and apparatus for improved throughput in a multi-node
communication system with a shared resource
    10.
    发明授权
    Method and apparatus for improved throughput in a multi-node communication system with a shared resource 失效
    用于在具有共享资源的多节点通信系统中提高吞吐量的方法和装置

    公开(公告)号:US5467352A

    公开(公告)日:1995-11-14

    申请号:US192884

    申请日:1994-02-07

    CPC分类号: H04L12/433

    摘要: A non-quota access indicator is circulated among nodes in a multi-node quota based communication system with a shared resource, indicating maximum possible non-quota access to the shared resource to a given node receiving same. Upon arrival at a node, the indicator is saved and then updated to reflect the current status of that node as either starved or satisfied, the former being a condition of currently having quota remaining and a shared resource access requirement, and the latter being a condition of either currently having no remaining quota or having no current shared resource access requirement. After updating, the node immediately propagates the indicator to the next node in the system. When a node without quota requires access to the shared resource, it compares its requirement to the last stored indicator and accesses the shared resource if the stored indicator is equal to or greater than the access requirement.

    摘要翻译: 非配额访问指示符在具有共享资源的基于多节点配额的通信系统中的节点之间传播,指示对给予接收到该节点的给定节点的共享资源的最大可能非配额访问。 在到达节点时,指示符被保存并且被更新以反映该节点的当前状态为饥饿或满足,前者是当前具有剩余配额的条件和共享资源访问要求,后者是条件 目前没有剩余配额或没有当前的共享资源访问要求。 更新后,节点立即将指示符传播到系统中的下一个节点。 当没有配额的节点需要访问共享资源时,如果存储的指示符等于或大于访问要求,则将其要求与最后存储的指示符进行比较,并访问共享资源。