专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20060174016A1 System and method for building and using communication binding objects 失效
标题翻译：用于构建和使用通信绑定对象的系统和方法
公开(公告)号：US20060174016A1
公开(公告)日：2006-08-03
申请号：US11048346
申请日：2005-02-01
申请人： Craig Critchley , David Wortendyke , Elliot Waingold , Eric Zinda , Erik Christensen , Giovanni Della-Libera , Kenneth Wolf , Michael Vernal , Shy Cohen , Stefan Pharies , Stephen Millet , Stephen Swartz , Tomasz Janczuk , Uday Hegde , Yaniv Pessach
发明人： Craig Critchley , David Wortendyke , Elliot Waingold , Eric Zinda , Erik Christensen , Giovanni Della-Libera , Kenneth Wolf , Michael Vernal , Shy Cohen , Stefan Pharies , Stephen Millet , Stephen Swartz , Tomasz Janczuk , Uday Hegde , Yaniv Pessach
IPC分类号： G06F9/46 , G06F15/16
CPC分类号： G06F9/546
摘要： The present invention provides for an automated, user friendly way of constructing and using a binding object. A developer is presenting and selects binding elements that will ultimately be used to create a runtime communication channel for transporting a message between a client and service endpoint. After receiving the user input, metadata, a channel factory and listener factory are created. The metadata describes binding elements and provides an abstract representation of a protocol stack that implements communication aspects at runtime. The channel factory is configured to use the collection of metadata at runtime to generate the runtime communication channel. Further, the listener factory is configured to accept the runtime communication channel for de-multiplex the communication aspects in order to process the message at a service endpoint. The present invention also provides for groupings of binding elements and standardized binging objects organized based on industry need.
摘要翻译：本发明提供了一种自动化，用户友好的构造和使用绑定对象的方式。开发人员正在呈现并选择将最终用于创建用于在客户端和服务端点之间传输消息的运行时通信通道的绑定元素。收到用户输入后，创建元数据，渠道工厂和监听工厂。元数据描述绑定元素，并提供在运行时实现通信方面的协议栈的抽象表示。通道工厂配置为在运行时使用元数据的集合来生成运行时通信通道。此外，收听工厂被配置为接受运行时通信信道以解复用通信方面，以便在服务端点处理消息。本发明还提供了基于行业需要组织的结合元件和标准化ing物的分组。

3. 发明申请

US20060215571A1 Querying for services using soap over UDP 有权
标题翻译：使用soap over UDP查询服务
公开(公告)号：US20060215571A1
公开(公告)日：2006-09-28
申请号：US11087139
申请日：2005-03-23
申请人： Michael Vernal , Erik Christensen , Martin Gudgin , John Justice , Gopal Kakivaya , David Langworthy , Yaniv Pessach , Jeffrey Schlimmer , Elliot Waingold , Kenneth Wolf
发明人： Michael Vernal , Erik Christensen , Martin Gudgin , John Justice , Gopal Kakivaya , David Langworthy , Yaniv Pessach , Jeffrey Schlimmer , Elliot Waingold , Kenneth Wolf
IPC分类号： H04L1/00
CPC分类号： H04L69/16 , H04L69/164 , H04L69/32 , H04L69/328
摘要： A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using SOAP over UDP. In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast URI. The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.
摘要翻译：发送计算机系统可以通过使用SOAP over UDP发送对服务的请求来识别一个或多个网络计算机上的一个或多个可用网络资源。特别地，发送计算机系统准备包括对可用资源的请求的SOAP消息。发送计算机系统然后将SOAP消息封装成用户数据报，并将用户数据报发送到网络上的一个或多个可识别的计算机系统。在一个实现中，发送计算机系统将用户数据报发送到多播URI。接收计算机系统通过UDP接收消息，解包消息，并响应SOAP消息请求。因此，发送计算机系统可以以有效的方式查询多个计算机系统，而不必引起另外与面向连接的通信相关的开销。

4. 发明授权

