公开(公告)号：WO2007009096A3

公开(公告)日：2009-04-16

申请号：PCT/US2006027525

申请日：2006-07-13

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  BATES JOHN P ,  WHITE PAYTON R ,  TAKEDA YUTAKA

Inventor： BATES JOHN P ,  WHITE PAYTON R ,  TAKEDA YUTAKA

IPC: G06F17/30

CPC classification number: G06F3/0236 ,  G06F3/0237 ,  G06F3/04817 ,  Y10S707/99935

Abstract: A user interface enables the input of text and other complicated inputs by identifying entities having an increased likelihood of being selected and decreasing the precision needed to select these entities. The user interface displays a set of entities in a radial pattern. The user manipulates a pointer with a joystick or other input device to select entities. The entities having a higher selection probabilities are allocated more space in the pattern than the other entities. The entities having a higher selection probabilities may also be emphasized with visual cues. Selection probabilities may be determined by comparing a sequence of entities previously selected, such as a partially input word, with a set of commonly selected sequences of entities, such as a set of words commonly used by users. The user interface can display a list of words corresponding with a sequence of selected entities, including characters from different writing systems.

Abstract translation: 用户接口通过识别具有增加的可能性被选择的实体并且降低选择这些实体所需的精度来实现文本和其他复杂输入的输入。 用户界面以径向模式显示一组实体。 用户使用操纵杆或其他输入设备操纵指针以选择实体。 具有较高选择概率的实体在模式中被分配比其他实体更多的空间。 具有更高选择概率的实体也可以用视觉线索强调。 可以通过将先前选择的实体的序列（例如部分输入的字）与一组常用的实体序列（诸如用户通常使用的一组单词）进行比较来确定选择概率。 用户界面可以显示与选定实体的序列相对应的单词列表，包括来自不同书写系统的字符。

公开(公告)号：WO2008134314A1

公开(公告)日：2008-11-06

申请号：PCT/US2008/061156

申请日：2008-04-22

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  TAKEDA, Yutaka ,  BERKEY, Howard L. ,  WHITE, Payton R. ,  VASS, Atilla

Inventor： TAKEDA, Yutaka ,  BERKEY, Howard L. ,  WHITE, Payton R. ,  VASS, Atilla

IPC: H04L12/28

CPC classification number: H04L61/2575 ,  H04L29/12452 ,  H04L29/12528 ,  H04L29/12537 ,  H04L61/2546 ,  H04L61/2578 ,  H04L67/104 ,  H04L67/1072

Abstract: An overlay network uses flexible neighbor selection based on network address translation (NAT) to define routing between nodes. The NAT type is used as a flexible neighbor selection criteria, either alone or in conjunction with other criteria. A method of selecting a neighboring node for a first node in a distributed hash table network includes determining a desired key value for a node finger table entry and requesting a set of candidate neighboring nodes near this desired key value. The method determines a network address translation type of each of the set of candidate neighboring nodes and ranks the set of candidate neighboring nodes accordingly. The method selects one of the set of candidate neighboring nodes based on the ranking. The NAT types of candidate neighboring nodes are determined by sending probe messages or from data received from a central overlay network server.

Abstract translation: 覆盖网络使用基于网络地址转换（NAT）的灵活的邻居选择来定义节点之间的路由。 NAT类型用作灵活的邻居选择标准，单独或与其他标准结合使用。 在分布式散列表网络中为第一节点选择相邻节点的方法包括：确定节点手指表条目的期望密钥值，并且在该期望密钥值附近请求一组候选相邻节点。 所述方法确定所述一组候选相邻节点中的每一个的网络地址转换类型，并且相应地对所述候选相邻节点的集合进行排序。 该方法基于排名选择一组候选相邻节点中的一个。 通过发送探测消息或从中央覆盖网络服务器接收的数据来确定候选邻居节点的NAT类型。

公开(公告)号：WO2004064356A3

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

申请号：PCT/JP2004000259

申请日：2004-01-15

