公开(公告)号：US06831895B1

公开(公告)日：2004-12-14

申请号：US09314107

申请日：1999-05-19

申请人： Hongbin Ji ,  Muralidharan Sampath Kodialam ,  Yung-Terng Wang

发明人： Hongbin Ji ,  Muralidharan Sampath Kodialam ,  Yung-Terng Wang

IPC分类号： H04J300

CPC分类号： H04L45/38 ,  H04L45/00 ,  H04L45/122 ,  H04L45/123 ,  H04L45/20 ,  H04L45/22

摘要： Congestion across links in a network, such as the Internet, is reduced by diverting traffic from the congested link to alternative, shortest paths by adjusting splitting factors associated with the congested and alternative links. The alternative shortest paths comprise equal cost paths. Alternatively, adjustments occur after the creation of additional equal cost paths/shortest paths if none are initially available within the network. Unique programs control the adjustment of the splitting factors and the creation of the additional shortest paths. The programs make use of both existing, real networks and constructed, virtual networks in conjunction with novel traffic flow relationships to divert traffic from a congested link without causing further congestion within the network. Another unique program deletes shortest paths once used to accept traffic diverted from a congested link when traffic in the network decreases.

摘要翻译： 通过调整与拥塞和替代链路相关联的分解因子，将流量从拥塞链路转移到备选最短路径，从而减少网络中诸如因特网之间的链路的拥塞。 替代的最短路径包括相等的成本路径。 或者，如果网络中最初没有可用的附加成本路径/最短路径，则在创建额外的等价路径/最短路径之后进行调整。 独特的程序控制分割因子的调整和附加最短路径的创建。 这些程序利用现有的，实际的网络和构建的虚拟网络结合新的业务流量关系来转发来自拥塞的链路的业务，而不会在网络内造成进一步的拥塞。 当网络中的流量减少时，另一个独特的程序会删除一次用于接收从拥塞链路转发的流量的最短路径。

公开(公告)号：US20090122099A1

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

申请号：US12354759

申请日：2009-01-15

申请人： John M. White ,  Emanuel Beer ,  Hongbin Ji ,  Chang-Tsung Lin ,  Shinichi Kurita

发明人： John M. White ,  Emanuel Beer ,  Hongbin Ji ,  Chang-Tsung Lin ,  Shinichi Kurita

IPC分类号： B41J29/393

CPC分类号： B41J29/393

摘要： Methods and apparatus for inkjet drop positioning are provided. A first method includes determining an intended deposition location of an ink drop on a substrate, depositing the ink drop on the substrate using an inkjet printing system, detecting a deposited location of the deposited ink drop on the substrate, comparing the deposited location to the intended location, determining a difference between the deposited location and the intended location, and compensating for the difference between the deposited location and the intended location by adjusting a parameter of an inkjet printing system. Numerous other aspects are provided.

摘要翻译： 提供了用于喷墨滴定位的方法和装置。 第一种方法包括确定墨滴在基底上的预期沉积位置，使用喷墨印刷系统将墨滴沉积在基底上，检测沉积的墨滴在基底上的沉积位置，将沉积位置与预期的位置进行比较 确定存放位置与预期位置之间的差异，以及通过调整喷墨打印系统的参数来补偿存放位置与预期位置之间的差异。 提供了许多其他方面。

公开(公告)号：US07413272B2

公开(公告)日：2008-08-19

申请号：US11061120

申请日：2005-02-18

申请人： Bassam Shamoun ,  Janusz Jozwiak ,  Quanyuan Shang ,  Hongbin Ji

发明人： Bassam Shamoun ,  Janusz Jozwiak ,  Quanyuan Shang ,  Hongbin Ji

IPC分类号： B41J29/38

CPC分类号： B41J2/2128 ,  B41J2/04541 ,  B41J2/0456 ,  B41J2/04581 ,  B41J2/04591 ,  B41J2/04593 ,  B41J2202/09 ,  G02F1/133516 ,  H04N1/4015

摘要： The present invention provides methods and apparatus for controlling the quantity of fluid output (e.g., drop size) by individual nozzles of a print head to a very high precision at a frequency equal to the frequency at which fluid is normally dispensed. This is achieved by mapping fluid quantity control information into the data that represents the image to be printed. Data representative of an image is received and converted into pixel data. In at least one embodiment, the pixel data includes pixels represented by N bits, and the N bits may represent a drop size for the pixel and a union of the N bits may represent a nozzle status. A print head may be controlled based on the pixel data, and the print head may include nozzles that are each adapted to deposit at least one drop size quantity of a fluid on a substrate.

摘要翻译： 本发明提供了用于以等于通常分配流体的频率的频率将打印头的各个喷嘴的流体输出量（例如，液滴尺寸）控制到非常高的精度的方法和装置。 这通过将流体量控制信息映射到表示要打印的图像的数据来实现。 接收表示图像的数据并将其转换为像素数据。 在至少一个实施例中，像素数据包括由N位表示的像素，并且N位可以表示像素的液滴大小，并且N位的并集可以表示喷嘴状态。 可以基于像素数据来控制打印头，并且打印头可以包括各自适于在衬底上沉积至少一个液滴量的流体的喷嘴。

