会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and apparatus for controlling traffic flows in a packet-switched network
    • 用于控制分组交换网络中的业务流的方法和装置
    • US06353618B1
    • 2002-03-05
    • US09244165
    • 1999-02-04
    • Anthony HungHossain Pezeshki-EsfahaniTom Davis
    • Anthony HungHossain Pezeshki-EsfahaniTom Davis
    • H04J302
    • H04L12/5602H04L2012/5637H04L2012/5649H04L2012/5675H04L2012/5679H04Q11/0478
    • A scheduling device for use in a packet-switched network, belonging to the class of non-work conserving or idling weighted round robin (WRR) arbiters, assigns a packet stream slots in a fixed-length time division multiple access (TDMA) frame by selecting free slots which are closest to ideal slot positions that would, if assigned, eliminate jitter or cell delay variation. The scheduler is able to simultaneously determine if a new constant bit rate connection requiring a predetermined bandwidth conforms to a leaky bucket or GCRA algorithm characterized by a peak packet or cell emission interval T=1/PCR and a packet or cell delay variation time, CDVT, i.e., whether the new connection is GCRA (T, CDVT) conformant. This determination is made by comparing the quantity ME+ML against the CDVT, where ME corresponds to the maximum time or distance by which any assigned slot is earlier than a corresponding ideal slot and ML corresponds to a maximum time or distance by which any assigned slot is later than a corresponding ideal slot. The scheduler can thus also carry out connection admission control (CAC) functions in an ATM network switch.
    • 属于非工作保存或空闲加权轮询(WRR)仲裁器类的分组交换网络中的调度设备通过固定长度时分多址(TDMA)帧中的分组流时隙分配 选择最接近理想时隙位置的空闲时隙,如果被分配,则消除抖动或信元延迟变化。 调度器能够同时确定需要预定带宽的新的恒定比特速率连接是否符合以峰值分组或小区发射间隔T = 1 / PCR为特征的泄漏桶或GCRA算法,以及分组或小区延迟变化时间CDVT ,即新连接是否符合GCRA(T,CDVT)。 通过比较数量ME + ML与CDVT进行该确定,其中ME对应于任何分配的时隙早于相应的理想时隙的最大时间或距离,并且ML对应于任何分配的时隙 晚于相应的理想槽。 因此,调度器也可以在ATM网络交换机中执行连接许可控制(CAC)功能。
    • 3. 发明授权
    • Cell/frame ATM interworking
    • 单元/帧ATM互通
    • US06711176B1
    • 2004-03-23
    • US09400836
    • 1999-09-21
    • Hossain Pezeshki-Esfahani
    • Hossain Pezeshki-Esfahani
    • H04J324
    • H04L12/5601H04L2012/5658
    • The method for converting cell-based ATM traffic to frame-based ATM traffic comprises assembling a group of one or more cells of a input cell stream which corresponds to an AAL5 PDU; extracting a user data payload of the AAL5 PDU, exclusive of any padding; constructing a frame-based ATM adaptation layer protocol data unit (FB-AAL PDU) having no padding using the AAL5 PDU payload; and segmenting the FB-AAL PDU into one or more frames to generate an output frame stream. The method provides an increase in bandwidth efficiency since the padding overhead required by AAL5 PDUs is eliminated when transferring data to, over or across a frame-based ATM network.
    • 用于将基于单元的ATM业务转换为基于帧的ATM业务的方法包括组合对应于AAL5 PDU的输入小区流的一个或多个小区的组; 提取AAL5 PDU的用户数据有效载荷,不包括任何填充; 使用所述AAL5 PDU有效载荷构建不具有填充的基于帧的ATM适配层协议数据单元(FB-AAL PDU); 以及将所述FB-AAL PDU分割成一个或多个帧以产生输出帧流。 该方法提供了带宽效率的增加,因为当将数据传送到基于帧的ATM网络上或之上时,由于AAL5 PDU所需的填充开销被消除。
    • 4. 发明授权
    • Flexible threshold based buffering system for use in digital communication devices
    • 灵活的基于阈值的缓冲系统,用于数字通信设备
    • US06687254B1
    • 2004-02-03
    • US09339844
    • 1999-06-25
    • Esmond HoTom DavisGanti SudhakarKostic PredragHossain Pezeshki-EsfahaniCharlie SabryNatalie Giroux
    • Esmond HoTom DavisGanti SudhakarKostic PredragHossain Pezeshki-EsfahaniCharlie SabryNatalie Giroux
    • H04L1228
    • H04L47/32H04L47/24H04L47/29H04L47/30H04L49/90H04L49/9036H04L49/9084
    • The method and system for buffering packets such as ATM cells at a queueing point of a device which employs a connection-orientated communications protocol includes the steps of logically partitioning a memory into plural reserved buffer spaces allocated to traffic classes and a shared buffer space available to any connection; determining whether to store or discard a given packet based on predetermined discard criteria; and filling the reserved buffer space to a predetermined state of congestion before storing the given packet in the shared buffer space. Reserved buffer space congestion states are defined with respect to individual connections, groups of connections, and the total capacity of the reserved buffer space itself. Packets are discarded when any, or alternatively a specific combination, of corresponding congestion states occur, and the shared space is congested as well. The system facilitates the balance between the sharing of physical memory resources amongst distinct and various types of traffic flows and the logical isolation thereof.
    • 用于在采用面向连接的通信协议的设备的排队点处缓冲诸如ATM信元的分组的方法和系统包括以下步骤:将存储器逻辑地划分成分配给业务类的多个预留缓冲空间和可用于 任何连接; 基于预定的丢弃标准确定是否存储或丢弃给定的分组; 以及在将所述给定分组存储在所述共享缓冲空间中之前,将预留的缓冲空间填充到预定的拥塞状态。 保留的缓冲空间拥塞状态是针对各个连接,连接组以及保留缓冲区本身的总容量而定义的。 当发生相应的拥塞状态的任何或者特定组合时,分组被丢弃,并且共享空间也是拥挤的。 该系统有助于在不同和各种类型的业务流中的物理存储器资源的共享与其逻辑隔离之间的平衡。
    • 5. 发明授权
    • Method and apparatus for data buffer management in a communications switch
    • 用于通信交换机中的数据缓冲器管理的方法和装置
    • US06539024B1
    • 2003-03-25
    • US09277361
    • 1999-03-26
    • Mark William JanoskaAlbert D. HellerHossain Pezeshki-Esfahani
    • Mark William JanoskaAlbert D. HellerHossain Pezeshki-Esfahani
    • H04L1228
    • H04L47/29H04L47/10H04L47/24H04L47/30H04L47/32
    • A method and apparatus is for buffering data cells in a queuing element is presented. Each queuing element includes a partitioned buffer, where the partitioned buffer includes a plurality of partitions. Each of the partitions stores data cells received by the queuing element. Storage of the data cells into the partitions is accomplished by using an array of logical queues. Each logical queue of the array of logical queues maps data cells corresponding to that logical queue to a particular partition of the plurality of partitions. More than one logical queue may map data cells to a particular partition. Each partition may include a reserved portion, where each logical queue that maps to the partition may map a portion of its data cells to the reserved portion. The resources of the reserved portion to which a logical queue maps data cells are reserved to that specific logical queue and cannot be utilized by other logical queues. Each partition also includes a shared portion, where all of the logical queues that map to a partition are able to utilize the storage space included in the shared portion. Each logical queue includes a maximum size. Depth pointers corresponding to the logical queue and the partition are updated as data cells are enqueued to, and dequeued from, the logical queue.
    • 提出了一种用于缓冲排队元件中的数据单元的方法和装置。 每个排队元素包括分区缓冲区,其中分区缓冲区包括多个分区。 每个分区存储由排队元件接收的数据单元。 通过使用逻辑队列阵列来实现将数据单元存储到分区中。 逻辑队列阵列的每个逻辑队列将对应于该逻辑队列的数据单元映射到多个分区的特定分区。 多个逻辑队列可以将数据单元映射到特定分区。 每个分区可以包括保留部分,其中映射到分区的每个逻辑队列可以将其数据信元的一部分映射到保留部分。 逻辑队列映射数据单元的保留部分的资源被保留给该特定逻辑队列,并且不能被其他逻辑队列使用。 每个分区还包括共享部分,其中映射到分区的所有逻辑队列能够利用包括在共享部分中的存储空间。 每个逻辑队列包括最大大小。 对应于逻辑队列和分区的深度指针随着数据单元入队列并从逻辑队列中排队而被更新。