Applicant: MATSUSHITA ELECTRIC IND CO LTD ,  TAKEDA YUTAKA

Inventor： TAKEDA YUTAKA

IPC: H04L29/06 ,  H04L29/08 ,  H04L29/12

CPC classification number: H04L29/12066 ,  H04L29/12301 ,  H04L29/12509 ,  H04L29/12528 ,  H04L61/1511 ,  H04L61/2076 ,  H04L61/2567 ,  H04L61/2575 ,  H04L63/029 ,  H04L63/08 ,  H04L67/02

Abstract: A host running an HTTP server behind a Network Address Translator (NAT) connected to an IP network uses a NAT-discovery process, e.g., a STUN test to determine the presence of the NAT. The host updates information in a redirect server based on the response of a relay server. An HTTP client host initiates a DNS query which connects it to the redirect server. The HTTP client host sends a HTTP request to the redirect server, which in turn redirects the HTTP request to a port on the packet relay server. The packet relay server relays the HTTP request to the HTTP server behind the NAT, which generates an HTTP response that is relayed back to the HTTP client. Seamless communication in an IP network is made possible by using a DDNS server that is updated using a user registration database. The IP network may have hosts located behind the NATs and hosts that are directly connected to the IP network.

Abstract translation: 运行连接到IP网络的网络地址转换器（NAT）后面的HTTP服务器的主机使用NAT发现过程，例如STUN测试来确定NAT的存在。 主机根据中继服务器的响应来更新重定向服务器中的信息。 HTTP客户端主机启动将其连接到重定向服务器的DNS查询。 HTTP客户端主机向重定向服务器发送HTTP请求，然后将HTTP请求重定向到分组中继服务器上的端口。 分组中继服务器将HTTP请求中继到NAT后面的HTTP服务器，生成一个HTTP响应，该响应被中继回HTTP客户端。 通过使用使用用户注册数据库进行更新的DDNS服务器，可以实现IP网络中的无缝通信。 IP网络可能具有位于NAT后面的主机和直接连接到IP网络的主机。

公开(公告)号：WO2009111205A3

公开(公告)日：2009-11-12

申请号：PCT/US2009034913

申请日：2009-02-23

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  TAKEDA YUTAKA

Inventor： TAKEDA YUTAKA

IPC: H04L12/28 ,  G06F15/16 ,  H04B7/24

CPC classification number: H04L43/0811 ,  H04L29/125 ,  H04L29/12528 ,  H04L29/12537 ,  H04L61/2564 ,  H04L61/2575 ,  H04L61/2578 ,  H04L61/6068

Abstract: Handling of multiple connections during NAT traversal for a node behind a symmetric NAT is disclosed. The likelihood of connection failure during symmetric NAT traversal may be reduced by serializing critical time windows after port prediction. Once port prediction has begun for a first connection, port prediction for a subsequent connection may be delayed until a connectivity check has begun for the first connection. This process may be repeated to handle NAT traversal for multiple simultaneous connections to different nodes.

Abstract translation: 公开了在对称NAT之后的节点的NAT穿越期间处理多个连接。 在对端NAT穿越过程中连接失败的可能性可以通过在端口预测后序列化关键时间窗口来减少。 一旦端口预测已经开始进行第一次连接，则后续连接的端口预测可能被延迟，直到连接检查已经开始进行第一次连接。 可以重复该过程以处理对不同节点的多个同时连接的NAT穿越。

公开(公告)号：WO2009073312A2

公开(公告)日：2009-06-11

申请号：PCT/US2008/083002

申请日：2008-11-10

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  MARR, James E. ,  TAKEDA, Yutaka ,  VASS, Attila ,  WHITE, Payton R. ,  DETWILER, Stephen C.

Inventor： MARR, James E. ,  TAKEDA, Yutaka ,  VASS, Attila ,  WHITE, Payton R. ,  DETWILER, Stephen C.

IPC: H04L12/56

CPC classification number: H04L47/525 ,  H04L29/06 ,  H04L29/08072 ,  H04L47/50 ,  H04L47/521