公开(公告)号：US07400630B1

公开(公告)日：2008-07-15

申请号：US09651792

申请日：2000-08-30

申请人： Hongbin Ji ,  Eraj D. Kaluarachchi ,  On-Ching Yue

发明人： Hongbin Ji ,  Eraj D. Kaluarachchi ,  On-Ching Yue

IPC分类号： H04L12/28 ,  G01R31/08

CPC分类号： H04L12/5601 ,  H04L2012/5632

摘要： Call admission methods for admitting connections into ATM/IP networks having a plurality of communication channels are disclosed. An overbooking technique is utilized which distinguishes among the different service classes. Each service class is assigned an overbooking factor. The call admission is determined based on the overbooking factor assigned to the class and the effective bandwidth for that service class. In addition, methods are disclosed for performing appropriate bookkeeping, i.e., updating and maintaining information concerning the state of the system.

摘要翻译： 公开了用于允许连接到具有多个通信信道的ATM / IP网络中的呼叫准入方法。 使用超额预订技术来区分不同的服务类别。 每个服务类都被分配一个超额预订因素。 呼叫准入基于分配给该类的超额预定因子和该服务类的有效带宽来确定。 此外，公开了用于执行适当的记帐的方法，即更新和维护关于系统状态的信息。

公开(公告)号：US07274697B2

公开(公告)日：2007-09-25

申请号：US10032379

申请日：2001-12-21

申请人： Hongbin Ji ,  Michael Carchia

发明人： Hongbin Ji ,  Michael Carchia

IPC分类号： G06F12/00 ,  H04L12/28

CPC分类号： G06F17/30955 ,  H04L45/7457 ,  H04L69/22

摘要： An advanced data structure allows lookup based upon the most significant 16 bits and the following variable number of K bits of the IP destination address. This 16/K scheme requires less than 2 MB memory to store the whole routing tables of present day backbone routers. A 16/Kc version utilizes bitmaps to compress the table to less than 0.5 MB. For the 16/K data structure each route lookup requires at most 2 memory accesses while the 16/Kc requires at most 3 memory accesses. By configuring the processor properly and developing a few customized instructions to accelerate route lookup, one can achieve 85 million lookups per second (MLPS) in the typical case with the processor running at 200 MHz. Further, the lookup method can be implemented using pipelining techniques to perform three lookups for three incoming packets simultaneously. Using such techniques, 100 MLPS performance can be achieved.

摘要翻译： 高级数据结构允许基于最高有效16位和IP目的地地址的以下可变数量的K位进行查找。 这种16 / K方案需要少于2MB的存储器来存储当前骨干路由器的整个路由表。 16 / Kc版本利用位图将表压缩到小于0.5 MB。 对于16 / K数据结构，每个路由查找最多需要2个存储器访问，而16 / Kc需要最多3个存储器访问。 通过正确配置处理器并开发一些自定义指令来加速路由查找，在处理器运行在200 MHz的典型情况下，可以实现每秒8500万次查找（MLPS）。 此外，可以使用流水线技术来实现查找方法，以同时对三个输入分组执行三次查找。 使用这样的技术，可以实现100 MLPS性能。

公开(公告)号：US06621797B1

公开(公告)日：2003-09-16

申请号：US09271812

申请日：1999-03-18

申请人： Zhensheng Zhang ,  Hongbin Ji

发明人： Zhensheng Zhang ,  Hongbin Ji

IPC分类号： H04J116

CPC分类号： H04L41/142 ,  H04L12/5601 ,  H04L43/0829 ,  H04L2012/5625 ,  H04L2012/5647

摘要： The present invention includes a system for determining cell loss among on-off sources on a network by (a) receiving cells; and (b) measuring aggregate cell loss of said sources at port level. The method preferably includes determining aggregate cell loss of the sources; determining mean rate of each of the sources; determining burstiness of each of the sources; determining average burst length of each of the sources; determining buffer size; and approximating the cell loss ratio of each of the sources based substantially only upon the aggregate cell loss, the mean rate, the burstiness, and the average burst length. This approximation can be calculated using the formula: γ i = γ ⁢ ∑ i = 1 N ⁢   ⁢ r j ∑ i = 1 N ⁢   ⁢ A j ⁢ r j ⁢ A i where &ggr;i is individual cell loss ratio, &ggr; is aggregate cell loss ratio, rj is mean rate, and A is computed from the formula: A i = T i ⁢ B i T i + B where Ti is average burst length of each of said sources, Bi is burstiness, and B is buffer size.

摘要翻译： 本发明包括一种用于通过（a）接收小区来确定网络上开 - 关源之间的小区丢失的系统; 和（b）在港口级别测量所述源的总细胞损失。 该方法优选地包括确定源的聚集细胞损失; 确定每个来源的平均速率; 确定每个源的突发性; 确定每个源的平均突发长度; 确定缓冲区大小; 并且基本上仅基于聚合单元损耗，平均速率，突发性和平均突发长度来近似每个源的信元丢失率。 这个近似值可以用下式计算：其中gammai是单个细胞损失率，γ是聚集细胞损失比，rj是平均率，A由下式计算：其中Ti是每个源的平均突发长度，Bi 是突发性的，B是缓冲区大小。