-
公开(公告)号：US20080101382A1
公开(公告)日：2008-05-01
申请号：US11553020
申请日：2006-10-26
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L47/193 , H04L47/36
摘要： A method for efficiently determining the path maximum transmission unit (MTU) during a handshake between a source host and a target host across a computer network. During the handshake, each router receives the SYN (synchronization) packet transmitted from the source host, and each router updates the value of the path MTU within the SYN packet when the path MTU value is greater than the MTU of the router. When the SYN packet reaches the target host, the target host also updates the value of the path MTU if the value of the path MTU within the SYN packet is greater than that of the target host. With this sequential checking and updating of the path MTU against their MTUs, the combination of the routers en-route and the target host ensures that the final path MTU is equal to or smaller than the smallest MTU of the various components/networks along the path.
摘要翻译： 一种用于在通过计算机网络的源主机和目标主机之间的握手期间有效地确定路径最大传输单元（MTU）的方法。 在握手过程中，每个路由器收到从源主机发送的SYN（同步）报文，当路由MTU值大于路由器的MTU值时，每个路由器都更新SYN报文中的路径MTU值。 当SYN数据包到达目标主机时，如果SYN数据包中路径MTU的值大于目标主机的值，目标主机也会更新路径MTU的值。 通过对其MTU的路径MTU的顺序检查和更新，路由器路由和目标主机的组合确保最终路径MTU等于或小于沿着路径的各种组件/网络的最小MTU 。
-
公开(公告)号：US07760648B2
公开(公告)日：2010-07-20
申请号：US12105145
申请日：2008-04-17
IPC分类号： H04L12/26
CPC分类号： H04L47/34 , H04L47/10 , H04L47/193 , H04L47/323 , H04L69/16 , H04L69/161 , H04L69/163
摘要： The present invention provides a method and apparatus for handling reordered data packets. A method comprises receiving a data packet and determining if the data packet is received out of order. The method further comprises delaying transmission of an acknowledgement indicating that a data packet is missing in response to determining that the data packet is received out of order.
摘要翻译： 本发明提供了一种用于处理重新排序的数据分组的方法和装置。 一种方法包括接收数据分组并确定数据分组是否按顺序接收。 该方法还包括响应于确定数据分组被无序接收而延迟指示数据分组丢失的确认的传输。
-
3.发明授权Method, system and article for improved TCP performance during packet reordering 失效方法，系统和文章，用于在数据包重排序期间改进TCP性能公开(公告)号：US07742419B2
公开(公告)日：2010-06-22
申请号：US12101765
申请日：2008-04-11
IPC分类号： H04L1/00
CPC分类号： H04L29/06 , H04L69/16 , H04L69/161 , H04L69/163
摘要： TCP congestion avoidance is implemented upon retransmission of a packet and is reverted back to the original congestion state upon receipt of an early acknowledgement (ACK), indicating reordering of packets, thereby eliminating a needless restriction on TCP bandwidth. Upon receiving an ACK to a retransmitted packet, it is determined if the ACK resulted from receipt of the original reordered packet or the retransmitted packet, based on the arrival time of the ACK at the sender. If the round-trip-time (RTT) for the retransmitted packet is much lower than the average or current calculated RTT for the network link between sender and receiver, then the retransmission occurred as a result of a reordering event, and the congestion window is restored back to its value prior to the retransmission, thereby permitting the network link to continue operating at its original increased throughput.
摘要翻译： TCP拥塞避免在分组重传时实现，并且在接收到指示重新排序分组的早期确认（ACK）时被恢复到原始拥塞状态，从而消除对TCP带宽的不必要的限制。 在向重传的分组接收到ACK时，基于ACK在发送方的到达时间确定ACK是否从接收到原始重新排序的分组或重传分组而产生。 如果重发分组的往返时间（RTT）远低于发送方和接收方之间的网络链路的平均或当前计算的RTT，则重新发送作为重排序事件的结果，拥塞窗口为 在重传之前恢复其值，从而允许网络链路以其原始增加的吞吐量继续运行。
-
公开(公告)号：US07724652B2
公开(公告)日：2010-05-25
申请号：US11970994
申请日：2008-01-08
IPC分类号： H04L12/26
摘要： In a method of reducing network congestion between a source computer and a destination computer, a receiving router receives a source quench message and determines whether originator of the source quench message is the destination computer or an intermediate router. If the receiving router determines the originator to be the destination computer, the receiving router forwards the source quench message to the source computer. If the receiving router determines the originator to be an intermediate router, the receiving computer determines if there is an alternative route from the receiving router to the destination computer. If the receiving router determines there is no alternative route from the receiving router to the destination computer, the receiving router forwards the source quench message to the source computer. If the receiving router determines there is an alternative route to the destination computer, the receiving router does not forward the source quench message to the source computer, and, going forward, routes packets to the destination computer by the alternative route.
摘要翻译： 在减少源计算机和目的地计算机之间的网络拥塞的方法中，接收路由器接收源淬灭消息并且确定源淬灭消息的发起者是目的地计算机还是中间路由器。 如果接收路由器确定发起者为目标计算机，则接收路由器将源猝熄消息转发到源计算机。 如果接收路由器将发起者确定为中间路由器，则接收计算机确定是否存在从接收路由器到目的地计算机的替代路由。 如果接收路由器确定没有从接收路由器到目标计算机的替代路由，则接收路由器将源淬火消息转发到源计算机。 如果接收路由器确定存在到目标计算机的替代路由，则接收路由器不会将源淬灭消息转发到源计算机，并且将来通过替代路由将分组路由到目的地计算机。
-
公开(公告)号：US20100011312A1
公开(公告)日：2010-01-14
申请号：US12171540
申请日：2008-07-11
IPC分类号： G06F3/048
摘要： Disclosed is a virtual world server receives an update signal corresponding to an RFID tag. The virtual world server determines an RFID tag identifier, an RFID reader identifier, and an associated asset name from the update. The virtual world server looks up a virtual area associated with the RFID reader identifier. The virtual world server teleports a virtual asset associated with the RFID tag identifier to a virtual area in the virtual world. The virtual world server renders a model of the asset in a virtual world based on an avatar perspective.
摘要翻译： 公开了一种虚拟世界服务器接收对应于RFID标签的更新信号。 虚拟世界服务器从更新中确定RFID标签标识符，RFID读取器标识符和相关联的资产名称。 虚拟世界服务器查找与RFID读取器标识符相关联的虚拟区域。 虚拟世界服务器将与RFID标签标识符相关联的虚拟资产传送到虚拟世界中的虚拟区域。 虚拟世界服务器基于头像透视图在虚拟世界中呈现资产的模型。
-
公开(公告)号：US07571247B2
公开(公告)日：2009-08-04
申请号：US11301106
申请日：2005-12-12
IPC分类号： G06F15/16
CPC分类号： H04L47/10 , H04L47/266 , H04L47/30 , H04L49/90 , H04L49/901
摘要： A method, system, and program provide for efficient send socket call handling by a transport layer. A transport layer of a network protocol stack receives a send socket call for data of a specified length from an application layer. Responsive to detecting that there is insufficient memory for a single memory allocation to a buffer in the transport layer for at least the specified length, the transport layer blocks the send socket call. The transport layer only wakes the send socket call upon detection of sufficient memory for the single memory allocation within the buffer of the transport layer for at least the specified length, wherein waking the send socket call triggers a kernel to perform the single memory allocation in the buffer and to write the data to the single memory allocation in a single pass.
摘要翻译： 方法，系统和程序提供传输层有效的发送套接字呼叫处理。 网络协议栈的传输层从应用层接收指定长度的数据的发送套接字调用。 响应于检测到对于至少指定长度的传输层中的缓冲器的单个存储器分配没有足够的存储器，传输层阻止发送套接字调用。 检测到传输层缓冲区内单个内存分配的足够内存至少达到指定长度时，传输层只会唤醒发送套接字调用，其中唤醒发送套接字调用会触发内核执行单个内存分配 缓冲区，并将数据写入单次存储器分配。
-
7.发明授权Method, system and article for improved network performance by avoiding IP-ID wrap-arounds causing data corruption on fast networks 失效方法，系统和文章，通过避免在快速网络上导致数据损坏的IP-ID环绕来改善网络性能公开(公告)号：US07564843B2
公开(公告)日：2009-07-21
申请号：US11014552
申请日：2004-12-16
摘要： The reassembly timer in a TCP/IP receiver is dynamically set to avoid data corruption on fast networks caused by IP identification wrap-around. A sender generates IP packets with a special option specifying a reassembly time for fragments based on the subnet of the destination or on the calculated round-trip time of the connection. A receiver sets the reassembly timer to the reassembly time specified in the option. A sender can generate IP packets with an alternative option setting a time stamp for the generated packet. A receiver calculates a traversal time based on the difference between the arrival time of the fragment and this time stamp, and sets the reassembly timer based on this traversal time.
摘要翻译： TCP / IP接收器中的重组定时器被动态设置，以避免由IP识别环绕引起的快速网络上的数据损坏。 发送方生成具有特殊选项的IP数据包，指定基于目的地的子网或连接的计算出的往返时间的片段的重组时间。 接收机将重新组装定时器设置为选项中指定的重新组装时间。 发送方可以使用替代选项生成IP数据包，为生成的数据包设置时间戳。 接收机根据片段的到达时间与该时间戳的差异来计算遍历时间，并根据该遍历时间设置重新组装定时器。
-
公开(公告)号：US20090175167A1
公开(公告)日：2009-07-09
申请号：US11970994
申请日：2008-01-08
IPC分类号： H04L1/00
摘要： In a method of reducing network congestion between a source computer and a destination computer, a receiving router receives a source quench message and determines whether originator of the source quench message is the destination computer or an intermediate router. If the receiving router determines the originator to be the destination computer, the receiving router forwards the source quench message to the source computer. If the receiving router determines the originator to be an intermediate router, the receiving computer determines if there is an alternative route from the receiving router to the destination computer. If the receiving router determines there is no alternative route from the receiving router to the destination computer, the receiving router forwards the source quench message to the source computer. If the receiving router determines there is an alternative route to the destination computer, the receiving router does not forward the source quench message to the source computer, and, going forward, routes packets to the destination computer by the alternative route.
摘要翻译： 在减少源计算机和目的地计算机之间的网络拥塞的方法中，接收路由器接收源淬灭消息并且确定源淬灭消息的发起者是目的地计算机还是中间路由器。 如果接收路由器确定发起者为目标计算机，则接收路由器将源猝熄消息转发到源计算机。 如果接收路由器将发起者确定为中间路由器，则接收计算机确定是否存在从接收路由器到目的地计算机的替代路由。 如果接收路由器确定没有从接收路由器到目标计算机的替代路由，则接收路由器将源淬火消息转发到源计算机。 如果接收路由器确定存在到目标计算机的替代路由，则接收路由器不会将源淬灭消息转发到源计算机，并且将来通过替代路由将分组路由到目的地计算机。
-
9.发明授权Method, system, and computer program product for delivering data to a storage buffer assigned to an application 失效用于将数据传送到分配给应用程序的存储缓冲区的方法，系统和计算机程序产品公开(公告)号：US07519699B2
公开(公告)日：2009-04-14
申请号：US10912498
申请日：2004-08-05
IPC分类号： G06F15/173
CPC分类号： H04L67/2842 , H04L49/90 , H04L49/9036 , H04L69/16 , H04L69/161 , H04L69/32
摘要： A method, system, and computer program product in a computer-readable medium for delivering data, received from a network, to a storage buffer assigned to an application is proposed. An application designates a communication buffer within a local data processing system for buffering data communicated with an application. The local data processing system reports to a network interface of the local data processing system a memory address of the designated communication buffer, and the data processing system creates a cookie containing the memory address. The data processing system then sends the cookie form the local data processing system to a remote data processing system, such that the remote data processing system may address data directly to the designated communication buffer.
摘要翻译： 提出了一种用于将从网络接收的数据传送到分配给应用的存储缓冲器的计算机可读介质中的方法，系统和计算机程序产品。 应用程序指定本地数据处理系统内的通信缓冲器，用于缓冲与应用程序通信的数据。 本地数据处理系统向本地数据处理系统的网络接口报告指定通信缓冲器的存储器地址，并且数据处理系统创建包含存储器地址的cookie。 然后，数据处理系统将本地数据处理系统的cookie发送到远程数据处理系统，使得远程数据处理系统可以直接将数据寻址到指定的通信缓冲器。
-
10.发明申请SYSTEM AND METHOD FOR MINIMIZING RETRY DELAYS IN HIGH TRAFFIC COMPUTER NETWORKS 失效用于在高交通计算机网络中最小化重试延迟的系统和方法公开(公告)号：US20090049178A1
公开(公告)日：2009-02-19
申请号：US11839955
申请日：2007-08-16
IPC分类号： G06F15/16
CPC分类号： H04L41/5019
摘要： A system, method, and program product is provided that requests, by a first computer system, a new network session with a second computer system. The new network session request occurs after a previous network session between the two systems and the new network session request includes a new sequence number that is different from a previous sequence number that was used during the previous network session. The first computer system receives an acknowledgement from the second computer system that references the previous sequence number instead of the new sequence number. In response to receiving the acknowledgement at the first computer system that references the previous sequence number, the first computer system modifies the new sequence number by setting it to a value that is higher than the previous sequence number, and the first computer system re-requests the new network session using the modified new sequence number.
摘要翻译： 提供了一种系统，方法和程序产品，其由第一计算机系统请求与第二计算机系统的新网络会话。 新的网络会话请求发生在两个系统之前的网络会话之后，并且新的网络会话请求包括与先前网络会话期间使用的先前序列号不同的新的序列号。 第一计算机系统从第二计算机系统接收到引用先前序列号而不是新序列号的确认。 响应于在第一计算机系统处接收到引用先前序列号的确认，第一计算机系统通过将其设置为高于先前序列号的值来修改新序列号，并且第一计算机系统重新请求 新网络会话使用修改的新序列号。
-
-
-
-
-
-
-
-
-
搜索结果
160 条记录 (耗时 0.031 秒)