Abstract: Network bandwidth detection and distribution and prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. An available bandwidth may be detected for communication between the first node and a second node. A distribution may be determined for the available bandwidth among the two or more communication channels. A sending rate may be adjusted for data sent from the first node to the second node over one or more of the two or more communication channels in response to a detected change in the available bandwidth. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels.

Abstract translation: 公开了网络带宽检测和分配以及在被配置为通过网络与一个或多个其他节点通信的节点内的单个应用中的两个或更多个不同通信通道之间的网络流量。 可以检测可用带宽以用于第一节点和第二节点之间的通信。 可以针对两个或更多个通信信道中的可用带宽来确定分配。 响应于检测到的可用带宽的变化，可以针对两个或更多个通信信道中的一个或多个通过第一节点向第二节点发送的数据调整发送速率。 对于特定的时间量，带宽量可以根据与这些信道相关联的优先级分布在两个或更多个通信信道之中。

公开(公告)号：WO2007120213A3

公开(公告)日：2007-12-27

申请号：PCT/US2006044661

申请日：2006-11-17

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  TAKEDA YUTAKA ,  BERKEY HOWARD ,  WHITE PAYTON R ,  VASS ATTILA

Inventor： TAKEDA YUTAKA ,  BERKEY HOWARD ,  WHITE PAYTON R ,  VASS ATTILA

IPC: H04L12/18

CPC classification number: H04L12/1854

Abstract: Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.

Abstract translation: 广播消息被有效地引导到覆盖网络的节点。 广播消息包括一个End ID参数，用于指定应接收广播消息的节点的键值范围。 覆盖网络的每个节点维护一个手指节点列表及其各自的键值。 在接收到广播消息时，节点基于广播消息的结束ID值或相邻手指节点的密钥值为节点分配新的结束ID值。 该节点将手指节点的新的结束ID值与手指节点的键值进行比较，以确定是否将广播消息转发到该手指节点。 被转发到指状节点的广播消息包括等于为该指状节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。

公开(公告)号：WO2004063843A2

公开(公告)日：2004-07-29

申请号：PCT/JP2004/000261

申请日：2004-01-15

Applicant: MATSUSHITA ELECTRIC INDUSTRIAL CO.,LTD. ,  TAKEDA, Yutaka ,  BOIRI, Youssef, Kamal

Inventor： TAKEDA, Yutaka ,  BOIRI, Youssef, Kamal

IPC: G06F

CPC classification number: H04L61/1511 ,  H04L29/12066 ,  H04L29/12528 ,  H04L61/2575 ,  H04L65/1006 ,  H04L67/104 ,  H04L67/26

Abstract: Methods of operating a first endpoint device (ED) facilitate the making of a peer-to-peer (P2P) connection between the first ED and a second ED despite intervening network address translators (NATs) at both ends. The P2P connection extends across a system compliant with the internet protocol (IP) whose architecture that includes a first network (having at least the first ED and a first NAT), a second network (having at least the second ED and a second NAT) and a third network. The first ED connects to the third network via the first NAT while the second ED connects to the third network via the second NAT. A first such method includes: providing the second ED with the first IP-address/port pair; and providing the second ED with first type-information regarding the type of the first NAT.

Abstract translation: 操作第一端点设备（ED）的方法有助于在第一ED和第二ED之间进行对等（P2P）连接，尽管在两端都有中间的网络地址转换器（NAT）。 P2P连接跨越符合互联网协议（IP）的系统，该系统的架构包括第一网络（至少具有第一ED和第一NAT），第二网络（至少具有第二ED和第二NAT） 和第三个网络。 第一个ED通过第一个NAT连接到第三个网络，而第二个ED通过第二个NAT连接到第三个网络。 第一种方法包括：向第二ED提供第一IP地址/端口对; 以及向第二ED提供关于第一NAT的类型的第一类型信息。

公开(公告)号：WO2009140485A1