US07512957B2 Interface infrastructure for creating and interacting with web services 有权
标题翻译：用于创建和与Web服务交互的接口基础设施
公开(公告)号：US07512957B2
公开(公告)日：2009-03-31
申请号：US11003307
申请日：2004-12-03
申请人： Shy Cohen , Geary L. Eppley , Douglas M. Purdy , James E. Johnson , Stephen J. Millet , Stephen T. Swartz , Vijay K. Gajjala , Aaron Abraham Stern , Alexander Martin DeJarnatt , Alfred M. Lee, IV , Anand Rjagopalan , Anastasios Kasiolas , Chaitanya D. Upadhyay , Christopher G. Kaler , Craig Andrew Critchley , David Edwin Levin , David Owen Driver , David Wortendyke , Douglas A. Walter , Elliot Lee Waingold , Erik Bo Christensen , Erin P. Honeycutt , Eugene Shvets , Evgeny Osovetsky , Giovanni M. Della-Libera , Jesus Ruiz-Scougall , John David Doty , Jonathan T. Wheeler , Kapil Gupta , Kenneth David Wolf , Krishnan Srinivasan , Lance E. Olson , Matthew Thomas Tavis , Mauro Ottaviani , Max Attar Feingold , Michael James Coulson , Michael Jon Marucheck , Michael Steven Vernal , Michael Thomas Dice , Mohamed-Hany Essam Ramadan , Mohammad Makarechian , Natasha Harish Jethanandani , Richard Dievendorff , Richard Douglas Hill , Ryan Thomas Sturgell , Saurab Nog , Scott Christopher Seely , Serge Sverdlov , Siddhartha Puri , Sowmyanarayanan K. Srinivasan , Stefan Batres , Stefan Harrington Pharies , Tirunelveli Vishwanath , Tomasz Janczuk , Uday S. Hegde , Umesh Madan , Vaithialingam B. Balayogan , Vipul Arunkant Modi , Yaniv Pessach , Yasser Shohoud
发明人： Shy Cohen , Geary L. Eppley , Douglas M. Purdy , James E. Johnson , Stephen J. Millet , Stephen T. Swartz , Vijay K. Gajjala , Aaron Abraham Stern , Alexander Martin DeJarnatt , Alfred M. Lee, IV , Anand Rjagopalan , Anastasios Kasiolas , Chaitanya D. Upadhyay , Christopher G. Kaler , Craig Andrew Critchley , David Edwin Levin , David Owen Driver , David Wortendyke , Douglas A. Walter , Elliot Lee Waingold , Erik Bo Christensen , Erin P. Honeycutt , Eugene Shvets , Evgeny Osovetsky , Giovanni M. Della-Libera , Jesus Ruiz-Scougall , John David Doty , Jonathan T. Wheeler , Kapil Gupta , Kenneth David Wolf , Krishnan Srinivasan , Lance E. Olson , Matthew Thomas Tavis , Mauro Ottaviani , Max Attar Feingold , Michael James Coulson , Michael Jon Marucheck , Michael Steven Vernal , Michael Thomas Dice , Mohamed-Hany Essam Ramadan , Mohammad Makarechian , Natasha Harish Jethanandani , Richard Dievendorff , Richard Douglas Hill , Ryan Thomas Sturgell , Saurab Nog , Scott Christopher Seely , Serge Sverdlov , Siddhartha Puri , Sowmyanarayanan K. Srinivasan , Stefan Batres , Stefan Harrington Pharies , Tirunelveli Vishwanath , Tomasz Janczuk , Uday S. Hegde , Umesh Madan , Vaithialingam B. Balayogan , Vipul Arunkant Modi , Yaniv Pessach , Yasser Shohoud
IPC分类号： G06F3/00
CPC分类号： G06F9/547 , H04L67/02
摘要： A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.
摘要翻译： Web服务命名空间涉及用于创建各种应用程序的基础架构。该基础设施为构建各种规模和复杂性的基于消息的应用程序提供了基础。基础架构或框架提供基本消息传递，安全消息传递，可靠消息传递和事务消息传递的API。在一些实施例中，相关联的API以平衡实用性，可用性，可扩展性和可版本性的方式考虑到命名空间的层级中。

5. 发明授权

US07921216B2 System and method for building and using communication binding objects 失效
标题翻译：用于构建和使用通信绑定对象的系统和方法
公开(公告)号：US07921216B2
公开(公告)日：2011-04-05
申请号：US11048346
申请日：2005-02-01
申请人： Craig A. Critchley , David A. Wortendyke , Elliot L. Waingold , Eric K. Zinda , Erik B. Christensen , Giovanni M. Della-Libera , Kenneth D. Wolf , Michael S. Vernal , Shy Cohen , Stefan H. Pharies , Stephen J. Millet , Stephen T. Swartz , Tomasz Janczuk , Uday S. Hegde , Yaniv Pessach
发明人： Craig A. Critchley , David A. Wortendyke , Elliot L. Waingold , Eric K. Zinda , Erik B. Christensen , Giovanni M. Della-Libera , Kenneth D. Wolf , Michael S. Vernal , Shy Cohen , Stefan H. Pharies , Stephen J. Millet , Stephen T. Swartz , Tomasz Janczuk , Uday S. Hegde , Yaniv Pessach
IPC分类号： G06F15/16
CPC分类号： G06F9/546
摘要： The present invention provides for an automated, user friendly way of constructing and using a binding object. A developer is presented with and selects binding elements that will ultimately be used to create a runtime communication channel for transporting a message between a client and service endpoint. After receiving the user input, metadata, a channel factory and listener factory are created. The metadata describes binding elements and provides an abstract representation of a protocol stack that implements communication aspects at runtime. The channel factory is configured to use the collection of metadata at runtime to generate the runtime communication channel. Further, the listener factory is configured to accept the runtime communication channel for de-multiplexing the communication aspects in order to process the message at a service endpoint. The present invention also provides for groupings of binding elements and standardized binding objects organized based on industry need.
摘要翻译：本发明提供了一种自动化，用户友好的构造和使用绑定对象的方式。向开发人员呈现并选择将最终用于创建用于在客户端和服务端点之间传输消息的运行时通信通道的绑定元素。收到用户输入后，创建元数据，渠道工厂和监听工厂。元数据描述绑定元素，并提供在运行时实现通信方面的协议栈的抽象表示。通道工厂配置为在运行时使用元数据的集合来生成运行时通信通道。此外，收听工厂被配置为接受运行时通信信道以解复用通信方面，以便在服务端点处理消息。本发明还提供了基于工业需要组织的结合元件和标准化装订物体的分组。

