US2005175030A1PendingUtilityA1

System and method of format negotiation in a computing device

Assignee: PALMSOURCE INCPriority: Feb 9, 2004Filed: Feb 8, 2005Published: Aug 11, 2005
Est. expiryFeb 9, 2024(expired)· nominal 20-yr term from priority
G06F 21/30H04W 88/06H04L 63/20G06F 12/1081H04W 48/18G06F 21/54G06F 21/84G06F 21/53G06F 9/46G06F 9/449
46
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A system, method and computer-readable media are disclosed for format negotiation between a graph of connected nodes. A source node for multi-media content publishes a set of format constraints associated with the multi-media data and capabilities. A destination node for presenting the multi-media data publishes its set of format constraints associated with its capabilities. At least one filter node within the graph transmits or modifies multimedia data between the source and destination nodes. The format constraints are represented by logical expressions in disjunctive normal form and describe required values or acceptable ranges of values for one or more parameters. The method aspect of the invention comprises receiving source node format data, destination node format data and at least one filter node format data. As nodes are connected to the graph of nodes, the new node's format data is propagated to the directly and indirectly connected nodes in the graph. After the last node is connected, format negotiation resolves format constraints between the nodes in the graph. The negotiation occurs within the framework or operating system of a computing device, a remote server or a proxy server.

Claims

exact text as granted — not AI-modified
1 . A method for establishing a multimedia format for communicating data between a first node and the second node, the method comprising: 
 receiving first node format constraint data;    receiving second node format constraint data; and    negotiating any unresolved format constraints between the first node format constraint data and the second node format constraint data.    
     
     
         2 . The method of  claim 1 , wherein at least one of the first node format constraint data and the second node format constraint data comprises at least one parameter comprising a range of acceptable values.  
     
     
         3 . The method of  claim 2 , wherein negotiating any unresolved format constraints further comprises identifying a parameter within the range of acceptable values.  
     
     
         4 . The method of  claim 1 , further comprising: 
 based on the first node format constraint data and the second node format constraint data, selecting a filter node for communicating the data between the first node and the second node.    
     
     
         5 . The method of  claim 4 , wherein the filter node transforms the data.  
     
     
         6 . The method of  claim 1 , further comprising generating a graph of at least one connection between the first node and the second node.  
     
     
         7 . The method of  claim 6 , wherein the generated graph further comprises at least one filter node connected between the first node and the second node.  
     
     
         8 . The method of  claim 6 , wherein the negotiation of unresolved format constraints occurs according to the generated graph.  
     
     
         9 . The method of  claim 6 , wherein the step of negotiating unresolved format constraints occurs for all nodes in the graph in a single transaction after all nodes have been connected to the graph.  
     
     
         10 . The method of  claim 1 , wherein a framework that communicates with the first node and the second node performs the steps of receiving the first node format constraint data, receiving the second node format constraint data and negotiating any unresolved format constraints.  
     
     
         11 . The method of  claim 10 , wherein negotiating the unresolved format constraints comprises selecting one of the range of compatible values according to the published format constraints of the first node and second node for the communication of data.  
     
     
         12 . The method of  claim 11 , wherein negotiating the unresolved format constraints comprises selecting a first value for the first node from the range of acceptable values that is compatible with a second value from the range of acceptable values for the second node.  
     
     
         13 . The method of  claim 12 , wherein negotiating any unresolved format constraints comprises selecting a set of format data that is compatible with the received first node format constraint data, the second node format constraint data any logical expressions associated with the first node format constraint data or the second node format constraint data.  
     
     
         14 . The method of  claim 1 , wherein the format constraint data comprises at least one logical expression in disjunctive normal form.  
     
     
         15 . The method of  claim 1 , wherein negotiating any unresolved format constraints further comprises identifying alternate contents or an alternate transform content formats to optimize content for the second node.  
     
     
         16 . The method of  claim 15 , wherein a remote server or proxy server is used to identify the alternate content or alternate transform content formats.  
     
     
         17 . The method of  claim 1 , wherein a proxy server performs the step of negotiating remove from a computing device associated with the first node and the second node.  
     
     
         18 . The method of  claim 1 , wherein the first node format data comprises at least one wild card parameter.  
     
     
         19 . The method of  claim 18 , wherein the second node format constraint data comprises at least one of wild card parameter, and wherein negotiating any unresolved format constraints comprises selecting any value for the wild-card parameter.  
     
     
         20 . The method of  claim 1 , wherein the first node is a source node and the second node is a destination node.  
     
     
         21 . The method of  claim 1 , wherein the first node is a source node and the second node is a filter node.  
     
     
         22 . A system that establishes a multimedia format for communicating data between a first node and a second node, the system comprising: 
 a module configured to receive a first node format constraint data;    a module configured to receive a second node format constraint data; and    a module configured to negotiate any unresolved format constraints between the first node format constraint data and the second node format constraint data.    
     
     
         23 . A system that establishes a multimedia format for communicating data between a first node and a second node, the system comprising: 
 means for receiving a first node format constraint data;    means for receiving second node format constraint data; and    means for negotiating any unresolved format constraints between the first node format constraint data and the second node constraint format data.    
     
     
         24 . A computer readable medium storing instructions for controlling a computing device to establish a format for communicating data between a first node and a second node, the instructions comprising: 
 receiving first node format constraint data;    identifying a second node having a second node format constraint data; and    negotiating any unresolved format constraints between the first node format constraint data and the second node format constraint data.    
     
     
         25 . A method of generating a graph for use in communicating data from a source node to a destination node, the graph comprising at least one node, the method comprising: 
 (1) requesting a connection of a new node to the graph by propagating a format constraint for the new node to the at least one node in the graph;    (2) if the propagation fails, then denying the request for connection; and    (3) if the propagation is successful, then connecting the new node to the graph.    
     
     
         26 . The method of  claim 25 , wherein a successful propagation further comprises determining whether the format constraint for the new node is compatible with format constraints for the at least one node in the graph.  
     
     
         27 . The method of  claim 25 , further comprising repeating steps (1)-(3) for each new node to be connected to the graph.  
     
     
         28 . The method of  claim 27 , wherein after each new node is connected to the graph, the method further comprises: 
 resolving all format constraints for each node in the graph.    
     
     
         29 . A system for communicating data from a source node to a destination node using a graph, the graph comprising at least one node, the system comprising: 
 (1) means for requesting a connection of a new node to the graph by propagating a format constraint for the new node to the at least one node in the graph;    (2) means for denying the request for connection if the propagation fails; and    (3) means for connecting the new node to the graph if the propagation is successful.

Join the waitlist — get patent alerts

Track US2005175030A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.