公开(公告)日：2009-11-19

申请号：PCT/US2009/043938

申请日：2009-05-14

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  CORSON, Gregory, A. ,  TAKEDA, Yutaka ,  VASS, Attila

Inventor： CORSON, Gregory, A. ,  TAKEDA, Yutaka ,  VASS, Attila

IPC: G06F15/16

CPC classification number: H04H20/08 ,  H04H60/11 ,  H04H60/27 ,  H04H60/91 ,  H04H2201/40 ,  H04L67/104 ,  H04L67/1076 ,  H04L67/108 ,  H04L69/14 ,  H04N21/262 ,  H04N21/4334 ,  H04N21/4788 ,  H04N21/658

Abstract: The distribution of content over a peer to peer (P2P) network can be improved by utilizing at least one broadcast of the content in order to quickly seed the P2P network. When content is first to be distributed across the network, a broadcast can be scheduled that each peer device with broadcast receiving capability and within range of the broadcast is able to receive. As soon as a peer device receives at least a portion of the broadcast content, that peer can begin redistributing the content across the P2P network. Any errors or missing portions of the received broadcast content can be corrected by requesting a copy of the missing or incorrect portion from another peer on the P2P network.

Abstract translation: 通过利用内容的至少一个广播来提高对等（P2P）网络上的内容分布，以便快速种植P2P网络。 当内容首先通过网络分发时，可以调度具有广播接收能力并且在广播范围内的每个对等设备能够接收的广播。 一旦对等设备接收到广播内容的至少一部分，该对等体可以开始跨P2P网络重新分发内容。 可以通过从P2P网络上的另一对等体请求丢失或不正确部分的副本来纠正所接收的广播内容的任何错误或缺失部分。

公开(公告)号：WO2009073312A3

公开(公告)日：2009-08-13

申请号：PCT/US2008083002

申请日：2008-11-10

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  MARR JAMES E ,  TAKEDA YUTAKA ,  VASS ATTILA ,  WHITE PAYTON R ,  DETWILER STEPHEN C

Inventor： MARR JAMES E ,  TAKEDA YUTAKA ,  VASS ATTILA ,  WHITE PAYTON R ,  DETWILER STEPHEN C

IPC: H04L12/56

CPC classification number: H04L47/525 ,  H04L29/06 ,  H04L29/08072 ,  H04L47/50 ,  H04L47/521

Abstract: Network bandwidth detection and distribution and prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. An available bandwidth may be detected for communication between the first node and a second node. A distribution may be determined for the available bandwidth among the two or more communication channels. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels.

Abstract translation: 公开了网络带宽检测和分配以及在被配置为通过网络与一个或多个其他节点通信的节点内的单个应用中的两个或更多个不同通信通道之间的网络流量。 可以检测可用带宽以用于第一节点和第二节点之间的通信。 可以针对两个或更多个通信信道中的可用带宽来确定分配。 对于特定的时间量，带宽量可以根据与这些信道相关联的优先级分布在两个或更多个通信信道之中。

公开(公告)号：WO2007120213A2

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

申请号：PCT/US2006/044661

申请日：2006-11-17

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  TAKEDA, Yutaka ,  BERKEY, Howard ,  WHITE, Payton R. ,  VASS, Attila

Inventor： TAKEDA, Yutaka ,  BERKEY, Howard ,  WHITE, Payton R. ,  VASS, Attila

CPC classification number: H04L12/1854

Abstract: Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.

Abstract translation: 广播消息有效地指向覆盖网络的节点。 广播消息包括指定应该接收广播消息的节点的密钥值的范围的结束ID参数。 覆盖网络的每个节点维护手指节点及其各自的键值的列表。 在接收到广播消息时，节点基于广播消息的结束ID值或相邻手指节点的密钥值来为手指节点分配新的结束ID值。 节点将手指节点的新结束ID值与手指节点的密钥值进行比较，以确定是否将广播消息转发到该手指节点。 转发到手指节点的广播消息包括等于为手指节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。