6. 发明授权

US07453875B2 Querying for services using soap over UDP 有权
标题翻译：使用soap over UDP查询服务
公开(公告)号：US07453875B2
公开(公告)日：2008-11-18
申请号：US11087139
申请日：2005-03-23
申请人： Michael S. Vernal , Erik B. Christensen , Martin Gudgin , John R. Justice , Gopal Kakivaya , David Langworthy , Yaniv Pessach , Jeffrey Schlimmer , Elliot Waingold , Kenneth D. Wolf
发明人： Michael S. Vernal , Erik B. Christensen , Martin Gudgin , John R. Justice , Gopal Kakivaya , David Langworthy , Yaniv Pessach , Jeffrey Schlimmer , Elliot Waingold , Kenneth D. Wolf
IPC分类号： H04L12/28 , H04L12/56 , H04J3/26 , G06F15/16
CPC分类号： H04L69/16 , H04L69/164 , H04L69/32 , H04L69/328
摘要： A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using Simple Object Access Protocol (SOAP) over User Datagram Protocol (UDP). In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast Uniform Resource Identifier (URI). The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.
摘要翻译：发送计算机系统可以通过使用通过用户数据报协议（UDP）的简单对象访问协议（SOAP）发送对服务的请求来识别一个或多个网络计算机上的一个或多个可用网络资源。特别地，发送计算机系统准备包括对可用资源的请求的SOAP消息。发送计算机系统然后将SOAP消息封装成用户数据报，并将用户数据报发送到网络上的一个或多个可识别的计算机系统。在一个实现中，发送计算机系统将用户数据报发送到多播统一资源标识符（URI）。接收计算机系统通过UDP接收消息，解包消息，并响应SOAP消息请求。因此，发送计算机系统可以以有效的方式查询多个计算机系统，而不必引起另外与面向连接的通信相关的开销。

7. 发明申请

US20050080858A1 System and method for searching a peer-to-peer network 审中-公开
标题翻译：用于搜索对等网络的系统和方法
公开(公告)号：US20050080858A1
公开(公告)日：2005-04-14
申请号：US10684126
申请日：2003-10-10
申请人： Yaniv Pessach
发明人： Yaniv Pessach
IPC分类号： G06F15/16 , H04L29/08
CPC分类号： H04L67/104 , H04L67/1068 , H04L67/107
摘要： A peer-to-peer (P2P) search request message may multicast from an originating peer to its neighboring peers. Each neighboring peer may multicast the request message in turn until a search radius is reached. Each peer receiving the request message may conduct a single node search. If the single node search is successful, a P2P search response message may be generated. Each receiving peer may filter duplicate messages and may multicast to less than 100% of its neighbors. Responses may be cached and cached responses sent in response to request messages, expanding the effective search radius of a given P2P search. The multicast probability for a neighbor may be a function of how frequently the neighbor has previously responded to a particular search type. To reduce abuse by impolite or malicious peers, in addition to rate-based throttling, originating peers may be required to solve a computationally expensive puzzle.
摘要翻译：点对点（P2P）搜索请求消息可以从始发对等体到其相邻对等体进行多播。每个相邻的对等体可以依次组播请求消息，直到达到搜索半径。接收请求消息的每个对等体可以进行单个节点搜索。如果单个节点搜索成功，则可以生成P2P搜索响应消息。每个接收对等体可以过滤重复的消息，并且可以将其多播到小于其邻居的100％。应答可以被缓存并响应于请求消息发送缓存的响应，扩展给定P2P搜索的有效搜索半径。邻居的多播概率可以是邻居先前对特定搜索类型进行响应的频率的函数。为了减少不礼貌的或恶意的对等体的滥用，除了基于费率的调节之外，可能需要原始的对等方来解决计算上昂贵的难题。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式