利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.013 秒)

    Rate-based congestion control in packet communications networks
    2.
    发明公开
    Rate-based congestion control in packet communications networks 失效
    GeschwindigkeitsbasierteÜberlastregelung在Paket-Kommunikationsnetzen。

    公开(公告)号：EP0587522A2

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

    申请号：EP93480121.8

    申请日：1993-08-24

    申请人： International Business Machines Corporation

    发明人： Ahmadi, Hamid ,  Guerin, Roch A. ,  Derby, Jeffrey Haskell ,  Gun, Levent ,  Marin, Gerald Arnold ,  Naghshineh, Mamoud ,  Sohraby, Khosrow

    IPC分类号： H04L12/56

    CPC分类号： H04L12/5602 ,  H04L2012/5636 ,  H04L2012/5637 ,  H04L2012/5651 ,  H04L2012/568

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

    摘要翻译： 用于分组通信网络的拥塞控制系统，其中控制对网络的访问以防止这种拥塞。 每个分组源的预定义统计描述中的分组被标记为高优先级（“绿色”分组），而超过预先指定的特征的分组被标记为较低优先级（“红色”分组））。 整体红包速率受限于防止网络红包饱和。 引入红包到网络中受到一定程度的迟滞，以提供与更高层错误恢复协议的更好的交互。 引入到红色分组标记中的滞后量可以是固定的或变化的，这取决于在入口点到网络的输入数据分组的统计。

    Allocation method and apparatus for reusing network resources in a wireless communication system
    4.
    发明公开
    Allocation method and apparatus for reusing network resources in a wireless communication system 失效
    一种用于在无线通信系统中重新使用的网络资源的分配方法和装置

    公开(公告)号：EP0709983A1

    公开(公告)日：1996-05-01

    申请号：EP94480114.1

    申请日：1994-10-26

    申请人： International Business Machines Corporation

    发明人： Krishna, Arvind ,  Martinez, Jose Louis ,  Natarajan, Kadathur ,  Wetterwald, Michelle ,  Ahmadi, Hamid ,  Bantz, David ,  Bauchot, Frederic ,  Harrison, Colin

    IPC分类号： H04L12/28 ,  H04Q7/36 ,  H04B1/713

    CPC分类号： H04W28/26 ,  H04B1/713 ,  H04B1/715 ,  H04B2001/7152 ,  H04W16/12 ,  H04W28/16 ,  H04W60/00 ,  H04W64/006 ,  H04W72/00 ,  H04W84/12 ,  H04W88/04 ,  H04W88/08

    摘要： In a wireless communication system (106), base stations (118, 120) are connected to a backbone network (116) such as a wired LAN and act as access points and relays for remote stations (128, 132, 136). A remote station registers and performs bidirectionnal communication with one of the base stations designated as its home base station. Base stations have overlapping coverage areas where a remote station is within reception range of several base stations. Such communication system may for instance be a multicell radio LAN using frequency hopping signaling. The method allows to reuse a limited number of network resources such as frequency hopping patterns and assign the same resource to several active base stations. Upon request from a base station, a network controller (110) connected to the backbone network computes a distance index between the requesting base station and the other active base stations and assigns to the requesting base station the same network resource as the one assigned to another base station with the highest distance index. Information about cells overlaps is centralized in a control database (109) and used by the network controller to compute distance indexes.

    摘要翻译： 在无线通信系统（106），基站（118，120）被连接到骨干网络（116）：诸如有线LAN和充当接入点和远程站（128，132，136）的继电器。 远程站寄存器，并执行与被指定为它的家庭基站的基站中的一个bidirectionnal通信。 基站具有重叠的覆盖区域，其中远程站是若干基站接收范围内。 Web通信系统例如可以是使用跳频信令LAN多小区无线电。 该方法允许重用网络资源有限数量：例如跳频模式和相同的资源分配给多个活动基站。 在从基站请求，连接到骨干网络的网络控制器（110）计算请求的基站和其它活性基站之间的距离指数和分配给请求的基站相同的网络资源作为分配给另一个所述一个 基站具有最高距离指数。 关于重叠小区的信息在控制数据库（109）和集中使用由网络控制器来计算距离索引。

    Traffic management in packet communications networks
    5.
    发明公开
    Traffic management in packet communications networks 失效
    分组通信网络中的流量管理

    公开(公告)号：EP0584029A2

    公开(公告)日：1994-02-23

    申请号：EP93480099.6

    申请日：1993-07-16

    申请人： International Business Machines Corporation

    发明人： Ahmadi, Hamid ,  Guerin, Roch ,  Gun, Levent

    IPC分类号： H04L12/56

    CPC分类号： H04L12/5602 ,  H04L2012/5632 ,  H04L2012/5636 ,  H04L2012/5637

    摘要： In a packet communications network, the addition or deletion of a connection to the network by a user is governed by a link traffic metric which represents the effective capacity of each link in the network which participates in the packet connection route. The link metric is calculated in real-time and updated by simple vector addition or subtraction. Moreover, this link metric is also used to calculate leaky bucket parameters which govern the access of packets to the network once the connection is set up. A packet network using these link metrics and metric generation techniques provides maximum packet throughput while, at the same time, preserving grade of service guarantees.

    摘要翻译： 在分组通信网络中，由用户添加或删除到网络的连接由链路流量度量来管理，该度量表示参与分组连接路由的网络中的每个链路的有效容量。 链路度量是实时计算的，并通过简单的向量加法或减法更新。 而且，这个链路度量也被用来计算泄漏桶参数，一旦建立连接，它就控制数据包对网络的访问。 使用这些链路量度和量度生成技术的分组网络提供最大的分组吞吐量，同时保持服务等级的保证。

    Dynamic user registration method in a mobile communications network
    7.
    发明公开
    Dynamic user registration method in a mobile communications network 失效
    Dynimisches Teilnehmererfassungsverfahren在einem mobilen Kommunikationsnetz。

    公开(公告)号：EP0658023A1

    公开(公告)日：1995-06-14

    申请号：EP93480220.8

    申请日：1993-12-08

    申请人： International Business Machines Corporation

    发明人： Bantz, David ,  Bauchot, Frédéric ,  Wetterwald, Michèle Marie ,  Natarajan, Kathadur ,  Ahmadi, Hamid

    IPC分类号： H04L12/28

    CPC分类号： H04W8/02 ,  H04W8/26

    摘要： In a communications system comprising a number of base stations, each base station communicating over a shared communication channel with a plurality of registered stations and controlling the network cell formed by said plurality of registered stations, a method is described for dynamically registering and deregistering mobile stations. Each station owns a unique address and is allocated a local identifier at registration time. Each network cell owns a unique cell identifier known to all registered stations belonging to this network cell. Base stations manage cell members data uniquely associating the unique address and the local identifier corresponding to each one of the mobile stations belonging to their network cell. A registration request is sent to a selected base station by a registering mobile station, comprising the unique cell identifier of the network cell controlled by the selected base station and the unique address of the registering mobile station; the selected base station detects in its cell members data any conflicting registered station whose unique address matches the unique address of the registering mobile station and sends an address check packet to any conflicting registered station, comprising the unique address of the conflicting registered station, its local identifier and the identifier of the network cell it controls. A receiving registered mobile station sends to the selected base station, an acknowledgement to the address check packet if its unique address, the local identifier of its owning base station and its network cell identifier all match with the ones carried by the address check packet. The selected base station rejects the registration request it it receives an acknowledgement to its address check packet. The same address check packet is used to deregister inactive stations.

    摘要翻译： 在包括多个基站的通信系统中，每个基站通过共享通信信道与多个注册站进行通信，并控制由所述多个注册站形成的网络小区，描述了一种动态登记和注销移动站的方法 。 每个站拥有唯一的地址，并在注册时分配一个本地标识符。 每个网络小区拥有属于该网络小区的所有注册站所知的唯一小区标识符。 基站管理与属于其网络小区的移动站中的每一个对应的唯一地址和本地标识唯一地相关联的小区成员数据。 注册请求由注册移动台发送到所选择的基站，包括由所选择的基站控制的网络小区的唯一小区标识符和注册移动台的唯一地址; 所选择的基站在其小区成员数据中检测其唯一地址与注册移动站的唯一地址匹配的冲突注册站，并将地址检查分组发送到任何冲突的注册站，包括冲突注册站的唯一地址，其本地 标识符及其控制的网络单元的标识符。 接收登记的移动台如果其唯一地址，其拥有的基站的本地标识符及其网络小区标识符全部与地址检查分组携带的那些一致，则向所选择的基站发送对地址检查分组的确认。 所选择的基站拒绝其接收到其地址检查分组的确认的注册请求。 相同的地址检查包用于取消注册非活动站。

    An adaptive medium access control scheme for wireless LAN
    8.
    发明公开
    An adaptive medium access control scheme for wireless LAN 失效
    适应中国网络乐队Netz。

    公开(公告)号：EP0621708A2

    公开(公告)日：1994-10-26

    申请号：EP94105696.2

    申请日：1994-04-13

    申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

    发明人： Ahmadi, Hamid ,  Bantz, David Frederick ,  Bauchot, Frederic Jacques ,  Krishna, Arvind ,  La Maire, Richard Orville ,  Natarajan, Kadathur S.

    IPC分类号： H04L12/28 ,  H04B7/204

    CPC分类号： H04W74/02 ,  H04W48/12 ,  H04W84/12

    摘要： A Medium Access (MAC) Protocol is utilized for wireless radio access for a plurality of remote stations to a base station on a LAN. The MAC protocol is based on a reservation scheme for user data traffic and a random access technique for control and signalling traffic. There is a time division fixed frame structure in which time is slotted, and time slots are grouped into fixed frames consisting of data and control subframes or periods. The fixed frame structure consists of three periods (A, B, and C) along with their respective headers. The first period, the A period, is the outbound channel which is used exclusively for data transfer from the base station to the remote stations. The following period, the B period, is the inbound channel that is used for contention-free data transfer from the remote stations to the base station. The allocation of the data slots in the A and B periods is performed by the base station. The last period of the frame, designated as the C period, is the control channel used for the transmission of reservation requests and data from the remote stations to the base station in a random-access contention mode using a slotted Aloha protocol. The duration of the three periods may be varied using a movable boundary technique. The base station estimates the number of actively transmitting remote stations utilizing feedback information from the remote stations. This estimate is broadcast to the remote stations as control indicia to control their transmission attempts in the C period, thus yielding high transmission efficiency.

    摘要翻译： 媒体接入（MAC）协议用于多个远程站到LAN上的基站的无线电接入。 MAC协议基于用于用户数据业务的预留方案和用于控制和信令业务的随机接入技术。 存在时分固定帧结构，其中时隙被分段，时隙被分组成由数据和控制子帧或周期组成的固定帧。 固定帧结构由三个周期（A，B和C）及其各自的报头组成。 第一个周期是A周期，是专用于从基站到远程站的数据传输的出站信道。 以下周期，B周期是用于从远程站到基站的无竞争数据传输的入站信道。 在A和B周期中的数据时隙的分配由基站执行。 指定为C周期的帧的最后一个周期是用于使用时隙Aloha协议以随机接入争用模式从远程站向基站传送预留请求和数据的控制信道。 可以使用可移动边界技术来改变三个周期的持续时间。 基站使用来自远程站的反馈信息估计主动发送的远程站的数量。 该估计作为控制标记广播到远程站，以在C周期中控制其传输尝试，从而产生高传输效率。

    Method and apparatus for optinum path selection in packet transmission networks
    9.
    发明公开
    Method and apparatus for optinum path selection in packet transmission networks 失效
    Verfahren und Vorrichtung zur optimalen Wegeauswahl inPaketübertragungsnetzen。

    公开(公告)号：EP0568477A2

    公开(公告)日：1993-11-03

    申请号：EP93480030.1

    申请日：1993-03-23

    申请人： International Business Machines Corporation

    发明人： Ahmadi, Hamid ,  Chen, Jeane Shu-Chun ,  Chow, Chee-Seng ,  Guerin, Roch ,  Gun, Levent ,  Lee, Anthony Mangchuen ,  Tedijanto, Theodore E.

    IPC分类号： H04L12/56

    CPC分类号： H04L45/123 ,  H04L45/12

    摘要： A packet communications system utilizes a route determining mechanism by identifying principal paths between the source and the destination in the system. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. Principal path links are accepted as legs of the optimum path, if feasible, i.e., if the resulting load on the link is less than a specified principal threshold. Secondary links are accepted only if the resulting load on the link is less than a specified secondary threshold, where the secondary threshold is less than the principal threshold. All paths must also have a transmission delay less than a specified threshold. Each request for a route includes the source node, the destination node, the load required, the maximum transmission delay and, if desired, the quality of service parameters which all of the legs of the route must satisfy. A modified Bellman-Ford breadth-first search algorithm is used to identify the principal links and, using these principal link identifications, determining the optimum path.

    摘要翻译： 分组通信系统通过识别系统中源和目的地之间的主路径来利用路由确定机制。 主路径是传输延迟小于指定阈值的最小跳数路径。 如果可行，即如果链路上的结果负载小于指定的主要阈值，则主路径链路被接受为最佳路径的分支。 仅当链路上产生的负载小于指定的辅助阈值（辅助阈值小于主要阈值）时，才接受辅助链路。 所有路径还必须具有小于指定阈值的传输延迟。 路由的每个请求包括源节点，目的地节点，所需的负载，最大传输延迟，以及如果需要，路由的所有路径必须满足的服务质量参数。 改进的Bellman-Ford宽度优先搜索算法用于识别主要链路，并使用这些主要链路标识来确定最佳路径。