中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

57 records (took 0.021 seconds)

    METHOD AND SYSTEM FOR CONTROLLING TRANSMISSION OF PACKETS IN COMPUTER NETWORKS
    2.
    发明申请
    METHOD AND SYSTEM FOR CONTROLLING TRANSMISSION OF PACKETS IN COMPUTER NETWORKS 审中-公开
    控制计算机网络中分组传输的方法和系统

    公开(公告)号：WO0139467A8

    公开(公告)日：2002-10-31

    申请号：PCT/GB0004410

    申请日：2000-11-21

    Applicant: IBM ,  IBM UK

    Inventor： AYDEMIR METIN ,  BASS BRIAN MITCHELL ,  JEFFRIES CLARK DEBS ,  ROVNER SONIA KIANG ,  SIEGEL MICHAEL STEVEN ,  GALLO ANTHONY MATTEO ,  GORTI BRAHMANAND KUMAR ,  HEDDES MARCO

    IPC: H04L12/801 ,  H04L12/835 ,  H04L29/06 ,  H04L12/56

    CPC classification number: H04L47/10 ,  H04L47/29 ,  H04L47/30

    Abstract: Methods, apparatus and program products for controlling a flow of a plurality of packets in a computer network are disclosed. The computer network includes a device defining a queue. The methods, apparatus and program products include determining a queue level for the queue and determining an offered rate of the plurality of packets to the queue. They also include controlling a transmission fraction of the plurality of packets to or from the queue, based on the queue level, the offered rate and a previous value of the transmission fraction so that the transmission fraction and the queue level are critically damped if the queue level is between at least a first queue level and a second queue level. Several embodiments are disclosed in which various techniques are used to determine the manner of the control.

    Abstract translation: 公开了一种用于控制计算机网络中的多个分组的流的方法，装置和程序产品。 计算机网络包括定义队列的设备。 方法，装置和程序产品包括确定队列的队列级别并确定多个分组到队列的提供速率。 它们还包括基于队列级别，提供的速率和传输部分的先前值来控制到队列或从队列的多个分组的传输分数，使得如果队列中传输分数和队列级别被严重衰减 级别在至少第一队列级别和第二队列级别之间。 公开了几种实施例，其中使用各种技术来确定控制的方式。

    METHOD AND SYSTEM FOR CONTROLLING FLOWS IN SUB-PIPES OF COMPUTER NETWORKS
    3.
    发明申请
    METHOD AND SYSTEM FOR CONTROLLING FLOWS IN SUB-PIPES OF COMPUTER NETWORKS 审中-公开
    用于控制计算机网络子流中的流量的方法和系统

    公开(公告)号：WO0176138A3

    公开(公告)日：2002-01-31

    申请号：PCT/GB0101436

    申请日：2001-03-30

    Applicant: IBM ,  IBM UK

    Inventor： GORTI BRAHMANAND KUMAR ,  HWANG DONGMING ,  JEFFERIES CLARK DEBS ,  SIEGEL MICHAEL STEVEN ,  SUDEEP KARTIK

    IPC: H04L12/54 ,  H04L12/70 ,  H04Q11/04 ,  H04L12/56

    CPC classification number: H04L12/5602 ,  H04L2012/5624 ,  H04L2012/5632 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04L2012/5681 ,  H04Q11/0478

    Abstract: A method and system for controlling a plurality of sub-pipes in a computer network is disclosed. The computer network includes at least one switch. The plurality of sub-pipes utilizes the switch for transmitting traffic through the network. The method and system include allowing a minimum flow to be set for each of the plurality of sub-pipes and determining whether congestion exists for the pipe. The method and system also include controlling a flow in a sub-pipe of the plurality of sub-pipes only if congestion exists. Once congestion is determined to exist, the time set to control of sub-pipes is set significantly longer than for control over individual decreases or increases of the flows in sub-pipes. The flow is controlled such that the flow for the sub-pipe may be linearly increased if the flow for the sub-pipe of the plurality of sub-pipes is less than the minimum flow. The flow is also controlled such that the flow for the sub-pipe of the plurality of sub-pipes is exponentially decreased if the flow is greater than the minimum flow. In determining whether to increase or decrease the flow in a sub-pipe, a second definition of congestion may be used. Thus the traffic through the switch is stable.

    Abstract translation: 公开了一种用于控制计算机网络中的多个子管道的方法和系统。 计算机网络包括至少一个开关。 多个子管道利用交换机来通过网络传输业务。 所述方法和系统包括允许针对所述多个子管中的每一个设置最小流量并且确定所述管道是否存在拥塞。 该方法和系统还包括仅在拥塞存在的情况下控制多个子管道的子管道中的流量。 一旦确定拥挤存在，则设置为控制子管的时间被设置为比控制子管中的流量的个体减少或增加的时间长得多。 控制流量，使得如果多个子管中的子管的流量小于最小流量，则子管的流量可以线性增加。 还控制流量，使得如果流量大于最小流量，则多个子管道的子管道的流量指数下降。 在确定是否增加或减少子管中的流量时，可以使用第二种拥塞的定义。 因此，通过交换机的流量是稳定的。

    METHOD AND SYSTEM FOR SCHEDULING INFORMATION USING CALENDARS
    4.
    发明申请
    METHOD AND SYSTEM FOR SCHEDULING INFORMATION USING CALENDARS 审中-公开
    使用日历安排信息的方法和系统

    公开(公告)号：WO0179992A3

    公开(公告)日：2002-02-21

    申请号：PCT/GB0101337

    申请日：2001-03-26

    Applicant: IBM ,  IBM UK

    Inventor： BASS BRIAN MITCHELL ,  CALVIGNAC JEAN LOUIS ,  HEDDES MARCO ,  SIEGEL MICHAEL STEVEN ,  VERPLANKEN FABRICE JEAN

    IPC: H04L12/54 ,  H04L12/70 ,  H04L12/851 ,  H04L12/873 ,  H04L12/875 ,  H04Q11/04 ,  H04L12/56

    CPC classification number: H04L12/5601 ,  H04L47/2408 ,  H04L47/50 ,  H04L47/527 ,  H04L47/564 ,  H04L2012/5636 ,  H04L2012/5649 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04L2012/5681

    Abstract: A system and method of moving information units from a network processor toward a data transmission network in a prioritized sequence which accommodates several different levels of service. The present invention includes a method and system for scheduling the egress of processed information units (or frames) from a network processing unit according to stored priorities associated with the various sources of the information units. The priorities in the preferred embodiment include a low latency service, a minimum bandwidth, a weighted fair queueing and a system for preventing a user from continuing to exceed his service levels over an extended period. The present invention includes a plurality of calendars with different service rates to allow a user to select the service rate which he desires. If a customer has chosen a high bandwidth for service, the customer will be included in a calendar which is serviced more often than if the customer has chosen a lower bandwidth.

    Abstract translation: 一种将信息单元从网络处理器移动到数据传输网络的系统和方法，其以容纳几个不同级别的服务的优先顺序排列。 本发明包括一种方法和系统，用于根据存储的与信息单元的各种源相关联的优先级来调度来自网络处理单元的处理的信息单元（或帧）的出口。 优选实施例中的优先级包括低延迟服务，最小带宽，加权公平排队以及用于在较长时间内防止用户继续超过其服务水平的系统。 本发明包括具有不同服务速率的多个日历，以允许用户选择他所期望的服务速率。 如果客户选择了高带宽进行服务，则客户将被包含在比客户选择较低带宽的情况下更常服务的日历。

    QUEUE MANAGER FOR BUFFER
    10.
    发明专利
    QUEUE MANAGER FOR BUFFER 失效

    公开(公告)号：JP2001222505A

    公开(公告)日：2001-08-17

    申请号：JP2000384352

    申请日：2000-12-18

    Applicant: IBM

    Inventor： BASS BRIAN MITCHELL ,  CALVIGNAC JEAN LOUIS ,  HEDDES MARCO C ,  SIEGEL MICHAEL STEVEN ,  MICHAEL RAYMOND TROMBLAY ,  VERPLANKEN FABRICE JEAN

    IPC: G06F12/00 ,  G06F5/06 ,  G06F5/14 ,  G06F12/02 ,  G06F12/08 ,  G06F13/00 ,  G06F13/14 ,  G06F13/16 ,  G06F13/38

    Abstract: PROBLEM TO BE SOLVED: To provide a bandwidth maintenance queue manager for (first-in first-out)FIFO buffer provided with another DRAM storage device for maintaining a FIFO queue. SOLUTION: A FIFO buffer is used on an ASIC chip so that plural queue entries can be stored and retrieved. As long as the total size of queues does not exceed a usable storage device in the buffer, any data storage device is not required more. When supplied data exceeds the buffer storage space of a certain prescribed quantity in the FIFO buffer, however, these data are written in the other data storage device in the form of packet and read from that storage device. That packet has an optimal size for maintaining the peak performance of the data storage device and is written in the data storage device in a way such as queuing with the address sequence of FIFO.

Patent Agency Ranking