COMMUNICATION PROTOCOL, DEVELOPING AND NETWORK OPERATING METHODS THEREFORE

• US 20100100592A1
• Filed: 03/26/2008
• Published: 04/22/2010
• Est. Priority Date: 04/13/2007
• Status: Active Grant

• Current Assignee: Grass Valley Canada (Belden Inc.)
• Original Assignee: Gvbb Holdings SARL (Vislink Technologies, Inc.)
• Inventors: Foedrowitz, Andreas
• Granted Patent: US 8,364,835 B2
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: H04L 61/35 involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function

Abstract

In a method for developing a communication protocol for transmitting binary instructions between devices in a network, each instruction comprising at least one of a binary transmitter identifier, a binary receiver identifier and a binary operation identifier, a set of alphanumeric identifiers for each transmitter of the network is determined, each alphanumeric identifier having the same number of characters. Then a set of binary transmitter identifiers having a same number of bits is generated by converting each alphanumeric identifier of said set into a binary identifier using a compression function. Finally binary instructions are formed having as transmitter identifiers a binary transmitter identifier from said set.

Claims

1-10. -10. (canceled)

11. Method for developing a communication protocol for transmitting binary instructions between devices in a network, each instruction comprising at least one of a binary transmitter identifier, a binary receiver identifier and a binary operation identifier, comprising the steps of

determining a set of alphanumeric identifiers for each transmitter or receiver of the network, or for each operation, respectively, each alphanumeric identifier having the same number of characters,

generating a set of binary transmitter, receiver, or operation identifiers, respectively, having a same number of bits by converting each alphanumeric identifier of said set into a binary identifier using a compression function;

forming binary instructions having as transmitter, receiver, or operation identifiers, respectively, a binary transmitter identifier from said set.)

12. Method according to claim 11, wherein the compression function is the same for each type of identifier.

13. Method according to claim 11, wherein the number of bits is the same for each type of identifier.

14. Method according to claim 11, wherein each alphanumeric character has an integer numeric value unambiguously assigned to it, and the compression function has the form

F(A)=( . . . ((s[a₀]*c+s[a₁])*c+s[a₂])* . . . )+s[a_n−

1],

n being the number of alphanumeric characters in the alphanumeric identifiers,

s[a_i], i=0, 1, . . . , n−

1 being a numerical value assigned to the i-th alphanumeric character a_i of identifier A,

c being an integer larger than the largest one of said integer numeric values.

15. Method according to claim 14, wherein the set of alphanumeric characters comprises between 36 and 63 different characters.

16. Method according claim 11, wherein the number of bits in each binary identifier and the number of bits simultaneously processed by an instruction in a processor of any of the devices of the network are identical.

17. Method for operating a network comprising the steps of

transmitting a binary instruction between devices of said network using a protocol obtainable by a method according to claim 11,

receiving said binary instruction and transforming an identifier of the received binary instruction into alphanumeric form using a decompression function inverse to said compression function.

18. Communication protocol for transmitting binary instructions between devices in a network, each instruction comprising at least one of a binary transmitter identifier, a binary receiver identifier and a binary operation identifier, wherein each binary identifier is related to an alphanumeric identifier A=(a₀, a₁, . . . , a_n−

1) comprising n characters a₀, a₁, . . . , a<sub>n−

1</sub> descriptive of the transmitter, the receiver or the operation by a compression function

F(A)=( . . . ((s[a₀]*c+s[a₁])*c+s[a₂])* . . . )+s[a<sub>n−

1</sub>],

s[a_i], i=0, 1, . . . , n−

1 being a numerical value assigned to the i-th alphanumeric character a_i of identifier A, c being an integer larger than the largest one of said integer numeric values.