Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
7,600 | 7,600 | 14,606,582 | 2,488 | Systems and methods for automated detection and classification of objects in a fluid of a receptacle such as, for example, a soft-sided receptacle such as a flexible container. The automated detection may include initiating movement of the receptacle to move objects in the fluid contained by the receptacle. Sequential frames of image data may be recorded and processed to identify moving objects in the image data. In turn, at least one motion parameter of the objects may be determined and utilized to classify the object into at least one of a predetermined plurality of object classes. For example, the object classes may at least include a predetermined class corresponding to bubbles and a predetermined class corresponding to particles. | 1. A method for automated detection and classification of objects in a receptacle containing a fluid utilizing a machine vision system, comprising:
detecting, using a processor of the machine vision system, a first object in the fluid contained by the receptacle that appears in a plurality of sequential frames of digital image data of the receptacle; determining, using a processor of the machine vision system, at least one motion parameter corresponding to movement of the first object through the fluid in the plurality of sequential frames; and classifying, using a processor of the machine vision system, the first object into one of a predetermined plurality of object classes at least partially based on the at least one motion parameter of the first object. 2. The method according to claim 1, further comprising:
moving the receptacle to initiate movement of the first object through the fluid in the receptacle; and capturing the plurality of sequential frames of digital image data of the receptacle with a camera of the machine vision system after the moving step with the receptacle stationary relative to the camera. 3. The method according to claim 2, wherein the moving step comprises:
displacing the receptacle at least with respect to an axis orthogonally disposed relative to a field of view of the camera and the force of gravity. 4. The method according to claim 1, wherein the detecting step comprises:
observing pixels in at least a portion of the plurality of sequential frames of digital image data; generating a background image corresponding to the receptacle based on the observing step; and subtracting the background image from each of the plurality of sequential frames of digital image data to generate a foreground image indicative of the first object. 5. The method of claim 4, further comprising:
establishing a relative weighting for a first pixel of the foreground image relative to at least one other pixel value of the foreground image based on corresponding relative pixel intensities for the background image. 6. The method according to claim 5, wherein the relative weighting is inversely proportional to the relative intensities of the corresponding pixels for the background image. 7. The method according to claim 1, further comprising:
associating the first object with a first motion track. 8. The method according to claim 7, further comprising:
calculating the at least one motion parameter for the first object at least partially based on the first motion track to which the first object is associated. 9. The method according to claim 8, wherein the first motion track is determined using observations of a location of the first object in the fluid of the receptacle in respective previous ones of the plurality of sequential frames of digital image data of the receptacle. 10. The method according to claim 9, further comprising:
establishing, at least partially based on the first motion track, a predicted area comprising a subset of pixels of a frame of the plurality of sequential frames of digital image data within which the first object is expected to be located in the frame. 11. The method according to claim 10, wherein a plurality of objects are located in the predicted area, and wherein the associating step comprises:
performing a statistical analysis for each of the plurality of objects relative to the first motion track to determine which of the plurality of objects corresponds to the first object. 12. The method according to claim 11, wherein the statistical analysis comprises at least one of a global nearest neighbor (GNN) approach and a joint probabilistic data association (JPDA) approach. 13. The method according to claim 8, further comprising:
detecting, using a processor of the machine vision system, at least a second object in the fluid contained by the receptacle that appears in a plurality of sequential frames of digital image data of the receptacle; associating the second object with a second motion track; calculating at least one motion parameter corresponding to movement of the second object through the fluid in the plurality of sequential frames at least partially based on the second motion track to which the second object is associated; classifying, using a processor of the machine vision system, the second object into one of a predetermined plurality of object classes at least partially based on the at least one motion parameter of the second object. 14. The method according to claim 8, further comprising:
establishing the first motion track in response to the detecting step. 15. The method according to claim 14, wherein the first motion track is established only if an intensity value of one or more pixels corresponding to the first object is greater than a minimum new track threshold value. 16. The method according to claim 1, wherein the motion parameter comprises at least one of a velocity, a direction of travel, or an acceleration of the first object. 17. The method according to claim 1, wherein the classifying step comprises:
executing a classification model using the processor of the machine learning system at least partially based on one or more features at least including the at least one motion parameter. 18. The method according to claim 17, wherein the classification model is generated using training data corresponding to one or more observed features of training objects to establish the predetermined plurality of object classes. 19. The method according to claim 17, wherein the one or more features comprise a plurality of features that are selected from the group consisting of a motion parameter, a morphological characteristic, a radiometric characteristic, or a combination thereof. 20. The method according to claim 1, wherein a first predetermined object class corresponds to particles and a second predetermined object class corresponds to bubbles. 21. The method according to claim 1, wherein the classifying step includes:
first classifying the first object into a subset group of the predetermined plurality of object classes; and second classifying the first object into one of the subset group of the predetermined plurality of object classes. 22. The method according to claim 12, wherein the subset group of the predetermined plurality of object classes include a first predetermined object class corresponds to particles and a second predetermined object class corresponds to bubbles of a predetermined size. 23. The method according to claim 1, further comprising:
generating an indication that the receptacle is defective upon classification of the first object into an object class corresponding to particles exceeding a predetermined size. 24. The method according to claim 23, wherein the indication comprises a human perceivable indication. 25. The method according to claim 23, further comprising:
discarding the receptacle in response to the indication. 26. The method according to claim 1, wherein each pixel in the plurality of sequential frames of digital image data corresponds to a resolution of not less than about 100 microns. 27. The method according to claim 1, wherein each pixel in the plurality of sequential frames of digital image data corresponds to a resolution of not less than about 60 microns. 28. A machine vision system for automated detection and classification of objects in a receptacle containing a fluid, comprising:
a receptacle support member operable to supportably engage a receptacle containing a fluid in a receptacle support region; a camera having an imaging field encompassing the receptacle support region, the camera being operable to output a plurality of sequential frames of digital image data of the imaging field including the receptacle support region; an image processing module in operative communication with the camera for receiving the plurality of sequential frames of digital image data, wherein the imaging processing module includes a detection module to detect a first object in the fluid of the receptacle that appears in the plurality of sequential frames of digital image data of the receptacle, a motion analysis module to determine at least one motion parameter corresponding to movement of the first object through the fluid in the plurality of sequential frames of digital image data, and a classification module to classify the first object into one of a predetermined plurality of object classes at least partially based on the at least one motion parameter of the first object. 29. The machine vision system of claim 28, wherein the receptacle support member is moveable to initiate movement of the object in the fluid of the receptacle. 30. The machine vision system of claim 29, wherein the receptacle support member is moveable at least with respect to an axis orthogonally disposed relative to the force of gravity. 31. The machine vision system of claim 30, wherein the receptacle support member is moveable at least with respect to an axis orthogonally disposed to the direction of the imaging field of the camera. 32. The machine vision system of claim 31, wherein the receptacle support member is transparent between the receptacle support region and the camera. 33. The machine vision system of claim 32, wherein the receptacle support region is disposed between a light emitter and the camera. 34. The machine vision system of claim 29, further comprising a receptacle containing a fluid supportably engaged by the receptacle support member. 35. The machine vision system of claim 34, wherein the receptacle comprises a flexible bag. 36. The machine visions system of claim 35, wherein the flexible bag is at least partially transparent. 37. The machine vision system of claim 36, wherein the receptacle support member comprises opposing transparent sidewall members supportably engaged with the receptacle at least in the receptacle support region. | Systems and methods for automated detection and classification of objects in a fluid of a receptacle such as, for example, a soft-sided receptacle such as a flexible container. The automated detection may include initiating movement of the receptacle to move objects in the fluid contained by the receptacle. Sequential frames of image data may be recorded and processed to identify moving objects in the image data. In turn, at least one motion parameter of the objects may be determined and utilized to classify the object into at least one of a predetermined plurality of object classes. For example, the object classes may at least include a predetermined class corresponding to bubbles and a predetermined class corresponding to particles.1. A method for automated detection and classification of objects in a receptacle containing a fluid utilizing a machine vision system, comprising:
detecting, using a processor of the machine vision system, a first object in the fluid contained by the receptacle that appears in a plurality of sequential frames of digital image data of the receptacle; determining, using a processor of the machine vision system, at least one motion parameter corresponding to movement of the first object through the fluid in the plurality of sequential frames; and classifying, using a processor of the machine vision system, the first object into one of a predetermined plurality of object classes at least partially based on the at least one motion parameter of the first object. 2. The method according to claim 1, further comprising:
moving the receptacle to initiate movement of the first object through the fluid in the receptacle; and capturing the plurality of sequential frames of digital image data of the receptacle with a camera of the machine vision system after the moving step with the receptacle stationary relative to the camera. 3. The method according to claim 2, wherein the moving step comprises:
displacing the receptacle at least with respect to an axis orthogonally disposed relative to a field of view of the camera and the force of gravity. 4. The method according to claim 1, wherein the detecting step comprises:
observing pixels in at least a portion of the plurality of sequential frames of digital image data; generating a background image corresponding to the receptacle based on the observing step; and subtracting the background image from each of the plurality of sequential frames of digital image data to generate a foreground image indicative of the first object. 5. The method of claim 4, further comprising:
establishing a relative weighting for a first pixel of the foreground image relative to at least one other pixel value of the foreground image based on corresponding relative pixel intensities for the background image. 6. The method according to claim 5, wherein the relative weighting is inversely proportional to the relative intensities of the corresponding pixels for the background image. 7. The method according to claim 1, further comprising:
associating the first object with a first motion track. 8. The method according to claim 7, further comprising:
calculating the at least one motion parameter for the first object at least partially based on the first motion track to which the first object is associated. 9. The method according to claim 8, wherein the first motion track is determined using observations of a location of the first object in the fluid of the receptacle in respective previous ones of the plurality of sequential frames of digital image data of the receptacle. 10. The method according to claim 9, further comprising:
establishing, at least partially based on the first motion track, a predicted area comprising a subset of pixels of a frame of the plurality of sequential frames of digital image data within which the first object is expected to be located in the frame. 11. The method according to claim 10, wherein a plurality of objects are located in the predicted area, and wherein the associating step comprises:
performing a statistical analysis for each of the plurality of objects relative to the first motion track to determine which of the plurality of objects corresponds to the first object. 12. The method according to claim 11, wherein the statistical analysis comprises at least one of a global nearest neighbor (GNN) approach and a joint probabilistic data association (JPDA) approach. 13. The method according to claim 8, further comprising:
detecting, using a processor of the machine vision system, at least a second object in the fluid contained by the receptacle that appears in a plurality of sequential frames of digital image data of the receptacle; associating the second object with a second motion track; calculating at least one motion parameter corresponding to movement of the second object through the fluid in the plurality of sequential frames at least partially based on the second motion track to which the second object is associated; classifying, using a processor of the machine vision system, the second object into one of a predetermined plurality of object classes at least partially based on the at least one motion parameter of the second object. 14. The method according to claim 8, further comprising:
establishing the first motion track in response to the detecting step. 15. The method according to claim 14, wherein the first motion track is established only if an intensity value of one or more pixels corresponding to the first object is greater than a minimum new track threshold value. 16. The method according to claim 1, wherein the motion parameter comprises at least one of a velocity, a direction of travel, or an acceleration of the first object. 17. The method according to claim 1, wherein the classifying step comprises:
executing a classification model using the processor of the machine learning system at least partially based on one or more features at least including the at least one motion parameter. 18. The method according to claim 17, wherein the classification model is generated using training data corresponding to one or more observed features of training objects to establish the predetermined plurality of object classes. 19. The method according to claim 17, wherein the one or more features comprise a plurality of features that are selected from the group consisting of a motion parameter, a morphological characteristic, a radiometric characteristic, or a combination thereof. 20. The method according to claim 1, wherein a first predetermined object class corresponds to particles and a second predetermined object class corresponds to bubbles. 21. The method according to claim 1, wherein the classifying step includes:
first classifying the first object into a subset group of the predetermined plurality of object classes; and second classifying the first object into one of the subset group of the predetermined plurality of object classes. 22. The method according to claim 12, wherein the subset group of the predetermined plurality of object classes include a first predetermined object class corresponds to particles and a second predetermined object class corresponds to bubbles of a predetermined size. 23. The method according to claim 1, further comprising:
generating an indication that the receptacle is defective upon classification of the first object into an object class corresponding to particles exceeding a predetermined size. 24. The method according to claim 23, wherein the indication comprises a human perceivable indication. 25. The method according to claim 23, further comprising:
discarding the receptacle in response to the indication. 26. The method according to claim 1, wherein each pixel in the plurality of sequential frames of digital image data corresponds to a resolution of not less than about 100 microns. 27. The method according to claim 1, wherein each pixel in the plurality of sequential frames of digital image data corresponds to a resolution of not less than about 60 microns. 28. A machine vision system for automated detection and classification of objects in a receptacle containing a fluid, comprising:
a receptacle support member operable to supportably engage a receptacle containing a fluid in a receptacle support region; a camera having an imaging field encompassing the receptacle support region, the camera being operable to output a plurality of sequential frames of digital image data of the imaging field including the receptacle support region; an image processing module in operative communication with the camera for receiving the plurality of sequential frames of digital image data, wherein the imaging processing module includes a detection module to detect a first object in the fluid of the receptacle that appears in the plurality of sequential frames of digital image data of the receptacle, a motion analysis module to determine at least one motion parameter corresponding to movement of the first object through the fluid in the plurality of sequential frames of digital image data, and a classification module to classify the first object into one of a predetermined plurality of object classes at least partially based on the at least one motion parameter of the first object. 29. The machine vision system of claim 28, wherein the receptacle support member is moveable to initiate movement of the object in the fluid of the receptacle. 30. The machine vision system of claim 29, wherein the receptacle support member is moveable at least with respect to an axis orthogonally disposed relative to the force of gravity. 31. The machine vision system of claim 30, wherein the receptacle support member is moveable at least with respect to an axis orthogonally disposed to the direction of the imaging field of the camera. 32. The machine vision system of claim 31, wherein the receptacle support member is transparent between the receptacle support region and the camera. 33. The machine vision system of claim 32, wherein the receptacle support region is disposed between a light emitter and the camera. 34. The machine vision system of claim 29, further comprising a receptacle containing a fluid supportably engaged by the receptacle support member. 35. The machine vision system of claim 34, wherein the receptacle comprises a flexible bag. 36. The machine visions system of claim 35, wherein the flexible bag is at least partially transparent. 37. The machine vision system of claim 36, wherein the receptacle support member comprises opposing transparent sidewall members supportably engaged with the receptacle at least in the receptacle support region. | 2,400 |
7,601 | 7,601 | 14,346,766 | 2,453 | The present invention relates to a methods and network nodes for controlling resources of a service session in a communication network as well as to a corresponding system and computer program to improve the handling of resources in the network, and particularly to optimize signaling in the network. The method for controlling resources for a service session by a policy and charging system in a communication network comprises the steps of obtaining, at a first network node, a request including service session data indicating the type of service; determining, based on the service session data obtained at said first network node, a resource type to be assigned to said service; and sending to a second network node an indication of said resource type assigned to said service, according to which resource type it is determined when a service session associated with said service is terminated. | 1-15. (canceled) 16. A method for controlling resources for a service session by a policy and charging system in a communication network, the method comprising:
obtaining, at a first network node, a request including service session data indicating the type of service; determining, based on the service session data obtained at said first network node, a resource type to be assigned to said service; and sending to a second network node an indication of said resource type assigned to said service, according to which resource type it is determined when a service session associated with said service is terminated, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 17. The method of claim 16, wherein determining the resource type comprises determining whether the communication network or a user terminal or both support, of a plurality of bearers, a dedicated bearer that is a bearer dedicated to said service. 18. The method of claim 16, further comprising:
sending, from said second network node, the request including said service session data indicating the type of service to said first network node; receiving from said first network node the indication of a resource type determined based on said service session data and assigned to said service; and deciding when to terminate a service session associated with said service based on said received resource type. 19. The method of claim 16, wherein if the resource type indicates that resources are permanently reserved, said second network node will not take any action. 20. The method of claim 16, wherein if the resource type indicates that resources are temporarily reserved, said second network node will activate a timer. 21. The method of claim 20, wherein said second network node initiates a service session termination when said timer expires. 22. The method of claim 16, wherein if the resource type indicates that resources are permanently reserved, said second network node activates a timer that is longer than a timer that is activated if the resource type indicates that resources are temporarily reserved. 23. The method of claim 16, wherein the resource type implies the generation of a non-guaranteed bit rate bearer or guaranteed bit rate bearer. 24. The method of claim 16, wherein said first network node comprises a policy and charging rules function (PCRF), or said second network node comprises an application function or traffic detection function. 25. The method of claim 24, wherein said traffic detection function performs packet inspection and service classification. 26. A method for controlling resources for a service session in a communication network, the method comprising:
sending, from a second network node, a request including service session data indicating the type of service to a first network node; receiving from said first network node an indication of a resource type determined based on said service session data and assigned to said service; and deciding when to terminate a service session associated with said service based on said received resource type, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 27. The method of claim 26, further comprising said second network node taking no further action in response to the indication, in response to determining that the resource type indicates that resources are permanently reserved. 28. The method of claim 26, further comprising said second network node activating a timer, in response to determining that the resource type indicates that resources are temporarily reserved. 29. The method of claim 28, further comprising said second network node initiating a service session termination when said timer expires. 30. The method of claim 26, further comprising said second network node, in response to determining that the resource type indicates that resources are permanently reserved, activating a timer that is longer than a timer that is activated in response to determining that the resource type indicates that resources are temporarily reserved. 31. The method of claim 26, wherein the resource type implies the generation of a non-guaranteed bit rate bearer or guaranteed bit rate bearer. 32. The method of claim 26, wherein said first network node comprises a policy and charging rules function (PCRF) or said second network node comprises an application function or traffic detection function. 33. The method of claim 32, wherein said traffic detection function performs packet inspection and service classification. 34. A network node for controlling resources for a service session in a communication network, the network node comprising:
a request obtainer configured to obtain a request including service session data indicating the type of service; a determiner configured to determine, based on the obtained service session data, a resource type to be assigned to said service; and a resource type sender configured to send to a second network node an indication of said resource type assigned to said service, according to which resource type it is determined when a service session associated with said service is terminated, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 35. A network node for controlling resources for a service session in a communication network, the network node comprising:
a request sender configured to send a request including service session data indicating the type of service to another network node; a resource type receiver configured to receive from said other network node an indication of a resource type determined based on said service session data and assigned to said service; and a decider configured to decide when to terminate a service session associated with said service based on said received resource type, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 36. A non-transitory computer-readable medium comprising, stored thereupon, a computer program, the computer program including instructions configured so as to cause, when executed on a data processor, the data processor to execute the method of claim 16. 37. A non-transitory computer-readable medium comprising, stored thereupon, a computer program, the computer program including instructions configured so as to cause, when executed on a data processor, the data processor to execute the method of claim 26. | The present invention relates to a methods and network nodes for controlling resources of a service session in a communication network as well as to a corresponding system and computer program to improve the handling of resources in the network, and particularly to optimize signaling in the network. The method for controlling resources for a service session by a policy and charging system in a communication network comprises the steps of obtaining, at a first network node, a request including service session data indicating the type of service; determining, based on the service session data obtained at said first network node, a resource type to be assigned to said service; and sending to a second network node an indication of said resource type assigned to said service, according to which resource type it is determined when a service session associated with said service is terminated.1-15. (canceled) 16. A method for controlling resources for a service session by a policy and charging system in a communication network, the method comprising:
obtaining, at a first network node, a request including service session data indicating the type of service; determining, based on the service session data obtained at said first network node, a resource type to be assigned to said service; and sending to a second network node an indication of said resource type assigned to said service, according to which resource type it is determined when a service session associated with said service is terminated, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 17. The method of claim 16, wherein determining the resource type comprises determining whether the communication network or a user terminal or both support, of a plurality of bearers, a dedicated bearer that is a bearer dedicated to said service. 18. The method of claim 16, further comprising:
sending, from said second network node, the request including said service session data indicating the type of service to said first network node; receiving from said first network node the indication of a resource type determined based on said service session data and assigned to said service; and deciding when to terminate a service session associated with said service based on said received resource type. 19. The method of claim 16, wherein if the resource type indicates that resources are permanently reserved, said second network node will not take any action. 20. The method of claim 16, wherein if the resource type indicates that resources are temporarily reserved, said second network node will activate a timer. 21. The method of claim 20, wherein said second network node initiates a service session termination when said timer expires. 22. The method of claim 16, wherein if the resource type indicates that resources are permanently reserved, said second network node activates a timer that is longer than a timer that is activated if the resource type indicates that resources are temporarily reserved. 23. The method of claim 16, wherein the resource type implies the generation of a non-guaranteed bit rate bearer or guaranteed bit rate bearer. 24. The method of claim 16, wherein said first network node comprises a policy and charging rules function (PCRF), or said second network node comprises an application function or traffic detection function. 25. The method of claim 24, wherein said traffic detection function performs packet inspection and service classification. 26. A method for controlling resources for a service session in a communication network, the method comprising:
sending, from a second network node, a request including service session data indicating the type of service to a first network node; receiving from said first network node an indication of a resource type determined based on said service session data and assigned to said service; and deciding when to terminate a service session associated with said service based on said received resource type, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 27. The method of claim 26, further comprising said second network node taking no further action in response to the indication, in response to determining that the resource type indicates that resources are permanently reserved. 28. The method of claim 26, further comprising said second network node activating a timer, in response to determining that the resource type indicates that resources are temporarily reserved. 29. The method of claim 28, further comprising said second network node initiating a service session termination when said timer expires. 30. The method of claim 26, further comprising said second network node, in response to determining that the resource type indicates that resources are permanently reserved, activating a timer that is longer than a timer that is activated in response to determining that the resource type indicates that resources are temporarily reserved. 31. The method of claim 26, wherein the resource type implies the generation of a non-guaranteed bit rate bearer or guaranteed bit rate bearer. 32. The method of claim 26, wherein said first network node comprises a policy and charging rules function (PCRF) or said second network node comprises an application function or traffic detection function. 33. The method of claim 32, wherein said traffic detection function performs packet inspection and service classification. 34. A network node for controlling resources for a service session in a communication network, the network node comprising:
a request obtainer configured to obtain a request including service session data indicating the type of service; a determiner configured to determine, based on the obtained service session data, a resource type to be assigned to said service; and a resource type sender configured to send to a second network node an indication of said resource type assigned to said service, according to which resource type it is determined when a service session associated with said service is terminated, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 35. A network node for controlling resources for a service session in a communication network, the network node comprising:
a request sender configured to send a request including service session data indicating the type of service to another network node; a resource type receiver configured to receive from said other network node an indication of a resource type determined based on said service session data and assigned to said service; and a decider configured to decide when to terminate a service session associated with said service based on said received resource type, wherein said resource type indicates that resources are temporarily reserved for said service or said resource type indicates that resources are permanently reserved for said service resource type. 36. A non-transitory computer-readable medium comprising, stored thereupon, a computer program, the computer program including instructions configured so as to cause, when executed on a data processor, the data processor to execute the method of claim 16. 37. A non-transitory computer-readable medium comprising, stored thereupon, a computer program, the computer program including instructions configured so as to cause, when executed on a data processor, the data processor to execute the method of claim 26. | 2,400 |
7,602 | 7,602 | 13,979,592 | 2,486 | A video encoding device for encoding video using inter prediction includes encoding control means 11 for controlling an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size (PA) and a CU size (PB) of the CU to be encoded. A video decoding device includes decoding control means for controlling an inter-PU partition of a CU to be decoded, based on the minimum inter-PU size (PA) and the size (PB) of the CU to be decoded. | 1. A video encoding device for encoding video using inter prediction, comprising:
an encoding control unit which controls an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size and a CU size of the CU to be encoded. 2. The video encoding device according to claim 1, further comprising a multiplexer which multiplexes the minimum inter-PU size into a bitstream. 3. The video encoding device according to claim 1, further comprising an entropy encoder,
wherein the encoding control unit causes the entropy encoder to set an inter-PU partition type syntax at a predetermined inter-PU partition type in a PU header layer of the CU to be encoded, and entropy-encode the inter-PU partition type syntax when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size. 4. The video encoding device according to claim 1, further comprising an entropy encoder,
wherein the encoding control unit causes the entropy encoder not to entropy-encode an inter-PU partition type syntax in a PU header layer of the CU to be encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size, while the encoding control unit causes the entropy encoder to entropy-encode the inter-PU partition type syntax in the PU header layer of the CU to be encoded when the CU size of the CU to be encoded is greater than the minimum inter-PU size. 5. A video decoding device for decoding video using inter prediction, comprising:
a decoding control unit which controls an inter-PU partition of a CU to be decoded, based on a minimum inter-PU size and a size of the CU to be decoded. 6. The video decoding device according to claim 5, further comprising a de-multiplexer which de-multiplexes the minimum inter-PU size multiplexed into a bitstream. 7. The video decoding device according to claim 5, further comprising an entropy decoder,
wherein the decoding control unit causes the entropy decoder not to entropy-decode an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is less than or equal to the minimum inter-PU size, while the decoding control unit causes the entropy decoder to set a predetermined inter-PU partition type at an inter-PU partition type of the CU to be decoded when the PU of the CU to be decoded is the inter PU and the CU size of the CU to be decoded is not less than or equal to the minimum inter-PU size. 8. The video decoding device according to claim 5, further comprising an entropy decoder,
wherein the decoding control unit causes the entropy decoder to entropy-decode an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is greater than the minimum inter-PU size. 9. The video decoding device according to claim 5, wherein the decoding control unit determines that there is an error in an access unit accessing a bitstream including a decoded CU when an inter-PU size of the decoded CU is less than the minimum inter-PU size. 10. A video encoding method for encoding video using inter prediction, comprising:
controlling an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size and a CU size of the CU to be encoded. 11. The video encoding method according to claim 10, further comprising:
multiplexing the minimum inter-PU size into a bitstream. 12. The video encoding method according to claim 10,
wherein an inter-PU partition type syntax in a PU header layer of the CU to be encoded is set at a predetermined inter-PU partition type in the PU header layer of the CU to be encoded, and entropy-encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size. 13. The video encoding method according to claim 10, wherein an inter-PU partition type syntax in a PU header layer of the CU to be encoded is not entropy-encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size, while the inter-PU partition type syntax in the PU header layer of the CU to be encoded is entropy-encoded when the CU size of the CU to be encoded is greater than the minimum inter-PU size. 14. A video decoding method for decoding video using inter prediction, comprising:
controlling an inter-PU partition of a CU to be decoded, based on a minimum inter-PU size and a size of the CU to be decoded. 15. The video decoding method according to claim 14, wherein the minimum inter-PU size multiplexed into a bitstream is de-multiplexed. 16. The video decoding method according to claim 14, wherein an inter-PU partition type syntax in a PU header layer of the CU to be decoded is not entropy-decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is less than or equal to the minimum inter-PU size, while an inter-PU partition type of the CU to be decoded is set at a predetermined inter-PU partition type when the PU of the CU to be decoded is the inter PU and the CU size of the CU to be decoded is not less than or equal to the minimum inter-PU size. 17. The video decoding method according to claim 14, wherein an inter-PU partition type syntax in a PU header layer of the CU to be decoded is entropy-decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is greater than the minimum inter-PU size. 18. The video decoding method according to claim 14, wherein it is determined that there is an error in an access unit accessing a bitstream including a decoded CU when an inter-PU size of the decoded CU is less than the minimum inter-PU size. 19. A non-transitory computer readable information recording medium storing a video encoding program for encoding video using inter prediction, when executed by a processor, performs a method for:
controlling an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size and a CU size of the CU to be encoded. 20. The computer readable information recording medium according to claim 19, further comprising: multiplexing the minimum inter-PU size into a bitstream. 21. The computer readable information recording medium according to claim 19, further comprising: setting an inter-PU partition type syntax at a predetermined inter-PU partition type in a PU header layer of the CU to be encoded, and entropy-encoding the inter-PU partition type syntax when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size. 22. The computer readable information recording medium according to claim 19, further comprising: inhibiting entropy-encoding an inter-PU partition type syntax in a PU header layer of the CU to be encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size, and executing the process of entropy-encoding the inter-PU partition type syntax in the PU header layer of the CU to be encoded when the CU size of the CU to be encoded is greater than the minimum inter-PU size. 23. A non-transitory computer readable information recording medium storing a video decoding program for decoding video using inter prediction, when executed by a processor, performs a method for: controlling an inter-PU partition of a CU to be decoded, based on a minimum inter-PU size and a size of the CU to be decoded. 24. The computer readable information recording medium according to claim 23, further comprising: de-multiplexing the minimum inter-PU size multiplexed into a bitstream. 25. The computer readable information recording medium according to claim 23, further comprising: inhibiting entropy-decoding an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is less than or equal to the minimum inter-PU size, and executing a process of setting, to a predetermined inter-PU partition type, an inter-PU partition type of the CU to be decoded when the PU of the CU to be decoded is the inter PU and the CU size of the CU to be decoded is not less than or equal to the minimum inter-PU size. 26. The computer readable information recording medium according to claim 23, further comprising: entropy-decoding an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is greater than the minimum inter-PU size. 27. The computer readable information recording medium according to claim 23, further comprising: determining that there is an error in an access unit accessing a bitstream including a decoded CU when an inter-PU size of the decoded CU is less than the minimum inter-PU size. | A video encoding device for encoding video using inter prediction includes encoding control means 11 for controlling an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size (PA) and a CU size (PB) of the CU to be encoded. A video decoding device includes decoding control means for controlling an inter-PU partition of a CU to be decoded, based on the minimum inter-PU size (PA) and the size (PB) of the CU to be decoded.1. A video encoding device for encoding video using inter prediction, comprising:
an encoding control unit which controls an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size and a CU size of the CU to be encoded. 2. The video encoding device according to claim 1, further comprising a multiplexer which multiplexes the minimum inter-PU size into a bitstream. 3. The video encoding device according to claim 1, further comprising an entropy encoder,
wherein the encoding control unit causes the entropy encoder to set an inter-PU partition type syntax at a predetermined inter-PU partition type in a PU header layer of the CU to be encoded, and entropy-encode the inter-PU partition type syntax when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size. 4. The video encoding device according to claim 1, further comprising an entropy encoder,
wherein the encoding control unit causes the entropy encoder not to entropy-encode an inter-PU partition type syntax in a PU header layer of the CU to be encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size, while the encoding control unit causes the entropy encoder to entropy-encode the inter-PU partition type syntax in the PU header layer of the CU to be encoded when the CU size of the CU to be encoded is greater than the minimum inter-PU size. 5. A video decoding device for decoding video using inter prediction, comprising:
a decoding control unit which controls an inter-PU partition of a CU to be decoded, based on a minimum inter-PU size and a size of the CU to be decoded. 6. The video decoding device according to claim 5, further comprising a de-multiplexer which de-multiplexes the minimum inter-PU size multiplexed into a bitstream. 7. The video decoding device according to claim 5, further comprising an entropy decoder,
wherein the decoding control unit causes the entropy decoder not to entropy-decode an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is less than or equal to the minimum inter-PU size, while the decoding control unit causes the entropy decoder to set a predetermined inter-PU partition type at an inter-PU partition type of the CU to be decoded when the PU of the CU to be decoded is the inter PU and the CU size of the CU to be decoded is not less than or equal to the minimum inter-PU size. 8. The video decoding device according to claim 5, further comprising an entropy decoder,
wherein the decoding control unit causes the entropy decoder to entropy-decode an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is greater than the minimum inter-PU size. 9. The video decoding device according to claim 5, wherein the decoding control unit determines that there is an error in an access unit accessing a bitstream including a decoded CU when an inter-PU size of the decoded CU is less than the minimum inter-PU size. 10. A video encoding method for encoding video using inter prediction, comprising:
controlling an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size and a CU size of the CU to be encoded. 11. The video encoding method according to claim 10, further comprising:
multiplexing the minimum inter-PU size into a bitstream. 12. The video encoding method according to claim 10,
wherein an inter-PU partition type syntax in a PU header layer of the CU to be encoded is set at a predetermined inter-PU partition type in the PU header layer of the CU to be encoded, and entropy-encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size. 13. The video encoding method according to claim 10, wherein an inter-PU partition type syntax in a PU header layer of the CU to be encoded is not entropy-encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size, while the inter-PU partition type syntax in the PU header layer of the CU to be encoded is entropy-encoded when the CU size of the CU to be encoded is greater than the minimum inter-PU size. 14. A video decoding method for decoding video using inter prediction, comprising:
controlling an inter-PU partition of a CU to be decoded, based on a minimum inter-PU size and a size of the CU to be decoded. 15. The video decoding method according to claim 14, wherein the minimum inter-PU size multiplexed into a bitstream is de-multiplexed. 16. The video decoding method according to claim 14, wherein an inter-PU partition type syntax in a PU header layer of the CU to be decoded is not entropy-decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is less than or equal to the minimum inter-PU size, while an inter-PU partition type of the CU to be decoded is set at a predetermined inter-PU partition type when the PU of the CU to be decoded is the inter PU and the CU size of the CU to be decoded is not less than or equal to the minimum inter-PU size. 17. The video decoding method according to claim 14, wherein an inter-PU partition type syntax in a PU header layer of the CU to be decoded is entropy-decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is greater than the minimum inter-PU size. 18. The video decoding method according to claim 14, wherein it is determined that there is an error in an access unit accessing a bitstream including a decoded CU when an inter-PU size of the decoded CU is less than the minimum inter-PU size. 19. A non-transitory computer readable information recording medium storing a video encoding program for encoding video using inter prediction, when executed by a processor, performs a method for:
controlling an inter-PU partition type of a CU to be encoded, based on a minimum inter-PU size and a CU size of the CU to be encoded. 20. The computer readable information recording medium according to claim 19, further comprising: multiplexing the minimum inter-PU size into a bitstream. 21. The computer readable information recording medium according to claim 19, further comprising: setting an inter-PU partition type syntax at a predetermined inter-PU partition type in a PU header layer of the CU to be encoded, and entropy-encoding the inter-PU partition type syntax when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size. 22. The computer readable information recording medium according to claim 19, further comprising: inhibiting entropy-encoding an inter-PU partition type syntax in a PU header layer of the CU to be encoded when the CU size of the CU to be encoded is less than or equal to the minimum inter-PU size, and executing the process of entropy-encoding the inter-PU partition type syntax in the PU header layer of the CU to be encoded when the CU size of the CU to be encoded is greater than the minimum inter-PU size. 23. A non-transitory computer readable information recording medium storing a video decoding program for decoding video using inter prediction, when executed by a processor, performs a method for: controlling an inter-PU partition of a CU to be decoded, based on a minimum inter-PU size and a size of the CU to be decoded. 24. The computer readable information recording medium according to claim 23, further comprising: de-multiplexing the minimum inter-PU size multiplexed into a bitstream. 25. The computer readable information recording medium according to claim 23, further comprising: inhibiting entropy-decoding an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is less than or equal to the minimum inter-PU size, and executing a process of setting, to a predetermined inter-PU partition type, an inter-PU partition type of the CU to be decoded when the PU of the CU to be decoded is the inter PU and the CU size of the CU to be decoded is not less than or equal to the minimum inter-PU size. 26. The computer readable information recording medium according to claim 23, further comprising: entropy-decoding an inter-PU partition type syntax in a PU header layer of the CU to be decoded when a PU of the CU to be decoded is an inter PU and a CU size of the CU to be decoded is greater than the minimum inter-PU size. 27. The computer readable information recording medium according to claim 23, further comprising: determining that there is an error in an access unit accessing a bitstream including a decoded CU when an inter-PU size of the decoded CU is less than the minimum inter-PU size. | 2,400 |
7,603 | 7,603 | 14,976,489 | 2,485 | System and techniques for enhanced imaging are described herein. Light from an environment may be sampled to create an image. Energy reflected from the environment may also be sampled to create a depth image of the environment. A classifier may be applied to both the image and the depth image to provide a set of object properties for an object in the environment. A composite image may be constructed that includes portions of the image and depth image representing the object as well as the object properties. | 1. At least one machine readable medium including instructions for enhanced imaging, the instructions, when executed by a machine, cause the machine to perform operations comprising:
sampling light from the environment to create an image; sampling reflected energy from the environment contemporaneously to the sampling of the light to create a depth image of the environment; applying a classifier to the image and the depth image to provide a set of object properties of an object in the environment; and constructing a composite image that includes a portion of the image in which the object is represented, a corresponding portion of the depth image, and the set of object properties. 2. The machine readable medium of claim 1, wherein sampling the reflected energy includes:
emitting light into the environment; and sampling the emitted light. 3. The machine readable medium of claim 1, wherein applying the classifier includes applying a classifier in a device that includes a detector used to perform the sampling of the reflected light. 4. The machine readable medium of claim 1, wherein the set of object properties includes at least one of: object shape; object surface type, object hardness, object identification, or sound absorption. 5. The machine readable medium of claim 1, wherein applying the classifier includes:
performing object recognition on the image and the depth image to identify the object; and extracting properties of the object from a dataset corresponding to the object. 6. The machine readable medium of claim 1, wherein constructing the composite image includes:
encoding the depth image as a channel of the image; and including a geometric representation of the object, the geometric representation registered to the image. 7. The machine readable medium of claim 6, wherein the composite image includes the set of properties as attributes to the geometric representation of the object. 8. The machine readable medium of claim 7, wherein the composite image is a frame from a video of composite images, and wherein the geometric representation of the object changes between frames of the video. 9. A device for enhanced imaging, the device comprising:
a detector to sample light from the environment to create an image; a depth sensor to sample reflected energy from the environment contemporaneously to the sampling of the light to create a depth image of the environment; a classifier to accept the image and the depth image and to provide a set of object properties of an object in the environment; and a compositor to construct a composite image that includes a portion of the image in which the object is represented, a corresponding portion of the depth image, and the set of object properties. 10. The device of claim 9, wherein to sample the reflected energy includes:
an emitter to emit light into the environment; and the detector to sample the emitted light. 11. The device of claim 9, wherein the classifier is in a device that includes a detector used to perform the sampling of the reflected light. 12. The device of claim 9, wherein the set of object properties includes at least one of: object shape; object surface type, object hardness, object identification, or sound absorption. 13. The device of claim 9, wherein to provide the set of object properties includes the classifier to:
perform object recognition on the image and the depth image to identify the object; and extract properties of the object from a dataset corresponding to the object. 14. The device of claim 9, wherein to construct the composite image includes the compositor to:
encode the depth image as a channel of the image; and include a geometric representation of the object, the geometric representation registered to the image. 15. The device of claim 14, wherein the composite image includes the set of properties as attributes to the geometric representation of the object. 16. The device of claim 15, wherein the composite image is a frame from a video of composite images, and wherein the geometric representation of the object changes between frames of the video. 17. A method for enhanced imaging, the method comprising:
sampling light from the environment to create an image; sampling reflected energy from the environment contemporaneously to the sampling of the light to create a depth image of the environment; applying a classifier to the image and the depth image to provide a set of object properties of an object in the environment; and constructing a composite image that includes a portion of the image in which the object is represented, a corresponding portion of the depth image, and the set of object properties. 18. The method of claim 17, wherein sampling the reflected energy includes:
emitting light into the environment; and sampling the emitted light. 19. The method of claim 17, wherein applying the classifier includes applying a classifier in a device that includes a detector used to perform the sampling of the reflected light. 20. The method of claim 17, wherein the set of object properties includes at least one of: object shape; object surface type, object hardness, object identification, or sound absorption. 21. The method of claim 17, wherein applying the classifier includes:
performing object recognition on the image and the depth image to identify the object; and extracting properties of the object from a dataset corresponding to the object. 22. The method of claim 17, wherein constructing the composite image includes:
encoding the depth image as a channel of the image; and including a geometric representation of the object, the geometric representation registered to the image. 23. The method of claim 22, wherein the composite image includes the set of properties as attributes to the geometric representation of the object. 24. The method of claim 23, wherein the composite image is a frame from a video of composite images, and wherein the geometric representation of the object changes between frames of the video. | System and techniques for enhanced imaging are described herein. Light from an environment may be sampled to create an image. Energy reflected from the environment may also be sampled to create a depth image of the environment. A classifier may be applied to both the image and the depth image to provide a set of object properties for an object in the environment. A composite image may be constructed that includes portions of the image and depth image representing the object as well as the object properties.1. At least one machine readable medium including instructions for enhanced imaging, the instructions, when executed by a machine, cause the machine to perform operations comprising:
sampling light from the environment to create an image; sampling reflected energy from the environment contemporaneously to the sampling of the light to create a depth image of the environment; applying a classifier to the image and the depth image to provide a set of object properties of an object in the environment; and constructing a composite image that includes a portion of the image in which the object is represented, a corresponding portion of the depth image, and the set of object properties. 2. The machine readable medium of claim 1, wherein sampling the reflected energy includes:
emitting light into the environment; and sampling the emitted light. 3. The machine readable medium of claim 1, wherein applying the classifier includes applying a classifier in a device that includes a detector used to perform the sampling of the reflected light. 4. The machine readable medium of claim 1, wherein the set of object properties includes at least one of: object shape; object surface type, object hardness, object identification, or sound absorption. 5. The machine readable medium of claim 1, wherein applying the classifier includes:
performing object recognition on the image and the depth image to identify the object; and extracting properties of the object from a dataset corresponding to the object. 6. The machine readable medium of claim 1, wherein constructing the composite image includes:
encoding the depth image as a channel of the image; and including a geometric representation of the object, the geometric representation registered to the image. 7. The machine readable medium of claim 6, wherein the composite image includes the set of properties as attributes to the geometric representation of the object. 8. The machine readable medium of claim 7, wherein the composite image is a frame from a video of composite images, and wherein the geometric representation of the object changes between frames of the video. 9. A device for enhanced imaging, the device comprising:
a detector to sample light from the environment to create an image; a depth sensor to sample reflected energy from the environment contemporaneously to the sampling of the light to create a depth image of the environment; a classifier to accept the image and the depth image and to provide a set of object properties of an object in the environment; and a compositor to construct a composite image that includes a portion of the image in which the object is represented, a corresponding portion of the depth image, and the set of object properties. 10. The device of claim 9, wherein to sample the reflected energy includes:
an emitter to emit light into the environment; and the detector to sample the emitted light. 11. The device of claim 9, wherein the classifier is in a device that includes a detector used to perform the sampling of the reflected light. 12. The device of claim 9, wherein the set of object properties includes at least one of: object shape; object surface type, object hardness, object identification, or sound absorption. 13. The device of claim 9, wherein to provide the set of object properties includes the classifier to:
perform object recognition on the image and the depth image to identify the object; and extract properties of the object from a dataset corresponding to the object. 14. The device of claim 9, wherein to construct the composite image includes the compositor to:
encode the depth image as a channel of the image; and include a geometric representation of the object, the geometric representation registered to the image. 15. The device of claim 14, wherein the composite image includes the set of properties as attributes to the geometric representation of the object. 16. The device of claim 15, wherein the composite image is a frame from a video of composite images, and wherein the geometric representation of the object changes between frames of the video. 17. A method for enhanced imaging, the method comprising:
sampling light from the environment to create an image; sampling reflected energy from the environment contemporaneously to the sampling of the light to create a depth image of the environment; applying a classifier to the image and the depth image to provide a set of object properties of an object in the environment; and constructing a composite image that includes a portion of the image in which the object is represented, a corresponding portion of the depth image, and the set of object properties. 18. The method of claim 17, wherein sampling the reflected energy includes:
emitting light into the environment; and sampling the emitted light. 19. The method of claim 17, wherein applying the classifier includes applying a classifier in a device that includes a detector used to perform the sampling of the reflected light. 20. The method of claim 17, wherein the set of object properties includes at least one of: object shape; object surface type, object hardness, object identification, or sound absorption. 21. The method of claim 17, wherein applying the classifier includes:
performing object recognition on the image and the depth image to identify the object; and extracting properties of the object from a dataset corresponding to the object. 22. The method of claim 17, wherein constructing the composite image includes:
encoding the depth image as a channel of the image; and including a geometric representation of the object, the geometric representation registered to the image. 23. The method of claim 22, wherein the composite image includes the set of properties as attributes to the geometric representation of the object. 24. The method of claim 23, wherein the composite image is a frame from a video of composite images, and wherein the geometric representation of the object changes between frames of the video. | 2,400 |
7,604 | 7,604 | 13,908,669 | 2,468 | The described embodiments of the present invention include a method for controlling authorization of a multimedia service requested by a user device. In one embodiment, the method includes examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; rejecting the service if the service is not supported and if a policy associated with the access network requires unsupported services to be rejected; and authorizing a default level of resources in the access network if the service is not supported and if the policy associated with the access network does not require unsupported services to be rejected. | 1. A method for controlling authorization of a multimedia service requested by a user device comprising:
examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; and rejecting the service if the service is not supported. 2. A method in accordance with claim 1, wherein the user device connects to the access network using mobile IP, the step of examining the identity of an access network associated with the user device comprising extracting the identity from a header associated with a Normal Vendor Specific Extension within the Mobile Internet Protocol. 3. A method in accordance with claim 1, wherein the user device uses a SIP INVITE message to request the multimedia service, the step of examining the identity of the service requested comprising extracting the identity from a header in the SIP INVITE message. 4. A method in accordance with claim 1, wherein the step of authorizing comprises:
obtaining quality of service constraints from the user device; and providing the quality of service constraints to a Policy Function server for use in allocating bearer level resources. 5. A method for controlling authorization of a multimedia service requested by a user device comprising:
examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; and authorizing a default level of resources in the access network if the service is not supported. 6. A method in accordance with claim 5, wherein the user device connects to the access network using mobile IP, the step of examining the identity of an access network associated with the user device comprising extracting the identity from a header associated with a Normal Vendor Specific Extension within the Mobile Internet Protocol. 7. A method in accordance with claim 5, wherein the user device uses a SIP INVITE message to request the multimedia service, the step of examining the identity of the service requested comprising extracting the identity from a header in the SIP INVITE message. 8. A method in accordance with claim 5, wherein the step of authorizing comprises:
obtaining quality of service constraints from the user device; and providing the quality of service constraints to a Policy Function server for use in allocating bearer level resources. 9. A method for controlling authorization of a multimedia service requested by a user device comprising:
examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; rejecting the service if the service is not supported and if a policy associated with the access network requires unsupported services to be rejected; and authorizing a default level of resources in the access network if the service is not supported and if the policy associated with the access network does not require unsupported services to be rejected. 10. A method in accordance with claim 9, wherein the user device connects to the access network using mobile IP, the step of examining the identity of an access network associated with the user device comprising extracting the identity from a header associated with a Normal Vendor Specific Extension within the Mobile Internet Protocol. 11. A method in accordance with claim 9, wherein the user device uses a SIP INVITE message to request the multimedia service, the step of examining the identity of the service requested comprising extracting the identity from a header in the SIP INVITE message. 12. A method in accordance with claim 9, wherein the step of authorizing comprises:
obtaining quality of service constraints from the user device; and providing the quality of service constraints to a Policy Function server for use in allocating bearer level resources. 13-17. (canceled) | The described embodiments of the present invention include a method for controlling authorization of a multimedia service requested by a user device. In one embodiment, the method includes examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; rejecting the service if the service is not supported and if a policy associated with the access network requires unsupported services to be rejected; and authorizing a default level of resources in the access network if the service is not supported and if the policy associated with the access network does not require unsupported services to be rejected.1. A method for controlling authorization of a multimedia service requested by a user device comprising:
examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; and rejecting the service if the service is not supported. 2. A method in accordance with claim 1, wherein the user device connects to the access network using mobile IP, the step of examining the identity of an access network associated with the user device comprising extracting the identity from a header associated with a Normal Vendor Specific Extension within the Mobile Internet Protocol. 3. A method in accordance with claim 1, wherein the user device uses a SIP INVITE message to request the multimedia service, the step of examining the identity of the service requested comprising extracting the identity from a header in the SIP INVITE message. 4. A method in accordance with claim 1, wherein the step of authorizing comprises:
obtaining quality of service constraints from the user device; and providing the quality of service constraints to a Policy Function server for use in allocating bearer level resources. 5. A method for controlling authorization of a multimedia service requested by a user device comprising:
examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; and authorizing a default level of resources in the access network if the service is not supported. 6. A method in accordance with claim 5, wherein the user device connects to the access network using mobile IP, the step of examining the identity of an access network associated with the user device comprising extracting the identity from a header associated with a Normal Vendor Specific Extension within the Mobile Internet Protocol. 7. A method in accordance with claim 5, wherein the user device uses a SIP INVITE message to request the multimedia service, the step of examining the identity of the service requested comprising extracting the identity from a header in the SIP INVITE message. 8. A method in accordance with claim 5, wherein the step of authorizing comprises:
obtaining quality of service constraints from the user device; and providing the quality of service constraints to a Policy Function server for use in allocating bearer level resources. 9. A method for controlling authorization of a multimedia service requested by a user device comprising:
examining an identity of an access network associated with the user device and an identity of the service requested to determine whether the service is supported; authorizing resources in the access network required by the service if the service is supported; rejecting the service if the service is not supported and if a policy associated with the access network requires unsupported services to be rejected; and authorizing a default level of resources in the access network if the service is not supported and if the policy associated with the access network does not require unsupported services to be rejected. 10. A method in accordance with claim 9, wherein the user device connects to the access network using mobile IP, the step of examining the identity of an access network associated with the user device comprising extracting the identity from a header associated with a Normal Vendor Specific Extension within the Mobile Internet Protocol. 11. A method in accordance with claim 9, wherein the user device uses a SIP INVITE message to request the multimedia service, the step of examining the identity of the service requested comprising extracting the identity from a header in the SIP INVITE message. 12. A method in accordance with claim 9, wherein the step of authorizing comprises:
obtaining quality of service constraints from the user device; and providing the quality of service constraints to a Policy Function server for use in allocating bearer level resources. 13-17. (canceled) | 2,400 |
7,605 | 7,605 | 14,797,764 | 2,446 | A network includes at least two nodes that employ a routing protocol to communicate across a network. One of the nodes is a parent node and another of the nodes is a child node of the parent node. An address generator assigns a unique network address to the child node by appending an address value of a number of bits to a parent address of the parent node to create the unique network address for the child node. | 1. A network comprising:
at least two nodes that employ a routing protocol to communicate across a network, where one of the at least two nodes is a parent node and another of the at least two nodes is a child node of the parent node; and an address generator to assign a unique network address to the child node by appending an address value of a number of bits to a parent address of the parent node to create the unique network address for the child node. 2. The network of claim 1, wherein the routing protocol is a Routing for Low Power Networks (RPL) protocol. 3. The network of claim 1, wherein the address generator resides in the parent node, in the child node, or in the parent node and the child node. 4. The network of claim 1, wherein the parent node and the child node are configured as a destination oriented directed acyclic graph (DODAG). 5. The network of claim 1, wherein the unique network address of the child node is stored in a prefix address portion of an Internet Protocol V6 (IPV6) Internet address for the child node. 6. The network of claim 1, further comprising an address router that performs a comparison between unique address values of at least two child nodes and a destination address that is specified in a message and routes the message through a selected one of the at least two child nodes to another node that is a closest match to the destination address. 7. The network of claim 1, wherein the child node announces its unique network address via a destination advertisement object (DAO) directed to the parent node in response to an information object message sent by the parent node. 8. The network of claim 1, wherein the address generator sets the address value of the number of bits to a predetermined identifier for the child node that is appended to the address of its parent node to create the unique network address for the child node. 9. The network of claim 1, wherein the address generator includes a random address generator to generate a random number as the address value of the number of bits that is appended to the address of the parent node to create the unique network address for the child node. 10. The network of claim 9, wherein the address generator further comprises a duplicate detector to detect an addressing conflict between at least two child nodes in a common network hierarchy level having the same unique network address. 11. The network of claim 10, wherein the address generator determines a subsequent random number via the random address generator if the addressing conflict is detected. 12. The network of claim 1, wherein the address generator of a given node employs a dynamic host configuration protocol (DHCP) to determine the address value that is appended to the address of the parent node to create the unique network address for each of its child nodes. 13. The network of claim 1, wherein the child node utilizes a domain name service (DNS) to determine a network address for at least one other node in the network. 14. A method comprising:
receiving a network address of a parent node at a child node from a network; appending an address value of a number of bits to the received network address of the parent node to create a unique network address assigned to the child node; and communicating the unique network address assigned to the child node to the parent node via the network. 15. The method of claim 14, further comprising performing a comparison between address values of at least two child nodes and a destination address and routing a message to a selected one of the at least two child nodes that is a closest match to the destination address. 16. The method of claim 14, further comprising assigning the address value of the number of bits of the child node via a predetermined unique identifier. 17. The method of claim 14, further comprising generating a random number to assign the address value of the number of bits of the child node. 18. The method of claim 14, further comprising utilizing a dynamic host configuration protocol (DHCP) to assign the address value of the number of bits of the child node. 19. A system comprising:
a parent node to communicate a network address of the parent node via a routing protocol to a network; a child node to receive the parent address from the network via the routing protocol; an address generator to append an address value of a number of bits to the network address of the parent node to create the unique network address for the child node; and an address router that performs a comparison between unique address values of at least two child nodes in the network and a received destination address of a message from the network and routes the message through one of the at least two child nodes to a destination node that is a closest match to the destination address. 20. The system of claim 20, wherein the address generator sets the address value to the number of bits of the unique network address via a predetermined identifier setting in the child node, a random number generated in the child node, or via a dynamic host configuration protocol (DHCP). | A network includes at least two nodes that employ a routing protocol to communicate across a network. One of the nodes is a parent node and another of the nodes is a child node of the parent node. An address generator assigns a unique network address to the child node by appending an address value of a number of bits to a parent address of the parent node to create the unique network address for the child node.1. A network comprising:
at least two nodes that employ a routing protocol to communicate across a network, where one of the at least two nodes is a parent node and another of the at least two nodes is a child node of the parent node; and an address generator to assign a unique network address to the child node by appending an address value of a number of bits to a parent address of the parent node to create the unique network address for the child node. 2. The network of claim 1, wherein the routing protocol is a Routing for Low Power Networks (RPL) protocol. 3. The network of claim 1, wherein the address generator resides in the parent node, in the child node, or in the parent node and the child node. 4. The network of claim 1, wherein the parent node and the child node are configured as a destination oriented directed acyclic graph (DODAG). 5. The network of claim 1, wherein the unique network address of the child node is stored in a prefix address portion of an Internet Protocol V6 (IPV6) Internet address for the child node. 6. The network of claim 1, further comprising an address router that performs a comparison between unique address values of at least two child nodes and a destination address that is specified in a message and routes the message through a selected one of the at least two child nodes to another node that is a closest match to the destination address. 7. The network of claim 1, wherein the child node announces its unique network address via a destination advertisement object (DAO) directed to the parent node in response to an information object message sent by the parent node. 8. The network of claim 1, wherein the address generator sets the address value of the number of bits to a predetermined identifier for the child node that is appended to the address of its parent node to create the unique network address for the child node. 9. The network of claim 1, wherein the address generator includes a random address generator to generate a random number as the address value of the number of bits that is appended to the address of the parent node to create the unique network address for the child node. 10. The network of claim 9, wherein the address generator further comprises a duplicate detector to detect an addressing conflict between at least two child nodes in a common network hierarchy level having the same unique network address. 11. The network of claim 10, wherein the address generator determines a subsequent random number via the random address generator if the addressing conflict is detected. 12. The network of claim 1, wherein the address generator of a given node employs a dynamic host configuration protocol (DHCP) to determine the address value that is appended to the address of the parent node to create the unique network address for each of its child nodes. 13. The network of claim 1, wherein the child node utilizes a domain name service (DNS) to determine a network address for at least one other node in the network. 14. A method comprising:
receiving a network address of a parent node at a child node from a network; appending an address value of a number of bits to the received network address of the parent node to create a unique network address assigned to the child node; and communicating the unique network address assigned to the child node to the parent node via the network. 15. The method of claim 14, further comprising performing a comparison between address values of at least two child nodes and a destination address and routing a message to a selected one of the at least two child nodes that is a closest match to the destination address. 16. The method of claim 14, further comprising assigning the address value of the number of bits of the child node via a predetermined unique identifier. 17. The method of claim 14, further comprising generating a random number to assign the address value of the number of bits of the child node. 18. The method of claim 14, further comprising utilizing a dynamic host configuration protocol (DHCP) to assign the address value of the number of bits of the child node. 19. A system comprising:
a parent node to communicate a network address of the parent node via a routing protocol to a network; a child node to receive the parent address from the network via the routing protocol; an address generator to append an address value of a number of bits to the network address of the parent node to create the unique network address for the child node; and an address router that performs a comparison between unique address values of at least two child nodes in the network and a received destination address of a message from the network and routes the message through one of the at least two child nodes to a destination node that is a closest match to the destination address. 20. The system of claim 20, wherein the address generator sets the address value to the number of bits of the unique network address via a predetermined identifier setting in the child node, a random number generated in the child node, or via a dynamic host configuration protocol (DHCP). | 2,400 |
7,606 | 7,606 | 13,771,560 | 2,447 | A method for automatically ascertaining the presence of shared data elements stored on multiple storage resources in a network, the method including automatically ascertaining the presence of multiple storage resources on the network by continuously monitoring the network, for each of the multiple storage resources ascertained to be present in the network, automatically ascertaining the presence of shared data elements associated with data elements stored thereon, and for each of the shared data elements ascertained to be stored on the multiple storage resources in the network, automatically ascertaining at least one property of at least one share designator associated with each of the shared data elements. | 1. A method for automatically ascertaining the presence of shared data elements stored on multiple storage resources in a network, the method comprising:
automatically ascertaining the presence of said multiple storage resources on said network by continuously monitoring said network; for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the presence of shared data elements associated with data elements stored thereon; and for each of said shared data elements ascertained to be stored on said multiple storage resources in said network, automatically ascertaining at least one property of at least one share designator associated with each of said shared data elements. 2. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 1 and also comprising:
for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the removal of shared data elements associated with data elements stored thereon by continuously monitoring said network. 3. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 1 and also comprising:
for each of said shared data elements ascertained to have been created, automatically ascertaining modifications of said at least one property of said at least one share designator associated with each said shared data elements. 4. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 3 and also comprising:
for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, sending an alert to at least one user of said network. 5. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 1 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. 6. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network, the method comprising:
automatically ascertaining the presence of said multiple storage resources on said network by continuously monitoring said network; for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the creation of shared data elements associated with data elements stored thereon by continuously monitoring said network; and for each of said shared data elements ascertained to have been created, automatically ascertaining at least one property of at least one share designator associated with each said shared data element. 7. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and also comprising:
for each of said shared data elements ascertained to have been created, sending an alert to at least one user of said network. 8. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and also comprising:
for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the removal of shared data elements associated with data elements stored thereon by continuously monitoring said network. 9. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 8 and also comprising:
for each of said shared data elements ascertained to have been removed, sending an alert to at least one user of said network. 10. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and also comprising:
for each of said shared data elements ascertained to have been created, automatically ascertaining modifications of said at least one property of said at least one share designator associated with each said shared data elements. 11. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 10 and also comprising:
for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, sending an alert to at least one user of said network. 12. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. 13. A system for automatically ascertaining the presence of shared data elements stored on multiple storage resources in a network, the system comprising:
network monitoring functionality operative for continuously monitoring said network and automatically ascertaining the presence of said multiple storage resources on said network; storage resource monitoring functionality operative for continuously monitoring said network and automatically ascertaining the presence of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network; and shared data element monitoring functionality operative for automatically ascertaining at least one property of at least one share designator associated with each of said shared data elements ascertained to be stored on said multiple storage resources in said network. 14. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 13 and wherein said storage resource monitoring functionality is also operative for continuously monitoring said network and automatically ascertaining the removal of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network. 15. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 13 and wherein said shared data element monitoring functionality is also operative for automatically ascertaining modifications of said at least one property of said at least one share designator associated with each of said shared data elements ascertained to have been created. 16. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 15 and also comprising alerting functionality operative, for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, to send an alert to at least one user of said network. 17. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 13 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. 18. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network, the system comprising:
network monitoring functionality operative for continuously monitoring said network and automatically ascertaining the presence of said multiple storage resources on said network; storage resource monitoring functionality operative for continuously monitoring said network and automatically ascertaining the creation of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network; and shared data element monitoring functionality operative for automatically ascertaining at least one property of at least one share designator associated with each of said shared data elements ascertained to have been created. 19. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and also comprising alerting functionality operative, for each of said shared data elements ascertained to have been created, to send an alert to at least one user of said network. 20. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and wherein said storage resource monitoring functionality is also operative for continuously monitoring said network and automatically ascertaining the removal of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network. 21. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 20 and also comprising alerting functionality operative, for each of said shared data elements ascertained to have been removed, to send an alert to at least one user of said network. 22. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and wherein said shared data element monitoring functionality is also operative for automatically ascertaining modifications of said at least one property of said at least one share designator associated with each of said shared data elements ascertained to have been created. 23. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 22 and also comprising alerting functionality operative, for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, to send an alert to at least one user of said network. 24. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. | A method for automatically ascertaining the presence of shared data elements stored on multiple storage resources in a network, the method including automatically ascertaining the presence of multiple storage resources on the network by continuously monitoring the network, for each of the multiple storage resources ascertained to be present in the network, automatically ascertaining the presence of shared data elements associated with data elements stored thereon, and for each of the shared data elements ascertained to be stored on the multiple storage resources in the network, automatically ascertaining at least one property of at least one share designator associated with each of the shared data elements.1. A method for automatically ascertaining the presence of shared data elements stored on multiple storage resources in a network, the method comprising:
automatically ascertaining the presence of said multiple storage resources on said network by continuously monitoring said network; for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the presence of shared data elements associated with data elements stored thereon; and for each of said shared data elements ascertained to be stored on said multiple storage resources in said network, automatically ascertaining at least one property of at least one share designator associated with each of said shared data elements. 2. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 1 and also comprising:
for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the removal of shared data elements associated with data elements stored thereon by continuously monitoring said network. 3. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 1 and also comprising:
for each of said shared data elements ascertained to have been created, automatically ascertaining modifications of said at least one property of said at least one share designator associated with each said shared data elements. 4. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 3 and also comprising:
for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, sending an alert to at least one user of said network. 5. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 1 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. 6. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network, the method comprising:
automatically ascertaining the presence of said multiple storage resources on said network by continuously monitoring said network; for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the creation of shared data elements associated with data elements stored thereon by continuously monitoring said network; and for each of said shared data elements ascertained to have been created, automatically ascertaining at least one property of at least one share designator associated with each said shared data element. 7. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and also comprising:
for each of said shared data elements ascertained to have been created, sending an alert to at least one user of said network. 8. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and also comprising:
for each of said multiple storage resources ascertained to be present in said network, automatically ascertaining the removal of shared data elements associated with data elements stored thereon by continuously monitoring said network. 9. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 8 and also comprising:
for each of said shared data elements ascertained to have been removed, sending an alert to at least one user of said network. 10. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and also comprising:
for each of said shared data elements ascertained to have been created, automatically ascertaining modifications of said at least one property of said at least one share designator associated with each said shared data elements. 11. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 10 and also comprising:
for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, sending an alert to at least one user of said network. 12. A method for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 6 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. 13. A system for automatically ascertaining the presence of shared data elements stored on multiple storage resources in a network, the system comprising:
network monitoring functionality operative for continuously monitoring said network and automatically ascertaining the presence of said multiple storage resources on said network; storage resource monitoring functionality operative for continuously monitoring said network and automatically ascertaining the presence of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network; and shared data element monitoring functionality operative for automatically ascertaining at least one property of at least one share designator associated with each of said shared data elements ascertained to be stored on said multiple storage resources in said network. 14. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 13 and wherein said storage resource monitoring functionality is also operative for continuously monitoring said network and automatically ascertaining the removal of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network. 15. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 13 and wherein said shared data element monitoring functionality is also operative for automatically ascertaining modifications of said at least one property of said at least one share designator associated with each of said shared data elements ascertained to have been created. 16. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 15 and also comprising alerting functionality operative, for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, to send an alert to at least one user of said network. 17. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 13 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. 18. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network, the system comprising:
network monitoring functionality operative for continuously monitoring said network and automatically ascertaining the presence of said multiple storage resources on said network; storage resource monitoring functionality operative for continuously monitoring said network and automatically ascertaining the creation of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network; and shared data element monitoring functionality operative for automatically ascertaining at least one property of at least one share designator associated with each of said shared data elements ascertained to have been created. 19. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and also comprising alerting functionality operative, for each of said shared data elements ascertained to have been created, to send an alert to at least one user of said network. 20. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and wherein said storage resource monitoring functionality is also operative for continuously monitoring said network and automatically ascertaining the removal of shared data elements associated with data elements stored on each of said multiple storage resources ascertained to be present in said network. 21. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 20 and also comprising alerting functionality operative, for each of said shared data elements ascertained to have been removed, to send an alert to at least one user of said network. 22. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and wherein said shared data element monitoring functionality is also operative for automatically ascertaining modifications of said at least one property of said at least one share designator associated with each of said shared data elements ascertained to have been created. 23. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 22 and also comprising alerting functionality operative, for each of said at least one property of said at least one share designator associated with each said shared data elements ascertained to have been modified, to send an alert to at least one user of said network. 24. A system for automatically ascertaining the creation of shared data elements stored on multiple storage resources in a network according to claim 18 and wherein said at least one property includes at least one of:
name of a share designator;
network path of the shared data element designated by the share designator;
access permissions of a share designator;
identification of a person creating, removing or modifying a share designator; and
network location of the person creating, removing or changing a share designator at the time of creating, removing or changing said share designator. | 2,400 |
7,607 | 7,607 | 15,595,384 | 2,413 | A differentiated routing system is provided for routing a communication service according to an access point of a subscriber terminal to a first network domain. The system includes a computing system executing a core routing engine (CRE) that receives a request for a communication service from the subscriber terminal. When the communication service is to be routed to a second network domain, the CRE identifies an access point at which the subscriber terminal accesses the first network domain, includes a tag in the request according to the identified access point. The tag includes information to be used by the second network domain for routing the communication service. The CRE then transmits the request to the second network domain. | 1. A differentiated routing system comprising:
a computing system comprising at least one processor and in communication with a subscriber terminal and a first network domain; and a core routing engine (CRE) executable by at least one processor to:
receive a request for a communication service from the subscriber terminal; and
when the communication service is to be routed to a second network domain:
identify an access point (AP) at which the subscriber terminal accesses the first network domain;
include a tag in the request according to the identified access point, the tag including information to be used by the second network domain for routing the communication service; and
transmit the request to the second network domain. 2. The system as recited in claim 1, wherein the AP provides a dedicated access line (DAL) for the subscriber terminal. 3. The system as recited in claim 1, wherein the first network domain and the second network domain both comprise internet protocol (IP) based networks. 4. The system as recited in claim 3, wherein the request comprises a session initiation protocol-uniform resource identifier (SIP-URI) and the tag is included in the SIP-URI. 5. The system as recited in claim 1, wherein the second network domain comprises a second CRE to:
receive the request from the first network domain; and route the communication service through the second network domain according to the tag in the received request. 6. The system as recited in claim 5, further comprising a third network domain having a third CRE to:
receive the request from the second network domain; and route the communication service through the third network domain according to the tag in the received request. 7. The system as recited in claim 5, wherein the second CRE is further executable to:
route the communication service through the second network domain according to information included in the tag. 8. The system as recited in claim 1, wherein the second CRE is further executable to:
receive another request from another subscriber terminal, the other request comprising a tag that is different from the tag of the request; and monitor operating characteristics associated with the communication service provided to the subscriber terminal separately from operating characteristics associated with a communication service provided to the other subscriber terminal. 9. A differentiated routing method comprising:
receiving a request for a communication service from a subscriber terminal by a first core routing engine (CRE) of a first network domain; and when the communication service is to be routed to a second network domain:
identifying an access point at which the subscriber terminal accesses the first network domain;
including a tag in the request according to the identified access point, the tag including information to be used by the second network domain for routing the communication service; and
transmitting the request to the second network domain. 10. The method as recited in claim 9, further comprising providing a dedicated access line (DAL) for the subscriber terminal using an access point (AP). 11. The method as recited in claim 9, wherein the first network domain and the second network domain both comprise internet protocol (IP) based networks. 12. The method as recited in claim 11, further comprising appending the tag in a session initiation protocol-uniform resource identifier (SIP-URI). 13. The method as recited in claim 9, further comprising:
receiving the request from the first network domain via a second CRE of the second network domain; and routing the communication service through the second network domain according to the tag in the received request. 14. The method as recited in claim 13, further comprising:
receiving the request from the second network domain via a third CRE of a third network domain; and routing the communication service through the third network domain according to the tag in the received request. 15. A communication network comprising:
a first network domain in communication with a subscriber terminal; and a second network domain in communication with the first network domain; wherein the first network domain comprises a computing system having at least one processor that executes a core routing engine (CRE) to:
receive a request for a communication service from the subscriber terminal; and
when the communication service is to be routed to a second network domain:
identify an access point (AP) at which the subscriber terminal accesses the first network domain;
include a tag in the request according to the identified access point, the tag including information to be used by the second network domain for routing the communication service; and
transmit the request to the second network domain. 16. The communication network as recited in claim 15, wherein the first network domain and the second network domain both comprise internet protocol (IP) based networks. 17. The communication network as recited in claim 15, wherein the CRE is further executed to perform appending the tag to a session initiation protocol-uniform resource identifier (SIP-URI), and transmitting the SIP-URI to the second network domain. 18. The communication network as recited in claim 15, wherein the CRE is further executed to:
receive, via a second CRE of the second network domain, the request from the first network domain; and route the communication service through the second network domain according to the tag included in the received request. 19. The communication network as recited in claim 18, wherein the CRE is further executed to route the communication service through the second network domain according to information included in the tag. 20. The communication network as recited in claim 15, wherein the CRE is further executed to:
receive another request from another subscriber terminal, the other request comprising a tag that is different from the tag of the request; and monitor operating characteristics associated with the communication service provided to the subscriber terminal separately from operating characteristics associated with a communication service provided to the other subscriber terminal. | A differentiated routing system is provided for routing a communication service according to an access point of a subscriber terminal to a first network domain. The system includes a computing system executing a core routing engine (CRE) that receives a request for a communication service from the subscriber terminal. When the communication service is to be routed to a second network domain, the CRE identifies an access point at which the subscriber terminal accesses the first network domain, includes a tag in the request according to the identified access point. The tag includes information to be used by the second network domain for routing the communication service. The CRE then transmits the request to the second network domain.1. A differentiated routing system comprising:
a computing system comprising at least one processor and in communication with a subscriber terminal and a first network domain; and a core routing engine (CRE) executable by at least one processor to:
receive a request for a communication service from the subscriber terminal; and
when the communication service is to be routed to a second network domain:
identify an access point (AP) at which the subscriber terminal accesses the first network domain;
include a tag in the request according to the identified access point, the tag including information to be used by the second network domain for routing the communication service; and
transmit the request to the second network domain. 2. The system as recited in claim 1, wherein the AP provides a dedicated access line (DAL) for the subscriber terminal. 3. The system as recited in claim 1, wherein the first network domain and the second network domain both comprise internet protocol (IP) based networks. 4. The system as recited in claim 3, wherein the request comprises a session initiation protocol-uniform resource identifier (SIP-URI) and the tag is included in the SIP-URI. 5. The system as recited in claim 1, wherein the second network domain comprises a second CRE to:
receive the request from the first network domain; and route the communication service through the second network domain according to the tag in the received request. 6. The system as recited in claim 5, further comprising a third network domain having a third CRE to:
receive the request from the second network domain; and route the communication service through the third network domain according to the tag in the received request. 7. The system as recited in claim 5, wherein the second CRE is further executable to:
route the communication service through the second network domain according to information included in the tag. 8. The system as recited in claim 1, wherein the second CRE is further executable to:
receive another request from another subscriber terminal, the other request comprising a tag that is different from the tag of the request; and monitor operating characteristics associated with the communication service provided to the subscriber terminal separately from operating characteristics associated with a communication service provided to the other subscriber terminal. 9. A differentiated routing method comprising:
receiving a request for a communication service from a subscriber terminal by a first core routing engine (CRE) of a first network domain; and when the communication service is to be routed to a second network domain:
identifying an access point at which the subscriber terminal accesses the first network domain;
including a tag in the request according to the identified access point, the tag including information to be used by the second network domain for routing the communication service; and
transmitting the request to the second network domain. 10. The method as recited in claim 9, further comprising providing a dedicated access line (DAL) for the subscriber terminal using an access point (AP). 11. The method as recited in claim 9, wherein the first network domain and the second network domain both comprise internet protocol (IP) based networks. 12. The method as recited in claim 11, further comprising appending the tag in a session initiation protocol-uniform resource identifier (SIP-URI). 13. The method as recited in claim 9, further comprising:
receiving the request from the first network domain via a second CRE of the second network domain; and routing the communication service through the second network domain according to the tag in the received request. 14. The method as recited in claim 13, further comprising:
receiving the request from the second network domain via a third CRE of a third network domain; and routing the communication service through the third network domain according to the tag in the received request. 15. A communication network comprising:
a first network domain in communication with a subscriber terminal; and a second network domain in communication with the first network domain; wherein the first network domain comprises a computing system having at least one processor that executes a core routing engine (CRE) to:
receive a request for a communication service from the subscriber terminal; and
when the communication service is to be routed to a second network domain:
identify an access point (AP) at which the subscriber terminal accesses the first network domain;
include a tag in the request according to the identified access point, the tag including information to be used by the second network domain for routing the communication service; and
transmit the request to the second network domain. 16. The communication network as recited in claim 15, wherein the first network domain and the second network domain both comprise internet protocol (IP) based networks. 17. The communication network as recited in claim 15, wherein the CRE is further executed to perform appending the tag to a session initiation protocol-uniform resource identifier (SIP-URI), and transmitting the SIP-URI to the second network domain. 18. The communication network as recited in claim 15, wherein the CRE is further executed to:
receive, via a second CRE of the second network domain, the request from the first network domain; and route the communication service through the second network domain according to the tag included in the received request. 19. The communication network as recited in claim 18, wherein the CRE is further executed to route the communication service through the second network domain according to information included in the tag. 20. The communication network as recited in claim 15, wherein the CRE is further executed to:
receive another request from another subscriber terminal, the other request comprising a tag that is different from the tag of the request; and monitor operating characteristics associated with the communication service provided to the subscriber terminal separately from operating characteristics associated with a communication service provided to the other subscriber terminal. | 2,400 |
7,608 | 7,608 | 14,599,775 | 2,416 | Systems and methodologies are described that facilitate defining new control channels in legacy wireless networks. Control data resources for new systems can be defined over resources reserved for general data communications in the legacy wireless network specification. In this regard, legacy devices can still be supported by devices implementing new control data resources, and the new control data resources can avoid substantial interference that is typically exhibited over legacy control and/or reference signal resources by instead using the general data resources. In addition, new system devices can avoid scheduling data communication resources over the new control resources to create a substantially non-interfered global control segment. Control data can be transmitted over the segment using beacon-based technologies, reuse schemes, and/or the like. | 1. A method for receiving control data over non-legacy control channels in a wireless communication network, comprising:
receiving non-legacy control data over a set of non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and decoding the non-legacy control data for scheduling data communications for wireless network access. 2. The method of claim 1, wherein receiving the non-legacy control data includes receiving a beacon signal that comprises the non-legacy control data. 3. The method of claim 1, wherein receiving the non-legacy control data includes receiving the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 4. The method of claim 1, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 5. The method of claim 1, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. 6. A wireless communications apparatus, comprising:
a receiver configured to receive non-legacy control data from an access point over the non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and at least one processor configured to decode the non-legacy control data for scheduling data communications for wireless network access. 7. The wireless communications apparatus of claim 6, wherein the receiver receives the non-legacy control data as one or more beacon signals. 8. The wireless communications apparatus of claim 6, wherein the receiver receives the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 9. The wireless communications apparatus of claim 6, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 10. The wireless communications apparatus of claim 6, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. 11. An wireless communications apparatus, comprising:
means for receiving non-legacy control data over a set of non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and means for decoding the non-legacy control data for scheduling data communications for wireless network access. 12. The wireless communications apparatus of claim 11, wherein the means for receiving receives the non-legacy control data as one or more beacon signals. 13. The wireless communications apparatus of claim 11, wherein the means for receiving the non-legacy control data includes means for receiving the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 14. The wireless communications apparatus of claim 11, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 15. The wireless communications apparatus of claim 11, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. 16. A non-transitory computer-readable medium comprising:
code for causing at least one computer to receive non-legacy control data over a set of non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and code for causing the at least one computer to decode the non-legacy control data for scheduling data communications for wireless network access. 17. The non-transitory computer-readable medium of claim 16, wherein the code for causing the at least one computer to receive causes the at least one computer to receive the non-legacy control data as one or more beacon signals. 18. The non-transitory computer-readable medium of claim 16, wherein the code for causing the at least one computer to receive causes the at least on computer to receive the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 19. The non-transitory computer-readable medium of claim 16, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 20. The non-transitory computer-readable medium of claim 16, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. | Systems and methodologies are described that facilitate defining new control channels in legacy wireless networks. Control data resources for new systems can be defined over resources reserved for general data communications in the legacy wireless network specification. In this regard, legacy devices can still be supported by devices implementing new control data resources, and the new control data resources can avoid substantial interference that is typically exhibited over legacy control and/or reference signal resources by instead using the general data resources. In addition, new system devices can avoid scheduling data communication resources over the new control resources to create a substantially non-interfered global control segment. Control data can be transmitted over the segment using beacon-based technologies, reuse schemes, and/or the like.1. A method for receiving control data over non-legacy control channels in a wireless communication network, comprising:
receiving non-legacy control data over a set of non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and decoding the non-legacy control data for scheduling data communications for wireless network access. 2. The method of claim 1, wherein receiving the non-legacy control data includes receiving a beacon signal that comprises the non-legacy control data. 3. The method of claim 1, wherein receiving the non-legacy control data includes receiving the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 4. The method of claim 1, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 5. The method of claim 1, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. 6. A wireless communications apparatus, comprising:
a receiver configured to receive non-legacy control data from an access point over the non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and at least one processor configured to decode the non-legacy control data for scheduling data communications for wireless network access. 7. The wireless communications apparatus of claim 6, wherein the receiver receives the non-legacy control data as one or more beacon signals. 8. The wireless communications apparatus of claim 6, wherein the receiver receives the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 9. The wireless communications apparatus of claim 6, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 10. The wireless communications apparatus of claim 6, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. 11. An wireless communications apparatus, comprising:
means for receiving non-legacy control data over a set of non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and means for decoding the non-legacy control data for scheduling data communications for wireless network access. 12. The wireless communications apparatus of claim 11, wherein the means for receiving receives the non-legacy control data as one or more beacon signals. 13. The wireless communications apparatus of claim 11, wherein the means for receiving the non-legacy control data includes means for receiving the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 14. The wireless communications apparatus of claim 11, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 15. The wireless communications apparatus of claim 11, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. 16. A non-transitory computer-readable medium comprising:
code for causing at least one computer to receive non-legacy control data over a set of non-legacy control data resources, wherein the set of non-legacy control data resources are defined within general data communication resources of a legacy network specification; and code for causing the at least one computer to decode the non-legacy control data for scheduling data communications for wireless network access. 17. The non-transitory computer-readable medium of claim 16, wherein the code for causing the at least one computer to receive causes the at least one computer to receive the non-legacy control data as one or more beacon signals. 18. The non-transitory computer-readable medium of claim 16, wherein the code for causing the at least one computer to receive causes the at least on computer to receive the non-legacy control data in resources within the set of non-legacy control data resources selected according to an identifier of an access point. 19. The non-transitory computer-readable medium of claim 16, wherein the set of non-legacy control data resources comprise at least a portion of one or more orthogonal frequency division multiplexing (OFDM) symbols. 20. The non-transitory computer-readable medium of claim 16, wherein the legacy network specification comprises a third generation partnership project (3GPP) long term evolution (LTE) specification and the defined non-legacy control data resources comprise at least one reserved resource block in at least one subframe. | 2,400 |
7,609 | 7,609 | 15,059,235 | 2,415 | A method of coordinating a plurality of radio access networks (RANs) includes aggregating, with a gateway, communications interfaces between a plurality of RANs and a packet core network through the gateway. A plurality of radio nodes (RNs) in each of the RANs is communicatively coupled to the gateway and to user equipment (UE) devices associated with the RNs in each of the RANs. The gateway also controls and coordinates mobility of the UE devices within and among the RANs. In addition, the gateway acts as a virtual enhanced NodeB (eNB) to the packet core network, thereby hiding the aggregated communications interfaces from the packet core network. | 1. A method of coordinating a plurality of radio access networks (RANs), comprising:
aggregating, with a gateway, communications interfaces between a plurality of RANs and a packet core network through the gateway, a plurality of radio nodes (RNs) in each of the RANs communicatively coupled to the gateway and to user equipment (UE) devices associated with the RNs in each of the RANs; controlling and coordinating, with the gateway, mobility of the UE devices within and among the RANs; and acting, with the gateway, as a virtual enhanced NodeB (eNB) to the packet core network, thereby hiding the aggregated communications interfaces from the packet core network. 2. The method of claim 1, wherein the gateway comprises a plurality of access controller instances 3. The method of claim 2, further comprising assigning each of the RANs to a single one of the access controller instances so that each access controller instance controls the respective RAN to which it is assigned. 4. The method of claim 2, further comprising: receiving a join request from a RN and/or a RAN; authenticating, with a cluster manager included in the gateway, the RN and/or RAN that sends the join request. 5. The method of claim 2, further comprising: receiving a join request from a plurality of RNs; authenticating, with a cluster manager included in the gateway, the plurality of RNs that send the join request; and selecting, with the cluster manager, which access controller instance each of the RNs is to be assigned. 6. The method of claim 5, wherein selecting which access controller instance each of the RNs is to be assigned is based at least in part on a signature of the RNs and a current load of the access controller instances. 7. The method of claim 2, further comprising redirecting, with a cluster manager, one of the RANs from a first access controller instance to a second access controller instance in the event of a failure associated with first access controller instance or for the purposes of load balancing. 8. The method of claim 2, further comprising, launching, with a cluster manager, a new access controller instance to perform load balancing based at least in part on a current load of remaining ones of the access controller instances. 9. The method of claim 8, further comprising launching the new access controller instance in response to receiving a join request from an RN and/or a RAN; and assigning the RN and/or a RAN from which the join request was received to the new access controller instance. 10. The method of claim 2, further comprising at least one access controller located external to the gateway. 11. The method of claim 2, wherein each of the access controller instances includes a distributed SON (d-SON) module for provisioning RNs assigned to the respective access controller instances in accordance with self-configuration, self-optimization and self-healing (SON) functionality. 12. The method of claim 11, further comprising, coordinating, with an aggregated SON (A-SON) module, activity performed by each of the d-SON modules in each of the access controller instances. 13. The method of claim 12, further comprising assigning, with a cluster manager operating in coordination with the A-SON module, a newly added RN to one of the RANs. 14. The method of claim 12, wherein coordinating the activity performed by each of the d-SON modules includes determining that two or more selected ones of the d-SON modules can conduct SON functionality simultaneously with one another. 15. The method of claim 12, further comprising, with the A-SON module, allocating physical cell identifiers (PCIs) and/or primary scrambling codes (PSCs) across RANs assigned to different ones of the access controller instances. 16. The method of claim 2, further comprising conducting handover events between RNs associated with the same or a different access controller instances without signaling the packet core network. 17. The method of claim 2, wherein the plurality of access controller instances and the hardware platform hosting the plurality of access controller has an NFV architecture. 18. The method of claim 2, further comprising using a single interface for all communication between the plurality of access controller instances and the packet core network. 19. The method of claim 1, further comprising aggregating, with the gateway, communications interfaces between at least two of the plurality of RANs that operate in accordance with different protocols. 20. The method of claim 19, wherein one of the two RANs operates in accordance with an LTE standard and the other of the two RANs operates in accordance with a UMTS standard. 21. The method of claim 18, wherein the single interface is provided by a mobility anchor module at which all data plane traffic between UEs and the packet core network terminate. 22. The method of claim 6, wherein the signature includes a geographic location of the RNs. 23. The method of claim 22, wherein the geographic location of the RNs is specified by a location identifier selected from the group consisting of a GPS coordinate, physical address, RF topology and IP address. 24. The method of claim 16, further comprising responding, with the gateway, to an RRC connection reestablishment request by performing an RRC Reestablishment Procedure across RNs from the same or different RANs. 25. The method of claim 2, further comprising conducting a hand-in or hand-out event between a macro cell and one of the access controller instances without signaling the core network. 26. The method of claim 2, further comprising reducing call setup times by combining a plurality of control plane messages between one of the RNs and the SN instance to which the RN is respectively assigned. 27. The method of claim 2, wherein each of the access controller instances perform logical open systems interconnection (OSI) layer L3 processing. 28. The method of claim 27, wherein each of the access controller instances perform at least a portion of logical open systems interconnection (OSI) layer L2 processing. 29. The method of claim 28, wherein the Layer L2 processing performed by each of the access controller instances includes Packet Data Control Protocol (PDCP) processing. 30. A gateway through which a plurality of RANs communicate with a packet core network, comprising:
a plurality of access controller modules to which as least one RAN is assigned, each of the access controller modules being configured to control the respective RAN assigned thereto; a core network aggregator module configured as single interface for all communication between the plurality of access controller modules and the packet core network; a mobility anchor module at which all data plane traffic between UEs attached to one of the RANs and the packet core network terminate; and a cluster manager module for assigning RNs to the access controller modules and transferring RN assignments from one access controller module to a different access controller module under specified circumstances. | A method of coordinating a plurality of radio access networks (RANs) includes aggregating, with a gateway, communications interfaces between a plurality of RANs and a packet core network through the gateway. A plurality of radio nodes (RNs) in each of the RANs is communicatively coupled to the gateway and to user equipment (UE) devices associated with the RNs in each of the RANs. The gateway also controls and coordinates mobility of the UE devices within and among the RANs. In addition, the gateway acts as a virtual enhanced NodeB (eNB) to the packet core network, thereby hiding the aggregated communications interfaces from the packet core network.1. A method of coordinating a plurality of radio access networks (RANs), comprising:
aggregating, with a gateway, communications interfaces between a plurality of RANs and a packet core network through the gateway, a plurality of radio nodes (RNs) in each of the RANs communicatively coupled to the gateway and to user equipment (UE) devices associated with the RNs in each of the RANs; controlling and coordinating, with the gateway, mobility of the UE devices within and among the RANs; and acting, with the gateway, as a virtual enhanced NodeB (eNB) to the packet core network, thereby hiding the aggregated communications interfaces from the packet core network. 2. The method of claim 1, wherein the gateway comprises a plurality of access controller instances 3. The method of claim 2, further comprising assigning each of the RANs to a single one of the access controller instances so that each access controller instance controls the respective RAN to which it is assigned. 4. The method of claim 2, further comprising: receiving a join request from a RN and/or a RAN; authenticating, with a cluster manager included in the gateway, the RN and/or RAN that sends the join request. 5. The method of claim 2, further comprising: receiving a join request from a plurality of RNs; authenticating, with a cluster manager included in the gateway, the plurality of RNs that send the join request; and selecting, with the cluster manager, which access controller instance each of the RNs is to be assigned. 6. The method of claim 5, wherein selecting which access controller instance each of the RNs is to be assigned is based at least in part on a signature of the RNs and a current load of the access controller instances. 7. The method of claim 2, further comprising redirecting, with a cluster manager, one of the RANs from a first access controller instance to a second access controller instance in the event of a failure associated with first access controller instance or for the purposes of load balancing. 8. The method of claim 2, further comprising, launching, with a cluster manager, a new access controller instance to perform load balancing based at least in part on a current load of remaining ones of the access controller instances. 9. The method of claim 8, further comprising launching the new access controller instance in response to receiving a join request from an RN and/or a RAN; and assigning the RN and/or a RAN from which the join request was received to the new access controller instance. 10. The method of claim 2, further comprising at least one access controller located external to the gateway. 11. The method of claim 2, wherein each of the access controller instances includes a distributed SON (d-SON) module for provisioning RNs assigned to the respective access controller instances in accordance with self-configuration, self-optimization and self-healing (SON) functionality. 12. The method of claim 11, further comprising, coordinating, with an aggregated SON (A-SON) module, activity performed by each of the d-SON modules in each of the access controller instances. 13. The method of claim 12, further comprising assigning, with a cluster manager operating in coordination with the A-SON module, a newly added RN to one of the RANs. 14. The method of claim 12, wherein coordinating the activity performed by each of the d-SON modules includes determining that two or more selected ones of the d-SON modules can conduct SON functionality simultaneously with one another. 15. The method of claim 12, further comprising, with the A-SON module, allocating physical cell identifiers (PCIs) and/or primary scrambling codes (PSCs) across RANs assigned to different ones of the access controller instances. 16. The method of claim 2, further comprising conducting handover events between RNs associated with the same or a different access controller instances without signaling the packet core network. 17. The method of claim 2, wherein the plurality of access controller instances and the hardware platform hosting the plurality of access controller has an NFV architecture. 18. The method of claim 2, further comprising using a single interface for all communication between the plurality of access controller instances and the packet core network. 19. The method of claim 1, further comprising aggregating, with the gateway, communications interfaces between at least two of the plurality of RANs that operate in accordance with different protocols. 20. The method of claim 19, wherein one of the two RANs operates in accordance with an LTE standard and the other of the two RANs operates in accordance with a UMTS standard. 21. The method of claim 18, wherein the single interface is provided by a mobility anchor module at which all data plane traffic between UEs and the packet core network terminate. 22. The method of claim 6, wherein the signature includes a geographic location of the RNs. 23. The method of claim 22, wherein the geographic location of the RNs is specified by a location identifier selected from the group consisting of a GPS coordinate, physical address, RF topology and IP address. 24. The method of claim 16, further comprising responding, with the gateway, to an RRC connection reestablishment request by performing an RRC Reestablishment Procedure across RNs from the same or different RANs. 25. The method of claim 2, further comprising conducting a hand-in or hand-out event between a macro cell and one of the access controller instances without signaling the core network. 26. The method of claim 2, further comprising reducing call setup times by combining a plurality of control plane messages between one of the RNs and the SN instance to which the RN is respectively assigned. 27. The method of claim 2, wherein each of the access controller instances perform logical open systems interconnection (OSI) layer L3 processing. 28. The method of claim 27, wherein each of the access controller instances perform at least a portion of logical open systems interconnection (OSI) layer L2 processing. 29. The method of claim 28, wherein the Layer L2 processing performed by each of the access controller instances includes Packet Data Control Protocol (PDCP) processing. 30. A gateway through which a plurality of RANs communicate with a packet core network, comprising:
a plurality of access controller modules to which as least one RAN is assigned, each of the access controller modules being configured to control the respective RAN assigned thereto; a core network aggregator module configured as single interface for all communication between the plurality of access controller modules and the packet core network; a mobility anchor module at which all data plane traffic between UEs attached to one of the RANs and the packet core network terminate; and a cluster manager module for assigning RNs to the access controller modules and transferring RN assignments from one access controller module to a different access controller module under specified circumstances. | 2,400 |
7,610 | 7,610 | 13,930,267 | 2,459 | Methods and arrangements for assessing impact of an event on a network. An event notification is received relative to traffic in the network. Metadata are extracted from the notification, and the extracted metadata are converted into a predetermined format for processing. The converted metadata are received, and an impact of the event on traffic in the network is determined. Other variants and embodiments are broadly contemplated herein. | 1. A method of assessing impact of an event on a network, said method comprising:
utilizing at least one processor to execute computer code configured for: receiving an event notification associated with an event affecting traffic in the network; extracting metadata from the event notification, the metadata including at least one of: location information, time information, and event type information; converting the extracted metadata into a predetermined format for processing; receiving the converted metadata; and determining, using the converted metadata, an estimated impact of the event on traffic in the network. 2. The method according to claim 1, wherein the event notification comprises an SMS notification. 3. The method according to claim 1, wherein the network is a transport network. 4. The method according to claim 3, wherein the transport network is a public transportation network. 5. The method according to claim 1, wherein the event notification comprises a notification relating to two or more events. 6. The method according to claim 1, wherein said extracting comprises consulting one or more extraction rules. 7. The method according to claim 6, comprising consulting a historical database of events to revise the one or more extraction rules. 8. The method according to claim 1, wherein the event notification includes an event location and time. 9. The method according to claim 8, wherein:
the network is a public transportation network; and said converting comprises converting the extracted metadata into a format relating to at least one stop for a public transit vehicle in the public transportation network. 10. The method according to claim 9, wherein said determining comprises estimating a delay with respect to at least one stop for the public transit vehicle. 11. The method according to claim 10, wherein said estimating comprises tailoring an estimate based on at least one of: an attenuation function relative to event type, a time of day, and a history of related events. 12. The method according to claim 10, comprising communicating at least one calculated delay with respect to at least one neighboring stop relative to the event. 13. The method according to claim 10, wherein said estimating comprises developing a conditional probability table. 14. An apparatus for assessing impact of an event on a network, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to receive an event notification associated with an event affecting traffic in the network; computer readable program code configured to extract metadata from the event notification, the metadata including at least one of: location information, time information, and event type information; computer readable program code configured to convert the extracted metadata into a predetermined format for processing; computer readable program code configured to receive the converted metadata; and computer readable program code configured to determine, using the converted metadata, an estimated impact of the event on traffic in the network. 15. A computer program product for assessing impact of an event on a network, said computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to receive an event notification associated with an event affecting traffic in the network; computer readable program code configured to extract metadata from the event notification, the metadata including at least one of: location information, time information, and event type information; computer readable program code configured to convert the extracted metadata into a predetermined format for processing; computer readable program code configured to receive the converted metadata; and computer readable program code configured to determine, using the converted metadata, an estimated impact of the event on traffic in the network. 16. The computer program product according to claim 15, wherein the event notification comprises an SMS notification. 17. The computer program product according to claim 15, wherein the event notification includes an event location and time. 18. The computer program product according to claim 17, wherein:
the network is a public transportation network; and said computer readable program code is configured to convert the extracted metadata into a format relating to at least one stop for a public transit vehicle in the public transportation network. 19. The computer program product according to claim 18, wherein said computer readable program code is configured to estimate a delay for the public transit vehicle with respect to at least one stop. 20. A method comprising:
receiving at least one SMS notification relative to an event in a public transportation network; extracting metadata from the at least one SMS notification; and receiving the extracted metadata and thereupon estimating a scheduling delay relative to at least one location in the public transportation network. | Methods and arrangements for assessing impact of an event on a network. An event notification is received relative to traffic in the network. Metadata are extracted from the notification, and the extracted metadata are converted into a predetermined format for processing. The converted metadata are received, and an impact of the event on traffic in the network is determined. Other variants and embodiments are broadly contemplated herein.1. A method of assessing impact of an event on a network, said method comprising:
utilizing at least one processor to execute computer code configured for: receiving an event notification associated with an event affecting traffic in the network; extracting metadata from the event notification, the metadata including at least one of: location information, time information, and event type information; converting the extracted metadata into a predetermined format for processing; receiving the converted metadata; and determining, using the converted metadata, an estimated impact of the event on traffic in the network. 2. The method according to claim 1, wherein the event notification comprises an SMS notification. 3. The method according to claim 1, wherein the network is a transport network. 4. The method according to claim 3, wherein the transport network is a public transportation network. 5. The method according to claim 1, wherein the event notification comprises a notification relating to two or more events. 6. The method according to claim 1, wherein said extracting comprises consulting one or more extraction rules. 7. The method according to claim 6, comprising consulting a historical database of events to revise the one or more extraction rules. 8. The method according to claim 1, wherein the event notification includes an event location and time. 9. The method according to claim 8, wherein:
the network is a public transportation network; and said converting comprises converting the extracted metadata into a format relating to at least one stop for a public transit vehicle in the public transportation network. 10. The method according to claim 9, wherein said determining comprises estimating a delay with respect to at least one stop for the public transit vehicle. 11. The method according to claim 10, wherein said estimating comprises tailoring an estimate based on at least one of: an attenuation function relative to event type, a time of day, and a history of related events. 12. The method according to claim 10, comprising communicating at least one calculated delay with respect to at least one neighboring stop relative to the event. 13. The method according to claim 10, wherein said estimating comprises developing a conditional probability table. 14. An apparatus for assessing impact of an event on a network, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to receive an event notification associated with an event affecting traffic in the network; computer readable program code configured to extract metadata from the event notification, the metadata including at least one of: location information, time information, and event type information; computer readable program code configured to convert the extracted metadata into a predetermined format for processing; computer readable program code configured to receive the converted metadata; and computer readable program code configured to determine, using the converted metadata, an estimated impact of the event on traffic in the network. 15. A computer program product for assessing impact of an event on a network, said computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to receive an event notification associated with an event affecting traffic in the network; computer readable program code configured to extract metadata from the event notification, the metadata including at least one of: location information, time information, and event type information; computer readable program code configured to convert the extracted metadata into a predetermined format for processing; computer readable program code configured to receive the converted metadata; and computer readable program code configured to determine, using the converted metadata, an estimated impact of the event on traffic in the network. 16. The computer program product according to claim 15, wherein the event notification comprises an SMS notification. 17. The computer program product according to claim 15, wherein the event notification includes an event location and time. 18. The computer program product according to claim 17, wherein:
the network is a public transportation network; and said computer readable program code is configured to convert the extracted metadata into a format relating to at least one stop for a public transit vehicle in the public transportation network. 19. The computer program product according to claim 18, wherein said computer readable program code is configured to estimate a delay for the public transit vehicle with respect to at least one stop. 20. A method comprising:
receiving at least one SMS notification relative to an event in a public transportation network; extracting metadata from the at least one SMS notification; and receiving the extracted metadata and thereupon estimating a scheduling delay relative to at least one location in the public transportation network. | 2,400 |
7,611 | 7,611 | 14,482,245 | 2,457 | Methods and systems for establishing new streaming sessions based on capabilities of their destinations, including the steps of: receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session. Receiving capabilities of a destination of the new streaming session. Allocating for the new streaming session a limit for an allowable end-to-end latency variation thereof, based on the capabilities. Estimating, before the new streaming session is established, an estimated end-to-end latency variation of the new streaming session, supposing it is established over the first path. Determining, based on comparing the estimated end-to-end latency variation with the limit, that the estimated end-to-end latency variation exceeds the limit. And rejecting the request, based on the determination. | 1. A network configured to admit streaming sessions based on capabilities of their destinations, comprising:
an admission controller, a latency variation allocator, and a latency variation calculator; the admission controller is configured to receive a request to establish a new streaming session over a new path, in presence of an existing streaming session; wherein the existing streaming session is established over an existing path, and the new path and the existing path pass through an output port of a switch; the latency variation allocator is configured to: receive capabilities of a destination of the new streaming session, and allocate a limit for a first allowable end-to-end latency variation of the new streaming session based on the capabilities; the latency variation calculator is configured to estimate, before the new streaming session is established, an estimated end-to-end latency variation of the new streaming session, supposing the new streaming session is established over the new path; the admission controller is further configured to: determine, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit, and reject the request based on the determination. 2. The network of claim 1, wherein the latency variation allocator comprises a local latency variation allocator associated with a switch coupled to the destination. 3. The network of claim 1, wherein the new streaming session is an HDBaseT streaming session. 4. The network of claim 1, wherein the capabilities of the destination comprises a buffer size thereof. 5. The network of claim 1, wherein the admission controller is further configured to receive a second request to establish a second new streaming session over a second new path, in presence of the existing streaming session; the second new path and the existing path pass through a second output port of a second switch; the latency variation allocator is further configured to: receive second capabilities of a second destination of the second new streaming session, and allocate for the second new streaming session a second limit for a second allowable end-to-end latency variation thereof based on the second capabilities; the latency variation calculator is further configured to estimate, before the second new streaming session is established, a second estimated end-to-end latency variation of the second new streaming session, supposing it is established over the second path; the admission controller is further configured to: determining, based on comparing the second estimated end-to-end latency variation with the second limit, a second determination that the second estimated end-to-end latency variation does not exceeds the second limit, and admit the second request based on the second determination. 6. The network of claim 1, wherein the latency variation allocator is further configured to: receive second capabilities of a second destination of a second existing streaming session, and allocate for the second existing streaming session a second limit for a second allowable end-to-end latency variation thereof, based on the second capabilities; the admission controller is further configured to: receive a second request to establish a second new streaming session over a second new path, in presence of the second streaming session; the second existing session is established over a second existing path, and the second new path and the second existing path pass through a second output port of a second switch; the latency variation calculator is further configured to estimate, before the second new streaming session is established, an estimated second end-to-end latency variation of the second existing streaming session, supposing the second new streaming session is established over the second new path; and the admission controller is further configured to: determine, based on comparing the second end-to-end latency variation with the second limit, a second determination that the second end-to-end latency variation exceeds the second limit, and reject the second request based on the second determination. 7. The network of claim 6, wherein the admission controller is further configured to receive a third request to establish a third new streaming session over a third new path, in presence of the second existing streaming session; the third new path and the second existing path pass through a third output port of a third switch; the latency variation calculator is further configured to estimate, before the third new streaming session is established, a third estimated end-to-end latency variation of the second existing streaming session, supposing the third new streaming session is established over the third path; and the admission controller is further configured to: determine, based on comparing the third estimated end-to-end latency variation with the limit, a third determination that the third estimated end-to-end latency variation does not exceed the limit, and admit the third request based on the third determination. 8. The network of claim 6, wherein the latency variation allocator is further configured to: receive third capabilities of a third destination of a third existing streaming session, and allocate for the third existing streaming session a third limit for a third allowable end-to-end latency variation thereof based on the third capabilities; the admission controller is further configured to: receive a third request to establish a third new streaming session over a third new path, in presence of the second and third existing streaming sessions; the third existing session is established over a third existing path, the third new path and the second existing path pass through a third output port of a third switch, and the third new path and the third existing path pass through a fourth output port of a fourth switch; the latency variation calculator is further configured to: estimate, before the third new streaming session is established, third and fourth estimated end-to-end latency variations of the second and third existing streaming sessions, respectively, supposing the third new streaming session is established over the third new path; and the admission controller is further configured to: determine, based on comparing the third and fourth estimated end-to-end latency variations with the second and the third limits, respectively, a third determination that at least one of the third and fourth estimated end-to-end latency variations exceeds the respective one of the second and third limits, and reject the third request based on the third determination. 9. The network of claim 8, wherein the admission controller is further configured to: receive a fourth request to establish a fourth new streaming session over a fourth new path, in presence of the second and third existing streaming sessions; the fourth new path and the second existing path pass through a fifth output port of a fifth switch, and the fourth new path and the third existing path pass through a sixed output port of a sixed switch; the latency variation calculator is further configured to: estimate, before the fourth new streaming session is established, fifth and sixed estimated end-to-end latency variations of the second and third existing streaming sessions, respectively, supposing the fourth new streaming session is established over the fourth new path; and the admission controller is further configured to: determine, based on comparing the fifth and sixed estimated end-to-end latency variations with the second and the third limits, respectively, a fourth determination that no one of the third and fourth estimated end-to-end latency variations exceeds the respective one of the second and third limits, and admit the fourth request based on the fourth determination. 10. The network of claim 1, wherein the admission controller is further configured to receive first and second maximum burst sizes of a certain streaming session and another streaming session at first and second input ports, respectively, of a certain switch; wherein the certain streaming session and the other streaming session pass through a certain output port of the certain switch; and the latency variation calculator is further configured to calculate a calculated local latency variation of the certain streaming session at the certain output port, based on the first and second maximum burst sizes. 11. The network of claim 10, wherein the latency variation calculator is further configured to: receive a local latency variation of the certain streaming sessions at another output port of another switch, and calculate the maximum burst size of the certain streaming session at the first input port of the certain switch based on the local latency variation; wherein the other output port is coupled to the first input port by a communication link. 12. A method for establishing new streaming sessions based on capabilities of their destinations, comprising:
receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session; wherein the existing streaming session is established over an existing path, and the new path and the existing path pass through an output port of a switch; receiving capabilities of a destination of the new streaming session; allocating for the new streaming session a limit for an allowable end-to-end latency variation thereof, based on the capabilities; estimating, before the new streaming session is established, an estimated end-to-end latency variation of the new streaming session, supposing it is established over the first path; determining, based on comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit; and rejecting the request, based on the determination. 13. The method of claim 12, wherein the new streaming session is an HDBaseT streaming session. 14. The method of claim 12, wherein the capabilities of the destination comprises a buffer size thereof. 15. The method of claim 12, further comprising receiving a second request to establish a second new streaming session over a second new path, in presence of the existing streaming session; wherein the second new path and the existing path pass through a second output port of a second switch; the method further comprises: receiving second capabilities of a second destination of the second new streaming session, allocating for the second new streaming session a second limit for a second allowable end-to-end latency variation thereof based on the second capabilities, and estimating, before the second new streaming session is established, a second estimated end-to-end latency variation of the second new streaming session, supposing it is established over the second path; the method further comprises: determining, based on comparing the second estimated end-to-end latency variation with the second limit, a second determination that the second estimated end-to-end latency variation does not exceeds the second limit, and admitting the second request based on the second determination. 16. The method of claim 12, further comprising: receiving second capabilities of a second destination of a second existing streaming session, and allocating for the second existing streaming session a second limit for a second allowable end-to-end latency variation thereof based on the second capabilities; the method further comprises: receiving a second request to establish a second new streaming session over a second new path, in presence of the second streaming session; wherein the second existing session is established over a second existing path, and the second new path and the second existing path pass through a second output port of a second switch; the method further comprises: estimating, before the second new streaming session is established, a second estimated end-to-end latency variation of the second existing streaming session, supposing the second new streaming session is established over the second new path; the method further comprises: determining, based on comparing the second estimated end-to-end latency variation with the second limit, a second determination that the second end-to-end latency variation exceeds the second limit, and rejecting the second request based on the second determination. 17. The method of claim 16, further comprising receiving a third request to establish a third new streaming session over a third new path, in presence of the second existing streaming session; wherein the third new path and the second existing path pass through a third output port of a third switch; the method further comprises: estimating, before the third new streaming session is established, a third estimated end-to-end latency variation of the second existing streaming session, supposing the third new streaming session is established over the third path; the method further comprises: determining, based on comparing the third estimated end-to-end latency variation with the limit, a third determination that the third estimated end-to-end latency variation does not exceed the limit, and admitting the third request based on the third determination. 18. The method of claim 16, further comprising: receiving third capabilities of a third destination of a third existing streaming session, and allocating for the third existing streaming session a third limit for a third allowable end-to-end latency variation thereof based on the third capabilities; the method further comprises: receiving a third request to establish a third new streaming session over a third new path, in presence of the second and third existing streaming sessions; wherein the third existing session is established over a third existing path, the third new path and the second existing path pass through a third output port of a third switch, and the third new path and the third existing path pass through a fourth output port of a fourth switch; the method further comprises: estimating, before the third new streaming session is established, third and fourth estimated end-to-end latency variations of the second and third existing streaming sessions, respectively, supposing the third new streaming session is established over the third new path; the method further comprises: determining, based on comparing the third and fourth estimated end-to-end latency variations with the second and the third limits, respectively, a third determination that at least one of the third and fourth estimated end-to-end latency variations exceeds the respective one of the second and third limits, and rejecting the third request based on the third determination. 19. The method of claim 12, further comprising receiving first and second maximum burst sizes of a certain streaming session and another streaming session at first and second input ports, respectively, of a certain switch; wherein the certain streaming session and the other streaming session pass through a certain output port of the certain switch; the method further comprises calculating a calculated local latency variation of the certain streaming session at the certain output port, based on the first and second maximum burst sizes. 20. The method of claim 19, further comprising receiving a local latency variation of the certain streaming sessions at another output port of another switch, and calculating the maximum burst size of the certain streaming session at the first input port of the certain switch based on the local latency variation; wherein the other output port is coupled to the first input port by a communication link. | Methods and systems for establishing new streaming sessions based on capabilities of their destinations, including the steps of: receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session. Receiving capabilities of a destination of the new streaming session. Allocating for the new streaming session a limit for an allowable end-to-end latency variation thereof, based on the capabilities. Estimating, before the new streaming session is established, an estimated end-to-end latency variation of the new streaming session, supposing it is established over the first path. Determining, based on comparing the estimated end-to-end latency variation with the limit, that the estimated end-to-end latency variation exceeds the limit. And rejecting the request, based on the determination.1. A network configured to admit streaming sessions based on capabilities of their destinations, comprising:
an admission controller, a latency variation allocator, and a latency variation calculator; the admission controller is configured to receive a request to establish a new streaming session over a new path, in presence of an existing streaming session; wherein the existing streaming session is established over an existing path, and the new path and the existing path pass through an output port of a switch; the latency variation allocator is configured to: receive capabilities of a destination of the new streaming session, and allocate a limit for a first allowable end-to-end latency variation of the new streaming session based on the capabilities; the latency variation calculator is configured to estimate, before the new streaming session is established, an estimated end-to-end latency variation of the new streaming session, supposing the new streaming session is established over the new path; the admission controller is further configured to: determine, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit, and reject the request based on the determination. 2. The network of claim 1, wherein the latency variation allocator comprises a local latency variation allocator associated with a switch coupled to the destination. 3. The network of claim 1, wherein the new streaming session is an HDBaseT streaming session. 4. The network of claim 1, wherein the capabilities of the destination comprises a buffer size thereof. 5. The network of claim 1, wherein the admission controller is further configured to receive a second request to establish a second new streaming session over a second new path, in presence of the existing streaming session; the second new path and the existing path pass through a second output port of a second switch; the latency variation allocator is further configured to: receive second capabilities of a second destination of the second new streaming session, and allocate for the second new streaming session a second limit for a second allowable end-to-end latency variation thereof based on the second capabilities; the latency variation calculator is further configured to estimate, before the second new streaming session is established, a second estimated end-to-end latency variation of the second new streaming session, supposing it is established over the second path; the admission controller is further configured to: determining, based on comparing the second estimated end-to-end latency variation with the second limit, a second determination that the second estimated end-to-end latency variation does not exceeds the second limit, and admit the second request based on the second determination. 6. The network of claim 1, wherein the latency variation allocator is further configured to: receive second capabilities of a second destination of a second existing streaming session, and allocate for the second existing streaming session a second limit for a second allowable end-to-end latency variation thereof, based on the second capabilities; the admission controller is further configured to: receive a second request to establish a second new streaming session over a second new path, in presence of the second streaming session; the second existing session is established over a second existing path, and the second new path and the second existing path pass through a second output port of a second switch; the latency variation calculator is further configured to estimate, before the second new streaming session is established, an estimated second end-to-end latency variation of the second existing streaming session, supposing the second new streaming session is established over the second new path; and the admission controller is further configured to: determine, based on comparing the second end-to-end latency variation with the second limit, a second determination that the second end-to-end latency variation exceeds the second limit, and reject the second request based on the second determination. 7. The network of claim 6, wherein the admission controller is further configured to receive a third request to establish a third new streaming session over a third new path, in presence of the second existing streaming session; the third new path and the second existing path pass through a third output port of a third switch; the latency variation calculator is further configured to estimate, before the third new streaming session is established, a third estimated end-to-end latency variation of the second existing streaming session, supposing the third new streaming session is established over the third path; and the admission controller is further configured to: determine, based on comparing the third estimated end-to-end latency variation with the limit, a third determination that the third estimated end-to-end latency variation does not exceed the limit, and admit the third request based on the third determination. 8. The network of claim 6, wherein the latency variation allocator is further configured to: receive third capabilities of a third destination of a third existing streaming session, and allocate for the third existing streaming session a third limit for a third allowable end-to-end latency variation thereof based on the third capabilities; the admission controller is further configured to: receive a third request to establish a third new streaming session over a third new path, in presence of the second and third existing streaming sessions; the third existing session is established over a third existing path, the third new path and the second existing path pass through a third output port of a third switch, and the third new path and the third existing path pass through a fourth output port of a fourth switch; the latency variation calculator is further configured to: estimate, before the third new streaming session is established, third and fourth estimated end-to-end latency variations of the second and third existing streaming sessions, respectively, supposing the third new streaming session is established over the third new path; and the admission controller is further configured to: determine, based on comparing the third and fourth estimated end-to-end latency variations with the second and the third limits, respectively, a third determination that at least one of the third and fourth estimated end-to-end latency variations exceeds the respective one of the second and third limits, and reject the third request based on the third determination. 9. The network of claim 8, wherein the admission controller is further configured to: receive a fourth request to establish a fourth new streaming session over a fourth new path, in presence of the second and third existing streaming sessions; the fourth new path and the second existing path pass through a fifth output port of a fifth switch, and the fourth new path and the third existing path pass through a sixed output port of a sixed switch; the latency variation calculator is further configured to: estimate, before the fourth new streaming session is established, fifth and sixed estimated end-to-end latency variations of the second and third existing streaming sessions, respectively, supposing the fourth new streaming session is established over the fourth new path; and the admission controller is further configured to: determine, based on comparing the fifth and sixed estimated end-to-end latency variations with the second and the third limits, respectively, a fourth determination that no one of the third and fourth estimated end-to-end latency variations exceeds the respective one of the second and third limits, and admit the fourth request based on the fourth determination. 10. The network of claim 1, wherein the admission controller is further configured to receive first and second maximum burst sizes of a certain streaming session and another streaming session at first and second input ports, respectively, of a certain switch; wherein the certain streaming session and the other streaming session pass through a certain output port of the certain switch; and the latency variation calculator is further configured to calculate a calculated local latency variation of the certain streaming session at the certain output port, based on the first and second maximum burst sizes. 11. The network of claim 10, wherein the latency variation calculator is further configured to: receive a local latency variation of the certain streaming sessions at another output port of another switch, and calculate the maximum burst size of the certain streaming session at the first input port of the certain switch based on the local latency variation; wherein the other output port is coupled to the first input port by a communication link. 12. A method for establishing new streaming sessions based on capabilities of their destinations, comprising:
receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session; wherein the existing streaming session is established over an existing path, and the new path and the existing path pass through an output port of a switch; receiving capabilities of a destination of the new streaming session; allocating for the new streaming session a limit for an allowable end-to-end latency variation thereof, based on the capabilities; estimating, before the new streaming session is established, an estimated end-to-end latency variation of the new streaming session, supposing it is established over the first path; determining, based on comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit; and rejecting the request, based on the determination. 13. The method of claim 12, wherein the new streaming session is an HDBaseT streaming session. 14. The method of claim 12, wherein the capabilities of the destination comprises a buffer size thereof. 15. The method of claim 12, further comprising receiving a second request to establish a second new streaming session over a second new path, in presence of the existing streaming session; wherein the second new path and the existing path pass through a second output port of a second switch; the method further comprises: receiving second capabilities of a second destination of the second new streaming session, allocating for the second new streaming session a second limit for a second allowable end-to-end latency variation thereof based on the second capabilities, and estimating, before the second new streaming session is established, a second estimated end-to-end latency variation of the second new streaming session, supposing it is established over the second path; the method further comprises: determining, based on comparing the second estimated end-to-end latency variation with the second limit, a second determination that the second estimated end-to-end latency variation does not exceeds the second limit, and admitting the second request based on the second determination. 16. The method of claim 12, further comprising: receiving second capabilities of a second destination of a second existing streaming session, and allocating for the second existing streaming session a second limit for a second allowable end-to-end latency variation thereof based on the second capabilities; the method further comprises: receiving a second request to establish a second new streaming session over a second new path, in presence of the second streaming session; wherein the second existing session is established over a second existing path, and the second new path and the second existing path pass through a second output port of a second switch; the method further comprises: estimating, before the second new streaming session is established, a second estimated end-to-end latency variation of the second existing streaming session, supposing the second new streaming session is established over the second new path; the method further comprises: determining, based on comparing the second estimated end-to-end latency variation with the second limit, a second determination that the second end-to-end latency variation exceeds the second limit, and rejecting the second request based on the second determination. 17. The method of claim 16, further comprising receiving a third request to establish a third new streaming session over a third new path, in presence of the second existing streaming session; wherein the third new path and the second existing path pass through a third output port of a third switch; the method further comprises: estimating, before the third new streaming session is established, a third estimated end-to-end latency variation of the second existing streaming session, supposing the third new streaming session is established over the third path; the method further comprises: determining, based on comparing the third estimated end-to-end latency variation with the limit, a third determination that the third estimated end-to-end latency variation does not exceed the limit, and admitting the third request based on the third determination. 18. The method of claim 16, further comprising: receiving third capabilities of a third destination of a third existing streaming session, and allocating for the third existing streaming session a third limit for a third allowable end-to-end latency variation thereof based on the third capabilities; the method further comprises: receiving a third request to establish a third new streaming session over a third new path, in presence of the second and third existing streaming sessions; wherein the third existing session is established over a third existing path, the third new path and the second existing path pass through a third output port of a third switch, and the third new path and the third existing path pass through a fourth output port of a fourth switch; the method further comprises: estimating, before the third new streaming session is established, third and fourth estimated end-to-end latency variations of the second and third existing streaming sessions, respectively, supposing the third new streaming session is established over the third new path; the method further comprises: determining, based on comparing the third and fourth estimated end-to-end latency variations with the second and the third limits, respectively, a third determination that at least one of the third and fourth estimated end-to-end latency variations exceeds the respective one of the second and third limits, and rejecting the third request based on the third determination. 19. The method of claim 12, further comprising receiving first and second maximum burst sizes of a certain streaming session and another streaming session at first and second input ports, respectively, of a certain switch; wherein the certain streaming session and the other streaming session pass through a certain output port of the certain switch; the method further comprises calculating a calculated local latency variation of the certain streaming session at the certain output port, based on the first and second maximum burst sizes. 20. The method of claim 19, further comprising receiving a local latency variation of the certain streaming sessions at another output port of another switch, and calculating the maximum burst size of the certain streaming session at the first input port of the certain switch based on the local latency variation; wherein the other output port is coupled to the first input port by a communication link. | 2,400 |
7,612 | 7,612 | 13,277,180 | 2,458 | A social networking system may recommend a set of users to a viewing user for establishing new connections on the social networking system. Through a user interface, the viewing user may select filters based on characteristics and dimensions of user profile information. The recommended set of users may be ranked according to the selected filters by the number of mutual connections. Pre-populated filters may be selected and suggested based on information about the viewing user. Multiple filters may be selected by the viewing user, and filters may be based on any identifiable object in the social networking system, in one embodiment. The candidate recommended users may also be ranked based on predictions that the viewing user will initiate a request to connect with the candidate recommended users. | 1. A method comprising:
maintaining a user profile for each of a plurality of users of a social networking system; maintaining a plurality of connections established between users of the social networking system; for a viewing user of the plurality of users, receiving a request to recommend one or more other users with whom to establish a connection in the social networking system by the viewing user, the request comprising a user profile characteristic for recommending the one or more other users; responsive to the request,
determining a plurality of the users of the social networking system with whom the viewing user has not already established a connection; and
filtering the determined plurality of users to eliminate users with profiles that do not match the user profile characteristic, the filtering resulting in a plurality of candidate recommended users;
ranking the candidate recommended users based on a prediction that the viewing user will initiate a request to the candidate recommended users; selecting one or more of the candidate recommended users based on the ranking; and providing the selected candidate recommended users for display to the viewing user in an interface enabling the viewing user to establish a connection with the selected candidate recommended users. 2. The method of claim 1, wherein the ranking is based on a type of the user profile characteristic provided by the viewing user. 3. The method of claim 1, wherein the ranking is based on an inference of the user profile characteristic. 4. The method of claim 1, wherein the user profile characteristic comprises a hometown. 5. The method of claim 4, wherein the ranking is based on a geographic proximity of hometowns included in profiles of candidate recommended users with respect to the hometown included in the user profile characteristic. 6. The method of claim 1, wherein the user profile characteristic comprises a current city. 7. The method of claim 6, wherein the ranking is based on a geographic proximity of current cities included in profiles of candidate recommended users with respect to the current city included in the user profile characteristic. 8. The method of claim 1, wherein the ranking is based on a mutual friend count. 9. The method of claim 1, wherein the user profile characteristic comprises a mutual friend. 10. The method of claim 9, wherein the ranking is based on the candidate recommended users being connected to the mutual friend included in the user profile characteristic on the social networking system. 11. The method of claim 1, wherein the user profile characteristic comprises an object on the social networking system. 12. The method of claim 11, wherein the ranking is based on the candidate recommended users being associated with the object included in the user profile characteristic on the social networking system. 13. The method of claim 1, wherein the user profile characteristic comprises a location object on the social networking system. 14. The method of claim 13, wherein the ranking is based on location information about the candidate recommended users within a predetermined geographic proximity to the location object included in the user profile characteristic on the social networking system. 15. The method of claim 1, wherein the user profile characteristic comprises an interest. 16. The method of claim 15, wherein the ranking is based on affinity information about the candidate recommended users with respect to the interest included in the user profile characteristic. 17. The method of claim 1, wherein the user profile characteristic comprises a graph object defined by an entity external to the social networking system. 18. The method of claim 17, wherein the ranking is based on affinity information about the candidate recommended users with respect to the graph object included in the user profile characteristic. 19. The method of claim 1, wherein the user profile characteristic is suggested by the social networking system based on a characteristic of the user profile of the viewing user. 20. The method of claim 1, wherein the user profile characteristic is pre-populated by the social networking system based on a characteristic of the user profile of the viewing user. 21. A method comprising:
transmitting, from a user device associated with a viewing user of a social networking system, a request to the social networking system for recommending one or more other users with whom to establish a connection in the social networking system; receiving a listing of a plurality of candidate recommended users for display in an interface on the user device, the interface including a first plurality of links for the viewing user to establish a connection with the plurality of candidate recommended users in the social networking system and a second plurality of links for selecting one or more user profile characteristics for filtering the candidate recommended users; receiving a selection of a link of the second plurality of links, the selection associated with a specified user profile characteristic; and responsive to the selection, rendering the listing of the plurality of candidate recommended users for display in the interface to exclude users having profiles that do not match the specified user profile characteristic. 22. The method of claim 21, further comprising:
receiving input via the user device for identifying a user profile characteristic not included in the interface; and receiving an indication of selecting the identified user profile characteristic as the specified user profile characteristic. 23. The method of claim 21, further comprising:
receiving a selection of a link of the first plurality of links, the selection associated with a specified candidate recommended user; and receiving an indication that a request to establish a connection with the specified candidate recommended user has been transmitted. 24. A method comprising:
maintaining a plurality of user profile objects on a social networking system, the plurality of user profile objects storing a plurality of user profiles associated with a plurality of users of the social networking system; maintaining a plurality of edge objects on the social networking system, where each of the plurality of edge objects comprises a connection established between two users of the social networking system; receiving a request from a viewing user for a plurality of candidate recommended users, where the request includes a selected filter; determining a plurality of unconnected users for the viewing user, where each of the plurality of unconnected users is not connected to the viewing user; filtering the determined plurality of unconnected users to eliminate users with profiles that do not match the selected filter; ranking the filtered plurality of unconnected users based on the associated user profiles of the filtered plurality of unconnected users matching the selected filter; selecting one or more of the ranked and filtered plurality of unconnected users as the plurality of candidate recommended users; and providing the plurality of candidate recommended users for display to the viewing user in an interface enabling the viewing user to establish a connection with the plurality of candidate recommended users. 25. The method of claim 24, wherein ranking the filtered plurality of unconnected users further comprises:
ranking the filtered plurality of unconnected users based on a plurality of predictions that the viewing user will initiate a request to connect with the filtered plurality of unconnected users. 26. The method of claim 24, wherein ranking the filtered plurality of unconnected users further comprises:
ranking the filtered plurality of unconnected users based on a count of mutual connections between the plurality of unconnected users and the viewing user. 27. The method of claim 24, wherein the selected filter comprises an identification of a user connected with the plurality of unconnected users and the viewing user on the social networking system and wherein ranking the filtered plurality of unconnected users further comprises:
ranking the filtered plurality of unconnected users based on a count of mutual user connections, where the count includes the user connected with the viewing user. 28. The method of claim 24, wherein the request from a viewing user for a plurality of candidate recommended users comprises a plurality of selected filters. | A social networking system may recommend a set of users to a viewing user for establishing new connections on the social networking system. Through a user interface, the viewing user may select filters based on characteristics and dimensions of user profile information. The recommended set of users may be ranked according to the selected filters by the number of mutual connections. Pre-populated filters may be selected and suggested based on information about the viewing user. Multiple filters may be selected by the viewing user, and filters may be based on any identifiable object in the social networking system, in one embodiment. The candidate recommended users may also be ranked based on predictions that the viewing user will initiate a request to connect with the candidate recommended users.1. A method comprising:
maintaining a user profile for each of a plurality of users of a social networking system; maintaining a plurality of connections established between users of the social networking system; for a viewing user of the plurality of users, receiving a request to recommend one or more other users with whom to establish a connection in the social networking system by the viewing user, the request comprising a user profile characteristic for recommending the one or more other users; responsive to the request,
determining a plurality of the users of the social networking system with whom the viewing user has not already established a connection; and
filtering the determined plurality of users to eliminate users with profiles that do not match the user profile characteristic, the filtering resulting in a plurality of candidate recommended users;
ranking the candidate recommended users based on a prediction that the viewing user will initiate a request to the candidate recommended users; selecting one or more of the candidate recommended users based on the ranking; and providing the selected candidate recommended users for display to the viewing user in an interface enabling the viewing user to establish a connection with the selected candidate recommended users. 2. The method of claim 1, wherein the ranking is based on a type of the user profile characteristic provided by the viewing user. 3. The method of claim 1, wherein the ranking is based on an inference of the user profile characteristic. 4. The method of claim 1, wherein the user profile characteristic comprises a hometown. 5. The method of claim 4, wherein the ranking is based on a geographic proximity of hometowns included in profiles of candidate recommended users with respect to the hometown included in the user profile characteristic. 6. The method of claim 1, wherein the user profile characteristic comprises a current city. 7. The method of claim 6, wherein the ranking is based on a geographic proximity of current cities included in profiles of candidate recommended users with respect to the current city included in the user profile characteristic. 8. The method of claim 1, wherein the ranking is based on a mutual friend count. 9. The method of claim 1, wherein the user profile characteristic comprises a mutual friend. 10. The method of claim 9, wherein the ranking is based on the candidate recommended users being connected to the mutual friend included in the user profile characteristic on the social networking system. 11. The method of claim 1, wherein the user profile characteristic comprises an object on the social networking system. 12. The method of claim 11, wherein the ranking is based on the candidate recommended users being associated with the object included in the user profile characteristic on the social networking system. 13. The method of claim 1, wherein the user profile characteristic comprises a location object on the social networking system. 14. The method of claim 13, wherein the ranking is based on location information about the candidate recommended users within a predetermined geographic proximity to the location object included in the user profile characteristic on the social networking system. 15. The method of claim 1, wherein the user profile characteristic comprises an interest. 16. The method of claim 15, wherein the ranking is based on affinity information about the candidate recommended users with respect to the interest included in the user profile characteristic. 17. The method of claim 1, wherein the user profile characteristic comprises a graph object defined by an entity external to the social networking system. 18. The method of claim 17, wherein the ranking is based on affinity information about the candidate recommended users with respect to the graph object included in the user profile characteristic. 19. The method of claim 1, wherein the user profile characteristic is suggested by the social networking system based on a characteristic of the user profile of the viewing user. 20. The method of claim 1, wherein the user profile characteristic is pre-populated by the social networking system based on a characteristic of the user profile of the viewing user. 21. A method comprising:
transmitting, from a user device associated with a viewing user of a social networking system, a request to the social networking system for recommending one or more other users with whom to establish a connection in the social networking system; receiving a listing of a plurality of candidate recommended users for display in an interface on the user device, the interface including a first plurality of links for the viewing user to establish a connection with the plurality of candidate recommended users in the social networking system and a second plurality of links for selecting one or more user profile characteristics for filtering the candidate recommended users; receiving a selection of a link of the second plurality of links, the selection associated with a specified user profile characteristic; and responsive to the selection, rendering the listing of the plurality of candidate recommended users for display in the interface to exclude users having profiles that do not match the specified user profile characteristic. 22. The method of claim 21, further comprising:
receiving input via the user device for identifying a user profile characteristic not included in the interface; and receiving an indication of selecting the identified user profile characteristic as the specified user profile characteristic. 23. The method of claim 21, further comprising:
receiving a selection of a link of the first plurality of links, the selection associated with a specified candidate recommended user; and receiving an indication that a request to establish a connection with the specified candidate recommended user has been transmitted. 24. A method comprising:
maintaining a plurality of user profile objects on a social networking system, the plurality of user profile objects storing a plurality of user profiles associated with a plurality of users of the social networking system; maintaining a plurality of edge objects on the social networking system, where each of the plurality of edge objects comprises a connection established between two users of the social networking system; receiving a request from a viewing user for a plurality of candidate recommended users, where the request includes a selected filter; determining a plurality of unconnected users for the viewing user, where each of the plurality of unconnected users is not connected to the viewing user; filtering the determined plurality of unconnected users to eliminate users with profiles that do not match the selected filter; ranking the filtered plurality of unconnected users based on the associated user profiles of the filtered plurality of unconnected users matching the selected filter; selecting one or more of the ranked and filtered plurality of unconnected users as the plurality of candidate recommended users; and providing the plurality of candidate recommended users for display to the viewing user in an interface enabling the viewing user to establish a connection with the plurality of candidate recommended users. 25. The method of claim 24, wherein ranking the filtered plurality of unconnected users further comprises:
ranking the filtered plurality of unconnected users based on a plurality of predictions that the viewing user will initiate a request to connect with the filtered plurality of unconnected users. 26. The method of claim 24, wherein ranking the filtered plurality of unconnected users further comprises:
ranking the filtered plurality of unconnected users based on a count of mutual connections between the plurality of unconnected users and the viewing user. 27. The method of claim 24, wherein the selected filter comprises an identification of a user connected with the plurality of unconnected users and the viewing user on the social networking system and wherein ranking the filtered plurality of unconnected users further comprises:
ranking the filtered plurality of unconnected users based on a count of mutual user connections, where the count includes the user connected with the viewing user. 28. The method of claim 24, wherein the request from a viewing user for a plurality of candidate recommended users comprises a plurality of selected filters. | 2,400 |
7,613 | 7,613 | 14,196,599 | 2,483 | An all-weather, remote camera system includes a camera housing and other components, such as a network connection, that allows the system to be placed in locations for capturing images over periods of time. The camera system includes a megapixel camera linked to a device server and image storage device to capture images under a variety of conditions. The camera system also includes a zoom capability to generate panoramic images. The zoom operations are performed within the camera system at its location. | 1. An all-weather, remote camera system comprising:
a camera housing; a camera enclosed by the camera housing, wherein the camera is configured to capture an image; a storage device to store the image; and a device server configured to instruct the camera to capture the image. 2. The camera system of claim 1, further comprising a control assembly to move a lens of the camera. 3. The camera system of claim 2, wherein the assembly includes a servomotor to rotate a gear ring on the camera. 4. The camera system of claim 1, further comprising a zoom control assembly to move the camera during a zoom operation. 5. The camera system of claim 4, wherein the zoom control assembly comprises a track rail guide assembly configured to allow the camera to move within the camera housing. 6. The camera system of claim 5, wherein the zoom control assembly further includes a bracket to hold a lens of the camera in place during the zoom operation. 7. The camera system of claim 4, wherein the zoom control assembly includes a robotic actuator to rotate a gear ring on the camera. 8. The camera system of claim 1, further comprising a heater activated by a thermostat board. 9. The camera system of claim 1, further comprising a network connector to establish a connection with a network to transmit the image to an Internet protocol (IP) addressable device. 10. The camera system of claim 1, further comprising a LED status indicator. 11. A method for capturing an image using an all-weather camera system, the method comprising:
moving a camera to a pre-defined location; performing a zoom operation using the camera; capturing an image using the camera according to control commands received from a device server; uploading the image to a storage device or to an Internet protocol (IP) addressable device. 12. The method of claim 11, wherein the performing step includes instructing a servomotor to move lens of the camera. 13. The method of claim 11, wherein the performing step includes instructing a robotic actuator to move the camera. 14. The method of claim 11, wherein the performing step includes rotating a gear ring on the camera to perform the zoom operation. 15. The method of claim 11, further comprising moving a camera housing enclosing the camera and the device server. 16. A method for executing a panorama process using an all-weather camera system, the method comprising:
acquiring a calibration image; setting exposure constraints; initiating an image capture sequence according to the exposure constraints and position sequence information using a camera; and processing at least one image acquired in the image capture sequence using image stitching and blending. 17. The method of claim 16, further comprising performing a zoom operation to prior to initiating the image capture sequence. 18. The method of claim 17, wherein the performing step includes using a zoom control assembly to move the camera. 19. A method for executing a self-repair process for an all-weather camera system, the method comprising:
monitoring components within the camera system; identifying an error condition for a component; displaying a code using a LED indicator; and transmitting diagnostic data from the camera system. 20. A method for executing a self-repair process during a loss of connection to a network from an all-weather camera system, the method comprising:
monitoring a network connector within the camera system; identifying a loss of connection to the network; archiving at least one image to a data storage on the camera system; and restoring the archived at least one image over the network when the connection is re-established. 21. An all-weather, remote camera system comprising:
a camera housing engaged to a pan/tilt base and having a lens cover; a megapixel camera enclosed by the camera housing, wherein the camera is configured to capture an image; a storage device to store the image; a device server configured to instruct the camera to capture the image; and a zoom control assembly to move the camera while lens of the camera remains fixed in close proximity to the lens cover according to an instruction received from the device server, wherein the zoom control assembly includes a track guide rail assembly and a mount sled to move the camera. | An all-weather, remote camera system includes a camera housing and other components, such as a network connection, that allows the system to be placed in locations for capturing images over periods of time. The camera system includes a megapixel camera linked to a device server and image storage device to capture images under a variety of conditions. The camera system also includes a zoom capability to generate panoramic images. The zoom operations are performed within the camera system at its location.1. An all-weather, remote camera system comprising:
a camera housing; a camera enclosed by the camera housing, wherein the camera is configured to capture an image; a storage device to store the image; and a device server configured to instruct the camera to capture the image. 2. The camera system of claim 1, further comprising a control assembly to move a lens of the camera. 3. The camera system of claim 2, wherein the assembly includes a servomotor to rotate a gear ring on the camera. 4. The camera system of claim 1, further comprising a zoom control assembly to move the camera during a zoom operation. 5. The camera system of claim 4, wherein the zoom control assembly comprises a track rail guide assembly configured to allow the camera to move within the camera housing. 6. The camera system of claim 5, wherein the zoom control assembly further includes a bracket to hold a lens of the camera in place during the zoom operation. 7. The camera system of claim 4, wherein the zoom control assembly includes a robotic actuator to rotate a gear ring on the camera. 8. The camera system of claim 1, further comprising a heater activated by a thermostat board. 9. The camera system of claim 1, further comprising a network connector to establish a connection with a network to transmit the image to an Internet protocol (IP) addressable device. 10. The camera system of claim 1, further comprising a LED status indicator. 11. A method for capturing an image using an all-weather camera system, the method comprising:
moving a camera to a pre-defined location; performing a zoom operation using the camera; capturing an image using the camera according to control commands received from a device server; uploading the image to a storage device or to an Internet protocol (IP) addressable device. 12. The method of claim 11, wherein the performing step includes instructing a servomotor to move lens of the camera. 13. The method of claim 11, wherein the performing step includes instructing a robotic actuator to move the camera. 14. The method of claim 11, wherein the performing step includes rotating a gear ring on the camera to perform the zoom operation. 15. The method of claim 11, further comprising moving a camera housing enclosing the camera and the device server. 16. A method for executing a panorama process using an all-weather camera system, the method comprising:
acquiring a calibration image; setting exposure constraints; initiating an image capture sequence according to the exposure constraints and position sequence information using a camera; and processing at least one image acquired in the image capture sequence using image stitching and blending. 17. The method of claim 16, further comprising performing a zoom operation to prior to initiating the image capture sequence. 18. The method of claim 17, wherein the performing step includes using a zoom control assembly to move the camera. 19. A method for executing a self-repair process for an all-weather camera system, the method comprising:
monitoring components within the camera system; identifying an error condition for a component; displaying a code using a LED indicator; and transmitting diagnostic data from the camera system. 20. A method for executing a self-repair process during a loss of connection to a network from an all-weather camera system, the method comprising:
monitoring a network connector within the camera system; identifying a loss of connection to the network; archiving at least one image to a data storage on the camera system; and restoring the archived at least one image over the network when the connection is re-established. 21. An all-weather, remote camera system comprising:
a camera housing engaged to a pan/tilt base and having a lens cover; a megapixel camera enclosed by the camera housing, wherein the camera is configured to capture an image; a storage device to store the image; a device server configured to instruct the camera to capture the image; and a zoom control assembly to move the camera while lens of the camera remains fixed in close proximity to the lens cover according to an instruction received from the device server, wherein the zoom control assembly includes a track guide rail assembly and a mount sled to move the camera. | 2,400 |
7,614 | 7,614 | 13,548,100 | 2,481 | A method for motion estimation is provided that includes determining a first motion vector for a first child coding unit (CU) of a parent CU and a second motion vector for a second child CU of the parent CU, wherein the first child CU, the second child CU, and the parent CU are in a CU hierarchy, wherein the first and second child CUs are smallest size CUs in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector, selecting the first and second motion vectors as candidate predictors for the parent CU, selecting a predictor for a prediction unit (PU) of the first parent CU from the candidate predictors, and refining the predictor using a second motion search type to determine a motion vector for the PU. | 1. A method for motion estimation in a video encoder, the method comprising:
determining a first motion vector for a first child coding unit (CU) of a first parent CU and a second motion vector for a second child CU of the first parent CU, wherein the first child CU, the second child CU, and the first parent CU are comprised in a CU hierarchy of a largest coding unit (LCU), wherein the first and second child CUs are CUs of a smallest size in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector; selecting the first and second motion vectors as first and second candidate predictors for the first parent CU; selecting a first predictor for a prediction unit (PU) of the first parent CU, wherein the first predictor is one of the first and second candidate predictors; and refining the first predictor using a second motion search type to determine a motion vector for the PU. 2. The method of claim 1, wherein the second motion search type is less complex than the first motion search type. 3. The method of claim 1, wherein the second motion search type is a one step motion search in which eight neighboring positions around the first predictor are evaluated to determine the motion vector for the PU. 4. The method of claim 3, wherein the first motion search type is a three step motion search. 5. The method of claim 1, wherein the first motion vector and the second motion vector are forward motion vectors, the selected first predictor is a forward predictor, and the motion vector determined for the PU is a forward motion vector. 6. The method of claim 1, wherein the first motion vector and the second motion vector are backward motion vectors, the selected first predictor is a backward predictor, and the motion vector determined for the PU is a backward motion vector. 7. The method of claim 1, further comprising:
determining a third motion vector for a third child coding unit (CU) of the first parent CU and a fourth motion vector for a fourth child CU of the first parent CU, wherein the third and fourth child CUs are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; and selecting the third and fourth motion vectors as third and fourth candidate predictors for the first parent CU; and wherein selecting a first predictor for a prediction unit (PU) comprises selecting the first predictor for the PU, wherein the first predictor is one of the first, second, third, and fourth candidate predictors. 8. The method of claim 1, further comprising:
determining a third motion vector for a first child coding unit (CU) of a second parent CU and a fourth motion vector for a second child CU of the second parent CU, wherein the first child CU of the second parent CU, the second child CU of the second parent CU, and the second parent CU are comprised in the CU hierarchy, wherein the first parent CU and the second parent CU are child CUs of a third parent CU in the CU hierarchy, wherein the first and second child CUs of the second parent CU are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; selecting the third and fourth motion vectors as first and second candidate predictors for the second parent CU; selecting a second predictor for a PU of the second parent CU, wherein the second predictor is one of the first and second candidate predictors for the second parent CU; and refining the second predictor using the second motion search type to determine a motion vector for the PU of the second parent CU. 9. The method of claim 8, further comprising:
selecting the motion vector of the PU of the first parent CU and the motion vector of the PU of the second parent PU as first and second candidate predictors for the third parent CU; selecting a third predictor for a PU of the third parent CU, wherein the third predictor is one of the first and second candidate predictors for the third parent CU; and refining the third predictor using the second motion search type to determine a motion vector for the PU of the third parent CU. 10. A digital system comprising a video encoder configured to perform a method for motion estimation during encoding of a video stream, the method comprising:
determining a first motion vector for a first child coding unit (CU) of a first parent CU and a second motion vector for a second child CU of the first parent CU, wherein the first child CU, the second child CU, and the first parent CU are comprised in a CU hierarchy of a largest coding unit (LCU), wherein the first and second child CUs are CUs of a smallest size in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector; selecting the first and second motion vectors as first and second candidate predictors for the first parent CU; selecting a first predictor for a prediction unit (PU) of the first parent CU, wherein the first predictor is one of the first and second candidate predictors; and refining the first predictor using a second motion search type to determine a motion vector for the PU. 11. The digital system of claim 10, wherein the second motion search type is less complex than the first motion search type. 12. The digital system of claim 10, the method further comprising:
determining a third motion vector for a third child coding unit (CU) of the first parent CU and a fourth motion vector for a fourth child CU of the first parent CU, wherein the third and fourth child CUs are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; and selecting the third and fourth motion vectors as third and fourth candidate predictors for the first parent CU; and wherein selecting a first predictor for a prediction unit (PU) comprises selecting the first predictor for the PU, wherein the first predictor is one of the first, second, third, and fourth candidate predictors. 13. The digital system of claim 10, the method further comprising:
determining a third motion vector for a first child coding unit (CU) of a second parent CU and a fourth motion vector for a second child CU of the second parent CU, wherein the first child CU of the second parent CU, the second child CU of the second parent CU, and the second parent CU are comprised in the CU hierarchy, wherein the first parent CU and the second parent CU are child CUs of a third parent CU in the CU hierarchy, wherein the first and second child CUs of the second parent CU are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; selecting the third and fourth motion vectors as first and second candidate predictors for the second parent CU; selecting a second predictor for a PU of the second parent CU, wherein the second predictor is one of the first and second candidate predictors for the second parent CU; and refining the second predictor using the second motion search type to determine a motion vector for the PU of the second parent CU. 14. The digital system of claim 13, the method further comprising:
selecting the motion vector of the PU of the first parent CU and the motion vector of the PU of the second parent PU as first and second candidate predictors for the third parent CU; selecting a third predictor for a PU of the third parent CU, wherein the third predictor is one of the first and second candidate predictors for the third parent CU; and refining the third predictor using the second motion search type to determine a motion vector for the PU of the third parent CU. 15. A computer readable medium storing software instructions that when executed in a digital system cause the digital system to perform a method for motion estimation as part of encoding a video stream, the method comprising:
determining a first motion vector for a first child coding unit (CU) of a first parent CU and a second motion vector for a second child CU of the first parent CU, wherein the first child CU, the second child CU, and the first parent CU are comprised in a CU hierarchy of a largest coding unit (LCU), wherein the first and second child CUs are CUs of a smallest size in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector; selecting the first and second motion vectors as first and second candidate predictors for the first parent CU; selecting a first predictor for a prediction unit (PU) of the first parent CU, wherein the first predictor is one of the first and second candidate predictors; and refining the first predictor using a second motion search type to determine a motion vector for the PU. 16. The computer readable medium of claim 15, wherein the second motion search type is less complex than the first motion search type. 17. The computer readable medium of claim 15, the method further comprising:
determining a third motion vector for a third child coding unit (CU) of the first parent CU and a fourth motion vector for a fourth child CU of the first parent CU, wherein the third and fourth child CUs are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; and selecting the third and fourth motion vectors as third and fourth candidate predictors for the first parent CU; and wherein selecting a first predictor for a prediction unit (PU) comprises selecting the first predictor for the PU, wherein the first predictor is one of the first, second, third, and fourth candidate predictors. 18. The computer readable medium of claim 15, the method further comprising:
determining a third motion vector for a first child coding unit (CU) of a second parent CU and a fourth motion vector for a second child CU of the second parent CU, wherein the first child CU of the second parent CU, the second child CU of the second parent CU, and the second parent CU are comprised in the CU hierarchy, wherein the first parent CU and the second parent CU are child CUs of a third parent CU in the CU hierarchy, wherein the first and second child CUs of the second parent CU are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; selecting the third and fourth motion vectors as first and second candidate predictors for the second parent CU; selecting a second predictor for a PU of the second parent CU, wherein the second predictor is one of the first and second candidate predictors for the second parent CU; and refining the second predictor using the second motion search type to determine a motion vector for the PU of the second parent CU. 19. The computer readable medium of claim 18, the method further comprising:
selecting the motion vector of the PU of the first parent CU and the motion vector of the PU of the second parent PU as first and second candidate predictors for the third parent CU; selecting a third predictor for a PU of the third parent CU, wherein the third predictor is one of the first and second candidate predictors for the third parent CU; and refining the third predictor using the second motion search type to determine a motion vector for the PU of the third parent CU. | A method for motion estimation is provided that includes determining a first motion vector for a first child coding unit (CU) of a parent CU and a second motion vector for a second child CU of the parent CU, wherein the first child CU, the second child CU, and the parent CU are in a CU hierarchy, wherein the first and second child CUs are smallest size CUs in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector, selecting the first and second motion vectors as candidate predictors for the parent CU, selecting a predictor for a prediction unit (PU) of the first parent CU from the candidate predictors, and refining the predictor using a second motion search type to determine a motion vector for the PU.1. A method for motion estimation in a video encoder, the method comprising:
determining a first motion vector for a first child coding unit (CU) of a first parent CU and a second motion vector for a second child CU of the first parent CU, wherein the first child CU, the second child CU, and the first parent CU are comprised in a CU hierarchy of a largest coding unit (LCU), wherein the first and second child CUs are CUs of a smallest size in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector; selecting the first and second motion vectors as first and second candidate predictors for the first parent CU; selecting a first predictor for a prediction unit (PU) of the first parent CU, wherein the first predictor is one of the first and second candidate predictors; and refining the first predictor using a second motion search type to determine a motion vector for the PU. 2. The method of claim 1, wherein the second motion search type is less complex than the first motion search type. 3. The method of claim 1, wherein the second motion search type is a one step motion search in which eight neighboring positions around the first predictor are evaluated to determine the motion vector for the PU. 4. The method of claim 3, wherein the first motion search type is a three step motion search. 5. The method of claim 1, wherein the first motion vector and the second motion vector are forward motion vectors, the selected first predictor is a forward predictor, and the motion vector determined for the PU is a forward motion vector. 6. The method of claim 1, wherein the first motion vector and the second motion vector are backward motion vectors, the selected first predictor is a backward predictor, and the motion vector determined for the PU is a backward motion vector. 7. The method of claim 1, further comprising:
determining a third motion vector for a third child coding unit (CU) of the first parent CU and a fourth motion vector for a fourth child CU of the first parent CU, wherein the third and fourth child CUs are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; and selecting the third and fourth motion vectors as third and fourth candidate predictors for the first parent CU; and wherein selecting a first predictor for a prediction unit (PU) comprises selecting the first predictor for the PU, wherein the first predictor is one of the first, second, third, and fourth candidate predictors. 8. The method of claim 1, further comprising:
determining a third motion vector for a first child coding unit (CU) of a second parent CU and a fourth motion vector for a second child CU of the second parent CU, wherein the first child CU of the second parent CU, the second child CU of the second parent CU, and the second parent CU are comprised in the CU hierarchy, wherein the first parent CU and the second parent CU are child CUs of a third parent CU in the CU hierarchy, wherein the first and second child CUs of the second parent CU are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; selecting the third and fourth motion vectors as first and second candidate predictors for the second parent CU; selecting a second predictor for a PU of the second parent CU, wherein the second predictor is one of the first and second candidate predictors for the second parent CU; and refining the second predictor using the second motion search type to determine a motion vector for the PU of the second parent CU. 9. The method of claim 8, further comprising:
selecting the motion vector of the PU of the first parent CU and the motion vector of the PU of the second parent PU as first and second candidate predictors for the third parent CU; selecting a third predictor for a PU of the third parent CU, wherein the third predictor is one of the first and second candidate predictors for the third parent CU; and refining the third predictor using the second motion search type to determine a motion vector for the PU of the third parent CU. 10. A digital system comprising a video encoder configured to perform a method for motion estimation during encoding of a video stream, the method comprising:
determining a first motion vector for a first child coding unit (CU) of a first parent CU and a second motion vector for a second child CU of the first parent CU, wherein the first child CU, the second child CU, and the first parent CU are comprised in a CU hierarchy of a largest coding unit (LCU), wherein the first and second child CUs are CUs of a smallest size in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector; selecting the first and second motion vectors as first and second candidate predictors for the first parent CU; selecting a first predictor for a prediction unit (PU) of the first parent CU, wherein the first predictor is one of the first and second candidate predictors; and refining the first predictor using a second motion search type to determine a motion vector for the PU. 11. The digital system of claim 10, wherein the second motion search type is less complex than the first motion search type. 12. The digital system of claim 10, the method further comprising:
determining a third motion vector for a third child coding unit (CU) of the first parent CU and a fourth motion vector for a fourth child CU of the first parent CU, wherein the third and fourth child CUs are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; and selecting the third and fourth motion vectors as third and fourth candidate predictors for the first parent CU; and wherein selecting a first predictor for a prediction unit (PU) comprises selecting the first predictor for the PU, wherein the first predictor is one of the first, second, third, and fourth candidate predictors. 13. The digital system of claim 10, the method further comprising:
determining a third motion vector for a first child coding unit (CU) of a second parent CU and a fourth motion vector for a second child CU of the second parent CU, wherein the first child CU of the second parent CU, the second child CU of the second parent CU, and the second parent CU are comprised in the CU hierarchy, wherein the first parent CU and the second parent CU are child CUs of a third parent CU in the CU hierarchy, wherein the first and second child CUs of the second parent CU are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; selecting the third and fourth motion vectors as first and second candidate predictors for the second parent CU; selecting a second predictor for a PU of the second parent CU, wherein the second predictor is one of the first and second candidate predictors for the second parent CU; and refining the second predictor using the second motion search type to determine a motion vector for the PU of the second parent CU. 14. The digital system of claim 13, the method further comprising:
selecting the motion vector of the PU of the first parent CU and the motion vector of the PU of the second parent PU as first and second candidate predictors for the third parent CU; selecting a third predictor for a PU of the third parent CU, wherein the third predictor is one of the first and second candidate predictors for the third parent CU; and refining the third predictor using the second motion search type to determine a motion vector for the PU of the third parent CU. 15. A computer readable medium storing software instructions that when executed in a digital system cause the digital system to perform a method for motion estimation as part of encoding a video stream, the method comprising:
determining a first motion vector for a first child coding unit (CU) of a first parent CU and a second motion vector for a second child CU of the first parent CU, wherein the first child CU, the second child CU, and the first parent CU are comprised in a CU hierarchy of a largest coding unit (LCU), wherein the first and second child CUs are CUs of a smallest size in the CU hierarchy, and wherein a first motion search type is used to determine the first motion vector and the second motion vector; selecting the first and second motion vectors as first and second candidate predictors for the first parent CU; selecting a first predictor for a prediction unit (PU) of the first parent CU, wherein the first predictor is one of the first and second candidate predictors; and refining the first predictor using a second motion search type to determine a motion vector for the PU. 16. The computer readable medium of claim 15, wherein the second motion search type is less complex than the first motion search type. 17. The computer readable medium of claim 15, the method further comprising:
determining a third motion vector for a third child coding unit (CU) of the first parent CU and a fourth motion vector for a fourth child CU of the first parent CU, wherein the third and fourth child CUs are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; and selecting the third and fourth motion vectors as third and fourth candidate predictors for the first parent CU; and wherein selecting a first predictor for a prediction unit (PU) comprises selecting the first predictor for the PU, wherein the first predictor is one of the first, second, third, and fourth candidate predictors. 18. The computer readable medium of claim 15, the method further comprising:
determining a third motion vector for a first child coding unit (CU) of a second parent CU and a fourth motion vector for a second child CU of the second parent CU, wherein the first child CU of the second parent CU, the second child CU of the second parent CU, and the second parent CU are comprised in the CU hierarchy, wherein the first parent CU and the second parent CU are child CUs of a third parent CU in the CU hierarchy, wherein the first and second child CUs of the second parent CU are CUs of the smallest size in the CU hierarchy, and wherein the first motion search type is used to determine the third motion vector and the fourth motion vector; selecting the third and fourth motion vectors as first and second candidate predictors for the second parent CU; selecting a second predictor for a PU of the second parent CU, wherein the second predictor is one of the first and second candidate predictors for the second parent CU; and refining the second predictor using the second motion search type to determine a motion vector for the PU of the second parent CU. 19. The computer readable medium of claim 18, the method further comprising:
selecting the motion vector of the PU of the first parent CU and the motion vector of the PU of the second parent PU as first and second candidate predictors for the third parent CU; selecting a third predictor for a PU of the third parent CU, wherein the third predictor is one of the first and second candidate predictors for the third parent CU; and refining the third predictor using the second motion search type to determine a motion vector for the PU of the third parent CU. | 2,400 |
7,615 | 7,615 | 14,665,065 | 2,482 | A camera assembly for a vehicle vision system includes a housing with a lens holder at a first housing portion and a connector portion at a second housing portion. The connector portion is configured for connecting to vehicle wiring when the camera assembly is installed at a vehicle. A circuit element is disposed within the housing and a plurality of electrical connector elements is disposed at the connector portion of the second housing portion. Each of the electrical connector elements includes a first end portion configured for electrically connecting to circuitry of the circuit element and a second end portion configured for electrically connecting to the vehicle wiring. The first end portions of the electrical connector elements include flexible elements that, during mating of the first housing portion to the second housing portion, flex as the first end portions engage the circuitry and make electrical connection with the circuitry. | 1. A camera assembly for a vehicle vision system, said camera assembly comprising:
a housing comprising a first housing portion mated with a second housing portion; wherein said first housing portion comprises a lens holder; wherein said second housing portion comprises a connector portion; wherein said connector portion is configured for connecting to vehicle wiring when said camera assembly is installed at a vehicle; a circuit element disposed within said housing; a plurality of electrical connector elements disposed at said connector portion of said second housing portion, wherein each of said electrical connector elements comprises (i) a first end portion that is configured for electrically connecting to circuitry of said circuit element and (ii) a second end portion that is configured for electrically connecting to the vehicle wiring; wherein said first end portions of said electrical connector elements comprise flexible elements; and wherein, during mating of said first housing portion to said second housing portion, said first end portions flex as said first end portions engage said circuitry and make electrical connection with said circuitry. 2. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements are angled relative to said second end portions of said electrical connector elements. 3. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements comprise spring elements that compress as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 4. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements are biased towards an extended state and compress towards a compressed state as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 5. The camera assembly of claim 4, wherein, when in said compressed state, said first end portions exert a biasing force at said circuitry to maintain electrical connection with said circuitry. 6. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements comprise coil spring elements that compress as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 7. The camera assembly of claim 1, wherein said electrical connector elements are insert molded in said connector portion during injection molding of said second housing portion with a polymer resin. 8. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements engage respective electrically conductive pads at said circuit element during mating of said first housing portion to said second housing portion. 9. The camera assembly of claim 1, wherein said first end portions have a thickness that is less than a thickness of said second end portions of said electrical connector elements. 10. The camera assembly of claim 1, wherein each of said electrical connector elements comprises a terminal body that is disposed in said connector portion of said second housing portion, and wherein said first end portion is at a first end of said terminal body, and wherein said second end portion is at a second end of said terminal body. 11. The camera assembly of claim 10, wherein said first end portions are connected to said first ends of said terminal bodies of said electrical connector elements. 12. The camera assembly of claim 11, wherein said first end portions are press-fit at said first ends of said terminal bodies. 13. The camera assembly of claim 12, wherein said second end portions are integrally formed with said terminal bodies. 14. The camera assembly of claim 1, wherein said first end portions are disposed in respective chambers of said second housing portion that are electrically isolated from one another to limit contact between pairs of said first end portions. 15. The camera assembly of claim 1, wherein said camera assembly comprises a rear backup camera of a vehicle. 16. A camera assembly for a vehicle vision system, said camera assembly comprising:
a housing comprising a first housing portion mated with a second housing portion; wherein said first housing portion comprises a lens holder; wherein said second housing portion comprises a connector portion; wherein said connector portion is configured for connecting to vehicle wiring when said camera assembly is installed at a vehicle; a circuit element disposed within said housing; a plurality of electrical connector elements disposed at said connector portion of said second housing portion, wherein each of said electrical connector elements comprises (i) a first end portion that is configured for electrically connecting to circuitry of said circuit element and (ii) a second end portion that is configured for electrically connecting to the vehicle wiring; wherein said first end portions of said electrical connector elements comprise spring elements, and wherein, during mating of said first housing portion to said second housing portion, said spring elements compress as said first end portions engage said circuitry and make electrical connection with said circuitry; wherein said first end portions are biased towards an extended state and compress towards a compressed state as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion; and wherein, when in said compressed state, said first end portions exert a biasing force at said circuitry to maintain electrical connection with said circuitry. 17. The camera assembly of claim 16, wherein said electrical connector elements are insert molded in said connector portion during injection molding of said second housing portion with a polymer resin. 18. The camera assembly of claim 16, wherein said spring elements are disposed in respective chambers of said second housing portion that are electrically isolated from one another to limit contact between pairs of said spring elements. 19. A camera assembly for a vehicle vision system, said camera assembly comprising:
a housing comprising a first housing portion mated with a second housing portion; wherein said first housing portion comprises a lens holder; wherein said second housing portion comprises a connector portion; wherein said connector portion is configured for connecting to vehicle wiring when said camera assembly is installed at a vehicle; a circuit element disposed within said housing; a plurality of electrical connector elements disposed at said connector portion of said second housing portion, wherein each of said electrical connector elements comprises (i) a body portion, (ii) a first end portion at a first end of said body portion, wherein said first end portion is configured for electrically connecting to circuitry of said circuit element, and (iii) a second end portion at a second end of said body portion, wherein said second end portion is configured for electrically connecting to the vehicle wiring; wherein said body portions are insert molded in said connector portion during injection molding of said second housing portion with a polymer resin; wherein said second end portions are integrally formed with said terminal bodies and are exposed at said connector portion of said second housing portion; wherein said first end portions of said electrical connector elements comprise flexible elements; wherein, during mating of said first housing portion to said second housing portion, said first end portions flex as said first end portions engage said circuitry and make electrical connection with said circuitry; and wherein said first end portions are of said electrical connector elements are biased towards a non-flexed state and flex towards a flexed state as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 20. The camera assembly of claim 19, wherein said first end portions of said electrical connector elements comprise spring elements that compress as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion, and wherein, when in said compressed state, said first end portions exert a biasing force at said circuitry to maintain electrical connection with said circuitry, and wherein said spring elements are disposed in respective chambers of said second housing portion that are electrically isolated from one another to limit contact between pairs of said spring elements. | A camera assembly for a vehicle vision system includes a housing with a lens holder at a first housing portion and a connector portion at a second housing portion. The connector portion is configured for connecting to vehicle wiring when the camera assembly is installed at a vehicle. A circuit element is disposed within the housing and a plurality of electrical connector elements is disposed at the connector portion of the second housing portion. Each of the electrical connector elements includes a first end portion configured for electrically connecting to circuitry of the circuit element and a second end portion configured for electrically connecting to the vehicle wiring. The first end portions of the electrical connector elements include flexible elements that, during mating of the first housing portion to the second housing portion, flex as the first end portions engage the circuitry and make electrical connection with the circuitry.1. A camera assembly for a vehicle vision system, said camera assembly comprising:
a housing comprising a first housing portion mated with a second housing portion; wherein said first housing portion comprises a lens holder; wherein said second housing portion comprises a connector portion; wherein said connector portion is configured for connecting to vehicle wiring when said camera assembly is installed at a vehicle; a circuit element disposed within said housing; a plurality of electrical connector elements disposed at said connector portion of said second housing portion, wherein each of said electrical connector elements comprises (i) a first end portion that is configured for electrically connecting to circuitry of said circuit element and (ii) a second end portion that is configured for electrically connecting to the vehicle wiring; wherein said first end portions of said electrical connector elements comprise flexible elements; and wherein, during mating of said first housing portion to said second housing portion, said first end portions flex as said first end portions engage said circuitry and make electrical connection with said circuitry. 2. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements are angled relative to said second end portions of said electrical connector elements. 3. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements comprise spring elements that compress as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 4. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements are biased towards an extended state and compress towards a compressed state as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 5. The camera assembly of claim 4, wherein, when in said compressed state, said first end portions exert a biasing force at said circuitry to maintain electrical connection with said circuitry. 6. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements comprise coil spring elements that compress as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 7. The camera assembly of claim 1, wherein said electrical connector elements are insert molded in said connector portion during injection molding of said second housing portion with a polymer resin. 8. The camera assembly of claim 1, wherein said first end portions of said electrical connector elements engage respective electrically conductive pads at said circuit element during mating of said first housing portion to said second housing portion. 9. The camera assembly of claim 1, wherein said first end portions have a thickness that is less than a thickness of said second end portions of said electrical connector elements. 10. The camera assembly of claim 1, wherein each of said electrical connector elements comprises a terminal body that is disposed in said connector portion of said second housing portion, and wherein said first end portion is at a first end of said terminal body, and wherein said second end portion is at a second end of said terminal body. 11. The camera assembly of claim 10, wherein said first end portions are connected to said first ends of said terminal bodies of said electrical connector elements. 12. The camera assembly of claim 11, wherein said first end portions are press-fit at said first ends of said terminal bodies. 13. The camera assembly of claim 12, wherein said second end portions are integrally formed with said terminal bodies. 14. The camera assembly of claim 1, wherein said first end portions are disposed in respective chambers of said second housing portion that are electrically isolated from one another to limit contact between pairs of said first end portions. 15. The camera assembly of claim 1, wherein said camera assembly comprises a rear backup camera of a vehicle. 16. A camera assembly for a vehicle vision system, said camera assembly comprising:
a housing comprising a first housing portion mated with a second housing portion; wherein said first housing portion comprises a lens holder; wherein said second housing portion comprises a connector portion; wherein said connector portion is configured for connecting to vehicle wiring when said camera assembly is installed at a vehicle; a circuit element disposed within said housing; a plurality of electrical connector elements disposed at said connector portion of said second housing portion, wherein each of said electrical connector elements comprises (i) a first end portion that is configured for electrically connecting to circuitry of said circuit element and (ii) a second end portion that is configured for electrically connecting to the vehicle wiring; wherein said first end portions of said electrical connector elements comprise spring elements, and wherein, during mating of said first housing portion to said second housing portion, said spring elements compress as said first end portions engage said circuitry and make electrical connection with said circuitry; wherein said first end portions are biased towards an extended state and compress towards a compressed state as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion; and wherein, when in said compressed state, said first end portions exert a biasing force at said circuitry to maintain electrical connection with said circuitry. 17. The camera assembly of claim 16, wherein said electrical connector elements are insert molded in said connector portion during injection molding of said second housing portion with a polymer resin. 18. The camera assembly of claim 16, wherein said spring elements are disposed in respective chambers of said second housing portion that are electrically isolated from one another to limit contact between pairs of said spring elements. 19. A camera assembly for a vehicle vision system, said camera assembly comprising:
a housing comprising a first housing portion mated with a second housing portion; wherein said first housing portion comprises a lens holder; wherein said second housing portion comprises a connector portion; wherein said connector portion is configured for connecting to vehicle wiring when said camera assembly is installed at a vehicle; a circuit element disposed within said housing; a plurality of electrical connector elements disposed at said connector portion of said second housing portion, wherein each of said electrical connector elements comprises (i) a body portion, (ii) a first end portion at a first end of said body portion, wherein said first end portion is configured for electrically connecting to circuitry of said circuit element, and (iii) a second end portion at a second end of said body portion, wherein said second end portion is configured for electrically connecting to the vehicle wiring; wherein said body portions are insert molded in said connector portion during injection molding of said second housing portion with a polymer resin; wherein said second end portions are integrally formed with said terminal bodies and are exposed at said connector portion of said second housing portion; wherein said first end portions of said electrical connector elements comprise flexible elements; wherein, during mating of said first housing portion to said second housing portion, said first end portions flex as said first end portions engage said circuitry and make electrical connection with said circuitry; and wherein said first end portions are of said electrical connector elements are biased towards a non-flexed state and flex towards a flexed state as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion. 20. The camera assembly of claim 19, wherein said first end portions of said electrical connector elements comprise spring elements that compress as said first end portions engage said circuitry and make electrical connection with said circuitry during mating of said first housing portion to said second housing portion, and wherein, when in said compressed state, said first end portions exert a biasing force at said circuitry to maintain electrical connection with said circuitry, and wherein said spring elements are disposed in respective chambers of said second housing portion that are electrically isolated from one another to limit contact between pairs of said spring elements. | 2,400 |
7,616 | 7,616 | 14,929,991 | 2,474 | In a network including a plurality of network nodes interconnected via a plurality of primary links and a controller in communication with the plurality of network nodes, the controller is configured to provide an event profile to the plurality of network nodes, the event profile indicating routing changes to be implemented in a variety of link loss scenarios. Each of the plurality of nodes is configured to determine that a particular link loss event occurred, determine, based on the event profile, routing changes for the particular link loss event, and implement the determined routing changes. | 1. A system for managing a network, comprising:
a plurality of network nodes interconnected via a plurality of primary links;
a controller in communication with the plurality of network nodes, the controller including one or more processors configured to:
provide an event profile to the plurality of network nodes, the event profile indicating routing changes to be implemented in a variety of link loss scenarios; and
wherein each of the plurality of nodes is configured to:
determine that a particular link loss event occurred;
determine, based on the event profile, routing changes for the particular link loss event; and
implement the determined routing changes. 2. The system of claim 1, wherein the controller is further configured to:
receive information from the plurality of nodes; and update the event profiles based on the received information. 3. The system of claim 2, wherein:
the received information identifies links having a high probability of link breaks; and the updating of the profiles accounts for scenarios where the identified links are lost. 4. The system of claim 1, wherein the plurality of network nodes communicate link loss events to one another through at least one of: applications on the nodes, and L2 separated control paths. 5. The system of claim 4, wherein communicating the link loss events through the applications comprises:
broadcasting, by a first node of the plurality of nodes, a frame with a special ether type; and detecting, by a second node of the plurality of nodes, the ether type and forwarding the frame to an application running on the second node. 6. The system of claim 5, wherein the second node is configured to determine whether to re-broadcast the frame, the determining based on whether the frame has not yet been transmitted over one or more interfaces. 7. The system of claim 6, wherein determining whether to re-broadcast the frame comprises looking, by the application on the second node, at a cookie in the frame. 8. A method of updating routing information in a network node, comprising:
receiving, from a controller, an event profile, the event profile indicating routing changes to be implemented in a variety of link loss scenarios; and
determining, with one or more processors, that a particular link loss event occurred;
determining, with the one or more processors based on the event profile, routing changes for the particular link loss event; and
implementing, with the one or more processors, the determined routing changes. 9. The method of claim 8, further comprising:
providing information to the controller, the information indicating a status of one or more links in the network. 10. The method of claim 9, wherein:
the information identifies links having a high probability of link breaks. 11. The method of claim 9, further comprising receiving an updated event profile from the controller in response to providing the information. 12. The method of claim 8, wherein determining that a particular link loss event occurred comprises detecting failure of a link directly coupled to the node. 13. The method of claim 8, wherein determining that a particular link loss event occurred comprises receiving a notification of the link loss event from a neighboring node. 14. The method of claim 13, further comprising:
determining whether the node has previously transmitted the notification to other nodes; and re-transmitting the notification if it has not yet been transmitted. 15. The system of claim 14, wherein determining whether the node has previously transmitted the notification comprises looking, by an application running on the node, at a cookie in the frame. 16. The method of claim 8, further comprising communicating link loss events to other nodes in the network through an application running on the node. 17. The method of claim 16, wherein communicating the link loss events through the application comprises broadcasting a frame with a special ether type detectable by the other nodes. 18. A network node, comprising:
a memory storing one or more routing tables; and one or more processors in communication with the memory, the one or more processors programmed to: receive, from a controller, an event profile, the event profile indicating routing changes to be implemented in a variety of link loss scenarios; and
determine that a particular link loss event occurred;
determine, based on the event profile, routing changes for the particular link loss event; and
implement the determined routing changes. 19. The node of claim 18, wherein determining that a particular link loss event occurred comprises receiving a notification of the link loss event from a neighboring node; and wherein the node is further programmed to:
determine whether it has previously transmitted the notification to other nodes; and re-transmit the notification if it has not yet been transmitted. 20. The node of claim 19, the node executing one or more applications, wherein the one or more applications determine whether the notification was previously transmitted and re-transmit the notification. | In a network including a plurality of network nodes interconnected via a plurality of primary links and a controller in communication with the plurality of network nodes, the controller is configured to provide an event profile to the plurality of network nodes, the event profile indicating routing changes to be implemented in a variety of link loss scenarios. Each of the plurality of nodes is configured to determine that a particular link loss event occurred, determine, based on the event profile, routing changes for the particular link loss event, and implement the determined routing changes.1. A system for managing a network, comprising:
a plurality of network nodes interconnected via a plurality of primary links;
a controller in communication with the plurality of network nodes, the controller including one or more processors configured to:
provide an event profile to the plurality of network nodes, the event profile indicating routing changes to be implemented in a variety of link loss scenarios; and
wherein each of the plurality of nodes is configured to:
determine that a particular link loss event occurred;
determine, based on the event profile, routing changes for the particular link loss event; and
implement the determined routing changes. 2. The system of claim 1, wherein the controller is further configured to:
receive information from the plurality of nodes; and update the event profiles based on the received information. 3. The system of claim 2, wherein:
the received information identifies links having a high probability of link breaks; and the updating of the profiles accounts for scenarios where the identified links are lost. 4. The system of claim 1, wherein the plurality of network nodes communicate link loss events to one another through at least one of: applications on the nodes, and L2 separated control paths. 5. The system of claim 4, wherein communicating the link loss events through the applications comprises:
broadcasting, by a first node of the plurality of nodes, a frame with a special ether type; and detecting, by a second node of the plurality of nodes, the ether type and forwarding the frame to an application running on the second node. 6. The system of claim 5, wherein the second node is configured to determine whether to re-broadcast the frame, the determining based on whether the frame has not yet been transmitted over one or more interfaces. 7. The system of claim 6, wherein determining whether to re-broadcast the frame comprises looking, by the application on the second node, at a cookie in the frame. 8. A method of updating routing information in a network node, comprising:
receiving, from a controller, an event profile, the event profile indicating routing changes to be implemented in a variety of link loss scenarios; and
determining, with one or more processors, that a particular link loss event occurred;
determining, with the one or more processors based on the event profile, routing changes for the particular link loss event; and
implementing, with the one or more processors, the determined routing changes. 9. The method of claim 8, further comprising:
providing information to the controller, the information indicating a status of one or more links in the network. 10. The method of claim 9, wherein:
the information identifies links having a high probability of link breaks. 11. The method of claim 9, further comprising receiving an updated event profile from the controller in response to providing the information. 12. The method of claim 8, wherein determining that a particular link loss event occurred comprises detecting failure of a link directly coupled to the node. 13. The method of claim 8, wherein determining that a particular link loss event occurred comprises receiving a notification of the link loss event from a neighboring node. 14. The method of claim 13, further comprising:
determining whether the node has previously transmitted the notification to other nodes; and re-transmitting the notification if it has not yet been transmitted. 15. The system of claim 14, wherein determining whether the node has previously transmitted the notification comprises looking, by an application running on the node, at a cookie in the frame. 16. The method of claim 8, further comprising communicating link loss events to other nodes in the network through an application running on the node. 17. The method of claim 16, wherein communicating the link loss events through the application comprises broadcasting a frame with a special ether type detectable by the other nodes. 18. A network node, comprising:
a memory storing one or more routing tables; and one or more processors in communication with the memory, the one or more processors programmed to: receive, from a controller, an event profile, the event profile indicating routing changes to be implemented in a variety of link loss scenarios; and
determine that a particular link loss event occurred;
determine, based on the event profile, routing changes for the particular link loss event; and
implement the determined routing changes. 19. The node of claim 18, wherein determining that a particular link loss event occurred comprises receiving a notification of the link loss event from a neighboring node; and wherein the node is further programmed to:
determine whether it has previously transmitted the notification to other nodes; and re-transmit the notification if it has not yet been transmitted. 20. The node of claim 19, the node executing one or more applications, wherein the one or more applications determine whether the notification was previously transmitted and re-transmit the notification. | 2,400 |
7,617 | 7,617 | 14,567,162 | 2,483 | Techniques related to determining partition modes and transform sizes for video coding are discussed. Such techniques may include determining a portion of a video frame is flat and bypassing an inter-prediction partition check and/or a transform size check for the portion of the video frame based on the portion of the video frame being flat. | 1. A computer-implemented method for video coding comprising:
determining a portion of a video frame is flat based on a flatness check of the portion of the video frame; bypassing an inter-prediction partition check for the portion of the video frame based on the portion of the video frame being flat; and performing a final mode decision for the portion of the video frame based at least in part on an inter-prediction mode coding cost for the portion of the video frame associated with an initial motion vector and an initial inter-prediction partition choice for the portion of the video frame. 2. The method of claim 1, further comprising:
bypassing a transform size check for the portion of the video frame based on the portion of the video frame being flat; and selecting a maximum transform size for the portion of the video frame based on the portion of the video frame being flat. 3. The method of claim 2, wherein the maximum transform size comprises a size of the portion of the video frame. 4. The method of claim 1, further comprising:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; and selecting a minimum transform size for the second portion of the video frame based on the second portion of the video frame being not flat. 5. The method of claim 4, further comprising:
performing a second inter-prediction partition check for the second portion of the video frame based on the second portion of the video frame being not flat and based on a second initial motion vector and a second initial inter-prediction partition choice for the second portion of the video frame to determine a final motion vector and a final inter-prediction partition choice for the second portion of the video frame; and performing a second final mode decision for the second portion of the video frame based at least in part on a second inter-prediction mode coding cost for the second portion of the video frame associated with the final motion vector and the final inter-prediction partition choice for the second portion of the video frame. 6. The method of claim 1, further comprising:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; determining the initial motion vector, the initial inter-prediction partition, and a second initial motion vector and a second initial inter-prediction partition for the second portion of the video frame based on a tree pruning technique; and performing a second inter-prediction partition check for the second portion of the video frame based on the portion of the video frame being not flat, the second inter-prediction partition check comprising a full partition options evaluation for the second portion of the video frame to generate a final motion vector and a final inter-prediction partition choice for the second portion of the video frame. 7. The method of claim 1, wherein the flatness check comprises at least one of a comparison of a pixel variance of the portion of the video frame to a first threshold, a determination of whether all pixel values of the portion of the video frame are within a second threshold of an average of the pixel values of the portion of the video frame, or a comparison of a range of the pixel values to a third threshold. 8. The method of claim 1, wherein the final mode decision for the portion of the video frame is further based on an intra-prediction mode coding cost for the portion of the video frame and a skip mode coding cost for the portion of the video frame. 9. The method of claim 1, wherein the portion of the video frame comprises at least one of a macroblock or a coding unit. 10. The method of claim 1, wherein the partition check comprises one or more calls to a hardware video motion estimation engine. 11. The method of claim 1, further comprising:
encoding the portion of the video frame based at least in part on the final mode decision to generate an encoded bitstream. 12. A system for providing a video encoding comprising:
a memory configured to store video data; and a central processing unit coupled to the memory, wherein the central processing unit comprises:
flatness check circuitry to determine a portion of a video frame is flat based on a flatness check of the portion of the video frame;
controller circuitry to bypass an inter-prediction partition check for the portion of the video frame based on the portion of the video frame being flat; and
mode selection circuitry to perform a final mode decision for the portion of the video frame based at least in part on an inter-prediction mode coding cost for the portion of the video frame associated with an initial motion vector and an initial inter-prediction partition choice for the portion of the video frame. 13. The system of claim 12, wherein the controller circuitry is to bypass a transform size check for the portion of the video frame based on the portion of the video frame being flat and to select a maximum transform size for the portion of the video frame based on the portion of the video frame being flat. 14. The system of claim 12, wherein the flatness check circuitry is to determine a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame and the controller circuitry is to select a minimum transform size for the second portion of the video frame based on the second portion of the video frame being not flat. 15. The system of claim 14, further comprising:
inter-prediction circuitry to perform a second inter-prediction partition check for the second portion of the video frame based on the second portion of the video frame being not flat and based on a second initial motion vector and a second initial inter-prediction partition choice for the second portion of the video frame to determine a final motion vector and a final inter-prediction partition choice for the second portion of the video frame, wherein the mode selection circuitry is to perform a second final mode decision for the second portion of the video frame based at least in part on a second inter-prediction mode coding cost for the second portion of the video frame associated with the final motion vector and the final inter-prediction partition choice for the second portion of the video frame. 16. The system of claim 12, wherein the flatness check circuitry is to determine a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame, the system further comprising:
inter-prediction circuitry to determine the initial motion vector, the initial inter-prediction partition, and a second initial motion vector and a second initial inter-prediction partition for the second portion of the video frame based on a tree pruning technique and to perform a second inter-prediction partition check for the second portion of the video frame based on the portion of the video frame being not flat, the second inter-prediction partition check comprising a full partition options evaluation for the second portion of the video frame to generate a final motion vector and a final inter-prediction partition choice for the second portion of the video frame. 17. The system of claim 12, wherein the flatness check comprises at least one of a comparison of a pixel variance of the portion of the video frame to a first threshold, a determination of whether all pixel values of the portion of the video frame are within a second threshold of an average of the pixel values of the portion of the video frame, or a comparison of a range of the pixel values to a third threshold. 18. The system of claim 12, further comprising:
a hardware video motion estimation engine to perform at least a portion of the partition check. 19. At least one machine readable medium comprising a plurality of instructions that in response to being executed on a computing device, cause the computing device to encode video by:
determining a portion of a video frame is flat based on a flatness check of the portion of the video frame; bypassing an inter-prediction partition check for the portion of the video frame based on the portion of the video frame being flat; and performing a final mode decision for the portion of the video frame based at least in part on an inter-prediction mode coding cost for the portion of the video frame associated with an initial motion vector and an initial inter-prediction partition choice for the portion of the video frame. 20. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
bypassing a transform size check for the portion of the video frame based on the portion of the video frame being flat; and selecting a maximum transform size for the portion of the video frame based on the portion of the video frame being flat. 21. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; and selecting a minimum transform size for the second portion of the video frame based on the second portion of the video frame being not flat. 22. The machine readable medium of claim 21, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
performing a second inter-prediction partition check for the second portion of the video frame based on the second portion of the video frame being not flat and based on a second initial motion vector and a second initial inter-prediction partition choice for the second portion of the video frame to determine a final motion vector and a final inter-prediction partition choice for the second portion of the video frame; and performing a second final mode decision for the second portion of the video frame based at least in part on a second inter-prediction mode coding cost for the second portion of the video frame associated with the final motion vector and the final inter-prediction partition choice for the second portion of the video frame. 23. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; determining the initial motion vector, the initial inter-prediction partition, and a second initial motion vector and a second initial inter-prediction partition for the second portion of the video frame based on a tree pruning technique; and performing a second inter-prediction partition check for the second portion of the video frame based on the portion of the video frame being not flat, the second inter-prediction partition check comprising a full partition options evaluation for the second portion of the video frame to generate a final motion vector and a final inter-prediction partition choice for the second portion of the video frame. 24. The machine readable medium of claim 19, wherein the flatness check comprises at least one of a comparison of a pixel variance of the portion of the video frame to a first threshold, a determination of whether all pixel values of the portion of the video frame are within a second threshold of an average of the pixel values of the portion of the video frame, or a comparison of a range of the pixel values to a third threshold. 25. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
encoding the portion of the video frame based at least in part on the final mode decision to generate an encoded bitstream. | Techniques related to determining partition modes and transform sizes for video coding are discussed. Such techniques may include determining a portion of a video frame is flat and bypassing an inter-prediction partition check and/or a transform size check for the portion of the video frame based on the portion of the video frame being flat.1. A computer-implemented method for video coding comprising:
determining a portion of a video frame is flat based on a flatness check of the portion of the video frame; bypassing an inter-prediction partition check for the portion of the video frame based on the portion of the video frame being flat; and performing a final mode decision for the portion of the video frame based at least in part on an inter-prediction mode coding cost for the portion of the video frame associated with an initial motion vector and an initial inter-prediction partition choice for the portion of the video frame. 2. The method of claim 1, further comprising:
bypassing a transform size check for the portion of the video frame based on the portion of the video frame being flat; and selecting a maximum transform size for the portion of the video frame based on the portion of the video frame being flat. 3. The method of claim 2, wherein the maximum transform size comprises a size of the portion of the video frame. 4. The method of claim 1, further comprising:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; and selecting a minimum transform size for the second portion of the video frame based on the second portion of the video frame being not flat. 5. The method of claim 4, further comprising:
performing a second inter-prediction partition check for the second portion of the video frame based on the second portion of the video frame being not flat and based on a second initial motion vector and a second initial inter-prediction partition choice for the second portion of the video frame to determine a final motion vector and a final inter-prediction partition choice for the second portion of the video frame; and performing a second final mode decision for the second portion of the video frame based at least in part on a second inter-prediction mode coding cost for the second portion of the video frame associated with the final motion vector and the final inter-prediction partition choice for the second portion of the video frame. 6. The method of claim 1, further comprising:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; determining the initial motion vector, the initial inter-prediction partition, and a second initial motion vector and a second initial inter-prediction partition for the second portion of the video frame based on a tree pruning technique; and performing a second inter-prediction partition check for the second portion of the video frame based on the portion of the video frame being not flat, the second inter-prediction partition check comprising a full partition options evaluation for the second portion of the video frame to generate a final motion vector and a final inter-prediction partition choice for the second portion of the video frame. 7. The method of claim 1, wherein the flatness check comprises at least one of a comparison of a pixel variance of the portion of the video frame to a first threshold, a determination of whether all pixel values of the portion of the video frame are within a second threshold of an average of the pixel values of the portion of the video frame, or a comparison of a range of the pixel values to a third threshold. 8. The method of claim 1, wherein the final mode decision for the portion of the video frame is further based on an intra-prediction mode coding cost for the portion of the video frame and a skip mode coding cost for the portion of the video frame. 9. The method of claim 1, wherein the portion of the video frame comprises at least one of a macroblock or a coding unit. 10. The method of claim 1, wherein the partition check comprises one or more calls to a hardware video motion estimation engine. 11. The method of claim 1, further comprising:
encoding the portion of the video frame based at least in part on the final mode decision to generate an encoded bitstream. 12. A system for providing a video encoding comprising:
a memory configured to store video data; and a central processing unit coupled to the memory, wherein the central processing unit comprises:
flatness check circuitry to determine a portion of a video frame is flat based on a flatness check of the portion of the video frame;
controller circuitry to bypass an inter-prediction partition check for the portion of the video frame based on the portion of the video frame being flat; and
mode selection circuitry to perform a final mode decision for the portion of the video frame based at least in part on an inter-prediction mode coding cost for the portion of the video frame associated with an initial motion vector and an initial inter-prediction partition choice for the portion of the video frame. 13. The system of claim 12, wherein the controller circuitry is to bypass a transform size check for the portion of the video frame based on the portion of the video frame being flat and to select a maximum transform size for the portion of the video frame based on the portion of the video frame being flat. 14. The system of claim 12, wherein the flatness check circuitry is to determine a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame and the controller circuitry is to select a minimum transform size for the second portion of the video frame based on the second portion of the video frame being not flat. 15. The system of claim 14, further comprising:
inter-prediction circuitry to perform a second inter-prediction partition check for the second portion of the video frame based on the second portion of the video frame being not flat and based on a second initial motion vector and a second initial inter-prediction partition choice for the second portion of the video frame to determine a final motion vector and a final inter-prediction partition choice for the second portion of the video frame, wherein the mode selection circuitry is to perform a second final mode decision for the second portion of the video frame based at least in part on a second inter-prediction mode coding cost for the second portion of the video frame associated with the final motion vector and the final inter-prediction partition choice for the second portion of the video frame. 16. The system of claim 12, wherein the flatness check circuitry is to determine a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame, the system further comprising:
inter-prediction circuitry to determine the initial motion vector, the initial inter-prediction partition, and a second initial motion vector and a second initial inter-prediction partition for the second portion of the video frame based on a tree pruning technique and to perform a second inter-prediction partition check for the second portion of the video frame based on the portion of the video frame being not flat, the second inter-prediction partition check comprising a full partition options evaluation for the second portion of the video frame to generate a final motion vector and a final inter-prediction partition choice for the second portion of the video frame. 17. The system of claim 12, wherein the flatness check comprises at least one of a comparison of a pixel variance of the portion of the video frame to a first threshold, a determination of whether all pixel values of the portion of the video frame are within a second threshold of an average of the pixel values of the portion of the video frame, or a comparison of a range of the pixel values to a third threshold. 18. The system of claim 12, further comprising:
a hardware video motion estimation engine to perform at least a portion of the partition check. 19. At least one machine readable medium comprising a plurality of instructions that in response to being executed on a computing device, cause the computing device to encode video by:
determining a portion of a video frame is flat based on a flatness check of the portion of the video frame; bypassing an inter-prediction partition check for the portion of the video frame based on the portion of the video frame being flat; and performing a final mode decision for the portion of the video frame based at least in part on an inter-prediction mode coding cost for the portion of the video frame associated with an initial motion vector and an initial inter-prediction partition choice for the portion of the video frame. 20. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
bypassing a transform size check for the portion of the video frame based on the portion of the video frame being flat; and selecting a maximum transform size for the portion of the video frame based on the portion of the video frame being flat. 21. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; and selecting a minimum transform size for the second portion of the video frame based on the second portion of the video frame being not flat. 22. The machine readable medium of claim 21, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
performing a second inter-prediction partition check for the second portion of the video frame based on the second portion of the video frame being not flat and based on a second initial motion vector and a second initial inter-prediction partition choice for the second portion of the video frame to determine a final motion vector and a final inter-prediction partition choice for the second portion of the video frame; and performing a second final mode decision for the second portion of the video frame based at least in part on a second inter-prediction mode coding cost for the second portion of the video frame associated with the final motion vector and the final inter-prediction partition choice for the second portion of the video frame. 23. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
determining a second portion of the video frame is not flat based on a second flatness check of the second portion of the video frame; determining the initial motion vector, the initial inter-prediction partition, and a second initial motion vector and a second initial inter-prediction partition for the second portion of the video frame based on a tree pruning technique; and performing a second inter-prediction partition check for the second portion of the video frame based on the portion of the video frame being not flat, the second inter-prediction partition check comprising a full partition options evaluation for the second portion of the video frame to generate a final motion vector and a final inter-prediction partition choice for the second portion of the video frame. 24. The machine readable medium of claim 19, wherein the flatness check comprises at least one of a comparison of a pixel variance of the portion of the video frame to a first threshold, a determination of whether all pixel values of the portion of the video frame are within a second threshold of an average of the pixel values of the portion of the video frame, or a comparison of a range of the pixel values to a third threshold. 25. The machine readable medium of claim 19, the machine readable medium comprising further instructions that in response to being executed on a computing device, cause the computing device to encode video by:
encoding the portion of the video frame based at least in part on the final mode decision to generate an encoded bitstream. | 2,400 |
7,618 | 7,618 | 14,869,238 | 2,424 | Methods and systems provide techniques for managing media streaming and content distribution and management using time-based metadata. A video segment may include a gate with associated content that is accessible conditioned on consumption of the gate. The manner in which the gate manages access to the associated content may be defined according to rules and syntactical elements. For example, a gate may be unlocked or collapsed. An unlocked gate allows a user to skip the gate and access the gated content. A collapsed gate is automatically skipped. A gate may become locked or un-collapsed. Various commands, including fast forward, rewind, jump forward, and jump backward may respond to a gate based on its locked or collapsed status. Embodiments also provide pooling of gates and selection of a subset of gates for playing. | 1. A video playback method, comprising:
parsing a media item into gates and associated scopes, when playback reaches a gate portion of the media item, determining the gate's state, if the gate's state is collapsed, advancing playback to a scope portion of the media item associated with the gate, and playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 2. The method of claim 1, further comprising, when a gate unlock condition is met while playing content of the gate portion, changing the state of the gate to unlocked for another iteration of operation. 3. The method of claim 2, wherein, when the gate unlock condition is met, changing the state of the gate to collapsed. 4. The method of claim 1, further comprising, when a gate unlock condition is met while playing content of the gate portion:
determining whether the gate is a member of a pool of gates, if so, determining whether a pool unlock condition is met, and if so, changing a state of all gates in the pool to one of: unlocked and collapsed. 5. The method of claim 1, wherein the parsing occurs based on gate definitions provided in metadata associated with the media item. 6. The method of claim 5, wherein the gate definitions include a value identifying a content period of the gate from a start position of the media item and a duration value. 7. The method of claim 5, wherein the gate definitions include a value identifying a network time of an onset of the gate from a network time and a time offset from the network time. 8. The method of claim 5, further comprising:
responsive to a command to alter gate playback from a normal mode to an alternate viewing method, determining from the gate definitions whether the alternate viewing mode is enabled, and if the alternate viewing mode is enabled, engaging the alternate viewing mode. 9. The method of claim 5,wherein the gate definitions include a grace period, the gate being unlocked during the grace period and locked thereafter. 10. The method of claim 5, wherein the gate definitions include a value identifying whether a gate is global, attributes of a global gate overriding attributes of a local gate. 11. The method of claim 5, wherein the gate definitions include a value defining a time at which a gate is consumed. 12. The method of claim 5, wherein properties controlling behavior of the gate varies based on a point of playback being reached via a normal mode or an alternate viewing mode. 13. The method of claim 5, wherein at a least a portion of playback activity is mapped to state record information, the mapping being applicable to a playback device to restore a state of gates. 14. A video playback method, comprising:
parsing a media item into gates and associated scopes, playing content of a gate portion of the media item, responsive to a user command to exit the gate, determining the gate's state, if the gate's state is unlocked, advancing playback to a scope portion of the media item associated with the gate and playing the scope portion, otherwise, continuing playing content of the gate portion. 15. The method of claim 14, further comprising, when a gate unlock condition is met, changing the state of the gate to unlocked. 16. The method of claim 14, further comprising, when a gate unlock condition is met, changing the state of the gate to collapsed. 17. The method of claim 14, further comprising, when a gate unlock condition is met:
determining whether the gate is a member of a pool of gates, if so, determining whether a pool unlock condition is met, and if so, changing a state of all gates in the pool to unlocked. 18. The method of claim 14, wherein the parsing occurs based on gate definitions provided in metadata associated with the media item. 19. The method of claim 18, wherein the gate definitions include a value identifying an onset of the gate from a start position of the media item and a duration value. 20. The method of claim 18, wherein the gate definitions include a value identifying a network time of an onset of the gate from a start position of the media item and a duration value. 21. A video playback method, comprising:
parsing a media item into gates and associated scopes, when playback reaches a scope portion of the media item, determining a state of a gate item associated with the scope portion, if the gate's state is unlocked, playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 22. The method of claim 21, wherein the playback reaches the scope portion in a normal playback mode. 23. The method of claim 21, wherein the playback reaches the scope portion in a jump within a media item timeline. 24. The method of claim 21, further comprising:
maintaining a running count of an elapsed time of normal playback that occurs without playback of a gate, when the running count meets a triggering condition, setting a state of another gate in playback order to locked, otherwise, setting the state of the other gate to unlocked. 25. A video playback apparatus, comprising:
a video decoder to decode a coded media item, and a processor to:
parse the media item into gates and associated scopes,
when playback reaches a scope portion of the media item, determine a state of a gate item associated with the scope portion,
if the gate's state is unlocked, play the scope portion to a display, and
otherwise, play content of the gate portion to the display before playing the scope portion. 26. The apparatus of claim 25, wherein the processor further:
maintains a running count of an elapsed time of normal playback that occurs without playback of a gate, when the running count meets a triggering condition, sets a state of a next gate in playback order to locked, otherwise, sets the state of the next gate to unlocked. 27. The apparatus of claim 25, wherein the processor changes a state of the gate to unlocked when a gate unlock condition is met. 28. The apparatus of claim 25, wherein the processor changes a state of the gate to collapsed when a gate unlock condition is met. 29. The apparatus of claim 25, wherein, when a gate unlock condition is met, the processor:
determines whether the gate is a member of a pool of gates, if so, determines whether a pool unlock condition is met, and if so, changes a state of all gates in the pool to unlocked. 30. A non-transitory computer-readable medium storing program instructions that, when executed, cause a processor to perform a method, the method comprising:
parsing a media item into gates and associated scopes, when playback reaches a gate portion of the media item, determining the gate's state, if the gate's state is collapsed, advancing playback to a scope portion of the media item associated with the gate, and playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 31. A non-transitory computer-readable medium storing metadata and a media item that when played by a video player, cause the player to perform a method, the method comprising:
parsing the media item into gates and associated scopes according to the metadata, when playback reaches a gate portion of the media item, determining the gate's state, if the gate's state is collapsed, advancing playback to a scope portion of the media item associated with the gate, and playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 32. The method of claim 1, wherein the playing content of the gate portion includes playing content of a plurality of gates. 33. The method of claim 1, wherein the parsing occurs based on gate definitions supplied by a client. 34. The method of claim 2, wherein, in a subsequent iteration of operation, the unlocked gate is skippable responsive to a received command. | Methods and systems provide techniques for managing media streaming and content distribution and management using time-based metadata. A video segment may include a gate with associated content that is accessible conditioned on consumption of the gate. The manner in which the gate manages access to the associated content may be defined according to rules and syntactical elements. For example, a gate may be unlocked or collapsed. An unlocked gate allows a user to skip the gate and access the gated content. A collapsed gate is automatically skipped. A gate may become locked or un-collapsed. Various commands, including fast forward, rewind, jump forward, and jump backward may respond to a gate based on its locked or collapsed status. Embodiments also provide pooling of gates and selection of a subset of gates for playing.1. A video playback method, comprising:
parsing a media item into gates and associated scopes, when playback reaches a gate portion of the media item, determining the gate's state, if the gate's state is collapsed, advancing playback to a scope portion of the media item associated with the gate, and playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 2. The method of claim 1, further comprising, when a gate unlock condition is met while playing content of the gate portion, changing the state of the gate to unlocked for another iteration of operation. 3. The method of claim 2, wherein, when the gate unlock condition is met, changing the state of the gate to collapsed. 4. The method of claim 1, further comprising, when a gate unlock condition is met while playing content of the gate portion:
determining whether the gate is a member of a pool of gates, if so, determining whether a pool unlock condition is met, and if so, changing a state of all gates in the pool to one of: unlocked and collapsed. 5. The method of claim 1, wherein the parsing occurs based on gate definitions provided in metadata associated with the media item. 6. The method of claim 5, wherein the gate definitions include a value identifying a content period of the gate from a start position of the media item and a duration value. 7. The method of claim 5, wherein the gate definitions include a value identifying a network time of an onset of the gate from a network time and a time offset from the network time. 8. The method of claim 5, further comprising:
responsive to a command to alter gate playback from a normal mode to an alternate viewing method, determining from the gate definitions whether the alternate viewing mode is enabled, and if the alternate viewing mode is enabled, engaging the alternate viewing mode. 9. The method of claim 5,wherein the gate definitions include a grace period, the gate being unlocked during the grace period and locked thereafter. 10. The method of claim 5, wherein the gate definitions include a value identifying whether a gate is global, attributes of a global gate overriding attributes of a local gate. 11. The method of claim 5, wherein the gate definitions include a value defining a time at which a gate is consumed. 12. The method of claim 5, wherein properties controlling behavior of the gate varies based on a point of playback being reached via a normal mode or an alternate viewing mode. 13. The method of claim 5, wherein at a least a portion of playback activity is mapped to state record information, the mapping being applicable to a playback device to restore a state of gates. 14. A video playback method, comprising:
parsing a media item into gates and associated scopes, playing content of a gate portion of the media item, responsive to a user command to exit the gate, determining the gate's state, if the gate's state is unlocked, advancing playback to a scope portion of the media item associated with the gate and playing the scope portion, otherwise, continuing playing content of the gate portion. 15. The method of claim 14, further comprising, when a gate unlock condition is met, changing the state of the gate to unlocked. 16. The method of claim 14, further comprising, when a gate unlock condition is met, changing the state of the gate to collapsed. 17. The method of claim 14, further comprising, when a gate unlock condition is met:
determining whether the gate is a member of a pool of gates, if so, determining whether a pool unlock condition is met, and if so, changing a state of all gates in the pool to unlocked. 18. The method of claim 14, wherein the parsing occurs based on gate definitions provided in metadata associated with the media item. 19. The method of claim 18, wherein the gate definitions include a value identifying an onset of the gate from a start position of the media item and a duration value. 20. The method of claim 18, wherein the gate definitions include a value identifying a network time of an onset of the gate from a start position of the media item and a duration value. 21. A video playback method, comprising:
parsing a media item into gates and associated scopes, when playback reaches a scope portion of the media item, determining a state of a gate item associated with the scope portion, if the gate's state is unlocked, playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 22. The method of claim 21, wherein the playback reaches the scope portion in a normal playback mode. 23. The method of claim 21, wherein the playback reaches the scope portion in a jump within a media item timeline. 24. The method of claim 21, further comprising:
maintaining a running count of an elapsed time of normal playback that occurs without playback of a gate, when the running count meets a triggering condition, setting a state of another gate in playback order to locked, otherwise, setting the state of the other gate to unlocked. 25. A video playback apparatus, comprising:
a video decoder to decode a coded media item, and a processor to:
parse the media item into gates and associated scopes,
when playback reaches a scope portion of the media item, determine a state of a gate item associated with the scope portion,
if the gate's state is unlocked, play the scope portion to a display, and
otherwise, play content of the gate portion to the display before playing the scope portion. 26. The apparatus of claim 25, wherein the processor further:
maintains a running count of an elapsed time of normal playback that occurs without playback of a gate, when the running count meets a triggering condition, sets a state of a next gate in playback order to locked, otherwise, sets the state of the next gate to unlocked. 27. The apparatus of claim 25, wherein the processor changes a state of the gate to unlocked when a gate unlock condition is met. 28. The apparatus of claim 25, wherein the processor changes a state of the gate to collapsed when a gate unlock condition is met. 29. The apparatus of claim 25, wherein, when a gate unlock condition is met, the processor:
determines whether the gate is a member of a pool of gates, if so, determines whether a pool unlock condition is met, and if so, changes a state of all gates in the pool to unlocked. 30. A non-transitory computer-readable medium storing program instructions that, when executed, cause a processor to perform a method, the method comprising:
parsing a media item into gates and associated scopes, when playback reaches a gate portion of the media item, determining the gate's state, if the gate's state is collapsed, advancing playback to a scope portion of the media item associated with the gate, and playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 31. A non-transitory computer-readable medium storing metadata and a media item that when played by a video player, cause the player to perform a method, the method comprising:
parsing the media item into gates and associated scopes according to the metadata, when playback reaches a gate portion of the media item, determining the gate's state, if the gate's state is collapsed, advancing playback to a scope portion of the media item associated with the gate, and playing the scope portion, otherwise, playing content of the gate portion before playing the scope portion. 32. The method of claim 1, wherein the playing content of the gate portion includes playing content of a plurality of gates. 33. The method of claim 1, wherein the parsing occurs based on gate definitions supplied by a client. 34. The method of claim 2, wherein, in a subsequent iteration of operation, the unlocked gate is skippable responsive to a received command. | 2,400 |
7,619 | 7,619 | 15,361,434 | 2,456 | A system and method in a building or vehicle for an actuator operation in response to a sensor according to a control logic, the system comprising a router or a gateway communicating with a device associated with the sensor and a device associated with the actuator over in-building or in-vehicle networks, and an external Internet-connected control server associated with the control logic implementing a PID closed linear control loop and communicating with the router over external network for controlling the in-building or in-vehicle phenomenon. The sensor may be a microphone or a camera, and the system may include voice or image processing as part of the control logic. A redundancy is used by using multiple sensors or actuators, or by using multiple data paths over the building or vehicle internal or external communication. The networks may be wired or wireless, and may be BAN, PAN, LAN, WAN, or home networks. | 1. A vehicle control system for commanding an actuator operation according in response to a sensor response associated with a phenomenon to a control, for use with one or more in-vehicle networks for communication in a vehicle, and one or more external networks for communicating with an Internet-connected control server via another vehicle or a roadside unit external to the vehicle, the system comprising:
a router in the vehicle, connected to the one or more in-vehicle networks and to the one or more of the external networks, and operative to pass digital data between said in-vehicle and one or more of the external networks; a first device in the vehicle comprising of, or connectable to, a sensor that responds to the phenomenon, the first device is operative to transmit a sensor digital data corresponding to the phenomenon to said router over said one or more in-vehicle networks; a second device in the vehicle comprising of, or connectable to, an actuator that affects the phenomenon, the second device is operative to execute actuator commands received from said router over said one or more in-vehicle networks; and a control server external to the vehicle storing the control logic, and communicatively coupled to said router over the Internet via said one or more of the external networks, wherein said control server is operative to receive the sensor digital data from said router, to produce actuator commands in response to the received sensor digital data according to the control logic, and to transmit the actuator commands to said second device via said router. 2. The system according to claim 1, wherein at least one of said external network is a vehicle-to-vehicle network for communicating with said control server via another vehicle. 3. The system according to claim 1, wherein at least one of the external networks is communicating with a stationary device, and wherein the stationary device is a roadside unit. 4. The system according to claim 1, wherein said router, said first device, and said second device are mechanical attached to the vehicle. 5. The system according to claim 1, wherein the vehicle is adapted for travelling on land, or water, or is airborne. 6. The system according to claim 1, wherein the vehicle is one out of a bicycle, a car, a motorcycle, a train, a ship, an aircraft, a boat, a spacecraft, a boat, a submarine, a dirigible, an electric scooter, a subway, a train, a trolleybus, a tram, a sailboat, a yacht, and an airplane. 7. The system according to claim 1, wherein the sensor is operative to sense the phenomenon in the vehicle, external to the vehicle, or associated with surroundings around the vehicle. 8. The system according to claim 1, wherein the actuator is operative to affect the phenomenon in the vehicle, external to the vehicle, or associated with surroundings around the vehicle. 9. The system according to claim 1, wherein the vehicle is an automobile, and wherein said system is coupled to monitor or control an Engine Control Unit (ECU), a Transmission Control Unit (TCU), an Anti-Lock Braking System (ABS), or Body Control Modules (BCM) of the automobile. 10. The system according to claim 1 further integrated with or being part of a vehicular communication system used for improved safety, traffic flow control, traffic reporting, or traffic management. 11. The system according to claim 1 further used for parking help, cruise control, lane keeping, road sign recognition, surveillance, speed limit warning, restricted entries, and pull-over commands, travel information, cooperative adaptive cruise control, cooperative forward collision warning, intersection collision avoidance, approaching emergency vehicle warning, vehicle safety inspection, transit or emergency vehicle signal priority, electronic parking payments, commercial vehicle clearance and safety inspections, in-vehicle signing, rollover warning, probe data collection, highway-rail intersection warning, or electronic toll collection. 12. The system according to claim 1, wherein one or more of the in-vehicle networks is a vehicle bus. 13. The system according to claim 12, wherein the vehicle bus is according to, or based on, Control Area Network (CAN) or Local Interconnect Network (LIN). 14. The system according to claim 1, wherein one or more of the in-vehicle networks is using is a communication medium that is based on DC power lines of the vehicle. 15. The system according to claim 1, wherein the vehicle further comprising an On-Board Diagnostics (OBD) system. 16. The system according to claim 15, wherein said system is coupled to or integrated with the OBD system. 17. The system according to claim 16, wherein the OBD system is according to, or based on, OBD-II or EOBD (European On-Board Diagnostics) standards. 18. The system according to claim 16, wherein the OBD system further comprises a diagnostics connector, and wherein said router, said first device, or said second device are coupled to the diagnostics connector. 19. The system according to claim 18, wherein said router, said first device, or said second device are at least in part powered via the diagnostics connector. 20. The system according to claim 1, wherein said router is operative to communicate to said control server an information regarding fuel and air metering, ignition system, misfire, auxiliary emission control, vehicle speed and idle control, transmission, on-board computer, fuel level, relative throttle position, ambient air temperature, accelerator pedal position, air flow rate, fuel type, oxygen level, fuel rail pressure, engine oil temperature, fuel injection timing, engine torque, engine coolant temperature, intake air temperature, exhaust gas temperature, fuel pressure, injection pressure, turbocharger pressure, boost pressure, exhaust pressure, exhaust gas temperature, engine run time, NOx sensor, manifold surface temperature, or a Vehicle Identification Number (VIN). | A system and method in a building or vehicle for an actuator operation in response to a sensor according to a control logic, the system comprising a router or a gateway communicating with a device associated with the sensor and a device associated with the actuator over in-building or in-vehicle networks, and an external Internet-connected control server associated with the control logic implementing a PID closed linear control loop and communicating with the router over external network for controlling the in-building or in-vehicle phenomenon. The sensor may be a microphone or a camera, and the system may include voice or image processing as part of the control logic. A redundancy is used by using multiple sensors or actuators, or by using multiple data paths over the building or vehicle internal or external communication. The networks may be wired or wireless, and may be BAN, PAN, LAN, WAN, or home networks.1. A vehicle control system for commanding an actuator operation according in response to a sensor response associated with a phenomenon to a control, for use with one or more in-vehicle networks for communication in a vehicle, and one or more external networks for communicating with an Internet-connected control server via another vehicle or a roadside unit external to the vehicle, the system comprising:
a router in the vehicle, connected to the one or more in-vehicle networks and to the one or more of the external networks, and operative to pass digital data between said in-vehicle and one or more of the external networks; a first device in the vehicle comprising of, or connectable to, a sensor that responds to the phenomenon, the first device is operative to transmit a sensor digital data corresponding to the phenomenon to said router over said one or more in-vehicle networks; a second device in the vehicle comprising of, or connectable to, an actuator that affects the phenomenon, the second device is operative to execute actuator commands received from said router over said one or more in-vehicle networks; and a control server external to the vehicle storing the control logic, and communicatively coupled to said router over the Internet via said one or more of the external networks, wherein said control server is operative to receive the sensor digital data from said router, to produce actuator commands in response to the received sensor digital data according to the control logic, and to transmit the actuator commands to said second device via said router. 2. The system according to claim 1, wherein at least one of said external network is a vehicle-to-vehicle network for communicating with said control server via another vehicle. 3. The system according to claim 1, wherein at least one of the external networks is communicating with a stationary device, and wherein the stationary device is a roadside unit. 4. The system according to claim 1, wherein said router, said first device, and said second device are mechanical attached to the vehicle. 5. The system according to claim 1, wherein the vehicle is adapted for travelling on land, or water, or is airborne. 6. The system according to claim 1, wherein the vehicle is one out of a bicycle, a car, a motorcycle, a train, a ship, an aircraft, a boat, a spacecraft, a boat, a submarine, a dirigible, an electric scooter, a subway, a train, a trolleybus, a tram, a sailboat, a yacht, and an airplane. 7. The system according to claim 1, wherein the sensor is operative to sense the phenomenon in the vehicle, external to the vehicle, or associated with surroundings around the vehicle. 8. The system according to claim 1, wherein the actuator is operative to affect the phenomenon in the vehicle, external to the vehicle, or associated with surroundings around the vehicle. 9. The system according to claim 1, wherein the vehicle is an automobile, and wherein said system is coupled to monitor or control an Engine Control Unit (ECU), a Transmission Control Unit (TCU), an Anti-Lock Braking System (ABS), or Body Control Modules (BCM) of the automobile. 10. The system according to claim 1 further integrated with or being part of a vehicular communication system used for improved safety, traffic flow control, traffic reporting, or traffic management. 11. The system according to claim 1 further used for parking help, cruise control, lane keeping, road sign recognition, surveillance, speed limit warning, restricted entries, and pull-over commands, travel information, cooperative adaptive cruise control, cooperative forward collision warning, intersection collision avoidance, approaching emergency vehicle warning, vehicle safety inspection, transit or emergency vehicle signal priority, electronic parking payments, commercial vehicle clearance and safety inspections, in-vehicle signing, rollover warning, probe data collection, highway-rail intersection warning, or electronic toll collection. 12. The system according to claim 1, wherein one or more of the in-vehicle networks is a vehicle bus. 13. The system according to claim 12, wherein the vehicle bus is according to, or based on, Control Area Network (CAN) or Local Interconnect Network (LIN). 14. The system according to claim 1, wherein one or more of the in-vehicle networks is using is a communication medium that is based on DC power lines of the vehicle. 15. The system according to claim 1, wherein the vehicle further comprising an On-Board Diagnostics (OBD) system. 16. The system according to claim 15, wherein said system is coupled to or integrated with the OBD system. 17. The system according to claim 16, wherein the OBD system is according to, or based on, OBD-II or EOBD (European On-Board Diagnostics) standards. 18. The system according to claim 16, wherein the OBD system further comprises a diagnostics connector, and wherein said router, said first device, or said second device are coupled to the diagnostics connector. 19. The system according to claim 18, wherein said router, said first device, or said second device are at least in part powered via the diagnostics connector. 20. The system according to claim 1, wherein said router is operative to communicate to said control server an information regarding fuel and air metering, ignition system, misfire, auxiliary emission control, vehicle speed and idle control, transmission, on-board computer, fuel level, relative throttle position, ambient air temperature, accelerator pedal position, air flow rate, fuel type, oxygen level, fuel rail pressure, engine oil temperature, fuel injection timing, engine torque, engine coolant temperature, intake air temperature, exhaust gas temperature, fuel pressure, injection pressure, turbocharger pressure, boost pressure, exhaust pressure, exhaust gas temperature, engine run time, NOx sensor, manifold surface temperature, or a Vehicle Identification Number (VIN). | 2,400 |
7,620 | 7,620 | 14,938,523 | 2,482 | The invention relates to a system and method for estimating global rig state. The system comprises a model incorporating multiple variables related to rig state, at least one camera operably connected to at least one processor wherein said camera is capable of gathering visual data regarding at least one variable of rig state and said processor is capable of compiling rig state data, estimating global rig state, or both. The system further comprises multiple sensors for measuring variables related to global rig state wherein said sensors are operably connected to said processor. The method comprises sensing various aspects of the rig state, collecting visual data corresponding with said sensor data, compiling multiple sources of rig data, and estimating the overall rig state. | 1. A system for estimating global rig state comprising:
at least one camera operably connected to at least one processor, wherein said camera is capable of gathering visual data regarding at least one variable of rig state and said processor is capable of compiling rig state data, estimating global rig state, or both; at least one sensor for measuring at least one variable related to global rig state wherein said sensor is operably connected to said processor; and a model incorporating multiple variables related to rig state. 2. The system of claim 1, wherein the model variables can be updated in real time. 3. The system of claim 1, wherein the compiled data is displayed to a user. 4. The system of claim 1, wherein the estimated rig state is used to refine data collected from said sensors. 5. The system of claim 1, further comprising a database operably connected to the processor, wherein said processor is capable of comparing current data against historical data in the database. 6. The system of claim 1, further comprising an alarm system for alerting staff to the occurrence of a pre-determined condition. 7. The system of claim 1, further comprising a machinery control system to cause or inhibit certain automated activities. 8. The system of claim 1, wherein the visual data, sensor measurements, estimated rig state or any combination thereof are computer searchable. 9. A method for estimating rig state comprising:
sensing various aspects of the rig state, collecting visual data corresponding with said sensor data, compiling multiple sources of rig data, and estimating the overall rig state. 10. The method of claim 9, wherein the estimated overall rig state is used to refine the gathered sensor data. 11. The method of claim 9, further comprising processing visual data to determine person location. 12. The method of claim 11, wherein the determined person location is used to cause or inhibit certain automated activities. 13. The method of claim 9, further comprising alerting staff to predetermined conditions. 14. The method of claim 9, further comprising annotating gathered visual data with corresponding rig state data. 15. The method of claim 9, further comprising recording the compiled data for future reference. 16. The method of claim 9, further comprising comparing the compiled data against a database of previously recorded data. | The invention relates to a system and method for estimating global rig state. The system comprises a model incorporating multiple variables related to rig state, at least one camera operably connected to at least one processor wherein said camera is capable of gathering visual data regarding at least one variable of rig state and said processor is capable of compiling rig state data, estimating global rig state, or both. The system further comprises multiple sensors for measuring variables related to global rig state wherein said sensors are operably connected to said processor. The method comprises sensing various aspects of the rig state, collecting visual data corresponding with said sensor data, compiling multiple sources of rig data, and estimating the overall rig state.1. A system for estimating global rig state comprising:
at least one camera operably connected to at least one processor, wherein said camera is capable of gathering visual data regarding at least one variable of rig state and said processor is capable of compiling rig state data, estimating global rig state, or both; at least one sensor for measuring at least one variable related to global rig state wherein said sensor is operably connected to said processor; and a model incorporating multiple variables related to rig state. 2. The system of claim 1, wherein the model variables can be updated in real time. 3. The system of claim 1, wherein the compiled data is displayed to a user. 4. The system of claim 1, wherein the estimated rig state is used to refine data collected from said sensors. 5. The system of claim 1, further comprising a database operably connected to the processor, wherein said processor is capable of comparing current data against historical data in the database. 6. The system of claim 1, further comprising an alarm system for alerting staff to the occurrence of a pre-determined condition. 7. The system of claim 1, further comprising a machinery control system to cause or inhibit certain automated activities. 8. The system of claim 1, wherein the visual data, sensor measurements, estimated rig state or any combination thereof are computer searchable. 9. A method for estimating rig state comprising:
sensing various aspects of the rig state, collecting visual data corresponding with said sensor data, compiling multiple sources of rig data, and estimating the overall rig state. 10. The method of claim 9, wherein the estimated overall rig state is used to refine the gathered sensor data. 11. The method of claim 9, further comprising processing visual data to determine person location. 12. The method of claim 11, wherein the determined person location is used to cause or inhibit certain automated activities. 13. The method of claim 9, further comprising alerting staff to predetermined conditions. 14. The method of claim 9, further comprising annotating gathered visual data with corresponding rig state data. 15. The method of claim 9, further comprising recording the compiled data for future reference. 16. The method of claim 9, further comprising comparing the compiled data against a database of previously recorded data. | 2,400 |
7,621 | 7,621 | 14,290,227 | 2,423 | A method and system for caching and streaming media content, including predictively delivering and/or acquiring content is provided. In the system, client devices may be communicatively coupled in a network, and may access and share cached content. Video segments making up a media stream may be selectively delivered to the clients such that a complete media stream may be formed from the different segments delivered to the different clients. Video segments may be pushed by the server to the client or requested by the client according to a prioritization scheme, including downloading: partial items on a client's subscription log, lower quality version(s) of content before higher quality version(s), higher bitrate segments before lower bitrate segments, summaries of full-length content, advertisements and splash screens common to multiple video clips. | 1. A video player, comprising:
a communication transceiver; a subscription log that stores identifiers of video content likely to be played by the video player and a media server from which the video content is available; a neighbor log that stores an index of segments of video content stored by other player devices; and a processor that, responsive to a request to play selected video content,
searches the neighbor log for identification of another player device that stores a segment associated with the selected video content,
when a match is found, causes the transceiver to transmit a request to the matching player device for video segments identified on the neighbor log, and
for segments for which no match is found, causes the transceiver to transmit a request to the media server for such segments. 2. The video player of claim 1, wherein the neighbor log further stores, for each other player device, data indicating a time when the other player device last was in communication with the video player. 3. The video player of claim 1, wherein the subscription log is provided to the video player from the media server. 4. The video player of claim 1, wherein the subscription log is assembled from transmissions received by the video player from the other player devices. 5. The video player of claim 1, wherein:
a cache of each of the player devices in the neighbor log is accessible by the video player; prior to transmitting the request for video segments, the processor determines whether video segments are in the cache of any of the player devices in the neighbor log; and the transmission of the requests for video segments is performed responsive to a determination that the requested video segments are not in the cache of any of the player devices in the neighbor log. 6. A method for retrieving requested video content at a first device, comprising:
responsive to a request to play selected content, identifying segments of content to be played; for each identified segment:
determining whether the respective segment is stored by a neighboring client device;
if the respective segment is determined to be stored by the neighboring device, requesting the segment from the neighboring device; and
otherwise requesting the segment from a media server to which the first device is communicatively coupled. 7. The method of claim 6, wherein
the identifying comprises searching a subscription log stored by the first device that identifies a set of segments associated with the selected content, and the determining and requesting steps are performed for the segments on the subscription log identified by the search. 8. The method of claim 6, wherein the identifying comprises searching a manifest file downloaded from the media server to the first device that identify neighboring client device(s) that store segments of the selected content. 9. The method of claim 6, wherein the determination comprises searching a neighbor log stored by the first device that identifies neighboring client device(s) associated with the first device and a time that each such neighboring client device was most recently confirmed to be in communication with the first device. 10. The method of claim 6, wherein the segment is requested from the neighboring device responsive to a determination that a most recent communication with the neighboring device is within a threshold time period. 11. The method of claim 6, wherein the segment is requested from the neighboring device responsive to a determination that at least one of a download speed and an upload speed, between the video player and the neighboring device, is above a threshold value. 12. The method of claim 6, wherein the segment is requested from the neighboring device responsive to a determination that the neighboring device downloads content from the media server above a threshold speed. 13. The method of claim 6, further comprising receiving the requested segment from the server. 14. The method of claim 6, wherein the determination comprises searching a neighbor log stored by the first device that identifies neighboring client device(s) associated with the first device and segments of content stored by each neighboring client device. 15. The method of claim 14, further comprising building the neighbor log from transmissions received from the neighboring client device(s) that identify segments of content respectively stored by those neighboring client device(s). 16. The method of claim 14, further comprising building the neighbor log from a transmission received from the media server that identify segments of content respectively stored by those neighboring client device(s). 17. The method of claim 14, wherein responsive to a determination that more than one neighboring device contains the requested segment, downloading the requested segment from the neighboring device that, on average, communicated most recently with the first device, has the highest download and upload speed, and has the highest download speed with respect to the media server. 18. The method of claim 14, wherein the neighbor log is initially provided by the server and subsequently updated in the respective video player. 19. A method of prioritizing video segments for downloading and playing on a video player, the method comprising:
receiving specifications of a video player to which at least one video segment is provided, wherein the specifications include a subscription log including preferences and a neighbor log including nearby devices communicatively coupled to the video player; determining an order in which to push the video segments to the video player; and delivering the video segments to the video player according to the order. 20. The method of claim 19, further comprising:
prior to determining an order in which to push the video segments to the video player, receiving a request to play a media stream; wherein the order in which to push the video segments is based on at least one video segment corresponding to the request to play the media stream. 21. The method of claim 19, wherein the prioritization is based on partially downloading each item in the subscription log. 22. The method of claim 19, wherein the prioritization is based on downloading a beginning portion of at least some items in the subscription log. 23. The method of claim 19, wherein the prioritization is based on downloading a lower bitrate version of at least some items in the subscription log before downloading a higher bitrate version of the at least some items in the subscription log. 24. The method of claim 19, wherein, for variable bitrate coding, the prioritization is based on downloading segments with a higher bitrate before downloading segments with a lower bitrate. 25. The method of claim 19, wherein the prioritization is based on a usage pattern of the video player. 26. The method of claim 19, wherein the prioritization is based on downloading splash screens that are common to several segments. 27. The method of claim 19, wherein the prioritization is based on:
dividing a video into several chapters; and caching a predefined number of frames from each chapter. 28. The method of claim 19, wherein the prioritization is based on downloading advertisements before downloading other content. 29. The method of claim 19, wherein segments are pushed to more than one video player based on a respective suitability of each video player and the segments are accessible between the video players. 30. The method of claim 19, wherein the prioritization is based on downloading lower bitrate layers of the at least one video segment before downloading higher bitrate layers of the at least one video segment. 31. The method of claim 30, wherein the download of the higher bitrate layers begins responsive to a determination that at least one of: a bandwidth and a cache of the video player is above respective threshold values. 32. The method of claim 30, wherein the download of the higher bitrate layers begins responsive to a determination that the lower bitrate layers are completely downloaded. 33. A method of providing a video segment to a video player, the method comprising:
receiving a request for the video segment; and providing the requested segment and a neighbor log of nearby devices, wherein a nearby device is communicatively coupled to the video player. 34. The method of claim 33, further comprising, prior to providing the requested segment:
determining whether the requested segment is in a cache of any of the nearby devices to the video player; and responsive to a determination that the segment is in the cache of at least one nearby device, directing the video player to the at least one nearby device for the requested segment. 35. The method of claim 33, further comprising responsive to a determination that more than one nearby device is suitable for receiving the segment, providing the segment to the nearby device that is, on average, most accessible, capable, and within range to the first device. 36. A storage device storing program instructions that, when executed by a processing device, causes the processing device to:
receive a request to play the segment; determine whether the requested segment is in a cache of the video player; responsive to a determination that the requested segment is not in the cache of the video player, determining whether the requested segment is in a cache of at least one nearby device communicatively coupled to the video player; responsive to a determination that the requested segment is in the cache of the at least one nearby device, download the requested segment from the at least one nearby device, decoding and playing the requested segment; and responsive to a determination that the requested segment is not in the cache of any of the at least one nearby device, request the segment from a server to which the video player is communicatively coupled. 37. A storage device storing program instructions that, when executed by a processing device, causes the processing device to:
receive specifications of a video player to which at least one video segment is provided, wherein the specifications include a subscription log including preferences and a neighbor log including nearby devices communicatively coupled to the video player; determine an order in which to push the video segments to the video player; and deliver the video segments to the video player according to the order. | A method and system for caching and streaming media content, including predictively delivering and/or acquiring content is provided. In the system, client devices may be communicatively coupled in a network, and may access and share cached content. Video segments making up a media stream may be selectively delivered to the clients such that a complete media stream may be formed from the different segments delivered to the different clients. Video segments may be pushed by the server to the client or requested by the client according to a prioritization scheme, including downloading: partial items on a client's subscription log, lower quality version(s) of content before higher quality version(s), higher bitrate segments before lower bitrate segments, summaries of full-length content, advertisements and splash screens common to multiple video clips.1. A video player, comprising:
a communication transceiver; a subscription log that stores identifiers of video content likely to be played by the video player and a media server from which the video content is available; a neighbor log that stores an index of segments of video content stored by other player devices; and a processor that, responsive to a request to play selected video content,
searches the neighbor log for identification of another player device that stores a segment associated with the selected video content,
when a match is found, causes the transceiver to transmit a request to the matching player device for video segments identified on the neighbor log, and
for segments for which no match is found, causes the transceiver to transmit a request to the media server for such segments. 2. The video player of claim 1, wherein the neighbor log further stores, for each other player device, data indicating a time when the other player device last was in communication with the video player. 3. The video player of claim 1, wherein the subscription log is provided to the video player from the media server. 4. The video player of claim 1, wherein the subscription log is assembled from transmissions received by the video player from the other player devices. 5. The video player of claim 1, wherein:
a cache of each of the player devices in the neighbor log is accessible by the video player; prior to transmitting the request for video segments, the processor determines whether video segments are in the cache of any of the player devices in the neighbor log; and the transmission of the requests for video segments is performed responsive to a determination that the requested video segments are not in the cache of any of the player devices in the neighbor log. 6. A method for retrieving requested video content at a first device, comprising:
responsive to a request to play selected content, identifying segments of content to be played; for each identified segment:
determining whether the respective segment is stored by a neighboring client device;
if the respective segment is determined to be stored by the neighboring device, requesting the segment from the neighboring device; and
otherwise requesting the segment from a media server to which the first device is communicatively coupled. 7. The method of claim 6, wherein
the identifying comprises searching a subscription log stored by the first device that identifies a set of segments associated with the selected content, and the determining and requesting steps are performed for the segments on the subscription log identified by the search. 8. The method of claim 6, wherein the identifying comprises searching a manifest file downloaded from the media server to the first device that identify neighboring client device(s) that store segments of the selected content. 9. The method of claim 6, wherein the determination comprises searching a neighbor log stored by the first device that identifies neighboring client device(s) associated with the first device and a time that each such neighboring client device was most recently confirmed to be in communication with the first device. 10. The method of claim 6, wherein the segment is requested from the neighboring device responsive to a determination that a most recent communication with the neighboring device is within a threshold time period. 11. The method of claim 6, wherein the segment is requested from the neighboring device responsive to a determination that at least one of a download speed and an upload speed, between the video player and the neighboring device, is above a threshold value. 12. The method of claim 6, wherein the segment is requested from the neighboring device responsive to a determination that the neighboring device downloads content from the media server above a threshold speed. 13. The method of claim 6, further comprising receiving the requested segment from the server. 14. The method of claim 6, wherein the determination comprises searching a neighbor log stored by the first device that identifies neighboring client device(s) associated with the first device and segments of content stored by each neighboring client device. 15. The method of claim 14, further comprising building the neighbor log from transmissions received from the neighboring client device(s) that identify segments of content respectively stored by those neighboring client device(s). 16. The method of claim 14, further comprising building the neighbor log from a transmission received from the media server that identify segments of content respectively stored by those neighboring client device(s). 17. The method of claim 14, wherein responsive to a determination that more than one neighboring device contains the requested segment, downloading the requested segment from the neighboring device that, on average, communicated most recently with the first device, has the highest download and upload speed, and has the highest download speed with respect to the media server. 18. The method of claim 14, wherein the neighbor log is initially provided by the server and subsequently updated in the respective video player. 19. A method of prioritizing video segments for downloading and playing on a video player, the method comprising:
receiving specifications of a video player to which at least one video segment is provided, wherein the specifications include a subscription log including preferences and a neighbor log including nearby devices communicatively coupled to the video player; determining an order in which to push the video segments to the video player; and delivering the video segments to the video player according to the order. 20. The method of claim 19, further comprising:
prior to determining an order in which to push the video segments to the video player, receiving a request to play a media stream; wherein the order in which to push the video segments is based on at least one video segment corresponding to the request to play the media stream. 21. The method of claim 19, wherein the prioritization is based on partially downloading each item in the subscription log. 22. The method of claim 19, wherein the prioritization is based on downloading a beginning portion of at least some items in the subscription log. 23. The method of claim 19, wherein the prioritization is based on downloading a lower bitrate version of at least some items in the subscription log before downloading a higher bitrate version of the at least some items in the subscription log. 24. The method of claim 19, wherein, for variable bitrate coding, the prioritization is based on downloading segments with a higher bitrate before downloading segments with a lower bitrate. 25. The method of claim 19, wherein the prioritization is based on a usage pattern of the video player. 26. The method of claim 19, wherein the prioritization is based on downloading splash screens that are common to several segments. 27. The method of claim 19, wherein the prioritization is based on:
dividing a video into several chapters; and caching a predefined number of frames from each chapter. 28. The method of claim 19, wherein the prioritization is based on downloading advertisements before downloading other content. 29. The method of claim 19, wherein segments are pushed to more than one video player based on a respective suitability of each video player and the segments are accessible between the video players. 30. The method of claim 19, wherein the prioritization is based on downloading lower bitrate layers of the at least one video segment before downloading higher bitrate layers of the at least one video segment. 31. The method of claim 30, wherein the download of the higher bitrate layers begins responsive to a determination that at least one of: a bandwidth and a cache of the video player is above respective threshold values. 32. The method of claim 30, wherein the download of the higher bitrate layers begins responsive to a determination that the lower bitrate layers are completely downloaded. 33. A method of providing a video segment to a video player, the method comprising:
receiving a request for the video segment; and providing the requested segment and a neighbor log of nearby devices, wherein a nearby device is communicatively coupled to the video player. 34. The method of claim 33, further comprising, prior to providing the requested segment:
determining whether the requested segment is in a cache of any of the nearby devices to the video player; and responsive to a determination that the segment is in the cache of at least one nearby device, directing the video player to the at least one nearby device for the requested segment. 35. The method of claim 33, further comprising responsive to a determination that more than one nearby device is suitable for receiving the segment, providing the segment to the nearby device that is, on average, most accessible, capable, and within range to the first device. 36. A storage device storing program instructions that, when executed by a processing device, causes the processing device to:
receive a request to play the segment; determine whether the requested segment is in a cache of the video player; responsive to a determination that the requested segment is not in the cache of the video player, determining whether the requested segment is in a cache of at least one nearby device communicatively coupled to the video player; responsive to a determination that the requested segment is in the cache of the at least one nearby device, download the requested segment from the at least one nearby device, decoding and playing the requested segment; and responsive to a determination that the requested segment is not in the cache of any of the at least one nearby device, request the segment from a server to which the video player is communicatively coupled. 37. A storage device storing program instructions that, when executed by a processing device, causes the processing device to:
receive specifications of a video player to which at least one video segment is provided, wherein the specifications include a subscription log including preferences and a neighbor log including nearby devices communicatively coupled to the video player; determine an order in which to push the video segments to the video player; and deliver the video segments to the video player according to the order. | 2,400 |
7,622 | 7,622 | 14,811,507 | 2,473 | A wireless receiver receives location pilots embedded in received symbols and uses the location pilots to detect the first path for every base station the network has designated for the receiver to use in time of arrival estimation. The receiver preferably applies matching pursuit strategies to offer a robust and reliable identification of a channel impulse response's first path. The receiver may also receive and use estimation pilots as a supplement to the location pilot information in determining time of arrival. The receiver can use metrics characteristic of the channel to improve the robustness and reliability of the identification of a CIR's first path. With the first path identified, the receiver measures the time of arrival for signals from that path and the receiver determines the observed time difference of arrival (OTDOA) to respond to network requests for OTDOA and position determination measurements. | 1. A method of determining time of arrival in a wireless network, comprising:
receiving at a receiver from a wireless network a request for time of arrival information; extracting location pilot symbols from a received signal; identifying a first path associated with the location pilot symbols using matching pursuit; determining a time of arrival based on the first path identified using matching pursuit estimation; and communicating information responsive to the time of arrival based on the first path from the receiver to the wireless network. 2. The method of claim 1, wherein the extracting location pilot symbols comprises comb filtering in a frequency domain. 3. The method of claim 1, wherein the identifying a first path uses both location pilot symbols and estimation pilot symbols. 4. The method of claim 3 further comprising comb filtering to extract estimation pilots. 5. The method of claim 3 further comprising interpolating from received location pilot symbols to generate virtual location pilot symbols. 6. The method of claim 1 further comprising determining a signal to noise measure for a channel impulse response and stopping matching pursuit estimation in response to the signal to noise measure. 7. The method of claim 6, wherein the received signal has an OFDM waveform. 8. The method of claim 1 further comprising correlating between a plurality of received location pilot symbols and a reference signal and providing a result of the correlating as an input to the matching pursuit estimation. 9. The method of claim 8, wherein the matching pursuit estimation uses location pilot symbols and estimation pilot symbols. 10. The method of claim 9 further comprising determining a signal to noise measure for a channel impulse response and stopping matching pursuit estimation in response to the signal to noise measure. 11. The method of claim 10 further comprising interpolating from received location pilot symbols to generate virtual location pilot symbols. 12. The method of claim 1, further comprising interpolating between two or more sets of path information to generate a time of arrive with a granularity smaller than defined by the system sampling period. 13. The method of claim 1, further comprising determining a power delay profile for a signal comprising plural location pilot symbols and performing matching pursuit estimation using the power delay profile. 14. The method of claim 13, wherein the matching pursuit estimation is performed using a location pilot power delay profile and an estimation pilot power delay profile. 15. The method of claim 14, further comprising generating virtual location pilot symbols and generating virtual estimation pilot symbols. 16. The method of claim 13, further comprising interpolating between two or more sets of path information to generate a time of arrive with a granularity smaller than defined by the system sampling period. 17. A method of determining time of arrival in a wireless network, comprising:
receiving at a receiver from a wireless network a request for time of arrival information; extracting pilot symbols from a received signal; identifying a first path associated with the extracted pilot symbols using matching pursuit; determining a time of arrival based on the first path identified using matching pursuit estimation; and communicating information responsive to the time of arrival based on the first path from the receiver to the wireless network. 18. The receiver of claim 16, wherein the extracted pilot symbols comprise extracted location pilot symbols. 19. The receiver of claim 16, wherein the extracted pilot symbols comprise extracted estimation pilot symbols. 20. The receiver of claim 16, wherein the extracted pilot symbols comprise extracted location pilot symbols and extracted estimation pilot symbols. 21. The method of claim 20, further comprising interpolating between two or more sets of path information to generate a time of arrive with a granularity smaller than defined by the system sampling period. 22. A receiver having a time of arrival function, the receiver comprising:
memory coupled to store extracted pilot symbols; an interpolator coupled to receive the extracted pilot symbols and to generate virtual pilot symbols; a multi-symbol correlator that correlates the extracted pilot symbols and the virtual pilot symbols with a reference signal and outputs an initial pilot channel impulse response; a matching pursuit estimator providing a channel impulse response estimate responsive to the initial pilot channel impulse response; and a time of arrival estimator responsive to the matching pursuit estimator to identify a first path and to determine a time of arrival for the first path. 23. The receiver of claim 22, wherein the extracted pilot symbols comprise extracted location pilot symbols. 24. The receiver of claim 22, wherein the extracted pilot symbols comprise extracted estimation pilot symbols. 25. The receiver of claim 22, wherein the extracted pilot symbols comprise extracted location pilot symbols and extracted estimation pilot symbols. 26. The receiver of claim 22, further comprising a time of arrival interpolator coupled to receive path information from matching pursuit estimator, the time of arrival interpolator adapted to provide interpolated path information to the time of arrival estimator so that the time of arrival estimator generates a time of arrival with a granularity smaller than defined by the system sampling period. | A wireless receiver receives location pilots embedded in received symbols and uses the location pilots to detect the first path for every base station the network has designated for the receiver to use in time of arrival estimation. The receiver preferably applies matching pursuit strategies to offer a robust and reliable identification of a channel impulse response's first path. The receiver may also receive and use estimation pilots as a supplement to the location pilot information in determining time of arrival. The receiver can use metrics characteristic of the channel to improve the robustness and reliability of the identification of a CIR's first path. With the first path identified, the receiver measures the time of arrival for signals from that path and the receiver determines the observed time difference of arrival (OTDOA) to respond to network requests for OTDOA and position determination measurements.1. A method of determining time of arrival in a wireless network, comprising:
receiving at a receiver from a wireless network a request for time of arrival information; extracting location pilot symbols from a received signal; identifying a first path associated with the location pilot symbols using matching pursuit; determining a time of arrival based on the first path identified using matching pursuit estimation; and communicating information responsive to the time of arrival based on the first path from the receiver to the wireless network. 2. The method of claim 1, wherein the extracting location pilot symbols comprises comb filtering in a frequency domain. 3. The method of claim 1, wherein the identifying a first path uses both location pilot symbols and estimation pilot symbols. 4. The method of claim 3 further comprising comb filtering to extract estimation pilots. 5. The method of claim 3 further comprising interpolating from received location pilot symbols to generate virtual location pilot symbols. 6. The method of claim 1 further comprising determining a signal to noise measure for a channel impulse response and stopping matching pursuit estimation in response to the signal to noise measure. 7. The method of claim 6, wherein the received signal has an OFDM waveform. 8. The method of claim 1 further comprising correlating between a plurality of received location pilot symbols and a reference signal and providing a result of the correlating as an input to the matching pursuit estimation. 9. The method of claim 8, wherein the matching pursuit estimation uses location pilot symbols and estimation pilot symbols. 10. The method of claim 9 further comprising determining a signal to noise measure for a channel impulse response and stopping matching pursuit estimation in response to the signal to noise measure. 11. The method of claim 10 further comprising interpolating from received location pilot symbols to generate virtual location pilot symbols. 12. The method of claim 1, further comprising interpolating between two or more sets of path information to generate a time of arrive with a granularity smaller than defined by the system sampling period. 13. The method of claim 1, further comprising determining a power delay profile for a signal comprising plural location pilot symbols and performing matching pursuit estimation using the power delay profile. 14. The method of claim 13, wherein the matching pursuit estimation is performed using a location pilot power delay profile and an estimation pilot power delay profile. 15. The method of claim 14, further comprising generating virtual location pilot symbols and generating virtual estimation pilot symbols. 16. The method of claim 13, further comprising interpolating between two or more sets of path information to generate a time of arrive with a granularity smaller than defined by the system sampling period. 17. A method of determining time of arrival in a wireless network, comprising:
receiving at a receiver from a wireless network a request for time of arrival information; extracting pilot symbols from a received signal; identifying a first path associated with the extracted pilot symbols using matching pursuit; determining a time of arrival based on the first path identified using matching pursuit estimation; and communicating information responsive to the time of arrival based on the first path from the receiver to the wireless network. 18. The receiver of claim 16, wherein the extracted pilot symbols comprise extracted location pilot symbols. 19. The receiver of claim 16, wherein the extracted pilot symbols comprise extracted estimation pilot symbols. 20. The receiver of claim 16, wherein the extracted pilot symbols comprise extracted location pilot symbols and extracted estimation pilot symbols. 21. The method of claim 20, further comprising interpolating between two or more sets of path information to generate a time of arrive with a granularity smaller than defined by the system sampling period. 22. A receiver having a time of arrival function, the receiver comprising:
memory coupled to store extracted pilot symbols; an interpolator coupled to receive the extracted pilot symbols and to generate virtual pilot symbols; a multi-symbol correlator that correlates the extracted pilot symbols and the virtual pilot symbols with a reference signal and outputs an initial pilot channel impulse response; a matching pursuit estimator providing a channel impulse response estimate responsive to the initial pilot channel impulse response; and a time of arrival estimator responsive to the matching pursuit estimator to identify a first path and to determine a time of arrival for the first path. 23. The receiver of claim 22, wherein the extracted pilot symbols comprise extracted location pilot symbols. 24. The receiver of claim 22, wherein the extracted pilot symbols comprise extracted estimation pilot symbols. 25. The receiver of claim 22, wherein the extracted pilot symbols comprise extracted location pilot symbols and extracted estimation pilot symbols. 26. The receiver of claim 22, further comprising a time of arrival interpolator coupled to receive path information from matching pursuit estimator, the time of arrival interpolator adapted to provide interpolated path information to the time of arrival estimator so that the time of arrival estimator generates a time of arrival with a granularity smaller than defined by the system sampling period. | 2,400 |
7,623 | 7,623 | 13,846,856 | 2,435 | Multiple-choice survey is used to increase probability that action is caused by a human user, not by an automated software script. Survey contains some answers that no human user would select, but also more than one correct answer. The answer selected by the user from many correct answers is used as an indication of interest to related subject and/or to display related advertisement. Multiple multi-choice surveys can be presented to the same user over time, to decrease probability of a robot randomly selecting correct answers. | 1. A computer-implemented method performed in a system comprising a central processing unit and a memory, the method comprising:
a. Receiving a request to access a resource, the request being received from a request originator; b. Providing to the request originator a response comprising at least one challenge question and a plurality of answer options responsive to the challenge question; c. Receiving from the request originator a choice of one of the plurality of answer options; and d. Allowing or denying the access to the resource based on the received choice of one of the plurality of answer options, wherein the plurality of answer options comprise at least one answer of a first type which is unlikely to be selected by a human user and at least two answers of a second type, which have high probability of being selected by the human users and which reflect predetermined characteristics of the human user. 2. The computer-implemented method of claim 1, wherein difference between the answers of the first and the second type are obvious to the human user but not obvious to a computer. 3. The computer-implemented method of claim 1, wherein allowing or denying the access to the resource is based on a previous pattern of received choices of answer options. 4. The computer-implemented method of claim 3, wherein the access to the resource is granted when the request originator selected answers of the second type multiple times in the past. 5. The computer-implemented method of claim 1, further comprising storing information on the received choice of one of the plurality of answer options for a future use. 6. The computer-implemented method of claim 5, further comprising using the stored information on the received choice of one of the plurality of answer options to compute distribution of a parameter reflective of the request originator. 7. The computer-implemented method of claim 5, further comprising using the stored information on the received choice of one of the plurality of answer options to provide content to the request originator. 8. The computer-implemented method of claim 1, wherein the challenge question connects the request originator with a group of peers. 9. The computer-implemented method of claim 8, further comprising using received choices of a first plurality of request originators to identify the group of peers. 10. The computer-implemented method of claim 9, further comprising using the identified group of request originators to allow of deny access to subsequent request originators based on the corresponding choices of one of the plurality of answer options. 11. The computer-implemented method of claim 1, wherein the resource is a virtual private network service. 12. The computer-implemented method of claim 1, wherein if the access to the resource is denied, future requests within a predetermined time-out period are also denied. 13. The computer-implemented method of claim 1, wherein the plurality of the answer options are provided to the request originator in a pictorial form. 14. The computer-implemented method of claim 1, further comprising randomly varying an order of the plurality of the answer options. 15. The computer-implemented method of claim 1, wherein the access to the resource is only partially denied. 16. A computer-readable medium comprising a set of computer-executable instructions, which, when executed by one or more processors, cause the one or more processors to perform a method comprising:
a. Receiving a request to access a resource, the request being received from a request originator; b. Providing to the request originator a response comprising at least one challenge question and a plurality of answer options responsive to the challenge question; c. Receiving from the request originator a choice of one of the plurality of answer options; and d. Allowing or denying the access to the resource based on the received choice of one of the plurality of answer options, wherein the plurality of answer options comprise at least one answers of a first type which is unlikely to be selected by a human user and at least two answers of a second type, which have high probability of being selected by the human users and which reflect predetermined characteristics of the human user. 17. The computer-readable medium of claim 16, wherein difference between the answers of the first and the second type are obvious to the human user but not obvious to a computer. 18. The computer-readable medium of claim 16, wherein allowing or denying the access to the resource is based on a previous pattern of received choices of answer options. 19. The computer-readable medium of claim 19, wherein the access to the resource is granted when the request originator selected answers of the second type multiple times in the past. 20. A system comprising a central processing unit and a memory storing a set of instructions, the central processing unit being configured by the set of instructions to:
a. Receive a request to access a resource, the request being received from a request originator; b. Provide to the request originator a response comprising at least one challenge question and a plurality of answer options responsive to the challenge question; c. Receive from the request originator a choice of one of the plurality of answer options; and d. Allow or deny the access to the resource based on the received choice of one of the plurality of answer options, wherein the plurality of answer options comprise at least one answer of a first type which is unlikely to be selected by a human user and at least two answers of a second type, which have high probability of being selected by the human users and which reflect predetermined characteristics of the human user. | Multiple-choice survey is used to increase probability that action is caused by a human user, not by an automated software script. Survey contains some answers that no human user would select, but also more than one correct answer. The answer selected by the user from many correct answers is used as an indication of interest to related subject and/or to display related advertisement. Multiple multi-choice surveys can be presented to the same user over time, to decrease probability of a robot randomly selecting correct answers.1. A computer-implemented method performed in a system comprising a central processing unit and a memory, the method comprising:
a. Receiving a request to access a resource, the request being received from a request originator; b. Providing to the request originator a response comprising at least one challenge question and a plurality of answer options responsive to the challenge question; c. Receiving from the request originator a choice of one of the plurality of answer options; and d. Allowing or denying the access to the resource based on the received choice of one of the plurality of answer options, wherein the plurality of answer options comprise at least one answer of a first type which is unlikely to be selected by a human user and at least two answers of a second type, which have high probability of being selected by the human users and which reflect predetermined characteristics of the human user. 2. The computer-implemented method of claim 1, wherein difference between the answers of the first and the second type are obvious to the human user but not obvious to a computer. 3. The computer-implemented method of claim 1, wherein allowing or denying the access to the resource is based on a previous pattern of received choices of answer options. 4. The computer-implemented method of claim 3, wherein the access to the resource is granted when the request originator selected answers of the second type multiple times in the past. 5. The computer-implemented method of claim 1, further comprising storing information on the received choice of one of the plurality of answer options for a future use. 6. The computer-implemented method of claim 5, further comprising using the stored information on the received choice of one of the plurality of answer options to compute distribution of a parameter reflective of the request originator. 7. The computer-implemented method of claim 5, further comprising using the stored information on the received choice of one of the plurality of answer options to provide content to the request originator. 8. The computer-implemented method of claim 1, wherein the challenge question connects the request originator with a group of peers. 9. The computer-implemented method of claim 8, further comprising using received choices of a first plurality of request originators to identify the group of peers. 10. The computer-implemented method of claim 9, further comprising using the identified group of request originators to allow of deny access to subsequent request originators based on the corresponding choices of one of the plurality of answer options. 11. The computer-implemented method of claim 1, wherein the resource is a virtual private network service. 12. The computer-implemented method of claim 1, wherein if the access to the resource is denied, future requests within a predetermined time-out period are also denied. 13. The computer-implemented method of claim 1, wherein the plurality of the answer options are provided to the request originator in a pictorial form. 14. The computer-implemented method of claim 1, further comprising randomly varying an order of the plurality of the answer options. 15. The computer-implemented method of claim 1, wherein the access to the resource is only partially denied. 16. A computer-readable medium comprising a set of computer-executable instructions, which, when executed by one or more processors, cause the one or more processors to perform a method comprising:
a. Receiving a request to access a resource, the request being received from a request originator; b. Providing to the request originator a response comprising at least one challenge question and a plurality of answer options responsive to the challenge question; c. Receiving from the request originator a choice of one of the plurality of answer options; and d. Allowing or denying the access to the resource based on the received choice of one of the plurality of answer options, wherein the plurality of answer options comprise at least one answers of a first type which is unlikely to be selected by a human user and at least two answers of a second type, which have high probability of being selected by the human users and which reflect predetermined characteristics of the human user. 17. The computer-readable medium of claim 16, wherein difference between the answers of the first and the second type are obvious to the human user but not obvious to a computer. 18. The computer-readable medium of claim 16, wherein allowing or denying the access to the resource is based on a previous pattern of received choices of answer options. 19. The computer-readable medium of claim 19, wherein the access to the resource is granted when the request originator selected answers of the second type multiple times in the past. 20. A system comprising a central processing unit and a memory storing a set of instructions, the central processing unit being configured by the set of instructions to:
a. Receive a request to access a resource, the request being received from a request originator; b. Provide to the request originator a response comprising at least one challenge question and a plurality of answer options responsive to the challenge question; c. Receive from the request originator a choice of one of the plurality of answer options; and d. Allow or deny the access to the resource based on the received choice of one of the plurality of answer options, wherein the plurality of answer options comprise at least one answer of a first type which is unlikely to be selected by a human user and at least two answers of a second type, which have high probability of being selected by the human users and which reflect predetermined characteristics of the human user. | 2,400 |
7,624 | 7,624 | 14,702,903 | 2,487 | Several systems, methods and integrated circuits capable of reducing blocking artifacts in video data are disclosed. In an embodiment, a system for reducing blocking artifacts in video data includes a processing module and a deblocking module. The deblocking module comprises a luma deblocking filter and a chroma deblocking filter configured to filter an edge between adjacent blocks associated with the video data, where a block of the adjacent blocks corresponds to one of a prediction block and a transform block. The processing module is communicatively associated with the deblocking module and is operable to configure at least one filter coefficient corresponding to the chroma deblocking filter based on one or more filter coefficients corresponding to the luma deblocking filter. The processing module is further configured to cause the chroma deblocking filter to filter the edge between the adjacent blocks based on the configured at least one filter coefficient. | 1. A system for reducing blocking artifacts, the system comprising:
a deblocking module comprising a luma deblocking filter and a chroma deblocking filter configured to filter an edge between adjacent blocks associated with video data, wherein a block of the adjacent blocks corresponds to one of a prediction block and a transform block; and a processing module communicatively associated with the deblocking module, the processing module operable to configure at least one filter coefficient corresponding to the chroma deblocking filter based on one or more filter coefficients corresponding to the luma deblocking filter, and the processing module being configured to cause the chroma deblocking filter to filter the edge based on the at least one filter coefficient. 2. The system of claim 1, wherein the processing module is further configured to:
compute a boundary strength associated with the edge, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks. 3. The system of claim 2, where the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the boundary strength to be greater than a predetermined value. 4. The system of claim 2, wherein the processing module is further configured to:
determine whether the adjacent blocks are associated with blocking artifacts based on a pre-defined criterion on determining the boundary strength to be less than or equal to a predetermined value. 5. The system of claim 4, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the adjacent blocks to be associated with the blocking artifacts and the boundary strength to be non-zero value. 6. The system of claim 4, wherein the pre-defined criterion is at least partially configured based on a sum of absolute differences between pixel values corresponding to pixels associated with at least one of the adjacent blocks. 7. The system of claim 1, wherein the one or more filter coefficients correspond to a filtering mode of the luma deblocking filter associated with modifying fewer pixel values of pixels associated with at least one of the adjacent blocks as compared to one or more remaining filtering modes of the luma deblocking filter. 8. The system of claim 1, wherein a filter coefficient of the at least one filter coefficient corresponds to a coefficient associated with a parameter, and wherein a parametric value associated with the parameter is configured to be combined with a pixel value corresponding to a pixel associated with a block from among the adjacent blocks. 9. The system of claim 1, wherein the system is one of a high efficiency video coding (HEVC) based decoder, a moving picture experts group (MPEG)-4 based decoder, a HEVC based encoder and a MPEG-4 based encoder. 10. A method of reducing blocking artifacts, the method comprising:
configuring at least one filter coefficient corresponding to a chroma deblocking filter based on one or more filter coefficients corresponding to a luma deblocking filter; and filtering an edge between adjacent blocks associated with video data based on the configured at least one filter coefficient, wherein a block of the adjacent blocks corresponds to one of a prediction block and a transform block. 11. The method of claim 10, further comprising:
computing a boundary strength associated with the edge, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks. 12. The method of claim 11, where the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the boundary strength to be greater than a predetermined value. 13. The method of claim 11, further comprising:
determining whether the adjacent blocks are associated with blocking artifacts based on a pre-defined criterion on determining the boundary strength to be less than or equal to a predetermined value. 14. The method of claim 13, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the adjacent blocks to be associated with the blocking artifacts and the boundary strength to be non-zero value. 15. The method of claim 13, wherein the pre-defined criterion is at least partially configured based on a sum of absolute differences between pixel values corresponding to pixels associated with at least one of the adjacent blocks. 16. The method of claim 10, wherein a filter coefficient of the at least one filter coefficient corresponds to a parameter, and wherein a parametric value associated with the parameter is configured to be combined with a pixel value corresponding to a pixel associated with a block from among the adjacent blocks. 17. An integrated circuit configured to reduce blocking artifacts, the integrated circuit comprising:
a coding module configured to perform at least one of encoding of video data and decoding of encoded video data, the coding module comprising:
a deblocking module comprising a luma deblocking filter and a chroma deblocking filter configured to filter an edge between adjacent blocks associated with video data, wherein a block of the adjacent blocks corresponds to one of a prediction block and a transform block; and
a processing module communicatively associated with the deblocking module, the processing module operable to configure at least one filter coefficient corresponding to the chroma deblocking filter based on one or more filter coefficients corresponding to the luma deblocking filter, and the processing module being configured to cause the chroma deblocking filter to filter the edge based on the at least one filter coefficient; and
a memory module communicatively associated with the coding module, the memory module configured to store the video data subsequent to one of an encoding of the video data and a decoding of the video data. 18. The integrated circuit of claim 17, wherein a filter coefficient of the at least one filter coefficient corresponds to a coefficient associated with a parameter, and wherein a parametric value associated with the parameter is configured to be combined with a pixel value corresponding to a pixel associated with a block from among the adjacent blocks. 19. The integrated circuit of claim 17, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining a boundary strength to be greater than a predetermined value, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks. 20. The integrated circuit of claim 17, wherein the processing module is further configured to:
compute a boundary strength associated with the edge, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks; and determine whether the adjacent blocks are associated with blocking artifacts based on a pre-defined criterion on determining the boundary strength to be less than or equal to a predetermined value, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the adjacent blocks to be associated with the blocking artifacts and the boundary strength to be non-zero value. | Several systems, methods and integrated circuits capable of reducing blocking artifacts in video data are disclosed. In an embodiment, a system for reducing blocking artifacts in video data includes a processing module and a deblocking module. The deblocking module comprises a luma deblocking filter and a chroma deblocking filter configured to filter an edge between adjacent blocks associated with the video data, where a block of the adjacent blocks corresponds to one of a prediction block and a transform block. The processing module is communicatively associated with the deblocking module and is operable to configure at least one filter coefficient corresponding to the chroma deblocking filter based on one or more filter coefficients corresponding to the luma deblocking filter. The processing module is further configured to cause the chroma deblocking filter to filter the edge between the adjacent blocks based on the configured at least one filter coefficient.1. A system for reducing blocking artifacts, the system comprising:
a deblocking module comprising a luma deblocking filter and a chroma deblocking filter configured to filter an edge between adjacent blocks associated with video data, wherein a block of the adjacent blocks corresponds to one of a prediction block and a transform block; and a processing module communicatively associated with the deblocking module, the processing module operable to configure at least one filter coefficient corresponding to the chroma deblocking filter based on one or more filter coefficients corresponding to the luma deblocking filter, and the processing module being configured to cause the chroma deblocking filter to filter the edge based on the at least one filter coefficient. 2. The system of claim 1, wherein the processing module is further configured to:
compute a boundary strength associated with the edge, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks. 3. The system of claim 2, where the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the boundary strength to be greater than a predetermined value. 4. The system of claim 2, wherein the processing module is further configured to:
determine whether the adjacent blocks are associated with blocking artifacts based on a pre-defined criterion on determining the boundary strength to be less than or equal to a predetermined value. 5. The system of claim 4, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the adjacent blocks to be associated with the blocking artifacts and the boundary strength to be non-zero value. 6. The system of claim 4, wherein the pre-defined criterion is at least partially configured based on a sum of absolute differences between pixel values corresponding to pixels associated with at least one of the adjacent blocks. 7. The system of claim 1, wherein the one or more filter coefficients correspond to a filtering mode of the luma deblocking filter associated with modifying fewer pixel values of pixels associated with at least one of the adjacent blocks as compared to one or more remaining filtering modes of the luma deblocking filter. 8. The system of claim 1, wherein a filter coefficient of the at least one filter coefficient corresponds to a coefficient associated with a parameter, and wherein a parametric value associated with the parameter is configured to be combined with a pixel value corresponding to a pixel associated with a block from among the adjacent blocks. 9. The system of claim 1, wherein the system is one of a high efficiency video coding (HEVC) based decoder, a moving picture experts group (MPEG)-4 based decoder, a HEVC based encoder and a MPEG-4 based encoder. 10. A method of reducing blocking artifacts, the method comprising:
configuring at least one filter coefficient corresponding to a chroma deblocking filter based on one or more filter coefficients corresponding to a luma deblocking filter; and filtering an edge between adjacent blocks associated with video data based on the configured at least one filter coefficient, wherein a block of the adjacent blocks corresponds to one of a prediction block and a transform block. 11. The method of claim 10, further comprising:
computing a boundary strength associated with the edge, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks. 12. The method of claim 11, where the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the boundary strength to be greater than a predetermined value. 13. The method of claim 11, further comprising:
determining whether the adjacent blocks are associated with blocking artifacts based on a pre-defined criterion on determining the boundary strength to be less than or equal to a predetermined value. 14. The method of claim 13, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the adjacent blocks to be associated with the blocking artifacts and the boundary strength to be non-zero value. 15. The method of claim 13, wherein the pre-defined criterion is at least partially configured based on a sum of absolute differences between pixel values corresponding to pixels associated with at least one of the adjacent blocks. 16. The method of claim 10, wherein a filter coefficient of the at least one filter coefficient corresponds to a parameter, and wherein a parametric value associated with the parameter is configured to be combined with a pixel value corresponding to a pixel associated with a block from among the adjacent blocks. 17. An integrated circuit configured to reduce blocking artifacts, the integrated circuit comprising:
a coding module configured to perform at least one of encoding of video data and decoding of encoded video data, the coding module comprising:
a deblocking module comprising a luma deblocking filter and a chroma deblocking filter configured to filter an edge between adjacent blocks associated with video data, wherein a block of the adjacent blocks corresponds to one of a prediction block and a transform block; and
a processing module communicatively associated with the deblocking module, the processing module operable to configure at least one filter coefficient corresponding to the chroma deblocking filter based on one or more filter coefficients corresponding to the luma deblocking filter, and the processing module being configured to cause the chroma deblocking filter to filter the edge based on the at least one filter coefficient; and
a memory module communicatively associated with the coding module, the memory module configured to store the video data subsequent to one of an encoding of the video data and a decoding of the video data. 18. The integrated circuit of claim 17, wherein a filter coefficient of the at least one filter coefficient corresponds to a coefficient associated with a parameter, and wherein a parametric value associated with the parameter is configured to be combined with a pixel value corresponding to a pixel associated with a block from among the adjacent blocks. 19. The integrated circuit of claim 17, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining a boundary strength to be greater than a predetermined value, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks. 20. The integrated circuit of claim 17, wherein the processing module is further configured to:
compute a boundary strength associated with the edge, wherein the boundary strength is a numerical value computed based on at least one of an encoding mode of the adjacent blocks associated with the edge and an encoding data associated with the adjacent blocks; and determine whether the adjacent blocks are associated with blocking artifacts based on a pre-defined criterion on determining the boundary strength to be less than or equal to a predetermined value, wherein the edge is filtered by the chroma deblocking filter based on the at least one filter coefficient on determining the adjacent blocks to be associated with the blocking artifacts and the boundary strength to be non-zero value. | 2,400 |
7,625 | 7,625 | 14,319,057 | 2,443 | The current document is directed to methods and systems for processing, classifying, and efficiently storing large volumes of event messages generated in modern computing systems. In a disclosed implementation, received event messages are assigned to clusters based on metrics computed for the event messages. In addition, a significance value is determined for each received event message. When the significance value exceeds a threshold value, one or more actions are taken, including marking an event record corresponding to the event message, storing an event record corresponding to the event message in a significant-event log, and generating a notice or alarm. | 1. An event-message clustering system comprising:
one or more processors; one or more memories; and computer instructions, stored in one or more of the one or more memories that, when executed by one or more of the one or more processors, control the event-message clustering system to
receive event messages, and
process each of the received event messages by
determining a cluster to which to assign the event message,
extracting data values from the event message,
computing a significance value for the event message,
generating an event record corresponding to the event message that includes the extracted data values, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. 2. The event-message clustering system of claim 1 wherein the significance value computed for an event message is a numeric value that reflects one or more of:
a dissimilarity of the event-message type that includes the received event message to other event-message types;
a frequency that event messages of the event-message type that includes the received event message are received; and
a temporal proximity of event messages of the event-message type that includes the received event message to critical events. 3. The event-message clustering system of claim 2 wherein the dissimilarity of the event-message type that includes the received event message to other event-message types is computed from one or more of:
a distance separating a point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space;
a ratio of densities of points in feature-vector space;
a difference between a pair-wise similarity computed for a group of event messages that includes the received event message and a pair-wise similarity computed for the group without the received event message; and
a difference between a pair-wise similarity computed for a group of event-message types that include the type of the received event message and a pair-wise similarity computed for the group without the type of the received event message. 4. The event-message clustering system of claim 3 wherein, in computing the distance separating the point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space, the other point in feature-vector space corresponds to one of;
a centroid of a cluster of event-message types;
a feature vector associated with a cluster; and
a kth-nearest-neighbor event message. 5. The event-message clustering system of claim 3 wherein the ratio of densities of points in feature-vector space is the ratio of an average density of points in feature-vector space to a density of points in feature-vector-space neighborhood of the point in feature-vector space corresponding to the type of the received event message. 6. The event-message clustering system of claim 2 wherein the frequency that event messages of the event-message type that includes the received event message are received is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received for each interval of time. 7. The event-message clustering system of claim 2 wherein the temporal proximity of event messages of the event-message type that includes the received event message to critical events is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication, within temporal neighborhoods about time points of critical system events; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received within the temporal neighborhoods. 8. The event-message clustering system of claim 7 further including one or more of:
determining, from the accessed number of event records, an average highest number of event messages of the event-message type that includes the received event message that are received that occur within the temporal neighborhoods. 9. The event-message clustering system of claim 1 wherein, following computation of a significance value for the event message, the event-message clustering system:
compares the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generates an event record corresponding to the event message,
places an indication in the event record to indicate that the event record corresponds to a significant event, and
stores the event record within, or associated with, the selected cluster in a physical data-storage device. 10. The event-message clustering system of claim 1 wherein, following computation of a significance value for the event message, the event-message clustering system:
compares the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generates an event record corresponding to the event message, and
stores the event record within an event log for significant event messages. 11. The event-message clustering system of claim 1 wherein, following computation of a significance value for the event message, the event-message clustering system:
compares the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generates one or more of a notice and alarm, and
transmits the generated notice or alarm to one or more of an automated system-administration subsystem and human system administrator. 12. A method that processes event messages, carried out within an event-message clustering system, the event-message clustering system having one or more processors, one or more memories, and computer instructions, stored in one or more of the one or more memories that, when executed by one or more of the one or more processors, control the event-message clustering system to receive event messages and process each of the received event messages, the method comprising:
receiving event messages, and processing each of the received event messages by
determining a cluster to which to assign the event message,
extracting data values from the event message,
computing a significance value for the event message,
generating an event record corresponding to the event message that includes the extracted data values, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. 13. The method of claim 12 wherein the significance value computed for an event message is a numeric value that reflects one or more of:
a dissimilarity of the event-message type that includes the received event message to other event-message types;
a frequency that event messages of the event-message type that includes the received event message are received; and
a temporal proximity of event messages of the event-message type that includes the received event message to critical events. 14. The method of claim 13 wherein the dissimilarity of the event-message type that includes the received event message to other event-message types is computed from one or more of:
a distance separating a point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space;
a ratio of densities of points in feature-vector space;
a difference between a pair-wise similarity computed for a group of event messages that includes the received event message and a pair-wise similarity computed for the group without the received event message; and
a difference between a pair-wise similarity computed for a group of event-message types that include the type of the received event message and a pair-wise similarity computed for the group without the type of the received event message. 15. The method of claim 14 wherein, in computing the distance separating the point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space, the other point in feature-vector space corresponds to one of:
a centroid of a cluster of event-message types;
a feature vector associated with a cluster; and
a kth-nearest-neighbor event message. 16. The method of claim 14 wherein the ratio of densities of points in feature-vector space is the ratio of an average density of points in feature-vector space to a density of points in feature-vector-space neighborhood of the point in feature-vector space corresponding to the type of the received event message. 17. The method of claim 13 wherein the frequency that event messages of the event-message type that includes the received event message are received is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received for each interval of time. 18. The method of claim 13 wherein the temporal proximity of event messages of the event-message type that includes the received event message to critical events is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication, within temporal neighborhoods about time points of critical system events; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received within the temporal neighborhoods. 19. The method of claim 18 further including one or more of:
determining, from the accessed number of event records, an average highest number of event messages of the event-message type that includes the received event message that are received that occur within the temporal neighborhoods. 20. The method of claim 12 further including, following computation of a significance value for the event message:
comparing the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generating an event record corresponding to the event message,
placing an indication in the event record to indicate that the event record corresponds to a significant event, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. 21. The method of claim 12 further including, following computation of a significance value for the event message:
comparing the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generating an event record corresponding to the event message, and
storing the event record within an event log for significant event messages. 22. The method of claim 12 further including, following computation of a significance value for the event message:
comparing the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generating one or more of a notice and alarm, and
transmitting the generated notice or alarm to one or more of an automated system-administration subsystem and human system administrator. 23. Computer instructions stored in a physical device that, when executed on one or more processors of an event-message clustering system that additionally includes one or more memories, control the event-message clustering system to:
receive event messages; and process each of the received event messages by
determining a cluster to which to assign the event message,
extracting data values from the event message,
computing a significance value for the event message,
generating an event record corresponding to the event message that includes the extracted data values, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. | The current document is directed to methods and systems for processing, classifying, and efficiently storing large volumes of event messages generated in modern computing systems. In a disclosed implementation, received event messages are assigned to clusters based on metrics computed for the event messages. In addition, a significance value is determined for each received event message. When the significance value exceeds a threshold value, one or more actions are taken, including marking an event record corresponding to the event message, storing an event record corresponding to the event message in a significant-event log, and generating a notice or alarm.1. An event-message clustering system comprising:
one or more processors; one or more memories; and computer instructions, stored in one or more of the one or more memories that, when executed by one or more of the one or more processors, control the event-message clustering system to
receive event messages, and
process each of the received event messages by
determining a cluster to which to assign the event message,
extracting data values from the event message,
computing a significance value for the event message,
generating an event record corresponding to the event message that includes the extracted data values, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. 2. The event-message clustering system of claim 1 wherein the significance value computed for an event message is a numeric value that reflects one or more of:
a dissimilarity of the event-message type that includes the received event message to other event-message types;
a frequency that event messages of the event-message type that includes the received event message are received; and
a temporal proximity of event messages of the event-message type that includes the received event message to critical events. 3. The event-message clustering system of claim 2 wherein the dissimilarity of the event-message type that includes the received event message to other event-message types is computed from one or more of:
a distance separating a point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space;
a ratio of densities of points in feature-vector space;
a difference between a pair-wise similarity computed for a group of event messages that includes the received event message and a pair-wise similarity computed for the group without the received event message; and
a difference between a pair-wise similarity computed for a group of event-message types that include the type of the received event message and a pair-wise similarity computed for the group without the type of the received event message. 4. The event-message clustering system of claim 3 wherein, in computing the distance separating the point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space, the other point in feature-vector space corresponds to one of;
a centroid of a cluster of event-message types;
a feature vector associated with a cluster; and
a kth-nearest-neighbor event message. 5. The event-message clustering system of claim 3 wherein the ratio of densities of points in feature-vector space is the ratio of an average density of points in feature-vector space to a density of points in feature-vector-space neighborhood of the point in feature-vector space corresponding to the type of the received event message. 6. The event-message clustering system of claim 2 wherein the frequency that event messages of the event-message type that includes the received event message are received is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received for each interval of time. 7. The event-message clustering system of claim 2 wherein the temporal proximity of event messages of the event-message type that includes the received event message to critical events is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication, within temporal neighborhoods about time points of critical system events; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received within the temporal neighborhoods. 8. The event-message clustering system of claim 7 further including one or more of:
determining, from the accessed number of event records, an average highest number of event messages of the event-message type that includes the received event message that are received that occur within the temporal neighborhoods. 9. The event-message clustering system of claim 1 wherein, following computation of a significance value for the event message, the event-message clustering system:
compares the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generates an event record corresponding to the event message,
places an indication in the event record to indicate that the event record corresponds to a significant event, and
stores the event record within, or associated with, the selected cluster in a physical data-storage device. 10. The event-message clustering system of claim 1 wherein, following computation of a significance value for the event message, the event-message clustering system:
compares the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generates an event record corresponding to the event message, and
stores the event record within an event log for significant event messages. 11. The event-message clustering system of claim 1 wherein, following computation of a significance value for the event message, the event-message clustering system:
compares the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generates one or more of a notice and alarm, and
transmits the generated notice or alarm to one or more of an automated system-administration subsystem and human system administrator. 12. A method that processes event messages, carried out within an event-message clustering system, the event-message clustering system having one or more processors, one or more memories, and computer instructions, stored in one or more of the one or more memories that, when executed by one or more of the one or more processors, control the event-message clustering system to receive event messages and process each of the received event messages, the method comprising:
receiving event messages, and processing each of the received event messages by
determining a cluster to which to assign the event message,
extracting data values from the event message,
computing a significance value for the event message,
generating an event record corresponding to the event message that includes the extracted data values, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. 13. The method of claim 12 wherein the significance value computed for an event message is a numeric value that reflects one or more of:
a dissimilarity of the event-message type that includes the received event message to other event-message types;
a frequency that event messages of the event-message type that includes the received event message are received; and
a temporal proximity of event messages of the event-message type that includes the received event message to critical events. 14. The method of claim 13 wherein the dissimilarity of the event-message type that includes the received event message to other event-message types is computed from one or more of:
a distance separating a point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space;
a ratio of densities of points in feature-vector space;
a difference between a pair-wise similarity computed for a group of event messages that includes the received event message and a pair-wise similarity computed for the group without the received event message; and
a difference between a pair-wise similarity computed for a group of event-message types that include the type of the received event message and a pair-wise similarity computed for the group without the type of the received event message. 15. The method of claim 14 wherein, in computing the distance separating the point in feature-vector space corresponding to the type of the received event message from another point in feature-vector space, the other point in feature-vector space corresponds to one of:
a centroid of a cluster of event-message types;
a feature vector associated with a cluster; and
a kth-nearest-neighbor event message. 16. The method of claim 14 wherein the ratio of densities of points in feature-vector space is the ratio of an average density of points in feature-vector space to a density of points in feature-vector-space neighborhood of the point in feature-vector space corresponding to the type of the received event message. 17. The method of claim 13 wherein the frequency that event messages of the event-message type that includes the received event message are received is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received for each interval of time. 18. The method of claim 13 wherein the temporal proximity of event messages of the event-message type that includes the received event message to critical events is computed by:
accessing a number of event records within the stored event records, each stored event record including a time indication, within temporal neighborhoods about time points of critical system events; and
determining, from the accessed number of event records, an average number of event messages of the event-message type that includes the received event message that are received within the temporal neighborhoods. 19. The method of claim 18 further including one or more of:
determining, from the accessed number of event records, an average highest number of event messages of the event-message type that includes the received event message that are received that occur within the temporal neighborhoods. 20. The method of claim 12 further including, following computation of a significance value for the event message:
comparing the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generating an event record corresponding to the event message,
placing an indication in the event record to indicate that the event record corresponds to a significant event, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. 21. The method of claim 12 further including, following computation of a significance value for the event message:
comparing the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generating an event record corresponding to the event message, and
storing the event record within an event log for significant event messages. 22. The method of claim 12 further including, following computation of a significance value for the event message:
comparing the computed significance value to a threshold value; and
when the computed significance value is greater than the threshold value,
generating one or more of a notice and alarm, and
transmitting the generated notice or alarm to one or more of an automated system-administration subsystem and human system administrator. 23. Computer instructions stored in a physical device that, when executed on one or more processors of an event-message clustering system that additionally includes one or more memories, control the event-message clustering system to:
receive event messages; and process each of the received event messages by
determining a cluster to which to assign the event message,
extracting data values from the event message,
computing a significance value for the event message,
generating an event record corresponding to the event message that includes the extracted data values, and
storing the event record within, or associated with, the selected cluster in a physical data-storage device. | 2,400 |
7,626 | 7,626 | 14,973,261 | 2,468 | Certain aspects and features of the present disclosure relate to a validation sub-system for determining whether access points in a telecommunication system provide suitable performance for a specified configuration of the telecommunication system. For example, a wireless receiver can simultaneous receive beacon signals at a common frequency from multiple access points. Each beacon signal has a data sequence that is different than the other beacon signals. A processing device can determine, based on the data sequences received by the wireless receiver, channel responses for channels between the access points and the wireless receiver. The processing device can output, based on the channel responses, an indicator that the access points are suitable for a specified configuration of a telecommunication system for providing wireless coverage using the access points. | 1. A method comprising:
simultaneously receiving, by a wireless receiver, beacon signals at a common frequency from a first access point and a second access point, respectively, wherein each of the beacon signals has a data sequence that is different than other beacon signals; determining, by a processing device and based on the data sequences received by the wireless receiver, channel responses for channels between the first access point and the wireless receiver and between the second access point and the wireless receiver; outputting, by the processing device and based on the channel responses, an indicator that the first access point and the second access point are suitable for a specified configuration of a telecommunication system for providing wireless coverage using the first access point and the second access point. 2. The method of claim 1, wherein the specified configuration comprises using the first access point and the second access point for a multiple-input/multiple-output operation. 3. The method of claim 2, further comprising determining that the first access point and the second access point are suitable for the multiple-input/multiple-output operation based on determining that one of the channel responses is sufficiently different than other channel responses. 4. The method of claim 1, further comprising determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on an amount of constructive or destructive interference between the channels, the amount of constructive or destructive interference determined from the channel responses. 5. The method of claim 1, further comprising determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on determining from the channel responses that the channels have respective threshold amounts of capacity. 6. The method of claim 1, further comprising determining that sufficiently different polarization exists between two antennas or antenna sections of an access point in the telecommunication system and outputting an additional indicator of the sufficiently different polarization, wherein determining that the sufficiently different polarization exists comprises:
simultaneously receiving, by the wireless receiver, two beacon signals having different data sequences and the same frequency from the access point; determining a channel response for a channel between the wireless receiver and with the access point; and determining, based on the channel response, that an amount of separation between the two beacon signals exceeds a threshold. 7. The method of claim 1, further comprising, prior to the wireless receiver receiving the beacon signals:
determining, by a controller in the telecommunication system, used frequency resources assigned to a set of access points for communicating with wireless terminal devices in a common coverage cell formed by the set of access points, wherein the set of access points includes the first access point and the second access point; identifying, by the controller in the telecommunication system, an additional frequency resource for a time slot other than the used frequency resources for the common coverage cell; assigning, by the controller, the additional frequency resource to the first access point and the second access point; and configuring the first access point and the second access point to transmit the respective beacon signals during the time slot using the assigned frequency resource. 8. The method of claim 1, further comprising:
simultaneously receiving, by the wireless receiver, additional beacon signals at the common frequency from additional access points, respectively, wherein the additional beacon signals have additional data sequences different from one another; and determining, by the processing device and based on the data sequences received by the wireless receiver, additional channel responses for additional channels between the additional access point and the wireless receiver, wherein the indicator also indicates that that the additional access points are suitable for the specified configuration. 9. A telecommunication system comprising:
a first access point and a second access point, wherein the first access point and the second access point are configured to simultaneously transmit respective beacon signals at a common frequency, wherein each of the beacon signals has a data sequence that is different than other beacon signals; a control device communicatively coupled to the first access point and the second access point and configured to:
determine, from an indicator associated with the beacon signals, that the first access point and the second access point are suitable for a specified configuration of the telecommunication system, and
based on the indicator, instruct the first access point and the second access point to communicate with wireless terminal devices using the specified configuration. 10. The telecommunication system of claim 9, wherein the specified configuration comprises the first access point and the second access point configured for a multiple-input/multiple-output operation, wherein the indicator indicates that a first channel response associated with the first access point is sufficiently different from a second channel response associated with the second access point. 11. The telecommunication system of claim 9, wherein the first access point and the second access point are configured to provide a common coverage cell and the control device is further configured to:
determine used frequency resources assigned to the first access point and the second access point for communicating with the wireless terminal devices in the common coverage cell; identify, prior to the first access point and the second access point transmitting the beacon signals, an additional frequency resource for a time slot other than the used frequency resources for the common coverage cell; assign the additional frequency resource to the first access point and the second access point; and instruct the first access point and the second access point to transmit the respective beacon signals during the time slot using the assigned frequency resource. 12. The telecommunication system of claim 9, wherein the indicator indicates that an amount of constructive or destructive interference between a first channel associated with the first access point and a second channel response associated with the second access point is suitable for the specified configuration. 13. The telecommunication system of claim 9, wherein the control device is configured to receive the indicator from a mobile computing device external to the telecommunication system. 14. A non-transitory computer-readable medium having instructions stored thereon that are executable by a processing device to perform operations, the operations comprising:
identifying data sequences in beacon signals received from a first access point and a second access point, respectively, wherein each of the beacon signals has a data sequence that is different than other beacon signals; determining, based on the data sequences, channel responses for channels via which a wireless receiver received the respective beacon signals; and based on determining the channel responses, communicating an indicator to a control device of a telecommunication system that the first access point and the second access point are suitable for a specified configuration of the telecommunication system for providing wireless coverage using the first access point and the second access point. 15. The non-transitory computer-readable medium of claim 14, wherein the specified configuration comprises using the first access point and the second access point for a multiple-input/multiple-output operation. 16. The non-transitory computer-readable medium of claim 15, wherein the operations further comprise determining that the first access point and the second access point are suitable for the multiple-input/multiple-output operation based on determining that one of the channel responses is sufficiently different than other channel responses. 17. The non-transitory computer-readable medium of claim 14, wherein the operations further comprise determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on an amount of constructive or destructive interference between the channels, the amount of constructive or destructive interference determined from the channel responses. 18. The non-transitory computer-readable medium of claim 14, wherein the operations further comprise determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on determining from the channel responses that the channels have respective threshold amounts of capacity. 19. The non-transitory computer-readable medium of claim 14, wherein the operations further comprise determining that sufficiently different polarization exists between two antennas or antenna sections of an access point in the telecommunication system and outputting an additional indicator of the sufficiently different polarization. 20. The non-transitory computer-readable medium of claim 19, wherein determining that the sufficiently different polarization exists comprises:
simultaneously receiving, by the wireless receiver, two beacon signals having different data sequences and the same frequency from the access point; determining a channel response for a channel between the wireless receiver and with the access point; and determining, based on the channel response, that an amount of separation between the two beacon signals exceeds a threshold. | Certain aspects and features of the present disclosure relate to a validation sub-system for determining whether access points in a telecommunication system provide suitable performance for a specified configuration of the telecommunication system. For example, a wireless receiver can simultaneous receive beacon signals at a common frequency from multiple access points. Each beacon signal has a data sequence that is different than the other beacon signals. A processing device can determine, based on the data sequences received by the wireless receiver, channel responses for channels between the access points and the wireless receiver. The processing device can output, based on the channel responses, an indicator that the access points are suitable for a specified configuration of a telecommunication system for providing wireless coverage using the access points.1. A method comprising:
simultaneously receiving, by a wireless receiver, beacon signals at a common frequency from a first access point and a second access point, respectively, wherein each of the beacon signals has a data sequence that is different than other beacon signals; determining, by a processing device and based on the data sequences received by the wireless receiver, channel responses for channels between the first access point and the wireless receiver and between the second access point and the wireless receiver; outputting, by the processing device and based on the channel responses, an indicator that the first access point and the second access point are suitable for a specified configuration of a telecommunication system for providing wireless coverage using the first access point and the second access point. 2. The method of claim 1, wherein the specified configuration comprises using the first access point and the second access point for a multiple-input/multiple-output operation. 3. The method of claim 2, further comprising determining that the first access point and the second access point are suitable for the multiple-input/multiple-output operation based on determining that one of the channel responses is sufficiently different than other channel responses. 4. The method of claim 1, further comprising determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on an amount of constructive or destructive interference between the channels, the amount of constructive or destructive interference determined from the channel responses. 5. The method of claim 1, further comprising determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on determining from the channel responses that the channels have respective threshold amounts of capacity. 6. The method of claim 1, further comprising determining that sufficiently different polarization exists between two antennas or antenna sections of an access point in the telecommunication system and outputting an additional indicator of the sufficiently different polarization, wherein determining that the sufficiently different polarization exists comprises:
simultaneously receiving, by the wireless receiver, two beacon signals having different data sequences and the same frequency from the access point; determining a channel response for a channel between the wireless receiver and with the access point; and determining, based on the channel response, that an amount of separation between the two beacon signals exceeds a threshold. 7. The method of claim 1, further comprising, prior to the wireless receiver receiving the beacon signals:
determining, by a controller in the telecommunication system, used frequency resources assigned to a set of access points for communicating with wireless terminal devices in a common coverage cell formed by the set of access points, wherein the set of access points includes the first access point and the second access point; identifying, by the controller in the telecommunication system, an additional frequency resource for a time slot other than the used frequency resources for the common coverage cell; assigning, by the controller, the additional frequency resource to the first access point and the second access point; and configuring the first access point and the second access point to transmit the respective beacon signals during the time slot using the assigned frequency resource. 8. The method of claim 1, further comprising:
simultaneously receiving, by the wireless receiver, additional beacon signals at the common frequency from additional access points, respectively, wherein the additional beacon signals have additional data sequences different from one another; and determining, by the processing device and based on the data sequences received by the wireless receiver, additional channel responses for additional channels between the additional access point and the wireless receiver, wherein the indicator also indicates that that the additional access points are suitable for the specified configuration. 9. A telecommunication system comprising:
a first access point and a second access point, wherein the first access point and the second access point are configured to simultaneously transmit respective beacon signals at a common frequency, wherein each of the beacon signals has a data sequence that is different than other beacon signals; a control device communicatively coupled to the first access point and the second access point and configured to:
determine, from an indicator associated with the beacon signals, that the first access point and the second access point are suitable for a specified configuration of the telecommunication system, and
based on the indicator, instruct the first access point and the second access point to communicate with wireless terminal devices using the specified configuration. 10. The telecommunication system of claim 9, wherein the specified configuration comprises the first access point and the second access point configured for a multiple-input/multiple-output operation, wherein the indicator indicates that a first channel response associated with the first access point is sufficiently different from a second channel response associated with the second access point. 11. The telecommunication system of claim 9, wherein the first access point and the second access point are configured to provide a common coverage cell and the control device is further configured to:
determine used frequency resources assigned to the first access point and the second access point for communicating with the wireless terminal devices in the common coverage cell; identify, prior to the first access point and the second access point transmitting the beacon signals, an additional frequency resource for a time slot other than the used frequency resources for the common coverage cell; assign the additional frequency resource to the first access point and the second access point; and instruct the first access point and the second access point to transmit the respective beacon signals during the time slot using the assigned frequency resource. 12. The telecommunication system of claim 9, wherein the indicator indicates that an amount of constructive or destructive interference between a first channel associated with the first access point and a second channel response associated with the second access point is suitable for the specified configuration. 13. The telecommunication system of claim 9, wherein the control device is configured to receive the indicator from a mobile computing device external to the telecommunication system. 14. A non-transitory computer-readable medium having instructions stored thereon that are executable by a processing device to perform operations, the operations comprising:
identifying data sequences in beacon signals received from a first access point and a second access point, respectively, wherein each of the beacon signals has a data sequence that is different than other beacon signals; determining, based on the data sequences, channel responses for channels via which a wireless receiver received the respective beacon signals; and based on determining the channel responses, communicating an indicator to a control device of a telecommunication system that the first access point and the second access point are suitable for a specified configuration of the telecommunication system for providing wireless coverage using the first access point and the second access point. 15. The non-transitory computer-readable medium of claim 14, wherein the specified configuration comprises using the first access point and the second access point for a multiple-input/multiple-output operation. 16. The non-transitory computer-readable medium of claim 15, wherein the operations further comprise determining that the first access point and the second access point are suitable for the multiple-input/multiple-output operation based on determining that one of the channel responses is sufficiently different than other channel responses. 17. The non-transitory computer-readable medium of claim 14, wherein the operations further comprise determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on an amount of constructive or destructive interference between the channels, the amount of constructive or destructive interference determined from the channel responses. 18. The non-transitory computer-readable medium of claim 14, wherein the operations further comprise determining that the first access point and the second access point are suitable for the specified configuration of the telecommunication system based on determining from the channel responses that the channels have respective threshold amounts of capacity. 19. The non-transitory computer-readable medium of claim 14, wherein the operations further comprise determining that sufficiently different polarization exists between two antennas or antenna sections of an access point in the telecommunication system and outputting an additional indicator of the sufficiently different polarization. 20. The non-transitory computer-readable medium of claim 19, wherein determining that the sufficiently different polarization exists comprises:
simultaneously receiving, by the wireless receiver, two beacon signals having different data sequences and the same frequency from the access point; determining a channel response for a channel between the wireless receiver and with the access point; and determining, based on the channel response, that an amount of separation between the two beacon signals exceeds a threshold. | 2,400 |
7,627 | 7,627 | 15,370,127 | 2,487 | An apparatus for providing motion estimation for video encoding includes a selection element and a processing element. The selection element is configured to select a subset including less than all of candidate pixel locations from among a plurality of candidate pixel locations used for motion vector determination based on a relationship between a best candidate pixel location of a first level of accuracy and a best candidate pixel location of a second level of accuracy. The processing element is configured to process an input video sequence to determine a motion vector at the first level of accuracy, to refine the motion vector at the second level of accuracy, and to determine the motion vector at a third level of accuracy using only the subset of candidate pixel locations. | 1. A method of performing motion estimation for video encoding, comprising:
processing an input video sequence to determine a motion vector between a first video frame and a reference frame, comprising determining a best candidate pixel location in the reference frame at a first level of accuracy; refining the motion vector at a second level of accuracy higher than the first level of accuracy, comprising determining a best candidate pixel location at the second level of accuracy; selecting, with a selection element, a subset of candidate pixel locations proximate to the best candidate pixel location at the second level of accuracy, and between:
the best candidate pixel location at the first level of accuracy, and
the best candidate pixel location at the second level of accuracy other than the best candidate pixel location at the first level of accuracy; and
determining the motion vector at a third level of accuracy using only the subset of candidate pixel locations. 2. The method of claim 1, wherein the determining of a best candidate pixel location comprises determining a block in the reference frame most closely matching the original block based on minimization of a distortion measure. 3. The method of claim 1, wherein the determining of a best candidate pixel location comprises determining a block in the reference frame most closely matching the original block based on minimization of a sum of absolute difference. 4. The method of claim 1, wherein the determining of a best candidate pixel location comprises determining a block in the reference frame most closely matching the original block based on minimization of a difference between the block in the reference frame and the original block. 5. The method of claim 1, wherein a candidate block has a size of less than or equal to 16×16 pixels. 6. The method of claim 1, wherein the first level of accuracy is integer pixel level of accuracy, the second level of accuracy is half pixel level of accuracy, and the third level of accuracy is quarter pixel level of accuracy. 7. The method of claim 1, wherein the number of the selected candidate block locations at a third level of accuracy is less than the number of the candidate block locations of the third level of accuracy. 8. An encoder for encoding video frames based on a motion vector describing the motion from a location of an original block in an original frame to a reference block location in a reference frame, comprising a motion estimation element configured to:
determine a best candidate block location at a first level of accuracy corresponding to a candidate block in the reference frame most closely matching the original block at the first level of accuracy; determine a best candidate block location at a second level of accuracy, higher than the first level of accuracy, corresponding to a candidate block in the reference frame most closely matching the original block at the second level of accuracy; select candidate block locations, at a third level of accuracy, that are proximate to the best candidate block location at the second level of accuracy, and between:
the best candidate block location at the first level of accuracy, and
the best candidate block location at the second level of accuracy other than the best candidate block location at the first level of accuracy; and
determine, from among the selected candidate block locations at the third level of accuracy, a reference block location corresponding to a candidate block in the reference frame most closely matching the original block. 9. The encoder of claim 8, wherein the motion estimation element is configured to determine a block in the reference frame most closely matching the original block based on minimization of a distortion measure. 10. The encoder of claim 8, wherein the motion estimation element is configured to determine a block in the reference frame most closely matching the original block based on minimization of a sum of absolute difference. 11. The encoder of claim 8, wherein the motion estimation element is configured to determine a block in the reference frame most closely matching the original block based on minimization of a difference between the block in the reference frame and the original block. 12. The encoder of claim 8, wherein a candidate block has a size of less than or equal to 16×16 pixels. 13. The encoder of claim 8, wherein the first level of accuracy is integer pixel level of accuracy, the second level of accuracy is half pixel level of accuracy, and the third level of accuracy is quarter pixel level of accuracy. 14. The encoder of claim 8, wherein the number of the selected candidate block locations at a third level of accuracy is less than the number of the candidate block locations of the third level of accuracy. | An apparatus for providing motion estimation for video encoding includes a selection element and a processing element. The selection element is configured to select a subset including less than all of candidate pixel locations from among a plurality of candidate pixel locations used for motion vector determination based on a relationship between a best candidate pixel location of a first level of accuracy and a best candidate pixel location of a second level of accuracy. The processing element is configured to process an input video sequence to determine a motion vector at the first level of accuracy, to refine the motion vector at the second level of accuracy, and to determine the motion vector at a third level of accuracy using only the subset of candidate pixel locations.1. A method of performing motion estimation for video encoding, comprising:
processing an input video sequence to determine a motion vector between a first video frame and a reference frame, comprising determining a best candidate pixel location in the reference frame at a first level of accuracy; refining the motion vector at a second level of accuracy higher than the first level of accuracy, comprising determining a best candidate pixel location at the second level of accuracy; selecting, with a selection element, a subset of candidate pixel locations proximate to the best candidate pixel location at the second level of accuracy, and between:
the best candidate pixel location at the first level of accuracy, and
the best candidate pixel location at the second level of accuracy other than the best candidate pixel location at the first level of accuracy; and
determining the motion vector at a third level of accuracy using only the subset of candidate pixel locations. 2. The method of claim 1, wherein the determining of a best candidate pixel location comprises determining a block in the reference frame most closely matching the original block based on minimization of a distortion measure. 3. The method of claim 1, wherein the determining of a best candidate pixel location comprises determining a block in the reference frame most closely matching the original block based on minimization of a sum of absolute difference. 4. The method of claim 1, wherein the determining of a best candidate pixel location comprises determining a block in the reference frame most closely matching the original block based on minimization of a difference between the block in the reference frame and the original block. 5. The method of claim 1, wherein a candidate block has a size of less than or equal to 16×16 pixels. 6. The method of claim 1, wherein the first level of accuracy is integer pixel level of accuracy, the second level of accuracy is half pixel level of accuracy, and the third level of accuracy is quarter pixel level of accuracy. 7. The method of claim 1, wherein the number of the selected candidate block locations at a third level of accuracy is less than the number of the candidate block locations of the third level of accuracy. 8. An encoder for encoding video frames based on a motion vector describing the motion from a location of an original block in an original frame to a reference block location in a reference frame, comprising a motion estimation element configured to:
determine a best candidate block location at a first level of accuracy corresponding to a candidate block in the reference frame most closely matching the original block at the first level of accuracy; determine a best candidate block location at a second level of accuracy, higher than the first level of accuracy, corresponding to a candidate block in the reference frame most closely matching the original block at the second level of accuracy; select candidate block locations, at a third level of accuracy, that are proximate to the best candidate block location at the second level of accuracy, and between:
the best candidate block location at the first level of accuracy, and
the best candidate block location at the second level of accuracy other than the best candidate block location at the first level of accuracy; and
determine, from among the selected candidate block locations at the third level of accuracy, a reference block location corresponding to a candidate block in the reference frame most closely matching the original block. 9. The encoder of claim 8, wherein the motion estimation element is configured to determine a block in the reference frame most closely matching the original block based on minimization of a distortion measure. 10. The encoder of claim 8, wherein the motion estimation element is configured to determine a block in the reference frame most closely matching the original block based on minimization of a sum of absolute difference. 11. The encoder of claim 8, wherein the motion estimation element is configured to determine a block in the reference frame most closely matching the original block based on minimization of a difference between the block in the reference frame and the original block. 12. The encoder of claim 8, wherein a candidate block has a size of less than or equal to 16×16 pixels. 13. The encoder of claim 8, wherein the first level of accuracy is integer pixel level of accuracy, the second level of accuracy is half pixel level of accuracy, and the third level of accuracy is quarter pixel level of accuracy. 14. The encoder of claim 8, wherein the number of the selected candidate block locations at a third level of accuracy is less than the number of the candidate block locations of the third level of accuracy. | 2,400 |
7,628 | 7,628 | 15,115,194 | 2,467 | The present disclosure relates to a method performed in a first access node in a wireless network of establishing a communications interface between the first access node arranged to operate according to a first radio access technology and one or more second access nodes arranged to operate according to a second radio access technology. The one or more second access nodes are discovered (S 31 ) based on receipt of respective radio signals representative of each second access node. A second access node of the discovered one or more second access nodes is selected (S 32 ) for establishing a communications interface with. A transport address is derived (S 33 ) for the selected second access node from a node related identity retrieved in the radio signal and an interface setup request message is sent (S 34 ) to the selected second access node. The communications interface is established upon receipt (S 35 ) of an interface setup response message from the selected second access node. | 1-22. (canceled) 23. A method, performed in a first access node in a wireless network, of establishing a communications interface between the first access node, arranged to operate according to a first radio access technology (RAT), and one or more second access nodes arranged to operate according to a second radio access technology, the method comprising:
discovering one or more second access nodes based on receipt of respective radio signals representative of each second access node; selecting a second access node of the discovered one or more second access nodes for establishing a communications interface with; deriving a transport address for the selected second access node from a node-related identity retrieved in the radio signal; sending an interface setup request message to the selected second access node; and receiving an interface setup response message from the selected second access node. 24. The method of claim 23, wherein the step of discovering one or more second access nodes comprises intercepting, by the first access node, radio signals originating from respective second access nodes. 25. The method of claim 23, wherein the step of discovering one or more second access nodes comprises receiving of one or more user equipment reports from a user equipment within a coverage area of the first access node, each user equipment report generated in response to interception by the user equipment of radio signals originating from a respective second access node. 26. The method of claim 23, wherein the step of discovering one or more second access nodes comprises determining a node-related identity of each discovered one or more second access node. 27. The method of claim 23, wherein the interface setup request message includes a node-related identity of the first access node. 28. The method of claim 23, wherein the first access node is an access point of a local area network and the selected second access node is an access node of a cellular radio access network. 29. The method of claim 28, wherein the interface setup request message includes a list of additional local area network access points within the coverage area of the selected second access node, the list including node-related identities and transport addresses of the additional local area network access points. 30. The method of claim 28, wherein the node-related identity retrieved in the radio signal is a physical cell ID (PCI) or/and a global cell ID (GCID). 31. The method of claim 30, wherein the node-related identity of the first access node is a Service Set ID (SSID), an Extended Service Set ID (ESSID), or a Basic Service Set ID (BSSID). 32. The method of claim 28, wherein the interface setup response message includes a list of access nodes configured to operate according to the second radio access technology and neighboring the selected second radio access node. 33. The method of claim 23, wherein the first access node is an access node of a cellular access network and the selected second access node is an access point of a local area network. 34. The method of claim 33, wherein the node-related identity retrieved in the radio signal is a Service Set ID (SSID), an Extended Service Set ID (ESSID), or a Basic Service Set ID (BSSID). 35. The method of claim 34, wherein the node-related identity of the first access node is a physical cell ID (PCI) or/and a global cell ID (GCID). 36. The method of claim 23, wherein the cellular access network is a GSM or a WCDMA or an LTE radio access network. 37. The method of claim 23, wherein the transport address is derived from a look-up table in a cellular radio access network, a core network entity or in an operation and maintenance function of a cellular access network. 38. The method of claim 23, wherein communications interfaces are established between the first access node and a subset or all of the second access nodes in a coverage area of the first access node. 39. A method, performed in a second access node, arranged to operate according to a second radio access technology, in a wireless network, of establishing a communications interface to a first access node arranged to operate according to a first radio access technology (RAT), the method comprising the steps of:
receiving an interface setup request message from the first access node; and sending an interface setup response message to the first access node. 40. An access node arranged to operate according to a first radio access technology in a wireless network, said access node being configured to establish a communications interface to one or more second access nodes arranged to operate according to a second radio access technology in the wireless network, the access node comprising:
a first radio transceiver arranged to receive radio signals of a first radio access technology; a processor arranged to discover one or more second access nodes based on receipt of respective radio signals representative of each second access node, to select a second access node of the discovered one or more second access nodes for establishing the communications interface with, and to derive a transport address for the selected second access node from a node-related identity retrieved in the radio signal; and a communications interface including a transceiver configured to transmit an interface setup request message to the selected second access node; and to receive an interface setup response message from the selected second access node. 41. The access node of claim 40, further comprising a second radio transceiver arranged to receive radio signals of a second radio access technology. 42. The access node of claim 41, wherein the access node is an eNodeB of a cellular radio access network. 43. The access node of claim 42, wherein the access node is an access point of a Wi-Fi local area network. 44. A non-transitory computer-readable medium comprising, stored thereupon, a computer program comprising computer-readable code that, when run in a first access node in a wireless network, the first access node being arranged to operate according to a first radio access technology (RAT), causes the access node to:
discover one or more second access nodes based on receipt of respective radio signals representative of each second access node, the one or more second access nodes being arranged to operate according to a second radio access technology; select a second access node of the discovered one or more second access nodes for establishing a communications interface with; derive a transport address for the selected second access node from a node-related identity retrieved in the radio signal; send an interface setup request message to the selected second access node; and receive an interface setup response message from the selected second access node. | The present disclosure relates to a method performed in a first access node in a wireless network of establishing a communications interface between the first access node arranged to operate according to a first radio access technology and one or more second access nodes arranged to operate according to a second radio access technology. The one or more second access nodes are discovered (S 31 ) based on receipt of respective radio signals representative of each second access node. A second access node of the discovered one or more second access nodes is selected (S 32 ) for establishing a communications interface with. A transport address is derived (S 33 ) for the selected second access node from a node related identity retrieved in the radio signal and an interface setup request message is sent (S 34 ) to the selected second access node. The communications interface is established upon receipt (S 35 ) of an interface setup response message from the selected second access node.1-22. (canceled) 23. A method, performed in a first access node in a wireless network, of establishing a communications interface between the first access node, arranged to operate according to a first radio access technology (RAT), and one or more second access nodes arranged to operate according to a second radio access technology, the method comprising:
discovering one or more second access nodes based on receipt of respective radio signals representative of each second access node; selecting a second access node of the discovered one or more second access nodes for establishing a communications interface with; deriving a transport address for the selected second access node from a node-related identity retrieved in the radio signal; sending an interface setup request message to the selected second access node; and receiving an interface setup response message from the selected second access node. 24. The method of claim 23, wherein the step of discovering one or more second access nodes comprises intercepting, by the first access node, radio signals originating from respective second access nodes. 25. The method of claim 23, wherein the step of discovering one or more second access nodes comprises receiving of one or more user equipment reports from a user equipment within a coverage area of the first access node, each user equipment report generated in response to interception by the user equipment of radio signals originating from a respective second access node. 26. The method of claim 23, wherein the step of discovering one or more second access nodes comprises determining a node-related identity of each discovered one or more second access node. 27. The method of claim 23, wherein the interface setup request message includes a node-related identity of the first access node. 28. The method of claim 23, wherein the first access node is an access point of a local area network and the selected second access node is an access node of a cellular radio access network. 29. The method of claim 28, wherein the interface setup request message includes a list of additional local area network access points within the coverage area of the selected second access node, the list including node-related identities and transport addresses of the additional local area network access points. 30. The method of claim 28, wherein the node-related identity retrieved in the radio signal is a physical cell ID (PCI) or/and a global cell ID (GCID). 31. The method of claim 30, wherein the node-related identity of the first access node is a Service Set ID (SSID), an Extended Service Set ID (ESSID), or a Basic Service Set ID (BSSID). 32. The method of claim 28, wherein the interface setup response message includes a list of access nodes configured to operate according to the second radio access technology and neighboring the selected second radio access node. 33. The method of claim 23, wherein the first access node is an access node of a cellular access network and the selected second access node is an access point of a local area network. 34. The method of claim 33, wherein the node-related identity retrieved in the radio signal is a Service Set ID (SSID), an Extended Service Set ID (ESSID), or a Basic Service Set ID (BSSID). 35. The method of claim 34, wherein the node-related identity of the first access node is a physical cell ID (PCI) or/and a global cell ID (GCID). 36. The method of claim 23, wherein the cellular access network is a GSM or a WCDMA or an LTE radio access network. 37. The method of claim 23, wherein the transport address is derived from a look-up table in a cellular radio access network, a core network entity or in an operation and maintenance function of a cellular access network. 38. The method of claim 23, wherein communications interfaces are established between the first access node and a subset or all of the second access nodes in a coverage area of the first access node. 39. A method, performed in a second access node, arranged to operate according to a second radio access technology, in a wireless network, of establishing a communications interface to a first access node arranged to operate according to a first radio access technology (RAT), the method comprising the steps of:
receiving an interface setup request message from the first access node; and sending an interface setup response message to the first access node. 40. An access node arranged to operate according to a first radio access technology in a wireless network, said access node being configured to establish a communications interface to one or more second access nodes arranged to operate according to a second radio access technology in the wireless network, the access node comprising:
a first radio transceiver arranged to receive radio signals of a first radio access technology; a processor arranged to discover one or more second access nodes based on receipt of respective radio signals representative of each second access node, to select a second access node of the discovered one or more second access nodes for establishing the communications interface with, and to derive a transport address for the selected second access node from a node-related identity retrieved in the radio signal; and a communications interface including a transceiver configured to transmit an interface setup request message to the selected second access node; and to receive an interface setup response message from the selected second access node. 41. The access node of claim 40, further comprising a second radio transceiver arranged to receive radio signals of a second radio access technology. 42. The access node of claim 41, wherein the access node is an eNodeB of a cellular radio access network. 43. The access node of claim 42, wherein the access node is an access point of a Wi-Fi local area network. 44. A non-transitory computer-readable medium comprising, stored thereupon, a computer program comprising computer-readable code that, when run in a first access node in a wireless network, the first access node being arranged to operate according to a first radio access technology (RAT), causes the access node to:
discover one or more second access nodes based on receipt of respective radio signals representative of each second access node, the one or more second access nodes being arranged to operate according to a second radio access technology; select a second access node of the discovered one or more second access nodes for establishing a communications interface with; derive a transport address for the selected second access node from a node-related identity retrieved in the radio signal; send an interface setup request message to the selected second access node; and receive an interface setup response message from the selected second access node. | 2,400 |
7,629 | 7,629 | 14,149,367 | 2,426 | Described herein are systems and methods for authenticating a user to access multimedia content, such as video content, over a user device. A method may comprise receiving a user request for a multimedia content service from a user device over a first application, receiving an identifier of the user device, identifying a service provider of a user, generating an activation code associating the identifier with the service provider, transmitting the activation code to the first application on the user device, receiving the activation code from the user over a second application, activating the multimedia content service for the user device based on the user activation input, and providing content from the multimedia content service to the user device over the first application. | 1. A method, comprising:
receiving a user request for a multimedia content service from a user device over a first application; receiving an identifier of the user device; identifying a service provider of a user; generating an activation code associating the identifier with the service provider; transmitting the activation code to the first application on the user device; receiving the activation code from the user over a second application; activating the multimedia content service for the user device based on the user activation input; and providing content from the multimedia content service to the user device over the first application. 2. The method of claim 1, wherein the second application is operating on a second user device connected to the multimedia content service. 3. The method of claim 1, further comprising:
authenticating the user as a subscriber to the service provider; and authorizing the user to receive the content from the multimedia content service. 4. The method of claim 3, further comprising:
receiving a further user request for the multimedia content service from the user device; and providing content from the multimedia content service to the user device without re-authenticating and re-authorizing the user. 5. The method of claim 1, wherein the activation code associating the identifier with the service provider is included within an automatic identification and capture (“ADIC”) code. 6. The method of claim 5, further comprising:
directing the second application to a network address encoded within the ADIC code, wherein the activation code within the ADIC code is received via the network address. 7. The method of claim 1, further comprising:
receiving a device type indicator describing at least one parameter of the user device; and formatting the content from the multimedia content service based on the at least one parameter of the user device. 8. The method of claim 1, wherein the content from the multimedia content service is streaming video content. 9. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform actions that include:
receiving a user request for a multimedia content service from a user device over a first application; receiving an identifier of the user device; identifying a service provider of a user; generating an activation code associating the identifier with the service provider; transmitting the activation code to the first application on the user device; receiving the activation code from the user over a second application; activating the multimedia content service for the user device based on the user activation input; and providing content from the multimedia content service to the user device over the first application. 10. The non-transitory computer readable storage medium of claim 9, wherein the second application is operating on a second user device connected to the multimedia content service. 11. The non-transitory computer readable storage medium of claim 10, wherein the actions further include:
authenticating the user as a subscriber to the service provider; and authorizing the user to receive the content from the multimedia content service. 12. The non-transitory computer readable storage medium of claim 9, wherein the actions further include:
receiving a further user request for, the multimedia content service from the user device; and providing content from the multimedia content service to the user device without re-authenticating and re-authorizing the user. 13. The non-transitory computer readable storage medium of claim 9, wherein the activation code associating the identifier with the service provider is included within an automatic identification and capture (“ADIC”) code. 14. The non-transitory computer readable storage medium of claim 13, wherein the actions further:
directing the second application to a network address encoded within the ADIC code; wherein the activation code within the ADIC code is received via the network address. 15. The non-transitory computer readable storage medium of claim 9, wherein the actions further include:
receiving a device type indicator describing at least one parameter of the user device; and formatting the content from the multimedia content service based on the at least one parameter of the user device. 16. A device, comprising:
a memory storing a plurality of rules; and a processor coupled to the memory and configured to perform actions that include:
receiving a user request for a multimedia content service from a user device over a first application;
receiving an identifier of the user device;
identifying a service provider of a user;
generating an activation code associating the identifier with the service provider;
transmitting the activation code to the first application on the user device;
receiving the activation code from the user over a second application;
activating the multimedia content service for the user device based on the user activation input; and
providing content from the multimedia content service to the user device over the first application. 17. The device of claim 16, wherein the second application is operating on a second user device connected to the multimedia content service. 18. The device of claim 16, wherein the processor is further configured to perform:
authenticating the user as a subscriber to the service provider; and authorizing the user to receive the content from the multimedia content service. 19. The device of claim 18, wherein the processor is further configured to perform:
receiving a further user request for the multimedia content service from the user device; and providing content from the multimedia content service to the user device without re-authenticating and re-authorizing the user. 20. The device of claim 16, wherein the activation code associating the identifier with the service provider is included within an automatic identification and capture (“ADIC”) code. | Described herein are systems and methods for authenticating a user to access multimedia content, such as video content, over a user device. A method may comprise receiving a user request for a multimedia content service from a user device over a first application, receiving an identifier of the user device, identifying a service provider of a user, generating an activation code associating the identifier with the service provider, transmitting the activation code to the first application on the user device, receiving the activation code from the user over a second application, activating the multimedia content service for the user device based on the user activation input, and providing content from the multimedia content service to the user device over the first application.1. A method, comprising:
receiving a user request for a multimedia content service from a user device over a first application; receiving an identifier of the user device; identifying a service provider of a user; generating an activation code associating the identifier with the service provider; transmitting the activation code to the first application on the user device; receiving the activation code from the user over a second application; activating the multimedia content service for the user device based on the user activation input; and providing content from the multimedia content service to the user device over the first application. 2. The method of claim 1, wherein the second application is operating on a second user device connected to the multimedia content service. 3. The method of claim 1, further comprising:
authenticating the user as a subscriber to the service provider; and authorizing the user to receive the content from the multimedia content service. 4. The method of claim 3, further comprising:
receiving a further user request for the multimedia content service from the user device; and providing content from the multimedia content service to the user device without re-authenticating and re-authorizing the user. 5. The method of claim 1, wherein the activation code associating the identifier with the service provider is included within an automatic identification and capture (“ADIC”) code. 6. The method of claim 5, further comprising:
directing the second application to a network address encoded within the ADIC code, wherein the activation code within the ADIC code is received via the network address. 7. The method of claim 1, further comprising:
receiving a device type indicator describing at least one parameter of the user device; and formatting the content from the multimedia content service based on the at least one parameter of the user device. 8. The method of claim 1, wherein the content from the multimedia content service is streaming video content. 9. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform actions that include:
receiving a user request for a multimedia content service from a user device over a first application; receiving an identifier of the user device; identifying a service provider of a user; generating an activation code associating the identifier with the service provider; transmitting the activation code to the first application on the user device; receiving the activation code from the user over a second application; activating the multimedia content service for the user device based on the user activation input; and providing content from the multimedia content service to the user device over the first application. 10. The non-transitory computer readable storage medium of claim 9, wherein the second application is operating on a second user device connected to the multimedia content service. 11. The non-transitory computer readable storage medium of claim 10, wherein the actions further include:
authenticating the user as a subscriber to the service provider; and authorizing the user to receive the content from the multimedia content service. 12. The non-transitory computer readable storage medium of claim 9, wherein the actions further include:
receiving a further user request for, the multimedia content service from the user device; and providing content from the multimedia content service to the user device without re-authenticating and re-authorizing the user. 13. The non-transitory computer readable storage medium of claim 9, wherein the activation code associating the identifier with the service provider is included within an automatic identification and capture (“ADIC”) code. 14. The non-transitory computer readable storage medium of claim 13, wherein the actions further:
directing the second application to a network address encoded within the ADIC code; wherein the activation code within the ADIC code is received via the network address. 15. The non-transitory computer readable storage medium of claim 9, wherein the actions further include:
receiving a device type indicator describing at least one parameter of the user device; and formatting the content from the multimedia content service based on the at least one parameter of the user device. 16. A device, comprising:
a memory storing a plurality of rules; and a processor coupled to the memory and configured to perform actions that include:
receiving a user request for a multimedia content service from a user device over a first application;
receiving an identifier of the user device;
identifying a service provider of a user;
generating an activation code associating the identifier with the service provider;
transmitting the activation code to the first application on the user device;
receiving the activation code from the user over a second application;
activating the multimedia content service for the user device based on the user activation input; and
providing content from the multimedia content service to the user device over the first application. 17. The device of claim 16, wherein the second application is operating on a second user device connected to the multimedia content service. 18. The device of claim 16, wherein the processor is further configured to perform:
authenticating the user as a subscriber to the service provider; and authorizing the user to receive the content from the multimedia content service. 19. The device of claim 18, wherein the processor is further configured to perform:
receiving a further user request for the multimedia content service from the user device; and providing content from the multimedia content service to the user device without re-authenticating and re-authorizing the user. 20. The device of claim 16, wherein the activation code associating the identifier with the service provider is included within an automatic identification and capture (“ADIC”) code. | 2,400 |
7,630 | 7,630 | 13,932,453 | 2,485 | A system and method for performing vehicle-velocity aware image enhancement. Embodiments generally include a video capture module configured to receive image data of the scene being monitored, an image extraction module configured to extract still images from incoming video data, a vehicle detection module that detects the approximate location of a target vehicle in the scene being monitored, a velocity determination module configured to determine the amplitude and direction of a vector that describes the velocity of the target vehicle in image pixel coordinates, and a velocity-aware enhancing module configured to enhance the image(s) of the target vehicle extracted from the video feed based on the vehicle's velocity. Embodiments may also include an infraction detection module configured to detect the occurrence of a violation of traffic law(s) by a target vehicle. | 1. An image enhancement system comprising:
an image capture module configured to obtain video data; an image extraction module operably connected to said image capture module and configured to extract at least one image from said video data; a vehicle detection module operably connected to said image extraction module and configured to detect a location of a target vehicle within said at least one image; and a vehicle-velocity aware enhancement module operably connected to said image extraction module and configured to enhance said at least one image based on a velocity of said target vehicle. 2. The image enhancement system of claim 1 further comprising a velocity determination module operably connected to said vehicle detection module and configured to determine the velocity of said target vehicle in image pixel coordinates. 3. The image enhancement system of claim 1 further comprising an infraction detection module operably connected to said image capture module and configured to detect a violation of a traffic law by said target vehicle. 4. The image enhancement system of claim 1 wherein said image capture module is a video camera. 5. The image enhancement system of claim 1 further comprising a trigger device operably connected to said image capture module and configured to indicate the occurrence of predefined events in a monitoring area. 6. The image enhancement system of claim 1 wherein said vehicle-velocity aware enhancement module enhances said at least one image utilizing velocity-aware de-blurring. 7. The image enhancement system of claim 1 wherein said vehicle-velocity aware enhancement module enhances said at least one image utilizing velocity-aware de-noising. 8. A non-transitory computer-usable medium for velocity-aware image enhancement, said computer-usable medium embodying computer program code, said computer program code comprising computer executable instructions configured for:
obtaining video data utilizing an image capture module; extracting at least one image from said video data utilizing an image extraction module; detecting a location of a target vehicle within said at least one image utilizing a vehicle detection module; and enhancing said at least one image based on a velocity of said target vehicle utilizing a vehicle-velocity aware enhancement module. 9. The non-transitory computer-usable medium of claim 8 further configured for determining the velocity of said target vehicle in image pixel coordinates utilizing a velocity determination module. 10. The non-transitory computer-usable medium of claim 8 further configured for detecting a violation of a traffic law by said target vehicle utilizing an infraction detection module. 11. The non-transitory computer-usable medium of claim 8 further configured for indicating the occurrence of predefined events in a monitoring area utilizing a trigger device. 12. The non-transitory computer-usable medium of claim 8 further configured for enhancing said at least one image utilizing velocity-aware de-blurring. 13. The non-transitory computer-usable medium of claim 8 further configured for enhancing said at least one image utilizing velocity-aware multi-frame super-resolution. 14. A computer-implemented method of velocity-aware image enhancement comprising:
obtaining video data utilizing an image capture module; extracting at least one image from said video data utilizing an image extraction module; detecting a location of a target vehicle within said at least one image utilizing a vehicle detection module; and enhancing said at least one image based on a velocity of said target vehicle utilizing a vehicle-velocity aware enhancement module. 15. The computer-implemented method of claim 14 further comprising determining the velocity of said target vehicle in image pixel coordinates utilizing a velocity determination module. 16. The computer-implemented method of claim 14 further comprising detecting a violation of a traffic law by said target vehicle utilizing an infraction detection module. 17. The computer-implemented method of claim 14 further comprising indicating the occurrence of predefined events in a monitoring area utilizing a trigger device. 18. The computer-implemented method of claim 14 further comprising enhancing said at least one image utilizing velocity-aware de-blurring. 19. The computer-implemented method of claim 14 further comprising enhancing said at least one image utilizing velocity-aware multi-frame super-resolution. 20. The computer-implemented method of claim 14 further comprising enhancing said at least one image utilizing velocity-aware de-noising. | A system and method for performing vehicle-velocity aware image enhancement. Embodiments generally include a video capture module configured to receive image data of the scene being monitored, an image extraction module configured to extract still images from incoming video data, a vehicle detection module that detects the approximate location of a target vehicle in the scene being monitored, a velocity determination module configured to determine the amplitude and direction of a vector that describes the velocity of the target vehicle in image pixel coordinates, and a velocity-aware enhancing module configured to enhance the image(s) of the target vehicle extracted from the video feed based on the vehicle's velocity. Embodiments may also include an infraction detection module configured to detect the occurrence of a violation of traffic law(s) by a target vehicle.1. An image enhancement system comprising:
an image capture module configured to obtain video data; an image extraction module operably connected to said image capture module and configured to extract at least one image from said video data; a vehicle detection module operably connected to said image extraction module and configured to detect a location of a target vehicle within said at least one image; and a vehicle-velocity aware enhancement module operably connected to said image extraction module and configured to enhance said at least one image based on a velocity of said target vehicle. 2. The image enhancement system of claim 1 further comprising a velocity determination module operably connected to said vehicle detection module and configured to determine the velocity of said target vehicle in image pixel coordinates. 3. The image enhancement system of claim 1 further comprising an infraction detection module operably connected to said image capture module and configured to detect a violation of a traffic law by said target vehicle. 4. The image enhancement system of claim 1 wherein said image capture module is a video camera. 5. The image enhancement system of claim 1 further comprising a trigger device operably connected to said image capture module and configured to indicate the occurrence of predefined events in a monitoring area. 6. The image enhancement system of claim 1 wherein said vehicle-velocity aware enhancement module enhances said at least one image utilizing velocity-aware de-blurring. 7. The image enhancement system of claim 1 wherein said vehicle-velocity aware enhancement module enhances said at least one image utilizing velocity-aware de-noising. 8. A non-transitory computer-usable medium for velocity-aware image enhancement, said computer-usable medium embodying computer program code, said computer program code comprising computer executable instructions configured for:
obtaining video data utilizing an image capture module; extracting at least one image from said video data utilizing an image extraction module; detecting a location of a target vehicle within said at least one image utilizing a vehicle detection module; and enhancing said at least one image based on a velocity of said target vehicle utilizing a vehicle-velocity aware enhancement module. 9. The non-transitory computer-usable medium of claim 8 further configured for determining the velocity of said target vehicle in image pixel coordinates utilizing a velocity determination module. 10. The non-transitory computer-usable medium of claim 8 further configured for detecting a violation of a traffic law by said target vehicle utilizing an infraction detection module. 11. The non-transitory computer-usable medium of claim 8 further configured for indicating the occurrence of predefined events in a monitoring area utilizing a trigger device. 12. The non-transitory computer-usable medium of claim 8 further configured for enhancing said at least one image utilizing velocity-aware de-blurring. 13. The non-transitory computer-usable medium of claim 8 further configured for enhancing said at least one image utilizing velocity-aware multi-frame super-resolution. 14. A computer-implemented method of velocity-aware image enhancement comprising:
obtaining video data utilizing an image capture module; extracting at least one image from said video data utilizing an image extraction module; detecting a location of a target vehicle within said at least one image utilizing a vehicle detection module; and enhancing said at least one image based on a velocity of said target vehicle utilizing a vehicle-velocity aware enhancement module. 15. The computer-implemented method of claim 14 further comprising determining the velocity of said target vehicle in image pixel coordinates utilizing a velocity determination module. 16. The computer-implemented method of claim 14 further comprising detecting a violation of a traffic law by said target vehicle utilizing an infraction detection module. 17. The computer-implemented method of claim 14 further comprising indicating the occurrence of predefined events in a monitoring area utilizing a trigger device. 18. The computer-implemented method of claim 14 further comprising enhancing said at least one image utilizing velocity-aware de-blurring. 19. The computer-implemented method of claim 14 further comprising enhancing said at least one image utilizing velocity-aware multi-frame super-resolution. 20. The computer-implemented method of claim 14 further comprising enhancing said at least one image utilizing velocity-aware de-noising. | 2,400 |
7,631 | 7,631 | 14,515,127 | 2,483 | A system and method for monitoring parking and identifying vehicles by monitoring a parking region based on video data of the parking region received from a video camera, detecting a parking event associated with a vehicle in the parking region, adjusting a view of the video camera based on the parking event, physically tracking the vehicle using the video camera, capturing an image of a license plate of the vehicle, and resuming monitoring the parking region after capturing the image of the license plate. | 1. A method comprising:
monitoring a parking region based on video data of a view of the parking region received from a video camera; detecting, using a processor, a parking event associated with a vehicle in the parking region; physically tracking the vehicle by adjusting a view of the video camera; capturing an image of a license plate of the vehicle; and subsequent to capturing the image of the license plate, resuming monitoring the parking region by physically adjusting the view of the video camera. 2. The method of claim 1, wherein the video camera is a pan-tilt-zoom camera. 3. The method of claim 1, wherein the view of the video camera remains stationary until a parking event is detected. 4. The method of claim 1, further comprising soft tracking the vehicle before detecting the parking event. 5. The method of claim 1, further comprising:
determining license plate text of the license plate of the vehicle based on the image of the license plate; determining a confidence score of the license plate text; determining that the confidence score does not meet a predetermined threshold; capturing a second image of the license plate of the vehicle, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera subsequent to capturing the second image. 6. The method of claim 5, further comprising:
determining license plate text of the license plate of the vehicle based on the second image of the license plate; determining a confidence score of the license plate text; determining that the confidence score meets a predetermined threshold, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera in response to determining that the confidence score meets the predetermined threshold. 7. The method of claim 1, further comprising determining a location of a parking zone within the parking region, wherein the parking event is detected using the location of the parking zone. 8. The method of claim 7, wherein:
the parking zone is associated with at least one of an optimal viewing angle and an optimal zoom ratio; and adjusting the view of the video camera comprises adjusting the view to achieve the at least one of an optimal viewing angle and an optimal zoom ratio. 9. The method of claim 1, wherein detecting the parking event associated with the vehicle in the parking region comprises at least one of:
detecting the vehicle entering the parking zone and detecting the vehicle change from moving to stationary; or detecting the vehicle leaving the parking zone and detecting the vehicle change from stationary to moving. 10. The method of claim 9, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises analyzing motion within the parking zone. 11. The method of claim 9, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises detecting the vehicle entering or leaving a parking zone using tracking information of the vehicle. 12. A system comprising:
a video camera; a processing system comprising one or more processors capable of receiving data from the video camera; and a memory system comprising one or more computer-readable media, wherein the one or more computer-readable media contain instructions that, when executed by the processing system, cause the processing system to perform operations comprising:
monitoring a parking region based on video data of a view of the parking region received from the video camera;
detecting a parking event associated with a vehicle in the parking region;
physically tracking the vehicle by adjusting a view of the video camera;
capturing an image of a license plate of the vehicle; and
subsequent to capturing the image of the license plate, resuming monitoring the parking region by physically adjusting the view of the video camera. 13. The system of claim 12, wherein the video camera is a pan-tilt-zoom camera. 14. The system of claim 12, wherein the view of the video camera remains stationary until a parking event is detected. 15. The system of claim 12, the operations further comprising soft tracking the vehicle before detecting the parking event. 16. The system of claim 12, the operations further comprising:
determining license plate text of the license plate of the vehicle based on the image of the license plate; determining a confidence score of the license plate text; determining that the confidence score does not meet a predetermined threshold; capturing a second image of the license plate of the vehicle, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera subsequent to capturing the second image. 17. The system of claim 16, the operations further comprising:
determining license plate text of the license plate of the vehicle based on the second image of the license plate; determining a confidence score of the license plate text; determining that the confidence score meets a predetermined threshold, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera in response to determining that the confidence score meets the predetermined threshold. 18. The system of claim 12, the operations further comprising determining a location of a parking zone within the parking region, wherein the parking event is detected using the location of the parking zone. 19. The system of claim 18, wherein:
the parking zone is associated with at least one of an optimal viewing angle and an optimal zoom ratio; and adjusting the view of the video camera comprises adjusting the view to achieve the at least one of an optimal viewing angle and an optimal zoom ratio. 20. The system of claim 12, wherein detecting the parking event associated with the vehicle in the parking region comprises at least one of:
detecting the vehicle entering the parking zone and detecting the vehicle change from moving to stationary; or detecting the vehicle leaving the parking zone and detecting the vehicle change from stationary to moving. 21. The system of claim 20, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises analyzing motion within the parking zone. 22. The system of claim 20, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises detecting the vehicle entering or leaving a parking zone using tracking information of the vehicle. | A system and method for monitoring parking and identifying vehicles by monitoring a parking region based on video data of the parking region received from a video camera, detecting a parking event associated with a vehicle in the parking region, adjusting a view of the video camera based on the parking event, physically tracking the vehicle using the video camera, capturing an image of a license plate of the vehicle, and resuming monitoring the parking region after capturing the image of the license plate.1. A method comprising:
monitoring a parking region based on video data of a view of the parking region received from a video camera; detecting, using a processor, a parking event associated with a vehicle in the parking region; physically tracking the vehicle by adjusting a view of the video camera; capturing an image of a license plate of the vehicle; and subsequent to capturing the image of the license plate, resuming monitoring the parking region by physically adjusting the view of the video camera. 2. The method of claim 1, wherein the video camera is a pan-tilt-zoom camera. 3. The method of claim 1, wherein the view of the video camera remains stationary until a parking event is detected. 4. The method of claim 1, further comprising soft tracking the vehicle before detecting the parking event. 5. The method of claim 1, further comprising:
determining license plate text of the license plate of the vehicle based on the image of the license plate; determining a confidence score of the license plate text; determining that the confidence score does not meet a predetermined threshold; capturing a second image of the license plate of the vehicle, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera subsequent to capturing the second image. 6. The method of claim 5, further comprising:
determining license plate text of the license plate of the vehicle based on the second image of the license plate; determining a confidence score of the license plate text; determining that the confidence score meets a predetermined threshold, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera in response to determining that the confidence score meets the predetermined threshold. 7. The method of claim 1, further comprising determining a location of a parking zone within the parking region, wherein the parking event is detected using the location of the parking zone. 8. The method of claim 7, wherein:
the parking zone is associated with at least one of an optimal viewing angle and an optimal zoom ratio; and adjusting the view of the video camera comprises adjusting the view to achieve the at least one of an optimal viewing angle and an optimal zoom ratio. 9. The method of claim 1, wherein detecting the parking event associated with the vehicle in the parking region comprises at least one of:
detecting the vehicle entering the parking zone and detecting the vehicle change from moving to stationary; or detecting the vehicle leaving the parking zone and detecting the vehicle change from stationary to moving. 10. The method of claim 9, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises analyzing motion within the parking zone. 11. The method of claim 9, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises detecting the vehicle entering or leaving a parking zone using tracking information of the vehicle. 12. A system comprising:
a video camera; a processing system comprising one or more processors capable of receiving data from the video camera; and a memory system comprising one or more computer-readable media, wherein the one or more computer-readable media contain instructions that, when executed by the processing system, cause the processing system to perform operations comprising:
monitoring a parking region based on video data of a view of the parking region received from the video camera;
detecting a parking event associated with a vehicle in the parking region;
physically tracking the vehicle by adjusting a view of the video camera;
capturing an image of a license plate of the vehicle; and
subsequent to capturing the image of the license plate, resuming monitoring the parking region by physically adjusting the view of the video camera. 13. The system of claim 12, wherein the video camera is a pan-tilt-zoom camera. 14. The system of claim 12, wherein the view of the video camera remains stationary until a parking event is detected. 15. The system of claim 12, the operations further comprising soft tracking the vehicle before detecting the parking event. 16. The system of claim 12, the operations further comprising:
determining license plate text of the license plate of the vehicle based on the image of the license plate; determining a confidence score of the license plate text; determining that the confidence score does not meet a predetermined threshold; capturing a second image of the license plate of the vehicle, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera subsequent to capturing the second image. 17. The system of claim 16, the operations further comprising:
determining license plate text of the license plate of the vehicle based on the second image of the license plate; determining a confidence score of the license plate text; determining that the confidence score meets a predetermined threshold, wherein monitoring the parking region is resumed by physically adjusting the view of the video camera in response to determining that the confidence score meets the predetermined threshold. 18. The system of claim 12, the operations further comprising determining a location of a parking zone within the parking region, wherein the parking event is detected using the location of the parking zone. 19. The system of claim 18, wherein:
the parking zone is associated with at least one of an optimal viewing angle and an optimal zoom ratio; and adjusting the view of the video camera comprises adjusting the view to achieve the at least one of an optimal viewing angle and an optimal zoom ratio. 20. The system of claim 12, wherein detecting the parking event associated with the vehicle in the parking region comprises at least one of:
detecting the vehicle entering the parking zone and detecting the vehicle change from moving to stationary; or detecting the vehicle leaving the parking zone and detecting the vehicle change from stationary to moving. 21. The system of claim 20, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises analyzing motion within the parking zone. 22. The system of claim 20, wherein detecting the vehicle change from moving to stationary or detecting the vehicle change from stationary to moving comprises detecting the vehicle entering or leaving a parking zone using tracking information of the vehicle. | 2,400 |
7,632 | 7,632 | 15,231,816 | 2,463 | A method for managing local ports in a packet-oriented data network is proposed, wherein packets are assigned to a selected local port, and assignment of a local port is controlled based on observation of transmission on the network. The invention also relates to a local port managing device, a packet-oriented data network, a digital storage media, and a computer program product. | 1-15. (canceled) 16. A method for managing local ports in a packet-oriented data network, comprising:
disadvantaging a first local port of the local ports for selection and assignment after at least one of: (i) the first local port has been used and (ii) in response to detection of the first local port being a target of data packet flooding, said disadvantaging of the first local port for selection and assignment comprising giving the first local port at least one of a first mark and a second mark, the first mark being given to the first local port having ended an unsuspected session and the second mark being given to the first local port having been detected as being the target of data packet flooding; and defining a queue including the local ports for selection and assignment, said local ports being selected and assigned from a head of said queue to a tail of said queue, wherein said disadvantaged local port is put at the tail of said queue. 17. The method of claim 16, wherein the head of the queue is a top of the queue and the tail of the queue is a bottom of the queue. 18. The method of claim 16, comprising:
continuously disregarding the disadvantaged first local port for selection and assignment for a predetermined period of time. 19. The method of claim 16, comprising:
disregarding the disadvantaged first local port for selection and assignment as long as data packet flooding is detected at said disadvantaged first local port. 20. The method of claim 16, comprising:
assigning the local ports to data packets based on observation of transmission on the network. 21. The method of claim 16, comprising:
allowing said disadvantaged first local port to shift through the queue to the head of the queue after the disadvantaged first local port is put at the tail of the queue. 22. The method of claim 16, comprising:
placing a second local port of the local ports at the tail of the queue in response to detecting data packet flooding at the second local port. 23. The method of claim 16, comprising:
prioritizing monitoring of the first local port in response to data packet flooding being detected at the first local port. 24. The method of claim 23, comprising:
removing prioritization of monitoring from the first local port after a pre-selected amount of time has passed from the prioritization of the first local port. 25. The method of claim 23, comprising:
removing prioritization of monitoring from the first local port after a pre-selected amount of time has passed from a detection of data packet flooding at the first local port. 26. A local port managing device configured to observe data transmissions on a packet oriented data network and assign data packets received by the local port managing device to a local port based on the observed data packet transmissions by a method comprising:
disadvantaging a first local port of the local ports for selection and assignment after at least one of: (i) the first local port has been used and (ii) in response to detection of the first local port being a target of data packet flooding, said disadvantaging of the first local port for selection and assignment comprising giving the first local port at least one of a first mark and a second mark, the first mark being given to the first local port having ended an unsuspected session and the second mark being given to the first local port having been detected as being the target of data packet flooding; and defining a queue including the local ports for selection and assignment, said local ports being selected and assigned from a head of said queue to a tail of said queue, wherein said disadvantaged local port is put at the tail of said queue. 27. The local port managing device of claim 26, wherein the method also comprises:
continuously disregarding the disadvantaged first local port for selection and assignment for a predetermined period of time. 28. The local port managing device of claim 26, wherein the method also comprises:
disregarding the disadvantaged first local port for selection and assignment as long as data packet flooding is detected at said disadvantaged first local port. 29. The local port managing device of claim 26, wherein the method also comprises:
assigning the local ports to data packets based on observation of transmission on the network. 30. The local port managing device of claim 26, wherein the method also comprises:
allowing said disadvantaged first local port to shift through the queue to the head of the queue after the disadvantaged first local port is put at the tail of the queue. 31. The local port managing device of claim 26, wherein the method also comprises:
placing a second local port of the local ports at the tail of the queue in response to detecting data packet flooding at the second local port. 32. The local port managing device of claim 26, wherein the method also comprises:
prioritizing monitoring of the first local port in response to data packet flooding being detected at the first local port. 33. The local port managing device of claim 32, wherein the method also comprises:
removing prioritization of monitoring from the first local port after a pre-selected amount of time has passed from the prioritization of the first local port or after a pre-selected amount of time has passed from a detection of data packet flooding at the first local port. 34. A packet-oriented data network, comprising the local port managing device of claim 26 and a plurality of terminal devices communicatively connected to the local port managing device. 35. A non-transitory digital storage medium having data stored thereon that defines a method that is performed by a local port managing device that executes the data, the method comprising:
disadvantaging a first local port of a plurality of local ports of a network for selection and assignment based on observation of the network after at least one of: (i) the first local port has been used and (ii) in response to detection of the first local port being a target of data packet flooding, said disadvantaging of the first local port for selection and assignment comprising giving the first local port at least one of a first mark and a second mark, the first mark being given to the first local port having ended an unsuspected session and the second mark being given to the first local port having been detected as being the target of data packet flooding; and defining a queue including the local ports for selection and assignment, said local ports being selected and assigned from a head of said queue to a tail of said queue, wherein said disadvantaged local port is put at the tail of said queue. | A method for managing local ports in a packet-oriented data network is proposed, wherein packets are assigned to a selected local port, and assignment of a local port is controlled based on observation of transmission on the network. The invention also relates to a local port managing device, a packet-oriented data network, a digital storage media, and a computer program product.1-15. (canceled) 16. A method for managing local ports in a packet-oriented data network, comprising:
disadvantaging a first local port of the local ports for selection and assignment after at least one of: (i) the first local port has been used and (ii) in response to detection of the first local port being a target of data packet flooding, said disadvantaging of the first local port for selection and assignment comprising giving the first local port at least one of a first mark and a second mark, the first mark being given to the first local port having ended an unsuspected session and the second mark being given to the first local port having been detected as being the target of data packet flooding; and defining a queue including the local ports for selection and assignment, said local ports being selected and assigned from a head of said queue to a tail of said queue, wherein said disadvantaged local port is put at the tail of said queue. 17. The method of claim 16, wherein the head of the queue is a top of the queue and the tail of the queue is a bottom of the queue. 18. The method of claim 16, comprising:
continuously disregarding the disadvantaged first local port for selection and assignment for a predetermined period of time. 19. The method of claim 16, comprising:
disregarding the disadvantaged first local port for selection and assignment as long as data packet flooding is detected at said disadvantaged first local port. 20. The method of claim 16, comprising:
assigning the local ports to data packets based on observation of transmission on the network. 21. The method of claim 16, comprising:
allowing said disadvantaged first local port to shift through the queue to the head of the queue after the disadvantaged first local port is put at the tail of the queue. 22. The method of claim 16, comprising:
placing a second local port of the local ports at the tail of the queue in response to detecting data packet flooding at the second local port. 23. The method of claim 16, comprising:
prioritizing monitoring of the first local port in response to data packet flooding being detected at the first local port. 24. The method of claim 23, comprising:
removing prioritization of monitoring from the first local port after a pre-selected amount of time has passed from the prioritization of the first local port. 25. The method of claim 23, comprising:
removing prioritization of monitoring from the first local port after a pre-selected amount of time has passed from a detection of data packet flooding at the first local port. 26. A local port managing device configured to observe data transmissions on a packet oriented data network and assign data packets received by the local port managing device to a local port based on the observed data packet transmissions by a method comprising:
disadvantaging a first local port of the local ports for selection and assignment after at least one of: (i) the first local port has been used and (ii) in response to detection of the first local port being a target of data packet flooding, said disadvantaging of the first local port for selection and assignment comprising giving the first local port at least one of a first mark and a second mark, the first mark being given to the first local port having ended an unsuspected session and the second mark being given to the first local port having been detected as being the target of data packet flooding; and defining a queue including the local ports for selection and assignment, said local ports being selected and assigned from a head of said queue to a tail of said queue, wherein said disadvantaged local port is put at the tail of said queue. 27. The local port managing device of claim 26, wherein the method also comprises:
continuously disregarding the disadvantaged first local port for selection and assignment for a predetermined period of time. 28. The local port managing device of claim 26, wherein the method also comprises:
disregarding the disadvantaged first local port for selection and assignment as long as data packet flooding is detected at said disadvantaged first local port. 29. The local port managing device of claim 26, wherein the method also comprises:
assigning the local ports to data packets based on observation of transmission on the network. 30. The local port managing device of claim 26, wherein the method also comprises:
allowing said disadvantaged first local port to shift through the queue to the head of the queue after the disadvantaged first local port is put at the tail of the queue. 31. The local port managing device of claim 26, wherein the method also comprises:
placing a second local port of the local ports at the tail of the queue in response to detecting data packet flooding at the second local port. 32. The local port managing device of claim 26, wherein the method also comprises:
prioritizing monitoring of the first local port in response to data packet flooding being detected at the first local port. 33. The local port managing device of claim 32, wherein the method also comprises:
removing prioritization of monitoring from the first local port after a pre-selected amount of time has passed from the prioritization of the first local port or after a pre-selected amount of time has passed from a detection of data packet flooding at the first local port. 34. A packet-oriented data network, comprising the local port managing device of claim 26 and a plurality of terminal devices communicatively connected to the local port managing device. 35. A non-transitory digital storage medium having data stored thereon that defines a method that is performed by a local port managing device that executes the data, the method comprising:
disadvantaging a first local port of a plurality of local ports of a network for selection and assignment based on observation of the network after at least one of: (i) the first local port has been used and (ii) in response to detection of the first local port being a target of data packet flooding, said disadvantaging of the first local port for selection and assignment comprising giving the first local port at least one of a first mark and a second mark, the first mark being given to the first local port having ended an unsuspected session and the second mark being given to the first local port having been detected as being the target of data packet flooding; and defining a queue including the local ports for selection and assignment, said local ports being selected and assigned from a head of said queue to a tail of said queue, wherein said disadvantaged local port is put at the tail of said queue. | 2,400 |
7,633 | 7,633 | 12,530,047 | 2,465 | A method and apparatus for enabling a network to provide information associated with neighboring network(s) of different access technologies to the wireless device, prior to the wireless device determining the need for a handover. When a determination is made by the network that a handover to a new access network is required, the network may send a message to the wireless device that commands the wireless device to leave a currently used access network. Alternatively, the network may send a message to the wireless device that guides or obligates the wireless device to select one of the access networks in the list, provided by the network, in case the wireless device chooses to make a handover. Upon receipt of a command message, the wireless device leaves a currently used access network either immediately or a reasonable time after having set up a connection to a new access network for ensuring smooth handover. | 1-71. (canceled) 72. A method, comprising:
receiving, by a mobile node, at least one message and an access network list from a network, the message being used to indicate to the mobile node that a handover to a new access network is required or to instruct the mobile node to select the new access network; selecting, by the mobile node, the new access network based at least in part on information associated with the network access list; and performing, by the mobile node, a handover from a currently used access network to the selected new access network. 73. The method of claim 72, wherein the access network list comprises a prioritized list of access networks, wherein the mobile node performs a handover to a highest priority access network that fulfils predefined criteria. 74. The method of claim 72, wherein the access network list is received after receipt of the message, wherein the message includes a delay condition for informing the mobile node to wait for a second message with the access network list. 75. The method of claim 72, wherein the message is a layer two message for handover signalling or the message is carried in layer three transportation. 76. The method of claim 72, wherein the message includes at least one of a network type, an identifier for the network, and a link action list. 77. An apparatus, comprising:
a receiver configured to receive at least one message and an access network list from a network, the message being used to indicate to the apparatus that a handover to a new access network is required or to instruct the apparatus to select the new access network; a selector configured to select the new access network based at least in part on information associated with the network access list; and a performer configured to perform a handover from a currently used access network to the selected new access network. 78. The apparatus of claim 77, wherein the access network list includes information associated with services that the new access network is capable of supporting. 79. The apparatus of claim 77, wherein the message includes at least one of a network type, an identifier for the network and a link action list. 80. The apparatus of claim 77, wherein there are multiple instances of the access network list, each instance being for a distinct access network list type. 81. The apparatus of claim 77, wherein the access network list comprises a prioritized list of access networks and wherein the apparatus performs a handover to a highest priority access network that fulfils predefined criteria. 82. The apparatus of claim 77, wherein the performer is configured to perform the handover after connection to the new access network is established. 83. The apparatus of claim 77, wherein the receiver is configured to receive the access network list after receipt of the message, wherein the message includes a delay condition for informing the apparatus to wait for the a message with the access network list. 84. An apparatus, comprising:
a transmitter configured to transmit, at least one message and an access network list to a mobile node, the message being used to indicate to the mobile node that a handover to a new access network is required or to instruct the mobile node to select the new access network based at least in part on information associated with the received access network list and to enable the mobile node to perform a handover from a currently used access network to the selected new access network. 85. The apparatus of claim 84, wherein the transmitter is configured to transmit the message prior to or after detection by the mobile node of a need to make a handover to the new access network. 86. The apparatus of claim 84, wherein the access network list comprises an access network list type and other information associated with the access network list. 87. The apparatus of claim 84, wherein the transmitter is configured to transmit the access network list after receipt of the message, wherein the message includes a delay condition for informing the mobile node to wait for the a second message with the access network list. 88. The apparatus of claim 84, wherein the message is a layer two message for handover signalling or the message is transmitted in layer three transportation. 89. The apparatus of claim 84, wherein the access network list includes information associated with services that the new access network is capable of supporting. 90. The apparatus of claim 84, wherein the message includes at least one of a network type, an identifier for the network and a link action list. 91. A method, comprising:
transmitting at least one message and an access network list to a mobile node, the message being used to indicate to the mobile node that a handover to a new access network is required or to instruct the mobile node to select the new access network based at least in part on information associated with the received access network list, and to enable the mobile node to perform a handover from a currently used access network to the selected new access network. 92. The method of claim 91, wherein the transmitting comprises transmitting the access network list after receipt of the message, wherein the message includes a delay condition for informing the mobile node to wait for the a second message with the access network list. 93. The method of claim 91, wherein the message includes at least one of a network type, an identifier for the network and a link action list. 94. The method of claim 91, wherein there are multiple instances of the access network list, each instance being for a distinct access network list type. | A method and apparatus for enabling a network to provide information associated with neighboring network(s) of different access technologies to the wireless device, prior to the wireless device determining the need for a handover. When a determination is made by the network that a handover to a new access network is required, the network may send a message to the wireless device that commands the wireless device to leave a currently used access network. Alternatively, the network may send a message to the wireless device that guides or obligates the wireless device to select one of the access networks in the list, provided by the network, in case the wireless device chooses to make a handover. Upon receipt of a command message, the wireless device leaves a currently used access network either immediately or a reasonable time after having set up a connection to a new access network for ensuring smooth handover.1-71. (canceled) 72. A method, comprising:
receiving, by a mobile node, at least one message and an access network list from a network, the message being used to indicate to the mobile node that a handover to a new access network is required or to instruct the mobile node to select the new access network; selecting, by the mobile node, the new access network based at least in part on information associated with the network access list; and performing, by the mobile node, a handover from a currently used access network to the selected new access network. 73. The method of claim 72, wherein the access network list comprises a prioritized list of access networks, wherein the mobile node performs a handover to a highest priority access network that fulfils predefined criteria. 74. The method of claim 72, wherein the access network list is received after receipt of the message, wherein the message includes a delay condition for informing the mobile node to wait for a second message with the access network list. 75. The method of claim 72, wherein the message is a layer two message for handover signalling or the message is carried in layer three transportation. 76. The method of claim 72, wherein the message includes at least one of a network type, an identifier for the network, and a link action list. 77. An apparatus, comprising:
a receiver configured to receive at least one message and an access network list from a network, the message being used to indicate to the apparatus that a handover to a new access network is required or to instruct the apparatus to select the new access network; a selector configured to select the new access network based at least in part on information associated with the network access list; and a performer configured to perform a handover from a currently used access network to the selected new access network. 78. The apparatus of claim 77, wherein the access network list includes information associated with services that the new access network is capable of supporting. 79. The apparatus of claim 77, wherein the message includes at least one of a network type, an identifier for the network and a link action list. 80. The apparatus of claim 77, wherein there are multiple instances of the access network list, each instance being for a distinct access network list type. 81. The apparatus of claim 77, wherein the access network list comprises a prioritized list of access networks and wherein the apparatus performs a handover to a highest priority access network that fulfils predefined criteria. 82. The apparatus of claim 77, wherein the performer is configured to perform the handover after connection to the new access network is established. 83. The apparatus of claim 77, wherein the receiver is configured to receive the access network list after receipt of the message, wherein the message includes a delay condition for informing the apparatus to wait for the a message with the access network list. 84. An apparatus, comprising:
a transmitter configured to transmit, at least one message and an access network list to a mobile node, the message being used to indicate to the mobile node that a handover to a new access network is required or to instruct the mobile node to select the new access network based at least in part on information associated with the received access network list and to enable the mobile node to perform a handover from a currently used access network to the selected new access network. 85. The apparatus of claim 84, wherein the transmitter is configured to transmit the message prior to or after detection by the mobile node of a need to make a handover to the new access network. 86. The apparatus of claim 84, wherein the access network list comprises an access network list type and other information associated with the access network list. 87. The apparatus of claim 84, wherein the transmitter is configured to transmit the access network list after receipt of the message, wherein the message includes a delay condition for informing the mobile node to wait for the a second message with the access network list. 88. The apparatus of claim 84, wherein the message is a layer two message for handover signalling or the message is transmitted in layer three transportation. 89. The apparatus of claim 84, wherein the access network list includes information associated with services that the new access network is capable of supporting. 90. The apparatus of claim 84, wherein the message includes at least one of a network type, an identifier for the network and a link action list. 91. A method, comprising:
transmitting at least one message and an access network list to a mobile node, the message being used to indicate to the mobile node that a handover to a new access network is required or to instruct the mobile node to select the new access network based at least in part on information associated with the received access network list, and to enable the mobile node to perform a handover from a currently used access network to the selected new access network. 92. The method of claim 91, wherein the transmitting comprises transmitting the access network list after receipt of the message, wherein the message includes a delay condition for informing the mobile node to wait for the a second message with the access network list. 93. The method of claim 91, wherein the message includes at least one of a network type, an identifier for the network and a link action list. 94. The method of claim 91, wherein there are multiple instances of the access network list, each instance being for a distinct access network list type. | 2,400 |
7,634 | 7,634 | 13,921,004 | 2,466 | Nodes within a network are configured to communicate with one another on one or more television white space (TVWS) frequencies that may be subject to interference caused by nearby TV towers. In order to mitigate that interference, the nodes may be configured to communicate according to specific operating parameters. The operating parameters may be generated based on expected interference levels caused by the nearby TV towers or QOS metrics associated with available channels. The nodes may also update a private database to reflect the expected interference levels or measured QOS metrics for different channels. | 1. A computer-implemented method for configuring a node to communicate on a television white space (TVWS) spectrum of frequencies, the method comprising:
receiving a request for at least one operating parameter from a first node that resides at a first location in a network; retrieving one or more entries associated with the first location from a first database, wherein each of the one or more entries reflects a quality of service metric for a TVWS channel at the first location; determining the at least one operating parameter for the first node based on the one or more entries, wherein the at least one operating parameter indicates a first TVWS channel; and transmitting the at least one operating parameter to the first node, wherein the first node is configured to perform future communication operations over the first TVWS channel according to the at least one operating parameter. 2. The computer-implemented method of claim 1, further comprising:
receiving from the first node a quality of service metric associated with the first TVWS channel and the first location; and updating the first database to include an entry that includes the quality of service metric, the first TVWS channel, and the first location. 3. The computer-implemented method of claim 1, further comprising:
receiving the at least one operating parameter; configuring a network interface associated with the first node to communicate over the first TVWS channel according to the at least one operating parameter; generating a quality of service metric associated with communication operations performed over the first TVWS channel; and transmitting the quality of service metric to a server. 4. The computer-implemented method of claim 1, wherein the at least one operating parameter determined for the first node reflects a sensitivity value with which signals are received or a signal-to-noise ratio with which signals are transmitted. 5. The computer-implemented method of claim 1, wherein the quality of service metric associated with the first TVWS channel reflects a packet loss rate associated with the first TVWS channel previously measured by a node configured to communicate over the first TVWS channel at the first location. 6. The computer-implemented method of claim 1, wherein the quality of service metric associated with the first TVWS channel reflects the inverse of an expected interference level associated with the first TVWS channel at the first location. 7. The computer-implemented method of claim 6, further comprising generating the expected interference level by:
computing a first power loss associated with a TV signal based on frequency separation between a frequency associated with the first TVWS channel and a frequency associated with a channel on which a TV tower transmits the TV signal; computing a second power loss associated with the TV signal based on physical separation between a location associated with the TV tower and the first location; and reducing an initial power level associated with the TV signal by the first power loss and by the second power loss. 8. The computer-implemented method of claim 7, further comprising:
retrieving the frequency associated with the channel on which the TV tower transmits the TV signal, the location associated with the TV tower, and the initial power level associated with the TV signal from a second database, wherein the second database comprises a public database, and wherein the first database comprises a private database. 9. The computer-implemented method of claim 7, wherein the first power loss is computed based on a frequency loss model, and the second power loss is computed based on a path loss model. 10. A non-transitory computer-readable medium storing program instructions that, when executed by a processing unit, cause the processing unit to configure a node to communicate on a television white space (TVWS) spectrum of frequencies, by performing the steps of:
receiving a request for at least one operating parameter from a first node that resides at a first location in a network; retrieving one or more entries associated with the first location from a first database, wherein each of the one or more entries reflects a quality of service metric for a TVWS channel at the first location; determining the at least one operating parameter for the first node based on the one or more entries, wherein the at least one operating parameter indicates a first TVWS channel; and transmitting the at least one operating parameter to the first node, wherein the first node is configured to perform future communication operations over the first TVWS channel according to the at least one operating parameter. 11. The non-transitory computer-readable medium of claim 10, further comprising the steps of:
receiving from the first node a quality of service metric associated with the first TVWS channel and the first location; and updating the first database to include an entry that includes the quality of service metric, the first TVWS channel, and the first location. 12. The non-transitory computer-readable medium of claim 10, further comprising the steps of:
receiving the at least one operating parameter; configuring a network interface associated with the first node to communicate over the first TVWS channel according to the at least one operating parameter; generating a quality of service metric associated with communication operations performed over the first TVWS channel; and transmitting the quality of service metric to a server. 13. The non-transitory computer-readable medium of claim 10, wherein the at least one operating parameter determined for the first node reflects a sensitivity value with which signals are received or a signal-to-noise ratio with which signals are transmitted. 14. The non-transitory computer-readable medium of claim 10, wherein the quality of service metric associated with the first TVVVS channel reflects a packet loss rate associated with the first TVWS channel previously measured by a node configured to communicate over the first TVWS channel at the first location. 15. The non-transitory computer-readable medium of claim 10, wherein the quality of service metric associated with the first TVWS channel reflects the inverse of an expected interference level associated with the first TVWS channel at the first location. 16. The non-transitory computer-readable medium of claim 15, further comprising generating the expected interference level by:
computing a first power loss associated with a TV signal based on frequency separation between a frequency associated with the first TVWS channel and a frequency associated with a channel on which a TV tower transmits the TV signal; computing a second power loss associated with the TV signal based on physical separation between a location associated with the TV tower and the first location; and reducing an initial power level associated with the TV signal by the first power loss and by the second power loss. 17. The non-transitory computer-readable medium of claim 16, further comprising:
retrieving the frequency associated with the channel on which the TV tower transmits the TV signal, the location associated with the TV tower, and the initial power level associated with the TV signal from a second database, wherein the second database comprises a public database, and wherein the first database comprises a private database. 18. The non-transitory computer-readable medium of claim 16, wherein the first power loss is computed based on a frequency loss model, and the second power loss is computed based on a path loss model. 19. A system for configuring a node to communicate on a television white space (TVWS) spectrum of frequencies, including:
a processing unit configured to:
receive a request for at least one operating parameter from a first node that resides at a first location in a network,
retrieve one or more entries associated with the first location from a first database, wherein each of the one or more entries reflects a quality of service metric for a TVWS channel at the first location,
determine the at least one operating parameter for the first node based on the one or more entries, wherein the at least one operating parameter indicates a first TVWS channel, and
transmit the at least one operating parameter to the first node, wherein the first node is configured to perform future communication operations over the first TVWS channel according to the at least one operating parameter. 20. The system of claim 19, further including:
a memory unit coupled to the processing unit and storing program instructions that, when executed by the processing unit, cause the processing unit to:
receive the request for the at least one operating parameter,
retrieve the one or more entries associated with the first location from the first database,
determine the at least one operating parameter for the first node based on the one or more entries, and
transmit the at least one operating parameter to the first node. 21. A computer-implemented method for configuring a node to communicate on a television white space (TVWS) spectrum of frequencies, the method comprising:
receiving a request for a first TVWS channel from a first node that resides at a first location in a network; retrieving one or more entries associated with the first location from a first database, wherein a given entry included in the one or more entries reflects a quality of service metric associated with a given TVWS channel computed by a given node residing at the first location and configured to communicate on the given TVWS channel; determining the first TVWS channel for the first node based on the quality of service metrics associated with the one or more entries; and transmitting the first TVWS channel to the first node, wherein the first node is configured to perform a communication operation over the first TVWS channel. 22. The computer-implemented method of claim 21, wherein the quality of service metric associated with the given TVWS channel reflects the inverse of an expected interference level associated with the given TVWS channel at the first location | Nodes within a network are configured to communicate with one another on one or more television white space (TVWS) frequencies that may be subject to interference caused by nearby TV towers. In order to mitigate that interference, the nodes may be configured to communicate according to specific operating parameters. The operating parameters may be generated based on expected interference levels caused by the nearby TV towers or QOS metrics associated with available channels. The nodes may also update a private database to reflect the expected interference levels or measured QOS metrics for different channels.1. A computer-implemented method for configuring a node to communicate on a television white space (TVWS) spectrum of frequencies, the method comprising:
receiving a request for at least one operating parameter from a first node that resides at a first location in a network; retrieving one or more entries associated with the first location from a first database, wherein each of the one or more entries reflects a quality of service metric for a TVWS channel at the first location; determining the at least one operating parameter for the first node based on the one or more entries, wherein the at least one operating parameter indicates a first TVWS channel; and transmitting the at least one operating parameter to the first node, wherein the first node is configured to perform future communication operations over the first TVWS channel according to the at least one operating parameter. 2. The computer-implemented method of claim 1, further comprising:
receiving from the first node a quality of service metric associated with the first TVWS channel and the first location; and updating the first database to include an entry that includes the quality of service metric, the first TVWS channel, and the first location. 3. The computer-implemented method of claim 1, further comprising:
receiving the at least one operating parameter; configuring a network interface associated with the first node to communicate over the first TVWS channel according to the at least one operating parameter; generating a quality of service metric associated with communication operations performed over the first TVWS channel; and transmitting the quality of service metric to a server. 4. The computer-implemented method of claim 1, wherein the at least one operating parameter determined for the first node reflects a sensitivity value with which signals are received or a signal-to-noise ratio with which signals are transmitted. 5. The computer-implemented method of claim 1, wherein the quality of service metric associated with the first TVWS channel reflects a packet loss rate associated with the first TVWS channel previously measured by a node configured to communicate over the first TVWS channel at the first location. 6. The computer-implemented method of claim 1, wherein the quality of service metric associated with the first TVWS channel reflects the inverse of an expected interference level associated with the first TVWS channel at the first location. 7. The computer-implemented method of claim 6, further comprising generating the expected interference level by:
computing a first power loss associated with a TV signal based on frequency separation between a frequency associated with the first TVWS channel and a frequency associated with a channel on which a TV tower transmits the TV signal; computing a second power loss associated with the TV signal based on physical separation between a location associated with the TV tower and the first location; and reducing an initial power level associated with the TV signal by the first power loss and by the second power loss. 8. The computer-implemented method of claim 7, further comprising:
retrieving the frequency associated with the channel on which the TV tower transmits the TV signal, the location associated with the TV tower, and the initial power level associated with the TV signal from a second database, wherein the second database comprises a public database, and wherein the first database comprises a private database. 9. The computer-implemented method of claim 7, wherein the first power loss is computed based on a frequency loss model, and the second power loss is computed based on a path loss model. 10. A non-transitory computer-readable medium storing program instructions that, when executed by a processing unit, cause the processing unit to configure a node to communicate on a television white space (TVWS) spectrum of frequencies, by performing the steps of:
receiving a request for at least one operating parameter from a first node that resides at a first location in a network; retrieving one or more entries associated with the first location from a first database, wherein each of the one or more entries reflects a quality of service metric for a TVWS channel at the first location; determining the at least one operating parameter for the first node based on the one or more entries, wherein the at least one operating parameter indicates a first TVWS channel; and transmitting the at least one operating parameter to the first node, wherein the first node is configured to perform future communication operations over the first TVWS channel according to the at least one operating parameter. 11. The non-transitory computer-readable medium of claim 10, further comprising the steps of:
receiving from the first node a quality of service metric associated with the first TVWS channel and the first location; and updating the first database to include an entry that includes the quality of service metric, the first TVWS channel, and the first location. 12. The non-transitory computer-readable medium of claim 10, further comprising the steps of:
receiving the at least one operating parameter; configuring a network interface associated with the first node to communicate over the first TVWS channel according to the at least one operating parameter; generating a quality of service metric associated with communication operations performed over the first TVWS channel; and transmitting the quality of service metric to a server. 13. The non-transitory computer-readable medium of claim 10, wherein the at least one operating parameter determined for the first node reflects a sensitivity value with which signals are received or a signal-to-noise ratio with which signals are transmitted. 14. The non-transitory computer-readable medium of claim 10, wherein the quality of service metric associated with the first TVVVS channel reflects a packet loss rate associated with the first TVWS channel previously measured by a node configured to communicate over the first TVWS channel at the first location. 15. The non-transitory computer-readable medium of claim 10, wherein the quality of service metric associated with the first TVWS channel reflects the inverse of an expected interference level associated with the first TVWS channel at the first location. 16. The non-transitory computer-readable medium of claim 15, further comprising generating the expected interference level by:
computing a first power loss associated with a TV signal based on frequency separation between a frequency associated with the first TVWS channel and a frequency associated with a channel on which a TV tower transmits the TV signal; computing a second power loss associated with the TV signal based on physical separation between a location associated with the TV tower and the first location; and reducing an initial power level associated with the TV signal by the first power loss and by the second power loss. 17. The non-transitory computer-readable medium of claim 16, further comprising:
retrieving the frequency associated with the channel on which the TV tower transmits the TV signal, the location associated with the TV tower, and the initial power level associated with the TV signal from a second database, wherein the second database comprises a public database, and wherein the first database comprises a private database. 18. The non-transitory computer-readable medium of claim 16, wherein the first power loss is computed based on a frequency loss model, and the second power loss is computed based on a path loss model. 19. A system for configuring a node to communicate on a television white space (TVWS) spectrum of frequencies, including:
a processing unit configured to:
receive a request for at least one operating parameter from a first node that resides at a first location in a network,
retrieve one or more entries associated with the first location from a first database, wherein each of the one or more entries reflects a quality of service metric for a TVWS channel at the first location,
determine the at least one operating parameter for the first node based on the one or more entries, wherein the at least one operating parameter indicates a first TVWS channel, and
transmit the at least one operating parameter to the first node, wherein the first node is configured to perform future communication operations over the first TVWS channel according to the at least one operating parameter. 20. The system of claim 19, further including:
a memory unit coupled to the processing unit and storing program instructions that, when executed by the processing unit, cause the processing unit to:
receive the request for the at least one operating parameter,
retrieve the one or more entries associated with the first location from the first database,
determine the at least one operating parameter for the first node based on the one or more entries, and
transmit the at least one operating parameter to the first node. 21. A computer-implemented method for configuring a node to communicate on a television white space (TVWS) spectrum of frequencies, the method comprising:
receiving a request for a first TVWS channel from a first node that resides at a first location in a network; retrieving one or more entries associated with the first location from a first database, wherein a given entry included in the one or more entries reflects a quality of service metric associated with a given TVWS channel computed by a given node residing at the first location and configured to communicate on the given TVWS channel; determining the first TVWS channel for the first node based on the quality of service metrics associated with the one or more entries; and transmitting the first TVWS channel to the first node, wherein the first node is configured to perform a communication operation over the first TVWS channel. 22. The computer-implemented method of claim 21, wherein the quality of service metric associated with the given TVWS channel reflects the inverse of an expected interference level associated with the given TVWS channel at the first location | 2,400 |
7,635 | 7,635 | 14,497,249 | 2,483 | The present disclosure relates to an image processing device and method which can accurately reproduce a dynamic range of an image.
A value on a vertical axis corresponding to a maximum white level is a digital value of the maximum white level (white 800%) which is assigned to a developed image, and is set as max_white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. A value on the vertical axis corresponding to a white level is a digital value of a white level (white 100%) which is assigned to a developed image, and is set as white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. The present disclosure is applicable to, for example, an image processing device. | 1-20. (canceled) 21. An image processing device, comprising:
at least one processor configured to:
decode image data to produce decoded image data;
receive dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data; and
adjust a dynamic range of the decoded image data based upon the dynamic range characteristic information. 22. The image processing device of claim 21, wherein the at least one processor is further configured to increase a dynamic range of the decoded image data to a dynamic range of the image data based upon the dynamic range characteristic information. 23. The image processing device of claim 21, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 24. The image processing device of claim 21, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 25. The image processing device of claim 24, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 26. The image processing device of claim 21, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 27. The image processing device of claim 21, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. 28. An image processing device, comprising:
at least one processor configured to:
encode image data to produce encoded image data; and
provide dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data. 29. The image processing device of claim 28, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 30. The image processing device of claim 28, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 31. The image processing device of claim 30, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 32. The image processing device of claim 28, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 33. The image processing device of claim 28, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. 34. At least one computer readable storage medium having stored thereon instructions, which, when executed by at least one processor, perform an image processing method, the method comprising:
decoding image data to produce decoded image data; receiving dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data; and adjusting a dynamic range of the decoded image data based upon the dynamic range characteristic information. 35. The at least one computer readable storage medium of claim 34, wherein the method further comprises increasing a dynamic range of the decoded image data to a dynamic range of the image data based upon the dynamic range characteristic information. 36. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 37. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 38. The at least one computer readable storage medium of claim 37, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 39. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 40. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. 41. At least one computer readable storage medium having stored thereon image data and dynamic range characteristic information associated with the image data, which, when the image data is decoded by at least one processor, is processed by the at least one processor to adjust a dynamic range of the image data, the dynamic range characteristic information comprising:
maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data. 42. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 43. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 44. The at least one computer readable storage medium of claim 43, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 45. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 46. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. | The present disclosure relates to an image processing device and method which can accurately reproduce a dynamic range of an image.
A value on a vertical axis corresponding to a maximum white level is a digital value of the maximum white level (white 800%) which is assigned to a developed image, and is set as max_white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. A value on the vertical axis corresponding to a white level is a digital value of a white level (white 100%) which is assigned to a developed image, and is set as white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. The present disclosure is applicable to, for example, an image processing device.1-20. (canceled) 21. An image processing device, comprising:
at least one processor configured to:
decode image data to produce decoded image data;
receive dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data; and
adjust a dynamic range of the decoded image data based upon the dynamic range characteristic information. 22. The image processing device of claim 21, wherein the at least one processor is further configured to increase a dynamic range of the decoded image data to a dynamic range of the image data based upon the dynamic range characteristic information. 23. The image processing device of claim 21, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 24. The image processing device of claim 21, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 25. The image processing device of claim 24, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 26. The image processing device of claim 21, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 27. The image processing device of claim 21, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. 28. An image processing device, comprising:
at least one processor configured to:
encode image data to produce encoded image data; and
provide dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data. 29. The image processing device of claim 28, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 30. The image processing device of claim 28, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 31. The image processing device of claim 30, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 32. The image processing device of claim 28, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 33. The image processing device of claim 28, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. 34. At least one computer readable storage medium having stored thereon instructions, which, when executed by at least one processor, perform an image processing method, the method comprising:
decoding image data to produce decoded image data; receiving dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data; and adjusting a dynamic range of the decoded image data based upon the dynamic range characteristic information. 35. The at least one computer readable storage medium of claim 34, wherein the method further comprises increasing a dynamic range of the decoded image data to a dynamic range of the image data based upon the dynamic range characteristic information. 36. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 37. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 38. The at least one computer readable storage medium of claim 37, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 39. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 40. The at least one computer readable storage medium of claim 34, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. 41. At least one computer readable storage medium having stored thereon image data and dynamic range characteristic information associated with the image data, which, when the image data is decoded by at least one processor, is processed by the at least one processor to adjust a dynamic range of the image data, the dynamic range characteristic information comprising:
maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data. 42. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 43. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 44. The at least one computer readable storage medium of claim 43, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 45. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 46. The at least one computer readable storage medium of claim 41, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. | 2,400 |
7,636 | 7,636 | 14,708,513 | 2,434 | Methods and systems for managing permission controls are disclosed. A method can comprise receiving a request to perform one or more restricted activities. The request can include at least an identifier of a first user associated with the request and an identification of the one or more restricted activities. The identifier of the first user associated with the request and/or the identification of the one or more restricted activities can be presented to a second user, such as an administrator. A response to the request can be provided by the second user and transmitted comprising information relating to one or more of a grant, denial, or modification of the performance of the one or more restricted activities. The transmitted response can be configured to be processed by the source to effect grant, denial, or modification of the performance of the one or more restricted activities. | 1. A method comprising:
receiving, by one or more processors, a request to perform one or more restricted activities, wherein the request comprises at least an identifier of a first user associated with the request and an identification of the one or more restricted activities; causing, by the one or more processors, presentation of the identifier of the first user associated with the request and the identification of the one or more restricted activities to a second user; receiving, by the one or more processors, a response to the request comprising information relating to one or more of a grant, denial, or modification of the performance of the one or more restricted activities; and causing, by the one or more processors, transmission of the response to a source of the request, wherein the transmitted response is configured to be processed by the source to effect grant, denial, or modification of the performance of the one or more restricted activities. 2. The method of claim 1, wherein the request further includes contextual information relating to the one or more restricted activities. 3. The method of claim 1, wherein the request further includes a time range, rating information, allocation information, location information, or alternatives to the one or more restricted activities, or a combination thereof. 4. The method of claim 1, wherein the to the one or more restricted activities comprise content consumption, interaction with a premises device, access to a premise, access to a portion of a premises, operation of a vehicle, access to a vehicle, or a combination thereof. 5. The method of claim 1, wherein the presentation of the identifier of the first user associated with the request and the identification of the one or more restricted activities comprises audio or visual presentation, or both. 6. The method of claim 1, wherein the response to the request is received as a user-provided input or as a selection of one or more options presented to a recipient of the request, or both. 7. The method of claim 1, wherein the response is transmitted via a network communications channel and the second user is an administrator of the first user. 8. A method comprising:
receiving, by one or more processors, first information relating to an attempt to perform one or more restricted activities by a first user; causing, by the one or more processors, presentation of second information relating to the restriction of the one or more restricted activities, in response to receiving the first information; causing, by the one or more processors, transmission of a request to perform the one or more restricted activities to a second user; receiving, by the one or more processors, a response to the request comprising information relating to one or more of a grant, denial, or modification of the one or more restriction activities; and causing, by the one or more processors, grant, denial, or modification of the performance of the one or more restricted activities. 9. The method of claim 8, wherein the request further includes contextual information relating to the one or more restricted activities. 10. The method of claim 8, wherein the request further includes a time range, rating information, allocation information, location information, or alternatives to the one or more restricted activities, or a combination thereof. 11. The method of claim 8, wherein the to the one or more restricted activities comprise content consumption, interaction with a premises device, access to a premise, access to a portion of a premises, operation of a vehicle, access to a vehicle, or a combination thereof. 12. The method of claim 8, further comprising determining that an administrator of permission controls is located outside a location zone and applying one or more of the permission controls to one or more activities to generated the one or more restricted activities based at least in part on the determination that the administrator of permission controls is located outside the location zone. 13. The method of claim 12, wherein the location zone comprises a premises or a geo-fenced area, or both. 14. The method of claim 12, wherein the second user is the administrator of permission controls. 15. A method comprising:
determining, by one or more processors, that an administrator is outside a location zone; applying, by one or more processors, a permission control to one or more activities to restrict a performance of the one or more activities; receiving, by one or more processors, first information relating to an attempt to perform one or more of the restricted activities; denying, by one or more processors, performance of the one or more of the restricted activities; receiving, by one or more processors, second information comprising authorization to unrestrict the one or more restricted activities; and allowing, by one or more processors, performance of the one or more of the unrestricted activities. 16. The method of claim 15, wherein the location zone comprises a premises or a geo-fenced area, or both. 17. The method of claim 15, wherein the to the one or more restricted activities comprise content consumption, interaction with a premises device, access to a premise, access to a portion of a premises, operation of a vehicle, access to a vehicle, or a combination thereof. 18. The method of claim 15, wherein the second information comprises a determination that the administrator is inside the location zone. 19. The method of claim 15, wherein the second information comprises a response to a request for permission. 20. The method of claim 15, wherein the one or more processors are disposed in a network datacenter. | Methods and systems for managing permission controls are disclosed. A method can comprise receiving a request to perform one or more restricted activities. The request can include at least an identifier of a first user associated with the request and an identification of the one or more restricted activities. The identifier of the first user associated with the request and/or the identification of the one or more restricted activities can be presented to a second user, such as an administrator. A response to the request can be provided by the second user and transmitted comprising information relating to one or more of a grant, denial, or modification of the performance of the one or more restricted activities. The transmitted response can be configured to be processed by the source to effect grant, denial, or modification of the performance of the one or more restricted activities.1. A method comprising:
receiving, by one or more processors, a request to perform one or more restricted activities, wherein the request comprises at least an identifier of a first user associated with the request and an identification of the one or more restricted activities; causing, by the one or more processors, presentation of the identifier of the first user associated with the request and the identification of the one or more restricted activities to a second user; receiving, by the one or more processors, a response to the request comprising information relating to one or more of a grant, denial, or modification of the performance of the one or more restricted activities; and causing, by the one or more processors, transmission of the response to a source of the request, wherein the transmitted response is configured to be processed by the source to effect grant, denial, or modification of the performance of the one or more restricted activities. 2. The method of claim 1, wherein the request further includes contextual information relating to the one or more restricted activities. 3. The method of claim 1, wherein the request further includes a time range, rating information, allocation information, location information, or alternatives to the one or more restricted activities, or a combination thereof. 4. The method of claim 1, wherein the to the one or more restricted activities comprise content consumption, interaction with a premises device, access to a premise, access to a portion of a premises, operation of a vehicle, access to a vehicle, or a combination thereof. 5. The method of claim 1, wherein the presentation of the identifier of the first user associated with the request and the identification of the one or more restricted activities comprises audio or visual presentation, or both. 6. The method of claim 1, wherein the response to the request is received as a user-provided input or as a selection of one or more options presented to a recipient of the request, or both. 7. The method of claim 1, wherein the response is transmitted via a network communications channel and the second user is an administrator of the first user. 8. A method comprising:
receiving, by one or more processors, first information relating to an attempt to perform one or more restricted activities by a first user; causing, by the one or more processors, presentation of second information relating to the restriction of the one or more restricted activities, in response to receiving the first information; causing, by the one or more processors, transmission of a request to perform the one or more restricted activities to a second user; receiving, by the one or more processors, a response to the request comprising information relating to one or more of a grant, denial, or modification of the one or more restriction activities; and causing, by the one or more processors, grant, denial, or modification of the performance of the one or more restricted activities. 9. The method of claim 8, wherein the request further includes contextual information relating to the one or more restricted activities. 10. The method of claim 8, wherein the request further includes a time range, rating information, allocation information, location information, or alternatives to the one or more restricted activities, or a combination thereof. 11. The method of claim 8, wherein the to the one or more restricted activities comprise content consumption, interaction with a premises device, access to a premise, access to a portion of a premises, operation of a vehicle, access to a vehicle, or a combination thereof. 12. The method of claim 8, further comprising determining that an administrator of permission controls is located outside a location zone and applying one or more of the permission controls to one or more activities to generated the one or more restricted activities based at least in part on the determination that the administrator of permission controls is located outside the location zone. 13. The method of claim 12, wherein the location zone comprises a premises or a geo-fenced area, or both. 14. The method of claim 12, wherein the second user is the administrator of permission controls. 15. A method comprising:
determining, by one or more processors, that an administrator is outside a location zone; applying, by one or more processors, a permission control to one or more activities to restrict a performance of the one or more activities; receiving, by one or more processors, first information relating to an attempt to perform one or more of the restricted activities; denying, by one or more processors, performance of the one or more of the restricted activities; receiving, by one or more processors, second information comprising authorization to unrestrict the one or more restricted activities; and allowing, by one or more processors, performance of the one or more of the unrestricted activities. 16. The method of claim 15, wherein the location zone comprises a premises or a geo-fenced area, or both. 17. The method of claim 15, wherein the to the one or more restricted activities comprise content consumption, interaction with a premises device, access to a premise, access to a portion of a premises, operation of a vehicle, access to a vehicle, or a combination thereof. 18. The method of claim 15, wherein the second information comprises a determination that the administrator is inside the location zone. 19. The method of claim 15, wherein the second information comprises a response to a request for permission. 20. The method of claim 15, wherein the one or more processors are disposed in a network datacenter. | 2,400 |
7,637 | 7,637 | 15,331,828 | 2,424 | A method for allowing user selection of interactive video software components in a television STB operatively coupled to a video content network includes the steps of: affording the user a selection of interactive video software components to run on the set-top box; and loading selected interactive video software components onto the set-top box. The selected interactive video software components are delivered from a remote node over the video content network to which the STB is coupled. | 1. A method for allowing user selection of interactive video software components in a television set-top box operatively coupled to a video content network, the method comprising the steps of:
affording a user a selection of interactive video software components to run on the set-top box so as to form a list of selected interactive video software components; updating the list to reflect only corresponding interactive video software components available to load on the set-top box via download from one or more remote servers; and loading the selected interactive video software components on the updated list onto the set-top box from the one or more remote servers. 2. The method of claim 1, wherein the affording step is performed at a prescribed time after the set-top box has completed a re-booting operation. 3. The method of claim 1, wherein the affording step is performed during execution of an initial monitor program on the set-top box. 4. The method of claim 1, wherein the loading step comprises delivering one or more of the selected interactive video software components to the set-top box under control of a multiple system operator (MSO). 5. The method of claim 1, wherein the loading step comprises delivering one or more of the selected interactive video software components using at least one of a Motion Pictures Expert Group (MPEG) standard from a data carousel and an Internet Protocol (IP) over a Data Over Cable Service Interface Specification (DOCSIS) network. 6. The method of claim 1, wherein the affording step comprises presenting the user with a selection interface. 7. The method of claim 1, wherein the affording step comprises forming a local list of selected interactive video software components. 8. The method of claim 7, wherein the local list is stored in non-volatile memory associated with the set-top box. 9. The method of claim 8, wherein at least a portion of the non-volatile memory is accessible to at least one of an operating system and a middleware layer of the set-top box. 10. The method of claim 1, further comprising the step of determining whether two-way communication between the set-top box and a configuration database is unavailable, and when determined to be unavailable, performing the additional steps of:
determining which interactive video software components to load on the set-top box based at least in part on a local list of interactive video software components; and loading the determined interactive video software components from an area of non-volatile memory on the set-top box. 11. The method of claim 1, wherein the updating step comprises the sub-steps of:
establishing two-way communication between the set-top box and a configuration database using a unique identifier; and retrieving from the configuration database a list of interactive video software components that are available to load on the set-top box for a device type corresponding to the unique identifier. 12. The method of claim 11, wherein the list of interactive video software components is stored in an extended application information table (XAIT). 13. The method of claim 1, further comprising the steps of:
establishing two-way communication between a configuration database and a network-based user interface; obtaining, using the network-based user interface, a list of software components available to load on the set-top box for a device type of the set-top box; and selecting, using the network-based user interface, at least one interactive video software component to load on the set-top box. 14. The method of claim 13, further comprising the step of verifying compatibility of a user-selected interactive video software component as a function of the device type of the set-top box. 15. The method of claim 1, wherein the loading step is performed using an in-band data stream. 16. The method of claim 1, wherein the loading step is performed using an out-of-band data stream. 17. A system comprising:
a set-top box having a set-top-box memory and at least one set-top box processor coupled to the set-top-box memory; a video content network; and at least one configuration server having a configuration server memory and at least one configuration server processor coupled to the configuration server memory; wherein the at least one set-top box processor and the at least one configuration server processor are cooperatively operative to: facilitate affording a user a selection of interactive video software components to run on the set-top box so as to form a list of selected interactive video software components; facilitate updating the list to reflect only corresponding interactive video software components available to load on the set-top box via download from one or more remote servers; and facilitate loading the selected interactive video software components on the updated list onto the set-top box from the one or more remote servers. 18. The system of claim 17, wherein affording the user a selection of interactive video software components is accomplished at least in part by the system executing an initial monitoring application. 19. The system of claim 17, wherein affording the user a selection of interactive video software components comprises presenting the user with a selection interface. 20. An apparatus for allowing user selection of interactive video software components in a television set-top box operatively coupled to a video content network, the apparatus comprising:
means for affording the user a selection of interactive video software components to run on the set-top box so as to form a list of selected interactive video software components; means for updating the list to reflect only corresponding interactive video software components available to load on the set-top box via download from one or more remote servers; and
means for loading the selected interactive video software components on the updated list onto the set-top box from the one or more remote servers. | A method for allowing user selection of interactive video software components in a television STB operatively coupled to a video content network includes the steps of: affording the user a selection of interactive video software components to run on the set-top box; and loading selected interactive video software components onto the set-top box. The selected interactive video software components are delivered from a remote node over the video content network to which the STB is coupled.1. A method for allowing user selection of interactive video software components in a television set-top box operatively coupled to a video content network, the method comprising the steps of:
affording a user a selection of interactive video software components to run on the set-top box so as to form a list of selected interactive video software components; updating the list to reflect only corresponding interactive video software components available to load on the set-top box via download from one or more remote servers; and loading the selected interactive video software components on the updated list onto the set-top box from the one or more remote servers. 2. The method of claim 1, wherein the affording step is performed at a prescribed time after the set-top box has completed a re-booting operation. 3. The method of claim 1, wherein the affording step is performed during execution of an initial monitor program on the set-top box. 4. The method of claim 1, wherein the loading step comprises delivering one or more of the selected interactive video software components to the set-top box under control of a multiple system operator (MSO). 5. The method of claim 1, wherein the loading step comprises delivering one or more of the selected interactive video software components using at least one of a Motion Pictures Expert Group (MPEG) standard from a data carousel and an Internet Protocol (IP) over a Data Over Cable Service Interface Specification (DOCSIS) network. 6. The method of claim 1, wherein the affording step comprises presenting the user with a selection interface. 7. The method of claim 1, wherein the affording step comprises forming a local list of selected interactive video software components. 8. The method of claim 7, wherein the local list is stored in non-volatile memory associated with the set-top box. 9. The method of claim 8, wherein at least a portion of the non-volatile memory is accessible to at least one of an operating system and a middleware layer of the set-top box. 10. The method of claim 1, further comprising the step of determining whether two-way communication between the set-top box and a configuration database is unavailable, and when determined to be unavailable, performing the additional steps of:
determining which interactive video software components to load on the set-top box based at least in part on a local list of interactive video software components; and loading the determined interactive video software components from an area of non-volatile memory on the set-top box. 11. The method of claim 1, wherein the updating step comprises the sub-steps of:
establishing two-way communication between the set-top box and a configuration database using a unique identifier; and retrieving from the configuration database a list of interactive video software components that are available to load on the set-top box for a device type corresponding to the unique identifier. 12. The method of claim 11, wherein the list of interactive video software components is stored in an extended application information table (XAIT). 13. The method of claim 1, further comprising the steps of:
establishing two-way communication between a configuration database and a network-based user interface; obtaining, using the network-based user interface, a list of software components available to load on the set-top box for a device type of the set-top box; and selecting, using the network-based user interface, at least one interactive video software component to load on the set-top box. 14. The method of claim 13, further comprising the step of verifying compatibility of a user-selected interactive video software component as a function of the device type of the set-top box. 15. The method of claim 1, wherein the loading step is performed using an in-band data stream. 16. The method of claim 1, wherein the loading step is performed using an out-of-band data stream. 17. A system comprising:
a set-top box having a set-top-box memory and at least one set-top box processor coupled to the set-top-box memory; a video content network; and at least one configuration server having a configuration server memory and at least one configuration server processor coupled to the configuration server memory; wherein the at least one set-top box processor and the at least one configuration server processor are cooperatively operative to: facilitate affording a user a selection of interactive video software components to run on the set-top box so as to form a list of selected interactive video software components; facilitate updating the list to reflect only corresponding interactive video software components available to load on the set-top box via download from one or more remote servers; and facilitate loading the selected interactive video software components on the updated list onto the set-top box from the one or more remote servers. 18. The system of claim 17, wherein affording the user a selection of interactive video software components is accomplished at least in part by the system executing an initial monitoring application. 19. The system of claim 17, wherein affording the user a selection of interactive video software components comprises presenting the user with a selection interface. 20. An apparatus for allowing user selection of interactive video software components in a television set-top box operatively coupled to a video content network, the apparatus comprising:
means for affording the user a selection of interactive video software components to run on the set-top box so as to form a list of selected interactive video software components; means for updating the list to reflect only corresponding interactive video software components available to load on the set-top box via download from one or more remote servers; and
means for loading the selected interactive video software components on the updated list onto the set-top box from the one or more remote servers. | 2,400 |
7,638 | 7,638 | 14,797,195 | 2,415 | A wireless device receives a packet from a sender node according to a routing protocol and determines a position information of the sender node. The wireless device calculates a distance to the sender node from the wireless device and discards the packet if the distance is outside of a range. Otherwise, the packet is processed according to the routing protocol. As a result, the approach may be suited to testing type environments where the wireless devices are proximately placed and yet one may wish to simulate real-world distances between the wireless devices. | 1. A method performed in a wireless device, said method comprising:
receiving a packet from a sender node according to a routing protocol; determining a position information of said sender node; calculating a distance to said sender node from said wireless device; and if said distance is within a range, then processing said packet according to said routing protocol, else discarding said packet. 2. The method of claim 1, further comprising:
maintaining, in said wireless device, a position information for said wireless device, wherein said distance is calculated based on said position information of said sender node and said position information of said wireless device. 3. The method of claim 2, wherein said position information of said sender node is part of a medium access control (MAC) address of said sender node, wherein MAC address is part of said packet received from said sender node, said determining comprises:
examining said MAC address in said packet for said position information of said sender node. 4. The method of claim 3, wherein said maintaining comprises:
receiving said position information of said wireless device from a user; and storing said position information in a memory contained in said wireless device, wherein said examining retrieves said position information from memory and said calculating is performed using the retrieved position information. 5. The method of claim 4, wherein said position information is in the form of Cartesian coordinates, and said distance is the spatial distance between Cartesian coordinates of said sender node and that of said wireless device,
wherein said range is an upper limit such that said packet is discarded if the sender node is at a distance more than that specified as said upper limit. 6. The method of claim 1, further comprising:
generating, in said wireless device, a value representing a signal strength with which said packet is received; and modifying said value for said packet based on said distance to said sender node and providing said modified value to a routing adapter layer, wherein said routing adapter layer is designed to choose a parent node from a plurality of parent nodes based on signal strengths of packets received from each of the parent node, wherein providing said modified value causes said routing adapter layer to select one of said plurality of parent nodes as said parent node based on said modified value. 7. The method of claim 1, further comprising:
overwriting at least one bit in said packet by a simulation layer, thereby generating an error packet; forwarding said error packet to a higher layer in said wireless device for further processing; and generating an error by said higher layer while processing said error packet. 8. A non-transitory machine readable medium storing one or more sequences of instructions for enabling a wireless device to process packets, wherein execution of said one or more instructions by one or more processors contained in said wireless device said wireless device to perform the actions of:
receiving a packet from a sender node according to a routing protocol; determining a position information of said sender node; calculating a distance to said sender node from said wireless device; and if said distance is within a range, then processing said packet according to said routing protocol, else discarding said packet. 9. The non-transitory machine readable medium of claim 8, further comprising instructions to cause said wireless device to perform the actions of:
maintaining, in said wireless device, a position information for said wireless device, wherein said distance is calculated based on said position information of said sender node and said position information of said wireless device. 10. The non-transitory machine readable medium of claim 9, wherein said position information of said sender node is part of a medium access control (MAC) address of said sender node, wherein MAC address is part of said packet received from said sender node, said determining comprises:
examining said MAC address in said packet for said position information of said sender node. 11. The non-transitory machine readable medium of claim 10, wherein said maintaining comprises:
receiving said position information of said wireless device from a user; and storing said position information in a memory contained in said wireless device, wherein said examining retrieves said position information from memory and said calculating is performed using the retrieved position information. 12. The non-transitory machine readable medium of claim 11, wherein said position information is in the form of Cartesian coordinates, and said distance is the spatial distance between Cartesian coordinates of said sender node and that of said wireless device,
wherein said range is an upper limit such that said packet is discarded if the sender node is at a distance more than that specified as said upper limit. 13. The non-transitory machine readable medium of claim 8, further comprising instructions to cause said wireless device to perform the actions of:
generating, in said wireless device, a value representing a signal strength with which said packet is received; and modifying said value for said packet based on said distance to said sender node and providing said modified value to a routing adapter layer, wherein said routing adapter layer is designed to choose a parent node from a plurality of parent nodes based on signal strengths of packets received from each of the parent node, wherein providing said modified value causes said routing adapter layer to select one of said plurality of parent nodes as said parent node based on said modified value. 14. The non-transitory machine readable medium of claim 8, further comprising instructions to cause said wireless device to perform the actions of:
overwriting at least one bit in said packet by a simulation layer, thereby generating an error packet; forwarding said error packet to a higher layer in said wireless device for further processing; and generating an error by said higher layer while processing said error packet. 15. A wireless device comprising:
a processing block and a memory, said memory to store instructions which when retrieved and executed by said processing block causes said wireless device to perform the actions of:
receiving a packet from a sender node according to a routing protocol;
determining a position information of said sender node;
calculating a distance to said sender node from said wireless device; and
if said distance is within a range, then processing said packet according to said routing protocol, else discarding said packet. 16. The wireless device of claim 15, wherein said processing block further performs the action of:
maintaining, in said wireless device, a position information for said wireless device, wherein said distance is calculated based on said position information of said sender node and said position information of said wireless device. 17. The wireless device of claim 16, wherein said position information of said sender node is part of a medium access control (MAC) address of said sender node, wherein MAC address is part of said packet received from said sender node, said determining comprises:
examining said MAC address in said packet for said position information of said sender node. 18. The wireless device of claim 17, wherein said maintaining comprises:
receiving said position information of said wireless device from a user; and storing said position information in a memory contained in said wireless device, wherein said examining retrieves said position information from memory and said calculating is performed using the retrieved position information, wherein said position information is in the form of Cartesian coordinates, and said distance is the spatial distance between Cartesian coordinates of said sender node and that of said wireless device, wherein said range is an upper limit such that said packet is discarded if the sender node is at a distance more than that specified as said upper limit. 19. The wireless device of claim 15, wherein said processing block further performs the action of:
generating, in said wireless device, a value representing a signal strength with which said packet is received; and modifying said value for said packet based on said distance to said sender node and providing said modified value to a routing adapter layer, wherein said routing adapter layer is designed to choose a parent node from a plurality of parent nodes based on signal strengths of packets received from each of the parent node, wherein providing said modified value causes said routing adapter layer to select one of said plurality of parent nodes as said parent node based on said modified value. 20. The wireless device of claim 15, wherein said processing block further performs the action of:
overwriting at least one bit in said packet by a simulation layer, thereby generating an error packet; forwarding said error packet to a higher layer in said wireless device for further processing; and generating an error by said higher layer while processing said error packet. | A wireless device receives a packet from a sender node according to a routing protocol and determines a position information of the sender node. The wireless device calculates a distance to the sender node from the wireless device and discards the packet if the distance is outside of a range. Otherwise, the packet is processed according to the routing protocol. As a result, the approach may be suited to testing type environments where the wireless devices are proximately placed and yet one may wish to simulate real-world distances between the wireless devices.1. A method performed in a wireless device, said method comprising:
receiving a packet from a sender node according to a routing protocol; determining a position information of said sender node; calculating a distance to said sender node from said wireless device; and if said distance is within a range, then processing said packet according to said routing protocol, else discarding said packet. 2. The method of claim 1, further comprising:
maintaining, in said wireless device, a position information for said wireless device, wherein said distance is calculated based on said position information of said sender node and said position information of said wireless device. 3. The method of claim 2, wherein said position information of said sender node is part of a medium access control (MAC) address of said sender node, wherein MAC address is part of said packet received from said sender node, said determining comprises:
examining said MAC address in said packet for said position information of said sender node. 4. The method of claim 3, wherein said maintaining comprises:
receiving said position information of said wireless device from a user; and storing said position information in a memory contained in said wireless device, wherein said examining retrieves said position information from memory and said calculating is performed using the retrieved position information. 5. The method of claim 4, wherein said position information is in the form of Cartesian coordinates, and said distance is the spatial distance between Cartesian coordinates of said sender node and that of said wireless device,
wherein said range is an upper limit such that said packet is discarded if the sender node is at a distance more than that specified as said upper limit. 6. The method of claim 1, further comprising:
generating, in said wireless device, a value representing a signal strength with which said packet is received; and modifying said value for said packet based on said distance to said sender node and providing said modified value to a routing adapter layer, wherein said routing adapter layer is designed to choose a parent node from a plurality of parent nodes based on signal strengths of packets received from each of the parent node, wherein providing said modified value causes said routing adapter layer to select one of said plurality of parent nodes as said parent node based on said modified value. 7. The method of claim 1, further comprising:
overwriting at least one bit in said packet by a simulation layer, thereby generating an error packet; forwarding said error packet to a higher layer in said wireless device for further processing; and generating an error by said higher layer while processing said error packet. 8. A non-transitory machine readable medium storing one or more sequences of instructions for enabling a wireless device to process packets, wherein execution of said one or more instructions by one or more processors contained in said wireless device said wireless device to perform the actions of:
receiving a packet from a sender node according to a routing protocol; determining a position information of said sender node; calculating a distance to said sender node from said wireless device; and if said distance is within a range, then processing said packet according to said routing protocol, else discarding said packet. 9. The non-transitory machine readable medium of claim 8, further comprising instructions to cause said wireless device to perform the actions of:
maintaining, in said wireless device, a position information for said wireless device, wherein said distance is calculated based on said position information of said sender node and said position information of said wireless device. 10. The non-transitory machine readable medium of claim 9, wherein said position information of said sender node is part of a medium access control (MAC) address of said sender node, wherein MAC address is part of said packet received from said sender node, said determining comprises:
examining said MAC address in said packet for said position information of said sender node. 11. The non-transitory machine readable medium of claim 10, wherein said maintaining comprises:
receiving said position information of said wireless device from a user; and storing said position information in a memory contained in said wireless device, wherein said examining retrieves said position information from memory and said calculating is performed using the retrieved position information. 12. The non-transitory machine readable medium of claim 11, wherein said position information is in the form of Cartesian coordinates, and said distance is the spatial distance between Cartesian coordinates of said sender node and that of said wireless device,
wherein said range is an upper limit such that said packet is discarded if the sender node is at a distance more than that specified as said upper limit. 13. The non-transitory machine readable medium of claim 8, further comprising instructions to cause said wireless device to perform the actions of:
generating, in said wireless device, a value representing a signal strength with which said packet is received; and modifying said value for said packet based on said distance to said sender node and providing said modified value to a routing adapter layer, wherein said routing adapter layer is designed to choose a parent node from a plurality of parent nodes based on signal strengths of packets received from each of the parent node, wherein providing said modified value causes said routing adapter layer to select one of said plurality of parent nodes as said parent node based on said modified value. 14. The non-transitory machine readable medium of claim 8, further comprising instructions to cause said wireless device to perform the actions of:
overwriting at least one bit in said packet by a simulation layer, thereby generating an error packet; forwarding said error packet to a higher layer in said wireless device for further processing; and generating an error by said higher layer while processing said error packet. 15. A wireless device comprising:
a processing block and a memory, said memory to store instructions which when retrieved and executed by said processing block causes said wireless device to perform the actions of:
receiving a packet from a sender node according to a routing protocol;
determining a position information of said sender node;
calculating a distance to said sender node from said wireless device; and
if said distance is within a range, then processing said packet according to said routing protocol, else discarding said packet. 16. The wireless device of claim 15, wherein said processing block further performs the action of:
maintaining, in said wireless device, a position information for said wireless device, wherein said distance is calculated based on said position information of said sender node and said position information of said wireless device. 17. The wireless device of claim 16, wherein said position information of said sender node is part of a medium access control (MAC) address of said sender node, wherein MAC address is part of said packet received from said sender node, said determining comprises:
examining said MAC address in said packet for said position information of said sender node. 18. The wireless device of claim 17, wherein said maintaining comprises:
receiving said position information of said wireless device from a user; and storing said position information in a memory contained in said wireless device, wherein said examining retrieves said position information from memory and said calculating is performed using the retrieved position information, wherein said position information is in the form of Cartesian coordinates, and said distance is the spatial distance between Cartesian coordinates of said sender node and that of said wireless device, wherein said range is an upper limit such that said packet is discarded if the sender node is at a distance more than that specified as said upper limit. 19. The wireless device of claim 15, wherein said processing block further performs the action of:
generating, in said wireless device, a value representing a signal strength with which said packet is received; and modifying said value for said packet based on said distance to said sender node and providing said modified value to a routing adapter layer, wherein said routing adapter layer is designed to choose a parent node from a plurality of parent nodes based on signal strengths of packets received from each of the parent node, wherein providing said modified value causes said routing adapter layer to select one of said plurality of parent nodes as said parent node based on said modified value. 20. The wireless device of claim 15, wherein said processing block further performs the action of:
overwriting at least one bit in said packet by a simulation layer, thereby generating an error packet; forwarding said error packet to a higher layer in said wireless device for further processing; and generating an error by said higher layer while processing said error packet. | 2,400 |
7,639 | 7,639 | 15,453,022 | 2,491 | A method for performing policy-based configuration of IPSec for a VPN is provided. According to one embodiment, a request for a VPN connection to be established between a network device and a peer network device is received by the network device from the peer network device. Responsive to receipt of the request, the VPN connection is established by the network device in accordance with a policy associated with the request without requiring manual entry of VPN settings by a network administrator of the network device. The policy includes multiple VPN settings for the VPN connection and is configured by a network administrator of the peer network device via a policy page displayed to the network administrator via a user interface of the peer network device. | 1. A method comprising
receiving, by a network device, from a peer network device a request for a Virtual Private Network (VPN) connection to be established between the network device and the peer network device; responsive to said receiving, establishing, by the network device, the VPN connection in accordance with a policy associated with the request without requiring manual entry of a plurality of VPN settings by a network administrator of the network device; wherein the policy includes a plurality of VPN settings for the VPN connection including (i) one or more of (a) a type of VPN authentication, (b) an outgoing VPN interface of the peer network device and (c) a crypto profile and (ii) a type of Internet Protocol Security (IPSec) tunnel to be established between the network device and the peer network device; and wherein the policy is configured by a network administrator of the peer network device via a policy page displayed to the network administrator via a user interface of the peer network device. 2. The method of claim 1, further comprising assigning, by the network device, the plurality of VPN settings to a VPN configuration profile. 3. The method of claim 1, wherein the type of IPSec tunnel to be established comprises a site-to-site tunnel. 4. The method of claim 1, wherein the type of IPSec tunnel to be established comprises a remote access tunnel. 5. The method of claim 1, wherein the policy page includes sufficient VPN settings to allow the VPN connection to be established between the network device and the peer network device. 6. The method of claim 1, further comprising automatically assigning, by the peer network device, default phase-1/phase-2 configuration profiles to the VPN connection. 7. The method of claim 1, wherein the network device comprises a router or a switch. 8. The method of claim 1, wherein the network device comprises a firewall security device or a gateway device. 9. The method of claim 1, wherein the peer network device comprises a router or a switch. 10. The method of claim 1, wherein the peer network device comprises a firewall security device or a gateway device. 11. A non-transitory computer-readable storage medium embodying a set of instructions, which when executed by one or more processors of a network device, causes the one or more processors to perform a method comprising:
receiving, from a peer network device, a request for a Virtual Private Network (VPN) connection to be established between the network device and the peer network device; responsive to said receiving, establishing, the VPN connection in accordance with a policy associated with the request without requiring manual entry of a plurality of VPN settings by a network administrator of the network device; wherein the policy includes a plurality of VPN settings for the VPN connection including (i) one or more of (a) a type of VPN authentication, (b) an outgoing VPN interface of the peer network device and (c) a crypto profile and (ii) a type of Internet Protocol Security (IPSec) tunnel to be established between the network device and the peer network device; and wherein the policy is configured by a network administrator of the peer network device via a policy page displayed to the network administrator via a user interface of the peer network device. 12. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises assigning the plurality of VPN settings to a VPN configuration profile. 13. The non-transitory computer-readable storage medium of claim 11, wherein the type of IPSec tunnel to be established comprises a site-to-site tunnel. 14. The non-transitory computer-readable storage medium of claim 11, wherein the type of IPSec tunnel to be established comprises a remote access tunnel. 15. The non-transitory computer-readable storage medium of claim 11, wherein the policy page includes sufficient VPN settings to allow the VPN connection to be established between the network device and the peer network device. 16. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises automatically assigning, by the peer network device, default phase-1/phase-2 configuration profiles to the VPN connection. 17. The non-transitory computer-readable storage medium of claim 11, wherein the network device comprises a router or a switch. 18. The non-transitory computer-readable storage medium of claim 11, wherein the network device comprises a firewall security device or a gateway device. 19. The non-transitory computer-readable storage medium of claim 11, wherein the peer network device comprises a router or a switch. 20. The non-transitory computer-readable storage medium of claim 11, wherein the peer network device comprises a firewall security device or a gateway device. | A method for performing policy-based configuration of IPSec for a VPN is provided. According to one embodiment, a request for a VPN connection to be established between a network device and a peer network device is received by the network device from the peer network device. Responsive to receipt of the request, the VPN connection is established by the network device in accordance with a policy associated with the request without requiring manual entry of VPN settings by a network administrator of the network device. The policy includes multiple VPN settings for the VPN connection and is configured by a network administrator of the peer network device via a policy page displayed to the network administrator via a user interface of the peer network device.1. A method comprising
receiving, by a network device, from a peer network device a request for a Virtual Private Network (VPN) connection to be established between the network device and the peer network device; responsive to said receiving, establishing, by the network device, the VPN connection in accordance with a policy associated with the request without requiring manual entry of a plurality of VPN settings by a network administrator of the network device; wherein the policy includes a plurality of VPN settings for the VPN connection including (i) one or more of (a) a type of VPN authentication, (b) an outgoing VPN interface of the peer network device and (c) a crypto profile and (ii) a type of Internet Protocol Security (IPSec) tunnel to be established between the network device and the peer network device; and wherein the policy is configured by a network administrator of the peer network device via a policy page displayed to the network administrator via a user interface of the peer network device. 2. The method of claim 1, further comprising assigning, by the network device, the plurality of VPN settings to a VPN configuration profile. 3. The method of claim 1, wherein the type of IPSec tunnel to be established comprises a site-to-site tunnel. 4. The method of claim 1, wherein the type of IPSec tunnel to be established comprises a remote access tunnel. 5. The method of claim 1, wherein the policy page includes sufficient VPN settings to allow the VPN connection to be established between the network device and the peer network device. 6. The method of claim 1, further comprising automatically assigning, by the peer network device, default phase-1/phase-2 configuration profiles to the VPN connection. 7. The method of claim 1, wherein the network device comprises a router or a switch. 8. The method of claim 1, wherein the network device comprises a firewall security device or a gateway device. 9. The method of claim 1, wherein the peer network device comprises a router or a switch. 10. The method of claim 1, wherein the peer network device comprises a firewall security device or a gateway device. 11. A non-transitory computer-readable storage medium embodying a set of instructions, which when executed by one or more processors of a network device, causes the one or more processors to perform a method comprising:
receiving, from a peer network device, a request for a Virtual Private Network (VPN) connection to be established between the network device and the peer network device; responsive to said receiving, establishing, the VPN connection in accordance with a policy associated with the request without requiring manual entry of a plurality of VPN settings by a network administrator of the network device; wherein the policy includes a plurality of VPN settings for the VPN connection including (i) one or more of (a) a type of VPN authentication, (b) an outgoing VPN interface of the peer network device and (c) a crypto profile and (ii) a type of Internet Protocol Security (IPSec) tunnel to be established between the network device and the peer network device; and wherein the policy is configured by a network administrator of the peer network device via a policy page displayed to the network administrator via a user interface of the peer network device. 12. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises assigning the plurality of VPN settings to a VPN configuration profile. 13. The non-transitory computer-readable storage medium of claim 11, wherein the type of IPSec tunnel to be established comprises a site-to-site tunnel. 14. The non-transitory computer-readable storage medium of claim 11, wherein the type of IPSec tunnel to be established comprises a remote access tunnel. 15. The non-transitory computer-readable storage medium of claim 11, wherein the policy page includes sufficient VPN settings to allow the VPN connection to be established between the network device and the peer network device. 16. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises automatically assigning, by the peer network device, default phase-1/phase-2 configuration profiles to the VPN connection. 17. The non-transitory computer-readable storage medium of claim 11, wherein the network device comprises a router or a switch. 18. The non-transitory computer-readable storage medium of claim 11, wherein the network device comprises a firewall security device or a gateway device. 19. The non-transitory computer-readable storage medium of claim 11, wherein the peer network device comprises a router or a switch. 20. The non-transitory computer-readable storage medium of claim 11, wherein the peer network device comprises a firewall security device or a gateway device. | 2,400 |
7,640 | 7,640 | 13,706,201 | 2,419 | A content delivery system ( 100 ) comprises a trusted holder of profile data ( 200 ) arranged to store information concerning a conscious entity, a content delivery requirement entity ( 210 ), a content intermediary entity ( 226 ); and a source of content ( 232 ). The trusted holder of profile data ( 200 ) is arranged to issue ( 230 ) profile reference data to the content delivery requirement entity in response to a request ( 222 ) therefrom, and to communicate ( 224 ) the profile reference data and at least part of the stored information concerning the conscious entity to the content intermediary entity ( 226 ), the request for content provision ( 222 ) being capable of identifying the conscious entity to the trusted holder of profile data. The content intermediary entity ( 226 ) is arranged to source, when in use, relevant content from the source of content ( 232 ) using the at least part of the stored information concerning the conscious entity. | 1. A content delivery system comprising:
a server comprising a processing resource arranged to support a trusted holder of profile data arranged to store information concerning a conscious entity; a content delivery requirement entity; a content intermediary entity; and a source of content; wherein the trusted holder of profile data is arranged to issue profile reference data to the content delivery requirement entity in response to a request for content provision therefrom, and to communicate the profile reference data and at least part of the stored information concerning the conscious entity to the content intermediary entity, the request for content provision being capable of identifying the conscious entity to the trusted holder of profile data; and the content intermediary entity is arranged to source, when in use, relevant content from the source of content using the at least part of the stored information concerning the conscious entity. 2. The system according to claim 1, wherein the content delivery requirement entity is arranged to receive identity data identifying the conscious entity. 3. The system according to claim 2, wherein the identity data is received from a communications device associated with the conscious entity. 4. The system according to claim 1, wherein a change in the at least part of the stored information concerning the conscious entity triggers the content delivery requirement entity to request sourcing of the relevant content. 5. The system according to claim 1, wherein at least part of the stored information concerning the conscious entity comprises profiling information compiled by measuring habitual thought patterns. 6. The system according to claim 1, wherein at least part of the stored information concerning the conscious entity comprises dynamically determined current location information associated with the conscious entity. 7. The system according to claim 1, wherein at least part of the stored information concerning the conscious entity comprises context information. 8. The system according to claim 1, further comprising a software application arranged to identify the conscious entity to the content delivery requirement entity. 9. The system according to claim 8, further comprising a communications device arranged to communicate the identity of the conscious entity from the software application to the content delivery requirement entity. 10. The system according to claim 1, wherein the content intermediary entity is arranged to provide reference data relating to the sourced relevant content found. 11. The system according to claim 9, wherein the content intermediary is arranged to provide data associated with the sourced relevant content in response to receipt of the profile reference data from the software application. 12. The system according to claim 11, wherein the content intermediary is arranged to communicate the data associated with the sourced relevant content to the communications device. 13. The system according to claim 1, wherein the profile reference data is authority data. 14. The system according to claim 1, wherein the content intermediary entity is arranged to process requests for data where the recipient of the data to be sourced is anonymous with respect to the content intermediary entity. 15. The system according to claim 8, wherein the profile reference data is communicated by the content delivery requirement entity to the software application. 16. The system according to claim 9, wherein the communications device is arranged to support a private communication. 17. A system as claimed in claim 1, wherein the content intermediary entity comprises:
a processing resource capable of receiving profile reference data and at least part of information concerning a conscious entity; and the processing resource is arranged to source, when in use, relevant content from a source of content using the at least part of the information concerning the conscious entity. 18. A trusted holder of profile data apparatus comprising:
a store for storing information concerning a conscious entity; a processing resource capable of generating reference data in response to request for the reference data; and the processing resource is arranged to communicate, when in use, the reference data and at least part of the information concerning the conscious entity for sourcing of relevant content, communication for sourcing of relevant content being in response to the request for the reference data. 19. The system according to claim 8, wherein the content intermediary is arranged to provide data associated with the sourced relevant content in response to receipt of the profile reference data from the software application. 20. A content delivery system comprising:
a server comprising a processing resource arranged to support a trusted holder of profile data arranged to store information concerning a conscious entity; a content delivery requirement entity; a content intermediary entity; and a source of content; wherein the trusted holder of profile data is arranged to issue profile reference data to the content delivery requirement entity in response to a request for content provision therefrom, and to communicate the profile reference data and at least part of the stored information concerning the conscious entity to the content intermediary entity, the request for content provision being capable of identifying the conscious entity to the trusted holder of profile data;
the content intermediary entity is arranged to source, when in use, relevant content from the source of content using the at least part of the stored information concerning the conscious entity; and
the at least part of the information stored concerning the conscious entity is formed from a profile analysis resulting in one or more profile elements consisting of a continuous or discrete rating in one or more dimensions. | A content delivery system ( 100 ) comprises a trusted holder of profile data ( 200 ) arranged to store information concerning a conscious entity, a content delivery requirement entity ( 210 ), a content intermediary entity ( 226 ); and a source of content ( 232 ). The trusted holder of profile data ( 200 ) is arranged to issue ( 230 ) profile reference data to the content delivery requirement entity in response to a request ( 222 ) therefrom, and to communicate ( 224 ) the profile reference data and at least part of the stored information concerning the conscious entity to the content intermediary entity ( 226 ), the request for content provision ( 222 ) being capable of identifying the conscious entity to the trusted holder of profile data. The content intermediary entity ( 226 ) is arranged to source, when in use, relevant content from the source of content ( 232 ) using the at least part of the stored information concerning the conscious entity.1. A content delivery system comprising:
a server comprising a processing resource arranged to support a trusted holder of profile data arranged to store information concerning a conscious entity; a content delivery requirement entity; a content intermediary entity; and a source of content; wherein the trusted holder of profile data is arranged to issue profile reference data to the content delivery requirement entity in response to a request for content provision therefrom, and to communicate the profile reference data and at least part of the stored information concerning the conscious entity to the content intermediary entity, the request for content provision being capable of identifying the conscious entity to the trusted holder of profile data; and the content intermediary entity is arranged to source, when in use, relevant content from the source of content using the at least part of the stored information concerning the conscious entity. 2. The system according to claim 1, wherein the content delivery requirement entity is arranged to receive identity data identifying the conscious entity. 3. The system according to claim 2, wherein the identity data is received from a communications device associated with the conscious entity. 4. The system according to claim 1, wherein a change in the at least part of the stored information concerning the conscious entity triggers the content delivery requirement entity to request sourcing of the relevant content. 5. The system according to claim 1, wherein at least part of the stored information concerning the conscious entity comprises profiling information compiled by measuring habitual thought patterns. 6. The system according to claim 1, wherein at least part of the stored information concerning the conscious entity comprises dynamically determined current location information associated with the conscious entity. 7. The system according to claim 1, wherein at least part of the stored information concerning the conscious entity comprises context information. 8. The system according to claim 1, further comprising a software application arranged to identify the conscious entity to the content delivery requirement entity. 9. The system according to claim 8, further comprising a communications device arranged to communicate the identity of the conscious entity from the software application to the content delivery requirement entity. 10. The system according to claim 1, wherein the content intermediary entity is arranged to provide reference data relating to the sourced relevant content found. 11. The system according to claim 9, wherein the content intermediary is arranged to provide data associated with the sourced relevant content in response to receipt of the profile reference data from the software application. 12. The system according to claim 11, wherein the content intermediary is arranged to communicate the data associated with the sourced relevant content to the communications device. 13. The system according to claim 1, wherein the profile reference data is authority data. 14. The system according to claim 1, wherein the content intermediary entity is arranged to process requests for data where the recipient of the data to be sourced is anonymous with respect to the content intermediary entity. 15. The system according to claim 8, wherein the profile reference data is communicated by the content delivery requirement entity to the software application. 16. The system according to claim 9, wherein the communications device is arranged to support a private communication. 17. A system as claimed in claim 1, wherein the content intermediary entity comprises:
a processing resource capable of receiving profile reference data and at least part of information concerning a conscious entity; and the processing resource is arranged to source, when in use, relevant content from a source of content using the at least part of the information concerning the conscious entity. 18. A trusted holder of profile data apparatus comprising:
a store for storing information concerning a conscious entity; a processing resource capable of generating reference data in response to request for the reference data; and the processing resource is arranged to communicate, when in use, the reference data and at least part of the information concerning the conscious entity for sourcing of relevant content, communication for sourcing of relevant content being in response to the request for the reference data. 19. The system according to claim 8, wherein the content intermediary is arranged to provide data associated with the sourced relevant content in response to receipt of the profile reference data from the software application. 20. A content delivery system comprising:
a server comprising a processing resource arranged to support a trusted holder of profile data arranged to store information concerning a conscious entity; a content delivery requirement entity; a content intermediary entity; and a source of content; wherein the trusted holder of profile data is arranged to issue profile reference data to the content delivery requirement entity in response to a request for content provision therefrom, and to communicate the profile reference data and at least part of the stored information concerning the conscious entity to the content intermediary entity, the request for content provision being capable of identifying the conscious entity to the trusted holder of profile data;
the content intermediary entity is arranged to source, when in use, relevant content from the source of content using the at least part of the stored information concerning the conscious entity; and
the at least part of the information stored concerning the conscious entity is formed from a profile analysis resulting in one or more profile elements consisting of a continuous or discrete rating in one or more dimensions. | 2,400 |
7,641 | 7,641 | 15,872,078 | 2,446 | A mail transfer agent comprises processing circuitry, storage circuitry, and networking circuitry. The storage circuitry holds a database. The networking circuitry is operable to receive, via a network connection, an email message. The processing circuitry is operable to analyze the email message to detect an image present in the email message. The processing circuitry is operable to determine, based on one or more records of the database, that the detected image is associated with a particular brand, and process the email message based on whether one or more characteristics of the email message are associated with the particular brand in the database. The one or more characteristics of the email message may comprise one or more of: sender domain, sender subdomain, and sender IP address. | 1. A system comprising:
processing circuitry, storage circuitry, and networking circuitry of a mail transfer agent, wherein:
the storage circuitry holds a database;
the networking circuitry is operable to receive, via a network connection, an email message;
the processing circuitry is operable to analyze the email message to detect an image present in the email message; and
the processing circuitry is operable to:
determine, based on one or more records of the database, that the detected image is associated with a particular brand; and
process the email message based on whether one or more characteristics of the email message are associated with the particular brand in the database. 2. The system of claim 1, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 3. The system of claim 1, wherein the processing of the email message comprises a routing of the email message to a quarantine if the one or more characteristics of the email message are not associated with the particular brand in the database. 4. The system of claim 3, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 5. The system of claim 1, wherein the processing of the email message comprises a reduction of a trustworthiness score of the email message if the one or more characteristics of the email message are not associated with the particular brand in the database. 6. The system of claim 5, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 7. The system of claim 1, wherein the processing of the email message comprises an insertion of warning text and/or image in the email message if the one or more characteristics of the email message are not associated with the particular brand in the database. 8. The system of claim 7, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 9. The system of claim 1, wherein:
the processing circuitry is operable to process the detected image using machine vision algorithms to extract features of the detected image; and the determination that the detected image is associated with the particular brand is based on the extracted features. 10. The system of claim 1, wherein the network connection is a simple mail transfer protocol (SMTP) connection. 11. The system of claim 1, wherein the processing of the email message comprises an increase of a trustworthiness score of the email message if the one or more characteristics of the email message are associated with the particular brand in the database. 12. The system of claim 11, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 13. The system of claim 1, wherein the processing of the email message comprises a routing of the email message to a recipient mailbox if the one or more characteristics of the email message are associated with the particular brand in the database. 14. The system of claim 13, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. | A mail transfer agent comprises processing circuitry, storage circuitry, and networking circuitry. The storage circuitry holds a database. The networking circuitry is operable to receive, via a network connection, an email message. The processing circuitry is operable to analyze the email message to detect an image present in the email message. The processing circuitry is operable to determine, based on one or more records of the database, that the detected image is associated with a particular brand, and process the email message based on whether one or more characteristics of the email message are associated with the particular brand in the database. The one or more characteristics of the email message may comprise one or more of: sender domain, sender subdomain, and sender IP address.1. A system comprising:
processing circuitry, storage circuitry, and networking circuitry of a mail transfer agent, wherein:
the storage circuitry holds a database;
the networking circuitry is operable to receive, via a network connection, an email message;
the processing circuitry is operable to analyze the email message to detect an image present in the email message; and
the processing circuitry is operable to:
determine, based on one or more records of the database, that the detected image is associated with a particular brand; and
process the email message based on whether one or more characteristics of the email message are associated with the particular brand in the database. 2. The system of claim 1, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 3. The system of claim 1, wherein the processing of the email message comprises a routing of the email message to a quarantine if the one or more characteristics of the email message are not associated with the particular brand in the database. 4. The system of claim 3, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 5. The system of claim 1, wherein the processing of the email message comprises a reduction of a trustworthiness score of the email message if the one or more characteristics of the email message are not associated with the particular brand in the database. 6. The system of claim 5, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 7. The system of claim 1, wherein the processing of the email message comprises an insertion of warning text and/or image in the email message if the one or more characteristics of the email message are not associated with the particular brand in the database. 8. The system of claim 7, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 9. The system of claim 1, wherein:
the processing circuitry is operable to process the detected image using machine vision algorithms to extract features of the detected image; and the determination that the detected image is associated with the particular brand is based on the extracted features. 10. The system of claim 1, wherein the network connection is a simple mail transfer protocol (SMTP) connection. 11. The system of claim 1, wherein the processing of the email message comprises an increase of a trustworthiness score of the email message if the one or more characteristics of the email message are associated with the particular brand in the database. 12. The system of claim 11, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. 13. The system of claim 1, wherein the processing of the email message comprises a routing of the email message to a recipient mailbox if the one or more characteristics of the email message are associated with the particular brand in the database. 14. The system of claim 13, wherein the one or more characteristics of the email message comprise one or more of: sender domain, sender subdomain, and sender IP address. | 2,400 |
7,642 | 7,642 | 14,006,765 | 2,452 | Methods and apparatus of managing a community site. Upon execution of processor-executable instructions by a processing unit, the processing unit manages the community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses. The terminal data indicates at least one of a time or a location associated with the terminal apparatus. The processing unit further stores content uploaded from at least one of the plurality of terminal apparatuses to at least one storage device, the content being accessible via the community site. In response to at least one predetermined condition relating to the usage of the community site being satisfied, the processing unit sends a signal to delete the content from the at least one storage device. | 1. An apparatus for managing a community site, the apparatus comprising:
a communication unit; at least one memory to store processor-executable instructions; and a processing unit communicatively coupled to the communication unit and the at least one memory, wherein upon execution of the processor-executable instructions by the processing unit, the processing unit: manages the community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the terminal apparatus; stores content uploaded from at least one of the plurality of terminal apparatuses to at least one storage device, the content being accessible via the community site; and in response to at least one predetermined condition relating to the usage of the community site being satisfied, sends a signal to delete the content from the at least one storage device. 2. The apparatus of claim 1, wherein the at least one predetermined condition relates to a number of terminal apparatuses that have accessed the community site. 3. The apparatus of claim 1, wherein the at least one predetermined condition relates to a number of terminal apparatuses that are within a setting range defined by the management data. 4. The apparatus of claim 1, wherein the at least one predetermined condition relates to a time since a most recent item of the content was uploaded. 5. The apparatus of claim 1, wherein the at least one predetermined condition relates to a number of items of the content that have a particular content-based classification. 6. The apparatus of claim 1, wherein the management data is stored to the at least one storage device, and wherein the processing unit:
sends a signal to delete the management data from the at least one storage device in response to the predetermined condition relating to the usage of the community site being satisfied. 7. The apparatus of claim 1, wherein the processing unit:
send a signal to delete the community site in response to the predetermined condition relating to the usage of the community site being satisfied. 8. The apparatus of claim 1, wherein the community site is a first community site, wherein the communication unit receives an instruction to establish a second community site associated with the first community site, and wherein the processing unit:
determines a number of terminal apparatuses that meet at least one predefined criterion; and if the number of terminal apparatuses that meet the at least one predefined criterion exceeds a predetermined threshold, establishes the second community site. 9. The apparatus of claim 8, wherein at least one predefined criterion comprises a presence within a particular geographic region. 10. The apparatus of claim 1, wherein the processing unit:
manages the community site so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on the plurality of terminal apparatuses presenting common or similar objects within a particular geographic region. 11. The apparatus of claim 10, wherein the common or similar objects comprise passwords. 12. The apparatus of claim 10, wherein the common or similar objects comprise photographs. 13. The apparatus of claim 1, wherein the processing unit:
manages the community site so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on the plurality of terminal apparatuses presenting common or similar objects within a particular time frame. 14. The apparatus of claim 13, wherein the common or similar objects comprise passwords. 15. The apparatus of claim 13, wherein the common or similar objects comprise photographs. 16. The apparatus of claim 1, wherein the management data comprises a setting range that defines an area in which each terminal apparatus must be present to access the community site. 17. A method of managing a community site, the method comprising:
managing the community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the portable terminal apparatus; electronically sending a signal to store content from the plurality of terminal apparatuses to at least one storage device, the content being accessible via the community site; and in response to at least one predetermined condition relating to the usage of the community site being satisfied, electronically sending a signal to delete the content from the at least one storage device. 18. At least one computer-readable medium encoded with instructions that, when executed on at least one processing unit, cause an apparatus to:
manage a community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the terminal apparatus; electronically send a signal to store content from the plurality of terminal apparatuses, the content being accessible via the community site; and in response to at least one predetermined condition relating to the usage of the community site being satisfied, electronically send a signal to delete the content. 19. An apparatus for accessing a community site, the community site being managed by a server in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the terminal apparatus, the apparatus for accessing the community site comprising:
a communication unit; at least one memory to store processor-executable instructions; and a processing unit communicatively coupled to the communication unit and the at least one memory, wherein upon execution of the processor-executable instructions by the processing unit, the processing unit: controls the communication unit to send an instruction to the server to establish the community site; and controls the communication unit to receive data relating to at least one content item accessible via the community site; wherein, in response to at least one predetermined condition relating to the usage of the community site being satisfied, the at least one content item is caused to be inaccessible to the apparatus via the community site. 20. The apparatus of claim 19, wherein the community site is a first community site, and wherein the processing unit:
controls the communication unit to send an instruction to an establish a second community site associated with the first community site. | Methods and apparatus of managing a community site. Upon execution of processor-executable instructions by a processing unit, the processing unit manages the community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses. The terminal data indicates at least one of a time or a location associated with the terminal apparatus. The processing unit further stores content uploaded from at least one of the plurality of terminal apparatuses to at least one storage device, the content being accessible via the community site. In response to at least one predetermined condition relating to the usage of the community site being satisfied, the processing unit sends a signal to delete the content from the at least one storage device.1. An apparatus for managing a community site, the apparatus comprising:
a communication unit; at least one memory to store processor-executable instructions; and a processing unit communicatively coupled to the communication unit and the at least one memory, wherein upon execution of the processor-executable instructions by the processing unit, the processing unit: manages the community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the terminal apparatus; stores content uploaded from at least one of the plurality of terminal apparatuses to at least one storage device, the content being accessible via the community site; and in response to at least one predetermined condition relating to the usage of the community site being satisfied, sends a signal to delete the content from the at least one storage device. 2. The apparatus of claim 1, wherein the at least one predetermined condition relates to a number of terminal apparatuses that have accessed the community site. 3. The apparatus of claim 1, wherein the at least one predetermined condition relates to a number of terminal apparatuses that are within a setting range defined by the management data. 4. The apparatus of claim 1, wherein the at least one predetermined condition relates to a time since a most recent item of the content was uploaded. 5. The apparatus of claim 1, wherein the at least one predetermined condition relates to a number of items of the content that have a particular content-based classification. 6. The apparatus of claim 1, wherein the management data is stored to the at least one storage device, and wherein the processing unit:
sends a signal to delete the management data from the at least one storage device in response to the predetermined condition relating to the usage of the community site being satisfied. 7. The apparatus of claim 1, wherein the processing unit:
send a signal to delete the community site in response to the predetermined condition relating to the usage of the community site being satisfied. 8. The apparatus of claim 1, wherein the community site is a first community site, wherein the communication unit receives an instruction to establish a second community site associated with the first community site, and wherein the processing unit:
determines a number of terminal apparatuses that meet at least one predefined criterion; and if the number of terminal apparatuses that meet the at least one predefined criterion exceeds a predetermined threshold, establishes the second community site. 9. The apparatus of claim 8, wherein at least one predefined criterion comprises a presence within a particular geographic region. 10. The apparatus of claim 1, wherein the processing unit:
manages the community site so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on the plurality of terminal apparatuses presenting common or similar objects within a particular geographic region. 11. The apparatus of claim 10, wherein the common or similar objects comprise passwords. 12. The apparatus of claim 10, wherein the common or similar objects comprise photographs. 13. The apparatus of claim 1, wherein the processing unit:
manages the community site so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on the plurality of terminal apparatuses presenting common or similar objects within a particular time frame. 14. The apparatus of claim 13, wherein the common or similar objects comprise passwords. 15. The apparatus of claim 13, wherein the common or similar objects comprise photographs. 16. The apparatus of claim 1, wherein the management data comprises a setting range that defines an area in which each terminal apparatus must be present to access the community site. 17. A method of managing a community site, the method comprising:
managing the community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the portable terminal apparatus; electronically sending a signal to store content from the plurality of terminal apparatuses to at least one storage device, the content being accessible via the community site; and in response to at least one predetermined condition relating to the usage of the community site being satisfied, electronically sending a signal to delete the content from the at least one storage device. 18. At least one computer-readable medium encoded with instructions that, when executed on at least one processing unit, cause an apparatus to:
manage a community site in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the terminal apparatus; electronically send a signal to store content from the plurality of terminal apparatuses, the content being accessible via the community site; and in response to at least one predetermined condition relating to the usage of the community site being satisfied, electronically send a signal to delete the content. 19. An apparatus for accessing a community site, the community site being managed by a server in accordance with management data so as to permit access to the community site by a plurality of terminal apparatuses based at least in part on terminal data from each of the plurality of terminal apparatuses, the terminal data indicating at least one of a time or a location associated with the terminal apparatus, the apparatus for accessing the community site comprising:
a communication unit; at least one memory to store processor-executable instructions; and a processing unit communicatively coupled to the communication unit and the at least one memory, wherein upon execution of the processor-executable instructions by the processing unit, the processing unit: controls the communication unit to send an instruction to the server to establish the community site; and controls the communication unit to receive data relating to at least one content item accessible via the community site; wherein, in response to at least one predetermined condition relating to the usage of the community site being satisfied, the at least one content item is caused to be inaccessible to the apparatus via the community site. 20. The apparatus of claim 19, wherein the community site is a first community site, and wherein the processing unit:
controls the communication unit to send an instruction to an establish a second community site associated with the first community site. | 2,400 |
7,643 | 7,643 | 13,541,598 | 2,468 | A transport mechanism for supporting the download of SVG over FLUTE or UDP. A RTP payload format is specified that enables live streaming and the streaming of rich media content. According to the present invention, rich media content is encapsulated in RTP packets based upon the payload format at the sender. With the present invention, an efficient framework is provided for satisfying several use cases or scenarios that involve rich media transmission. | 1. A method for delivering content to a client device, comprising:
transmitting a signal to the client device, the signal carrying within a packet stream a multimedia presentation specified using a markup language, wherein the multimedia presentation includes at least one scene description and at least one scene update, and wherein the packet stream includes scene packets, each of which contains information derived from either one of the at least one scene description or one of the at least one scene update 2. The method of claim 1, wherein each scene packet includes priority information for the content contained within the scene packet. 3. The method of claim 2, wherein each scene packet includes sequence information relative to the priority information for the scene packet. 4. The method of claim 1, wherein the multimedia presentation includes SVG. 5. The method of claim 1, wherein the packet stream comprises a plurality of real time transfer protocol packets. 6. The method of claim 1, further comprising transmitting embedded static media outside of the packet stream. 7. The method of claim 6, wherein the embedded static media is transmitted via FLUTE. 8. The method of claim 6, further comprising transmitting embedded dynamic media through a plurality of real time transport protocol connections. 9. The method of claim 1, wherein each scene packet includes a type field indicative of the content of the scene packet. 10. A computer program product for delivering content to a client device, comprising:
computer code for transmitting a signal to the client device, the signal carrying in a packet stream a multimedia presentation specified using a markup language, wherein the multimedia presentation includes at least one scene description and at least one scene update, and wherein the packet stream includes scene packets, each of which contains information derived from either one of the at least one scene description or one of the at least one scene update. 11. The computer program product of claim 10, wherein each scene packet includes priority information for the content contained within the scene packet. 12. The computer program product of claim 11, wherein each scene packet includes sequence information relative to the priority information for the scene packet. 13. The computer program product of claim 10, wherein the multimedia presentation includes SVG. 14. The computer program product of claim 10, wherein the packet stream comprises a plurality of real time transfer protocol packets. 15. The computer program product of claim 10, further comprising computer code for transmitting embedded static media outside of the packet stream. 16. The computer program product of claim 15, wherein the embedded static media is transmitted via FLUTE. 17. The computer program product of claim 15, further comprising computer code for transmitting embedded dynamic media through a plurality of real time transport protocol connections. 18. The computer program product of claim 10, wherein each scene packet includes a type field indicative of the content of the scene packet. 19. An electronic device, comprising:
a processor; and a memory unit operatively connected to the processor and including computer code for transmitting a signal to a client device, the signal carrying in a packet stream a multimedia presentation specified using a markup language, wherein the multimedia presentation includes at least one scene description and at least one scene update, and wherein the packet stream includes scene packets, each of which contains information derived from either one of the at least one scene description or one of the at least one scene update, 20. The electronic device of claim 19, wherein each scene packet includes priority information for the content contained within the scene packet. | A transport mechanism for supporting the download of SVG over FLUTE or UDP. A RTP payload format is specified that enables live streaming and the streaming of rich media content. According to the present invention, rich media content is encapsulated in RTP packets based upon the payload format at the sender. With the present invention, an efficient framework is provided for satisfying several use cases or scenarios that involve rich media transmission.1. A method for delivering content to a client device, comprising:
transmitting a signal to the client device, the signal carrying within a packet stream a multimedia presentation specified using a markup language, wherein the multimedia presentation includes at least one scene description and at least one scene update, and wherein the packet stream includes scene packets, each of which contains information derived from either one of the at least one scene description or one of the at least one scene update 2. The method of claim 1, wherein each scene packet includes priority information for the content contained within the scene packet. 3. The method of claim 2, wherein each scene packet includes sequence information relative to the priority information for the scene packet. 4. The method of claim 1, wherein the multimedia presentation includes SVG. 5. The method of claim 1, wherein the packet stream comprises a plurality of real time transfer protocol packets. 6. The method of claim 1, further comprising transmitting embedded static media outside of the packet stream. 7. The method of claim 6, wherein the embedded static media is transmitted via FLUTE. 8. The method of claim 6, further comprising transmitting embedded dynamic media through a plurality of real time transport protocol connections. 9. The method of claim 1, wherein each scene packet includes a type field indicative of the content of the scene packet. 10. A computer program product for delivering content to a client device, comprising:
computer code for transmitting a signal to the client device, the signal carrying in a packet stream a multimedia presentation specified using a markup language, wherein the multimedia presentation includes at least one scene description and at least one scene update, and wherein the packet stream includes scene packets, each of which contains information derived from either one of the at least one scene description or one of the at least one scene update. 11. The computer program product of claim 10, wherein each scene packet includes priority information for the content contained within the scene packet. 12. The computer program product of claim 11, wherein each scene packet includes sequence information relative to the priority information for the scene packet. 13. The computer program product of claim 10, wherein the multimedia presentation includes SVG. 14. The computer program product of claim 10, wherein the packet stream comprises a plurality of real time transfer protocol packets. 15. The computer program product of claim 10, further comprising computer code for transmitting embedded static media outside of the packet stream. 16. The computer program product of claim 15, wherein the embedded static media is transmitted via FLUTE. 17. The computer program product of claim 15, further comprising computer code for transmitting embedded dynamic media through a plurality of real time transport protocol connections. 18. The computer program product of claim 10, wherein each scene packet includes a type field indicative of the content of the scene packet. 19. An electronic device, comprising:
a processor; and a memory unit operatively connected to the processor and including computer code for transmitting a signal to a client device, the signal carrying in a packet stream a multimedia presentation specified using a markup language, wherein the multimedia presentation includes at least one scene description and at least one scene update, and wherein the packet stream includes scene packets, each of which contains information derived from either one of the at least one scene description or one of the at least one scene update, 20. The electronic device of claim 19, wherein each scene packet includes priority information for the content contained within the scene packet. | 2,400 |
7,644 | 7,644 | 14,481,352 | 2,458 | A device may determine a performance metric associated with a network service management process. The device may determine a key question that may identify a business issue associated with improving the performance metric. The device may perform a root cause analysis that identifies a solution to the key question. The solution may identify a manner in which the network service management process is to be modified in order to improve the performance metric. The device may forecast, based on the solution, a network service demand that may identify a quantity of expected future network service actions expected based on implementing the solution. The device may perform, based on the forecasted network service demand, capacity planning that may identify network service resources required to satisfy the forecasted network service demand. The device may schedule the network service resources such that the solution is implemented within the network service management process. | 1. A device, comprising:
one or more processors to:
determine a performance metric associated with a network service management process,
the performance metric being determined based on network service information associated with the network service management process;
determine a key question, associated with the performance metric, based on determining the performance metric,
the key question identifying a business issue associated with improving the performance metric;
perform a root cause analysis, associated with the key question, that identifies a solution to the key question,
the solution identifying a manner in which the network service management process is to be modified in order to improve the performance metric;
forecast a network service demand based on the solution to the key question,
the forecasted network service demand identifying a quantity of future network service actions expected based on implementing the solution within the network service management process;
perform capacity planning based on the forecasted network service demand,
a result of performing the capacity planning identifying network service resources required to satisfy the forecasted network service demand; and
schedule the network service resources, based on the result of performing capacity planning, such that the solution is implemented within the network service management process. 2. The device of claim 1, where the one or more processors are further to:
receive information indicating that the key question corresponds to the performance metric; and where the one or more processors, when determining the key question, are further to:
determine the key question based on the information indicating that the key question corresponds to the performance metric. 3. The device of claim 1, where the one or more processors, when performing the root cause analysis that identifies the solution to the key question, are to:
determine an issue tree, corresponding to the key question, that includes a hypothesis associated with the key question; validate the hypothesis based on a statistical analysis of the network service information; and identify the solution to the key question based on validating the hypothesis. 4. The device of claim 3, where the one or more processors are further to:
receive information indicating that the issue tree corresponds to the key question; and where the one or more processors, when determining the issue tree, are further to:
determine the issue tree based on the information indicating that the issue tree corresponds to the key question. 5. The device of claim 1, where the one or more processors, when performing the root cause analysis that identifies the solution to the key question, are further to:
perform a simulation associated with the solution,
a result of the simulation identifying a financial impact associated with implementing the solution within the network service management process; and
provide the result of the simulation,
the result being provided to permit a user, associated with the network service management process, to view the result of the simulation. 6. The device of claim 1, where the one or more processors, when performing the root cause analysis, associated with the key question, are to:
identify a first potential solution to the key question; perform a first simulation associated with the first potential solution,
a result of the first simulation identifying a financial impact associated with implementing the first potential solution within the network service management process;
identify a second potential solution to the key question; perform a second simulation associated with the second potential solution,
a result of the second simulation identifying a financial impact associated with implementing the second potential solution within the network service management process;
compare the financial impact associated with implementing the first potential solution to the financial impact associated with implementing the second potential solution; and identify the solution to the key question based on comparing the financial impact associated with implementing the first potential solution to the financial impact associated with implementing the second potential solution,
the solution being the first potential solution or the second potential solution. 7. The device of claim 1, where the one or more processors, when forecasting the network service demand, are to:
determine a group of forecast models associated with forecasting the network service demand; identify, based on the network service information, a particular forecast model of the group of forecast models; and forecast the network service demand using the particular forecast model. 8. A method, comprising:
determining, by a device, a performance metric associated with a network service management process,
the performance metric being determined based on network service information associated with the network service management process;
identifying, by the device and based on determining the performance metric, a key question associated with the performance metric,
the key question identifying a business issue associated with improving the performance metric;
identifying, by the device, an issue tree associated with the key question,
the issue tree including a set of hypotheses associated with the key question;
validating, by the device, a hypothesis, of the set of hypotheses, based on the network service information; determining, by the device, a solution to the key question based on validating the hypothesis,
the solution identifying a manner in which the network service management process is to be modified in order to improve the performance metric; and
performing, by the device, a simulation associated with the solution,
a result of the simulation including financial information associated with implementing the solution within the network service management process; and
outputting the result of the simulation. 9. The method of claim 8, where the hypothesis is a first hypothesis, the solution is a first solution, and the simulation is a first simulation;
where the method further comprises:
validating a second hypothesis, of the set of hypotheses, based on the network service information;
determining a second solution to the key question based on validating the second hypothesis,
the second solution identifying another manner in which the network service management process is to be modified in order to improve the performance metric; and
performing a second simulation associated with the second solution,
a result of the second simulation identifying financial information associated with implementing the second solution within the network service management process. 10. The method of claim 9, further comprising:
comparing the result of the first simulation to the result of the second simulation; identifying a preferred solution based on comparing the result of the first simulation to the result of the second simulation,
the preferred solution being the first solution or the second solution; and
provide information that identifies the preferred solution. 11. The method of claim 8, where the issue tree comprises:
a set of first level queries associated with the key question; and multiple sets of second level queries,
a set of second level queries, of the multiple sets of second level queries, corresponding to a first level query of the set of first level queries, and
a second level query, included in the set of second level queries, being associated with one or more hypotheses of the set of hypotheses. 12. The method of claim 8, where validating the hypothesis further comprises:
performing a statistical analysis based on the network performance information; and validating the hypothesis based on performing the statistical analysis. 13. The method of claim 8, where performing the simulation comprises:
performing a break-even analysis associated with the solution; performing a regression analysis associated with the solution; or determining a financial impact associated with the solution. 14. The method of claim 8, where outputting the result of the simulation further comprises:
providing the result of the simulation,
the result being provided to permit a user, associated with the network service management process, to view the result of the simulation. 15. A method, comprising:
generating, by a device, a report associated with a network service management process,
the report including information associated with a performance metric associated with the network service management process,
the performance metric being based on network service information associated with the network service management process;
determining, by the device, a key question, associated with the performance metric, based on generating the report,
the key question identifying a business issue associated with improving the performance metric;
determining, by the device, an issue tree, corresponding to the key question, that includes a hypothesis associated with the key question; validating, by the device, the hypothesis,
the hypothesis being validated based on a statistical analysis of the network service information;
identifying, by the device, a solution to the key question based on validating the hypothesis,
the solution identifying a manner in which the network service management process is to be modified in order to improve the performance metric;
forecasting, by the device, a network service demand based on the solution to the key question,
the forecasted network service demand identifying a quantity of future network service actions expected based on implementing the solution within the network service management process;
performing, by the device, capacity planning based on the forecasted network service demand,
a result of performing capacity planning identifying network service resources to satisfy the forecasted network service demand; and
scheduling, by the device, the network service resources such that the solution is implemented within the network service management process. 16. The method of claim 15, further comprising:
receiving information indicating that the key question corresponds to the performance metric; and where determining the key question further comprises:
determining the key question based on the information indicating that the key question corresponds to the performance metric. 17. The method of claim 15, where the issue tree comprises:
a set of first level queries associated with the key question; and multiple sets of second level queries,
a set of second level queries, of the multiple sets of second level queries, corresponding to a first level query of the set of first level queries, and
a second level query, included in the set of second level queries, being associated with one or more hypotheses of the set of hypotheses. 18. The method of claim 15, further comprising:
performing a simulation associated with the solution,
a result of the simulation identifying information associated with implementing the solution within the network service management process; and
providing the result of the simulation,
the result being provided to permit a user, associated with the network service management process, to view the result of the simulation. 19. The method of claim 18, where performing the simulation comprises:
performing a break-even analysis associated with the solution; performing a regression analysis associated with the solution; or determining a financial impact associated with the solution. 20. The method of claim 15, where forecasting the network service demand further comprises:
determining a group of forecast models associated with forecasting the network service demand; identifying, based the network service information, a best-fit forecast model of the group of forecast models; and forecasting the network service demand using the best-fit forecast model. | A device may determine a performance metric associated with a network service management process. The device may determine a key question that may identify a business issue associated with improving the performance metric. The device may perform a root cause analysis that identifies a solution to the key question. The solution may identify a manner in which the network service management process is to be modified in order to improve the performance metric. The device may forecast, based on the solution, a network service demand that may identify a quantity of expected future network service actions expected based on implementing the solution. The device may perform, based on the forecasted network service demand, capacity planning that may identify network service resources required to satisfy the forecasted network service demand. The device may schedule the network service resources such that the solution is implemented within the network service management process.1. A device, comprising:
one or more processors to:
determine a performance metric associated with a network service management process,
the performance metric being determined based on network service information associated with the network service management process;
determine a key question, associated with the performance metric, based on determining the performance metric,
the key question identifying a business issue associated with improving the performance metric;
perform a root cause analysis, associated with the key question, that identifies a solution to the key question,
the solution identifying a manner in which the network service management process is to be modified in order to improve the performance metric;
forecast a network service demand based on the solution to the key question,
the forecasted network service demand identifying a quantity of future network service actions expected based on implementing the solution within the network service management process;
perform capacity planning based on the forecasted network service demand,
a result of performing the capacity planning identifying network service resources required to satisfy the forecasted network service demand; and
schedule the network service resources, based on the result of performing capacity planning, such that the solution is implemented within the network service management process. 2. The device of claim 1, where the one or more processors are further to:
receive information indicating that the key question corresponds to the performance metric; and where the one or more processors, when determining the key question, are further to:
determine the key question based on the information indicating that the key question corresponds to the performance metric. 3. The device of claim 1, where the one or more processors, when performing the root cause analysis that identifies the solution to the key question, are to:
determine an issue tree, corresponding to the key question, that includes a hypothesis associated with the key question; validate the hypothesis based on a statistical analysis of the network service information; and identify the solution to the key question based on validating the hypothesis. 4. The device of claim 3, where the one or more processors are further to:
receive information indicating that the issue tree corresponds to the key question; and where the one or more processors, when determining the issue tree, are further to:
determine the issue tree based on the information indicating that the issue tree corresponds to the key question. 5. The device of claim 1, where the one or more processors, when performing the root cause analysis that identifies the solution to the key question, are further to:
perform a simulation associated with the solution,
a result of the simulation identifying a financial impact associated with implementing the solution within the network service management process; and
provide the result of the simulation,
the result being provided to permit a user, associated with the network service management process, to view the result of the simulation. 6. The device of claim 1, where the one or more processors, when performing the root cause analysis, associated with the key question, are to:
identify a first potential solution to the key question; perform a first simulation associated with the first potential solution,
a result of the first simulation identifying a financial impact associated with implementing the first potential solution within the network service management process;
identify a second potential solution to the key question; perform a second simulation associated with the second potential solution,
a result of the second simulation identifying a financial impact associated with implementing the second potential solution within the network service management process;
compare the financial impact associated with implementing the first potential solution to the financial impact associated with implementing the second potential solution; and identify the solution to the key question based on comparing the financial impact associated with implementing the first potential solution to the financial impact associated with implementing the second potential solution,
the solution being the first potential solution or the second potential solution. 7. The device of claim 1, where the one or more processors, when forecasting the network service demand, are to:
determine a group of forecast models associated with forecasting the network service demand; identify, based on the network service information, a particular forecast model of the group of forecast models; and forecast the network service demand using the particular forecast model. 8. A method, comprising:
determining, by a device, a performance metric associated with a network service management process,
the performance metric being determined based on network service information associated with the network service management process;
identifying, by the device and based on determining the performance metric, a key question associated with the performance metric,
the key question identifying a business issue associated with improving the performance metric;
identifying, by the device, an issue tree associated with the key question,
the issue tree including a set of hypotheses associated with the key question;
validating, by the device, a hypothesis, of the set of hypotheses, based on the network service information; determining, by the device, a solution to the key question based on validating the hypothesis,
the solution identifying a manner in which the network service management process is to be modified in order to improve the performance metric; and
performing, by the device, a simulation associated with the solution,
a result of the simulation including financial information associated with implementing the solution within the network service management process; and
outputting the result of the simulation. 9. The method of claim 8, where the hypothesis is a first hypothesis, the solution is a first solution, and the simulation is a first simulation;
where the method further comprises:
validating a second hypothesis, of the set of hypotheses, based on the network service information;
determining a second solution to the key question based on validating the second hypothesis,
the second solution identifying another manner in which the network service management process is to be modified in order to improve the performance metric; and
performing a second simulation associated with the second solution,
a result of the second simulation identifying financial information associated with implementing the second solution within the network service management process. 10. The method of claim 9, further comprising:
comparing the result of the first simulation to the result of the second simulation; identifying a preferred solution based on comparing the result of the first simulation to the result of the second simulation,
the preferred solution being the first solution or the second solution; and
provide information that identifies the preferred solution. 11. The method of claim 8, where the issue tree comprises:
a set of first level queries associated with the key question; and multiple sets of second level queries,
a set of second level queries, of the multiple sets of second level queries, corresponding to a first level query of the set of first level queries, and
a second level query, included in the set of second level queries, being associated with one or more hypotheses of the set of hypotheses. 12. The method of claim 8, where validating the hypothesis further comprises:
performing a statistical analysis based on the network performance information; and validating the hypothesis based on performing the statistical analysis. 13. The method of claim 8, where performing the simulation comprises:
performing a break-even analysis associated with the solution; performing a regression analysis associated with the solution; or determining a financial impact associated with the solution. 14. The method of claim 8, where outputting the result of the simulation further comprises:
providing the result of the simulation,
the result being provided to permit a user, associated with the network service management process, to view the result of the simulation. 15. A method, comprising:
generating, by a device, a report associated with a network service management process,
the report including information associated with a performance metric associated with the network service management process,
the performance metric being based on network service information associated with the network service management process;
determining, by the device, a key question, associated with the performance metric, based on generating the report,
the key question identifying a business issue associated with improving the performance metric;
determining, by the device, an issue tree, corresponding to the key question, that includes a hypothesis associated with the key question; validating, by the device, the hypothesis,
the hypothesis being validated based on a statistical analysis of the network service information;
identifying, by the device, a solution to the key question based on validating the hypothesis,
the solution identifying a manner in which the network service management process is to be modified in order to improve the performance metric;
forecasting, by the device, a network service demand based on the solution to the key question,
the forecasted network service demand identifying a quantity of future network service actions expected based on implementing the solution within the network service management process;
performing, by the device, capacity planning based on the forecasted network service demand,
a result of performing capacity planning identifying network service resources to satisfy the forecasted network service demand; and
scheduling, by the device, the network service resources such that the solution is implemented within the network service management process. 16. The method of claim 15, further comprising:
receiving information indicating that the key question corresponds to the performance metric; and where determining the key question further comprises:
determining the key question based on the information indicating that the key question corresponds to the performance metric. 17. The method of claim 15, where the issue tree comprises:
a set of first level queries associated with the key question; and multiple sets of second level queries,
a set of second level queries, of the multiple sets of second level queries, corresponding to a first level query of the set of first level queries, and
a second level query, included in the set of second level queries, being associated with one or more hypotheses of the set of hypotheses. 18. The method of claim 15, further comprising:
performing a simulation associated with the solution,
a result of the simulation identifying information associated with implementing the solution within the network service management process; and
providing the result of the simulation,
the result being provided to permit a user, associated with the network service management process, to view the result of the simulation. 19. The method of claim 18, where performing the simulation comprises:
performing a break-even analysis associated with the solution; performing a regression analysis associated with the solution; or determining a financial impact associated with the solution. 20. The method of claim 15, where forecasting the network service demand further comprises:
determining a group of forecast models associated with forecasting the network service demand; identifying, based the network service information, a best-fit forecast model of the group of forecast models; and forecasting the network service demand using the best-fit forecast model. | 2,400 |
7,645 | 7,645 | 14,236,920 | 2,416 | A connection request is received from a remote terminal of a radio communications system at a serving node of the radio communications system. Mobility information is requested ( 230 ) from the remote terminal based on receiving ( 200 ) the connection request. The requested mobility information is received ( 240 ) from the remote terminal, and the requested connection is established ( 250 ) with the remote terminal. | 1-19. (canceled) 20. A method, implemented in a serving node of a radio communications system, for receiving mobility information from a remote terminal, wherein the serving node is configured to establish connection with a plurality of remote terminals through radio links and the method comprises:
receiving a connection request from the remote terminal; requesting mobility information from the remote terminal in response to receiving the connection request; receiving the requested mobility information from the remote terminal; and establishing the requested connection with the remote terminal. 21. The method of claim 20, wherein receiving the connection request comprises receiving an RRC Connection Request message. 22. The method of claim 20, wherein requesting mobility information comprises requesting an estimated mobility state. 23. The method of claim 22, wherein the estimated mobility state is a mobility state estimated by the remote terminal when the remote terminal was in an idle mode. 24. The method of claim 22, wherein requesting the estimated mobility state comprises sending a Measurement Control message to the remote terminal. 25. The method of claim 22, wherein requesting the estimated mobility state comprises requesting a UE (User Equipment) information message that includes radio access capabilities of the remote terminal for different radio frequency band classes. 26. The method of claim 20, wherein requesting mobility information comprises requesting a horizontal Velocity UE (User Equipment) information element from the remote terminal. 27. The method of claim 20, wherein receiving the requested mobility information comprises receiving an estimate made by the remote terminal of a speed of movement of the remote terminal. 28. The method of claim 20, wherein receiving a connection request comprises recovering through a radio link, the method further comprising:
measuring a quality of a radio link with the remote terminal based on the received connection request; determining whether availability of the radio link is good by comparing a signal to noise ratio of the received connection request to a threshold; and wherein requesting mobility information comprises requesting mobility information only if the radio link has sufficient quality. 29. The method of claim 20, further comprising:
receiving mobility information from a plurality of other remote terminals; and combining the received mobility information from the remote terminal with the received mobility information from the plurality of other remote terminals. 30. A serving node of a radio communications system configured to communicate packet data with a plurality of remote terminals and to obtain mobility information from a remote terminal, the serving node comprising:
a receiver configured to receive a connection request from a remote terminal; a transmitter configured to transmit a request for mobility information from the remote terminal in response to receiving the connection request; the receiver further configured to receive the requested mobility information from the remote terminal; and a controller to establish the requested connection with the remote terminal. 31. The serving node of claim 30, wherein the requested mobility information comprises an estimate made by the remote terminal of a speed of movement of the remote terminal. 32. The serving node of claim 30, wherein the receiver is further to receive requested mobility information from other remote terminals and wherein the controller combines the received mobility information received from the other remote terminals. 33. A method, implemented in a remote terminal of a radio communications system, for sending mobility information to a serving node, wherein the remote terminal is operative to request connection with one of a plurality of serving nodes through radio links and the method comprises:
determining mobility information in an idle mode at the remote terminal; sending a connection request to the serving node; receiving a request for mobility information from the serving node in response to sending the connection request; and sending the mobility information to the serving node in response to the request for mobility information. 34. The method of claim 33, wherein sending mobility information comprises sending an estimated mobility state. 35. The method of claim 33, wherein sending mobility information comprises sending a horizontal Velocity UE (User Equipment) information element determined by the remote terminal. 36. The method of claim 33, wherein sending the connection request comprises sending an RRC Connection Request message, 37. The method of claim 33, further comprising establishing a connection with the serving node. 38. A remote terminal of a radio communications system configured to communicate packet data with one of a plurality of serving nodes and to send mobility information to a serving node, the remote terminal comprising:
a controller configured to determine mobility information in an idle mode at the remote terminal; a transmitter configured to send a connection request to the serving node; and a receiver configured to receive a request for mobility information from the serving node in response to sending the connection request; the transmitter further configured to send the estimated mobility information to the serving node in response to the request for mobility information. | A connection request is received from a remote terminal of a radio communications system at a serving node of the radio communications system. Mobility information is requested ( 230 ) from the remote terminal based on receiving ( 200 ) the connection request. The requested mobility information is received ( 240 ) from the remote terminal, and the requested connection is established ( 250 ) with the remote terminal.1-19. (canceled) 20. A method, implemented in a serving node of a radio communications system, for receiving mobility information from a remote terminal, wherein the serving node is configured to establish connection with a plurality of remote terminals through radio links and the method comprises:
receiving a connection request from the remote terminal; requesting mobility information from the remote terminal in response to receiving the connection request; receiving the requested mobility information from the remote terminal; and establishing the requested connection with the remote terminal. 21. The method of claim 20, wherein receiving the connection request comprises receiving an RRC Connection Request message. 22. The method of claim 20, wherein requesting mobility information comprises requesting an estimated mobility state. 23. The method of claim 22, wherein the estimated mobility state is a mobility state estimated by the remote terminal when the remote terminal was in an idle mode. 24. The method of claim 22, wherein requesting the estimated mobility state comprises sending a Measurement Control message to the remote terminal. 25. The method of claim 22, wherein requesting the estimated mobility state comprises requesting a UE (User Equipment) information message that includes radio access capabilities of the remote terminal for different radio frequency band classes. 26. The method of claim 20, wherein requesting mobility information comprises requesting a horizontal Velocity UE (User Equipment) information element from the remote terminal. 27. The method of claim 20, wherein receiving the requested mobility information comprises receiving an estimate made by the remote terminal of a speed of movement of the remote terminal. 28. The method of claim 20, wherein receiving a connection request comprises recovering through a radio link, the method further comprising:
measuring a quality of a radio link with the remote terminal based on the received connection request; determining whether availability of the radio link is good by comparing a signal to noise ratio of the received connection request to a threshold; and wherein requesting mobility information comprises requesting mobility information only if the radio link has sufficient quality. 29. The method of claim 20, further comprising:
receiving mobility information from a plurality of other remote terminals; and combining the received mobility information from the remote terminal with the received mobility information from the plurality of other remote terminals. 30. A serving node of a radio communications system configured to communicate packet data with a plurality of remote terminals and to obtain mobility information from a remote terminal, the serving node comprising:
a receiver configured to receive a connection request from a remote terminal; a transmitter configured to transmit a request for mobility information from the remote terminal in response to receiving the connection request; the receiver further configured to receive the requested mobility information from the remote terminal; and a controller to establish the requested connection with the remote terminal. 31. The serving node of claim 30, wherein the requested mobility information comprises an estimate made by the remote terminal of a speed of movement of the remote terminal. 32. The serving node of claim 30, wherein the receiver is further to receive requested mobility information from other remote terminals and wherein the controller combines the received mobility information received from the other remote terminals. 33. A method, implemented in a remote terminal of a radio communications system, for sending mobility information to a serving node, wherein the remote terminal is operative to request connection with one of a plurality of serving nodes through radio links and the method comprises:
determining mobility information in an idle mode at the remote terminal; sending a connection request to the serving node; receiving a request for mobility information from the serving node in response to sending the connection request; and sending the mobility information to the serving node in response to the request for mobility information. 34. The method of claim 33, wherein sending mobility information comprises sending an estimated mobility state. 35. The method of claim 33, wherein sending mobility information comprises sending a horizontal Velocity UE (User Equipment) information element determined by the remote terminal. 36. The method of claim 33, wherein sending the connection request comprises sending an RRC Connection Request message, 37. The method of claim 33, further comprising establishing a connection with the serving node. 38. A remote terminal of a radio communications system configured to communicate packet data with one of a plurality of serving nodes and to send mobility information to a serving node, the remote terminal comprising:
a controller configured to determine mobility information in an idle mode at the remote terminal; a transmitter configured to send a connection request to the serving node; and a receiver configured to receive a request for mobility information from the serving node in response to sending the connection request; the transmitter further configured to send the estimated mobility information to the serving node in response to the request for mobility information. | 2,400 |
7,646 | 7,646 | 13,693,479 | 2,493 | A technique to enforce mobile device security policy is based on a “risk profile” of the individual device, where the risk profile is fine-grained and based on the types of applications installed on the device, the services they are accessing, and the operation(s) the user granted the device authorization to perform. Thus, the approach takes into account not only the actual applications installed on the device (and those actively in use), but also the services those applications are accessing, and the scope of operations the user has granted the device authorization to perform. By combining this information to create the risk profile, a suitable security policy, including one that does not unnecessarily degrade device usability, may then be applied. | 1. A method to enforce an enterprise security policy when a request for access to a service is initiated at a mobile device, comprising:
responsive to a user authentication that grants an authorization to the mobile device to access the service, providing a notification to the mobile device that a security policy associated with the mobile device has changed to require at least one additional security constraint; responsive to receiving a notification from the mobile device that the additional security constraint has been met, providing an authorization token to the mobile device; responsive to receipt of the authorization token, determining whether the authorization token is valid; and responsive to a determination that the authorization token is valid and that the changed security policy is in force at the mobile device, permitting access to the service. 2. The method as described in claim 1 wherein the determination that the changed security policy is in force at the mobile device further includes:
verifying whether the user has complied with the security policy as changed to reflect the additional security constraint for this service access. 3. The method as described in claim 1 wherein the determination that the changed security policy is in force at the mobile device further includes:
contacting a security policy agent associated with the mobile device to query whether the security policy associated with the authorization and that is bound to the authorization token has been enforced for this particular access to the service; and
receiving an affirmative response to the query. 4. The method as described in claim 1 further including denying access to the service if the changed security policy is not in force at the mobile device. 5. The method as described in claim 4 further including revoking the authorization token. 6. The method as described in claim 1 further including maintaining a mapping that associates a service and its authorization scope to a security policy requirement level that defines one or more security policy requirements for the mobile device. 7. The method as described in claim 6 further including providing the mobile device with the one or more security policy requirements. 8. Apparatus to enforce an enterprise security policy when a request for access to a service is initiated at a mobile device, comprising:
a processor; computer memory holding computer program instructions that when executed by the processor perform a method, the method comprising:
responsive to a user authentication that grants an authorization to the mobile device to access the service, providing a notification to the mobile device that a security policy associated with the mobile device has changed to require at least one additional security constraint;
responsive to receiving a notification from the mobile device that the additional security constraint has been met, providing an authorization token to the mobile device;
responsive to receipt of the authorization token, determining whether the authorization token is valid; and
responsive to a determination that the authorization token is valid and that the changed security policy is in force at the mobile device, permitting access to the service. 9. The apparatus as described in claim 8 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
verifying whether the user has complied with the security policy as changed to reflect the additional security constraint for this service access. 10. The apparatus as described in claim 8 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
contacting a security policy agent associated with the mobile device to query whether the security policy associated with the authorization and that is bound to the authorization token has been enforced for this particular access to the service; and
receiving an affirmative response to the query. 11. The apparatus as described in claim 8 wherein the method further includes denying access to the service if the changed security policy is not in force at the mobile device. 12. The apparatus as described in claim 11 wherein the method further includes revoking the authorization token. 13. The apparatus as described in claim 8 wherein the method further includes maintaining a mapping that associates a service and its authorization scope to a security policy requirement level that defines one or more security policy requirements for the mobile device. 14. The apparatus as described in claim 13 wherein the method further includes providing the mobile device with the one or more security policy requirements. 15. A computer program product in a non-transitory computer readable storage medium for use in a data processing system, the computer program product holding computer program instructions which, when executed by the data processing system, perform a method to enforce an enterprise security policy when a request for access to a service is initiated at a mobile device, the method comprising:
responsive to a user authentication that grants an authorization to the mobile device to access the service, providing a notification to the mobile device that a security policy associated with the mobile device has changed to require at least one additional security constraint; responsive to receiving a notification from the mobile device that the additional security constraint has been met, providing an authorization token to the mobile device; responsive to receipt of the authorization token, determining whether the authorization token is valid; and responsive to a determination that the authorization token is valid and that the changed security policy is in force at the mobile device, permitting access to the service. 16. The computer program product as described in claim 15 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
verifying whether the user has complied with the security policy as changed to reflect the additional security constraint for this service access. 17. The computer program product as described in claim 15 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
contacting a security policy agent associated with the mobile device to query whether the security policy associated with the authorization and that is bound to the authorization token has been enforced for this particular access to the service; and
receiving an affirmative response to the query. 18. The computer program product as described in claim 15 wherein the method further includes denying access to the service if the changed security policy is not in force at the mobile device. 19. The computer program product as described in claim 18 wherein the method further includes revoking the authorization token. 20. The computer program product as described in claim 15 wherein the method further includes maintaining a mapping that associates a service and its authorization scope to a security policy requirement level that defines one or more security policy requirements for the mobile device. 21. The computer program product as described in claim 21 wherein the method further includes providing the mobile device with the one or more security policy requirements. 22. A mobile device, comprising:
a hardware processor; computer memory; a mobile application adapted to request a service to a secure back-end application, the mobile application prompting a user to perform an authentication to grant an authorization to the mobile device to access the service; and a security policy enforcement agent executed by the hardware processor and responsive to a successful authentication for receiving a notification that a security policy associated with the mobile device has changed to require at least one additional security constraint, the security policy enforcement agent enforcing the changed security policy to enable the mobile application to obtain access to the service. 23. The mobile device as described in claim 22 wherein the security policy enforcement agent enforces the changed security policy by providing determining whether the at least one additional security constraint has been met and, if so, receiving an authorization token that is bound to the authorization. 24. The mobile device as described in claim 23 wherein the mobile application forwards the authorization token for verification. | A technique to enforce mobile device security policy is based on a “risk profile” of the individual device, where the risk profile is fine-grained and based on the types of applications installed on the device, the services they are accessing, and the operation(s) the user granted the device authorization to perform. Thus, the approach takes into account not only the actual applications installed on the device (and those actively in use), but also the services those applications are accessing, and the scope of operations the user has granted the device authorization to perform. By combining this information to create the risk profile, a suitable security policy, including one that does not unnecessarily degrade device usability, may then be applied.1. A method to enforce an enterprise security policy when a request for access to a service is initiated at a mobile device, comprising:
responsive to a user authentication that grants an authorization to the mobile device to access the service, providing a notification to the mobile device that a security policy associated with the mobile device has changed to require at least one additional security constraint; responsive to receiving a notification from the mobile device that the additional security constraint has been met, providing an authorization token to the mobile device; responsive to receipt of the authorization token, determining whether the authorization token is valid; and responsive to a determination that the authorization token is valid and that the changed security policy is in force at the mobile device, permitting access to the service. 2. The method as described in claim 1 wherein the determination that the changed security policy is in force at the mobile device further includes:
verifying whether the user has complied with the security policy as changed to reflect the additional security constraint for this service access. 3. The method as described in claim 1 wherein the determination that the changed security policy is in force at the mobile device further includes:
contacting a security policy agent associated with the mobile device to query whether the security policy associated with the authorization and that is bound to the authorization token has been enforced for this particular access to the service; and
receiving an affirmative response to the query. 4. The method as described in claim 1 further including denying access to the service if the changed security policy is not in force at the mobile device. 5. The method as described in claim 4 further including revoking the authorization token. 6. The method as described in claim 1 further including maintaining a mapping that associates a service and its authorization scope to a security policy requirement level that defines one or more security policy requirements for the mobile device. 7. The method as described in claim 6 further including providing the mobile device with the one or more security policy requirements. 8. Apparatus to enforce an enterprise security policy when a request for access to a service is initiated at a mobile device, comprising:
a processor; computer memory holding computer program instructions that when executed by the processor perform a method, the method comprising:
responsive to a user authentication that grants an authorization to the mobile device to access the service, providing a notification to the mobile device that a security policy associated with the mobile device has changed to require at least one additional security constraint;
responsive to receiving a notification from the mobile device that the additional security constraint has been met, providing an authorization token to the mobile device;
responsive to receipt of the authorization token, determining whether the authorization token is valid; and
responsive to a determination that the authorization token is valid and that the changed security policy is in force at the mobile device, permitting access to the service. 9. The apparatus as described in claim 8 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
verifying whether the user has complied with the security policy as changed to reflect the additional security constraint for this service access. 10. The apparatus as described in claim 8 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
contacting a security policy agent associated with the mobile device to query whether the security policy associated with the authorization and that is bound to the authorization token has been enforced for this particular access to the service; and
receiving an affirmative response to the query. 11. The apparatus as described in claim 8 wherein the method further includes denying access to the service if the changed security policy is not in force at the mobile device. 12. The apparatus as described in claim 11 wherein the method further includes revoking the authorization token. 13. The apparatus as described in claim 8 wherein the method further includes maintaining a mapping that associates a service and its authorization scope to a security policy requirement level that defines one or more security policy requirements for the mobile device. 14. The apparatus as described in claim 13 wherein the method further includes providing the mobile device with the one or more security policy requirements. 15. A computer program product in a non-transitory computer readable storage medium for use in a data processing system, the computer program product holding computer program instructions which, when executed by the data processing system, perform a method to enforce an enterprise security policy when a request for access to a service is initiated at a mobile device, the method comprising:
responsive to a user authentication that grants an authorization to the mobile device to access the service, providing a notification to the mobile device that a security policy associated with the mobile device has changed to require at least one additional security constraint; responsive to receiving a notification from the mobile device that the additional security constraint has been met, providing an authorization token to the mobile device; responsive to receipt of the authorization token, determining whether the authorization token is valid; and responsive to a determination that the authorization token is valid and that the changed security policy is in force at the mobile device, permitting access to the service. 16. The computer program product as described in claim 15 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
verifying whether the user has complied with the security policy as changed to reflect the additional security constraint for this service access. 17. The computer program product as described in claim 15 wherein the determination by the method that the changed security policy is in force at the mobile device further includes:
contacting a security policy agent associated with the mobile device to query whether the security policy associated with the authorization and that is bound to the authorization token has been enforced for this particular access to the service; and
receiving an affirmative response to the query. 18. The computer program product as described in claim 15 wherein the method further includes denying access to the service if the changed security policy is not in force at the mobile device. 19. The computer program product as described in claim 18 wherein the method further includes revoking the authorization token. 20. The computer program product as described in claim 15 wherein the method further includes maintaining a mapping that associates a service and its authorization scope to a security policy requirement level that defines one or more security policy requirements for the mobile device. 21. The computer program product as described in claim 21 wherein the method further includes providing the mobile device with the one or more security policy requirements. 22. A mobile device, comprising:
a hardware processor; computer memory; a mobile application adapted to request a service to a secure back-end application, the mobile application prompting a user to perform an authentication to grant an authorization to the mobile device to access the service; and a security policy enforcement agent executed by the hardware processor and responsive to a successful authentication for receiving a notification that a security policy associated with the mobile device has changed to require at least one additional security constraint, the security policy enforcement agent enforcing the changed security policy to enable the mobile application to obtain access to the service. 23. The mobile device as described in claim 22 wherein the security policy enforcement agent enforces the changed security policy by providing determining whether the at least one additional security constraint has been met and, if so, receiving an authorization token that is bound to the authorization. 24. The mobile device as described in claim 23 wherein the mobile application forwards the authorization token for verification. | 2,400 |
7,647 | 7,647 | 14,737,658 | 2,444 | Communication services enable users to communicate electronically over communication exchange channels using multiple modes of communication. Conversations between groups of users are common, where many communications may be exchanged repeatedly over a period of time. In some scenarios, a communication desired to be conveyed by a participant in a conversation may be a simple endorsement, such as receipt acknowledgment and various levels of social activity actions and/or gestures, which may be useful for other participants of the conversation to see as well. An endorsement indication based on the participant selected endorsement may be transmitted to the other participants of the conversation over a designated communication channel. The designated communication channel may be a control messaging channel in a transport layer of a communication service, for example, that is distinct from the communication exchange channels such that normal communication traffic may be unaffected by the distribution of the endorsement indication. | 1. A computing device to distribute endorsement indications in a communication environment, the computing device comprising:
a memory configured to store instructions; and one or more processors coupled to the memory that are configured to execute a communication service, wherein the communication service comprises:
a communication module configured to facilitate exchange of one or more communications within a conversation over one or more communication exchange channels;
an endorsement module configured to enable a recipient to select an endorsement for an exchanged communication; and
a transport module associated with the endorsement module, the transport module configured to:
detect the selection of the endorsement for the exchanged communication by the recipient;
transmit an endorsement indication based on the selected endorsement to a sender and one or more other recipients of the exchanged communication over a designated communication channel that is distinct from the one or more communication exchange channels; and
provide the endorsement indication as one of a message and a notification such that display of the endorsement indication is enabled through communication user experiences associated with the sender and the one or more other recipients of the exchanged communication. 2. The computing device of claim 1, wherein the exchanged communication is one or more of an email exchange, a meeting invite, a shared contact card, a shared task, a text message exchange, an online conference, an audio communication, a video communication, an application sharing session, a desktop sharing session, and a data sharing session. 3. The computing device of claim 1, wherein the endorsement is one or more of a receipt acknowledgement and a social activity action. 4. The computing device of claim 3, wherein the social activity action is one of a like, a dislike, and a mention. 5. The computing device of claim 4, wherein the like and dislike social activity actions include one or more respective levels of like and dislike. 6. The computing device of claim 1, wherein the endorsement indication includes one or more of the recipient, the selected endorsement, the exchanged communication, a group associated with the exchanged communication, and a time elapsed from the selection of the endorsement. 7. The computing device of claim 1, wherein the designated communication channel is a control messaging channel in a transport layer of the communication service. 8. A method executed on a computing device to distribute endorsement indications in a communication environment, the method comprising:
detecting a selection of an endorsement for an exchanged communication by a recipient of the exchanged communication; transmitting an endorsement indication based on the selected endorsement to a sender and one or more other recipients of the exchanged communication over a designated communication channel that is distinct from one or more communication exchange channels over which one or more communications, including the exchanged communication, are exchanged; providing the endorsement indication as one of a message and a notification such that display of the endorsement indication is enabled through communication user experiences associated with the sender and the one or more other recipients of the exchanged communication; and enabling removal of the endorsement indication by the sender or the one or more other recipients of the exchanged communication. 9. The method of claim 8, wherein transmitting the endorsement indication comprises:
transmitting the endorsement indication to one of individual mailboxes or a shared mailbox associated with the sender and the one or more other recipients. 10. The method of claim 9, further comprising:
storing the endorsement indication in a database associated with the one of the individual mailboxes or the shared mailbox associated with the sender and the one or more other recipients such that the endorsement indication is persisted. 11. The method of claim 10, further comprising:
aggregating the endorsement indication with one or more other endorsement indications for the exchanged communication within the database. 12. The method of claim 8, wherein transmitting the endorsement indication further comprises:
transmitting a control message to the sender and the one or more other recipients over the designated communication channel. 13. The method of claim 12, wherein the control message is distinct from the exchanged communication, and includes one or more instructions for an action to be performed and metadata associated with the action. 14. The method of claim 13, wherein the action to be performed is generation of the endorsement indication and the metadata includes information associated with the selected endorsement. 15. The method of claim 13, wherein the metadata includes one or more of an endorser, a type of the selected endorsement, the exchanged communication, a group associated with the exchanged communication, and a time of endorsement selection. 16. The method of claim 13, further comprising:
processing the metadata of the control message to generate the endorsement indication. 17. A system configured to distribute endorsement indications in a communication environment, the system comprising:
a first server associated with a recipient of an exchanged communication; a second server associated with one of a sender and one or more other recipients of the exchanged communication; and a transport module associated with at least one of the first server and the second server, the transport module configured to distribute an endorsement indication based on an endorsement for the communication selected by the recipient at the first server to the second server, the transport module comprising:
a sending component configured to transmit a control message to the second server over a designated communication channel, wherein the control message includes an instruction to generate the endorsement indication and metadata associated with the selected endorsement;
a receiving component configured to:
intercept the control message at the second server; and
process the metadata of the control message to generate the endorsement indication; and
a broker component configured to provide the endorsement indication as one of a message and a notification to a client of the second server such that a display of the endorsement indication is enabled for the one of the sender and the one or more other recipients of the exchanged communication. 18. The system of claim 17, wherein the receiving component is further configured to:
store the endorsement indication in a data store associated with the second server. 19. The system of claim 17, wherein the receiving component is a transport delivery agent. 20. The system of claim 17, wherein the first server and the second server are computing devices, each of the computing devices comprising at least a memory, one or more processors, and a communication module configured to facilitate exchange of one or more communications within a conversation over one or more communication exchange channels. | Communication services enable users to communicate electronically over communication exchange channels using multiple modes of communication. Conversations between groups of users are common, where many communications may be exchanged repeatedly over a period of time. In some scenarios, a communication desired to be conveyed by a participant in a conversation may be a simple endorsement, such as receipt acknowledgment and various levels of social activity actions and/or gestures, which may be useful for other participants of the conversation to see as well. An endorsement indication based on the participant selected endorsement may be transmitted to the other participants of the conversation over a designated communication channel. The designated communication channel may be a control messaging channel in a transport layer of a communication service, for example, that is distinct from the communication exchange channels such that normal communication traffic may be unaffected by the distribution of the endorsement indication.1. A computing device to distribute endorsement indications in a communication environment, the computing device comprising:
a memory configured to store instructions; and one or more processors coupled to the memory that are configured to execute a communication service, wherein the communication service comprises:
a communication module configured to facilitate exchange of one or more communications within a conversation over one or more communication exchange channels;
an endorsement module configured to enable a recipient to select an endorsement for an exchanged communication; and
a transport module associated with the endorsement module, the transport module configured to:
detect the selection of the endorsement for the exchanged communication by the recipient;
transmit an endorsement indication based on the selected endorsement to a sender and one or more other recipients of the exchanged communication over a designated communication channel that is distinct from the one or more communication exchange channels; and
provide the endorsement indication as one of a message and a notification such that display of the endorsement indication is enabled through communication user experiences associated with the sender and the one or more other recipients of the exchanged communication. 2. The computing device of claim 1, wherein the exchanged communication is one or more of an email exchange, a meeting invite, a shared contact card, a shared task, a text message exchange, an online conference, an audio communication, a video communication, an application sharing session, a desktop sharing session, and a data sharing session. 3. The computing device of claim 1, wherein the endorsement is one or more of a receipt acknowledgement and a social activity action. 4. The computing device of claim 3, wherein the social activity action is one of a like, a dislike, and a mention. 5. The computing device of claim 4, wherein the like and dislike social activity actions include one or more respective levels of like and dislike. 6. The computing device of claim 1, wherein the endorsement indication includes one or more of the recipient, the selected endorsement, the exchanged communication, a group associated with the exchanged communication, and a time elapsed from the selection of the endorsement. 7. The computing device of claim 1, wherein the designated communication channel is a control messaging channel in a transport layer of the communication service. 8. A method executed on a computing device to distribute endorsement indications in a communication environment, the method comprising:
detecting a selection of an endorsement for an exchanged communication by a recipient of the exchanged communication; transmitting an endorsement indication based on the selected endorsement to a sender and one or more other recipients of the exchanged communication over a designated communication channel that is distinct from one or more communication exchange channels over which one or more communications, including the exchanged communication, are exchanged; providing the endorsement indication as one of a message and a notification such that display of the endorsement indication is enabled through communication user experiences associated with the sender and the one or more other recipients of the exchanged communication; and enabling removal of the endorsement indication by the sender or the one or more other recipients of the exchanged communication. 9. The method of claim 8, wherein transmitting the endorsement indication comprises:
transmitting the endorsement indication to one of individual mailboxes or a shared mailbox associated with the sender and the one or more other recipients. 10. The method of claim 9, further comprising:
storing the endorsement indication in a database associated with the one of the individual mailboxes or the shared mailbox associated with the sender and the one or more other recipients such that the endorsement indication is persisted. 11. The method of claim 10, further comprising:
aggregating the endorsement indication with one or more other endorsement indications for the exchanged communication within the database. 12. The method of claim 8, wherein transmitting the endorsement indication further comprises:
transmitting a control message to the sender and the one or more other recipients over the designated communication channel. 13. The method of claim 12, wherein the control message is distinct from the exchanged communication, and includes one or more instructions for an action to be performed and metadata associated with the action. 14. The method of claim 13, wherein the action to be performed is generation of the endorsement indication and the metadata includes information associated with the selected endorsement. 15. The method of claim 13, wherein the metadata includes one or more of an endorser, a type of the selected endorsement, the exchanged communication, a group associated with the exchanged communication, and a time of endorsement selection. 16. The method of claim 13, further comprising:
processing the metadata of the control message to generate the endorsement indication. 17. A system configured to distribute endorsement indications in a communication environment, the system comprising:
a first server associated with a recipient of an exchanged communication; a second server associated with one of a sender and one or more other recipients of the exchanged communication; and a transport module associated with at least one of the first server and the second server, the transport module configured to distribute an endorsement indication based on an endorsement for the communication selected by the recipient at the first server to the second server, the transport module comprising:
a sending component configured to transmit a control message to the second server over a designated communication channel, wherein the control message includes an instruction to generate the endorsement indication and metadata associated with the selected endorsement;
a receiving component configured to:
intercept the control message at the second server; and
process the metadata of the control message to generate the endorsement indication; and
a broker component configured to provide the endorsement indication as one of a message and a notification to a client of the second server such that a display of the endorsement indication is enabled for the one of the sender and the one or more other recipients of the exchanged communication. 18. The system of claim 17, wherein the receiving component is further configured to:
store the endorsement indication in a data store associated with the second server. 19. The system of claim 17, wherein the receiving component is a transport delivery agent. 20. The system of claim 17, wherein the first server and the second server are computing devices, each of the computing devices comprising at least a memory, one or more processors, and a communication module configured to facilitate exchange of one or more communications within a conversation over one or more communication exchange channels. | 2,400 |
7,648 | 7,648 | 15,268,541 | 2,439 | An online file storage system having secure file drawer and safe is disclosed for securely storing and sharing confidential files. The system comprises a web-based user interface, tools for setting up server-side encryption method and client-side encryption method, tools for synchronizing encryption between different computers, tools for uploading files, tools for tracking files, tools for granting the right of access to files to the owner of other safes, and tools for generating authenticity certificate for proving the upload time and the substance of the files in a future time. | 1. A file storing system, comprising a server having a network interface, and at least one client computer having a network interface, both the server and the at least one client computer being connected to the Internet, the system comprising:
means for creating a user account as a safe by a first user by using safe name and password; means for encrypting a mark with an encryption key and saving the encrypted mark, known as E-mark, on the server; means for determining if an encryption algorithm and a key are compatible with the algorithm and the key used to encrypt the encrypted mark; means for generating a file-uploading form; means for uploading a file in the safe of the first user; means for encrypting the file on the server or the client computer by using one or two encryption keys; means for saving the uploaded and encrypted file along with tracking information on the server; means for showing the file among other files in the secure file drawer or the safe of the first user; means for showing any of the files and deleting any of the files in the secure file drawer and safe of the first user; and means for generating a file-downloading page for a selected file, decrypting the selected file on the server or the client computer by using user-provided key, and downloading the selected file to the client computer of the first user. 2. The system of claim 1 comprising means for selecting an encryption machine and means for saving the location information of the encryption key on the server so the server is able to generate a proper script for getting the encryption key on the client computer. 3. The system of claim 1 further comprising means for allowing the first user to get an authenticity certificate for each of the files in the safe of the first user, the authenticity certificate containing file uploading time, file size, and file description. 4. The system of claim 1 further comprising means for authorizing the safe of the second user to retrieve from the server an authenticity certificate for the at least one file of the safe of the first user or the means for sending an authenticity certificate to the second user by email. 5. The system of claim 1 further comprising means for making a file in the first safe to be globally accessible so that any user of the system can access it and any user having proper encryption key can decrypt and download the file. 6. The system of claim 2 further comprising means for granting right of access to at least one file in the safe of the first user to a safe of a second user, means for the second user to select a file from the at least one file of the safe of the first user, means for allowing the second user to provide proper encryption keys, means for decrypting the selected file on the server or the client computer, and means for downloading the selected file to the client computer of the second user. 7. The system of claim 6 further comprising means for allowing the second user to get an authenticity certificate for each of the files of the first user from the safe of the second user, the authenticity certificate containing file uploading time, file size, and file description. 8. The system of claim 1 further comprising means for downloading a program using an encryption algorithm for decrypting standalone files that have been encrypted using the same algorithm and encryption keys in uploading the files to the server. 9. The system of claim 1 further comprising means for ordering at least one hard copy file together with an authenticity certificate certifying the file description, uploading time, and file size. 10. A method of storing confidential files on a server and client system for future proof of the substance and creation time of the files, the method comprising the steps of:
creating a user account as a safe by a first user using a safe name and safe password; encrypting a mark with an encryption key and saving the encrypted mark, known as E-mark, on the server; determining if an encryption algorithm and a key are compatible with the algorithm and the key used to encrypt the encrypted mark; generating an uploading form by the server containing one or two input boxes for accepting an encryption key; uploading a file from the client computer of the first user; encrypting the file by using the one or two encryption keys that the first user has provided; saving the uploaded and encrypted file along with tracking information on the server; sending a file summary page to the client computer of the first user to display file information about the files in the safe of the first user, the file summary page containing file descriptions, uploading times and file sizes; displaying any of the files, and deleting any of the files in the safe of the first user; and generating a file-downloading page containing one or two input boxes for accepting an encryption key for a selected file, sending to the server proper encryption keys correspondent to the encryption keys used in encrypting the selected file during uploading, decrypting the selected file on the server or on the client computer using user-provided encryption keys, and downloading the selected file to the client computer of the first user. 11. The method of claim 10 further comprising the steps of granting right of access to at least one file of the safe of the first user to a safe of a second user, enabling the second user to access the file of the first user, decrypt the file, and download the file to the client computer of the second user. 12. The method of claim 10 further comprising a step of allowing the first user to get an authenticity certificate for any of the encrypted files in the safe of the first user, wherein the authenticity certificate contains file uploading time, file size, and file description. 13. The method of claim 11 further comprising a step of authorizing the safe of the second user to retrieve an authenticity certificate for the files of the first user or a step of sending the authenticity to the second user by email. 14. The method of claim 10 further comprising a step of making a file in the safe of the first user to be globally accessible so that any user of the system can access the file and any user having proper encryption keys can decrypt and download the file. 15. The method of claim 10 further comprising the means for setting client-side encryption method, means for encrypting a copy of the mark by an account password, saving the encrypted mark, which is known as R-mark, on the server, and means for determining if the client computer's encryption algorithm is common with the server's encryption algorithm by comparing a first mark decrypted from the E-mark with a second mark decrypted from the R-mark. 16. The method of claim 15 further comprising the steps of sending a verification page for verifying the encrypted file, prompting the first user to enter one or two encryption keys corresponding to the one or two encryption keys used in encrypting the file in uploading, sending the encryption keys to the server and decrypting the uploaded file on the server by using the received encryption keys, downloading the decrypted file to the client computer of the first user for inspection, and marking the uploaded file as a verified file upon successful verification feedback. 17. The method of claim 10 wherein the uploading form contains an input box for accepting a hint for each of the one or two encryption keys and the file-downloading page displays each hint that has been entered for each of the encryption keys and has been saved on the server. 18. The method of claim 10 further comprising a step of ordering by the second user hard copy files granted to the second user, together with an authenticity certificate certifying to? the file descriptions, uploading times, and file sizes. 19. A computer program product for use in operating file storage system comprising a server and at least one client computer, the computer program product comprising a computer usable medium having computer readable code embodied on the medium, the computer program code further comprising:
program code for creating a user account as a safe by using a safe name or account number and safe password; program code for encrypting a mark with an encryption key and saving the encrypted mark on the server; program code for determining if an encryption algorithm and a user-provided key are compatible with the algorithm and the key that have been used to encrypt the encrypted mark; program code for generating an uploading form; program code for uploading files to the server; program code for encrypting files on the server or on the client computer by using one or two encryption keys that the first user has provided; program code for saving the uploaded file with tracking information on the server; program code for sending a page for displaying the files, and deleting the files in any safe on the server; and program code for generating a file-downloading page containing one or two input boxes for accepting an encryption key for a selected file, decrypting the selected file using the encryption keys the first user has provided, and downloading the selected file to the client computer of the first user. 20. A computer program product of claim 19 further comprising program code for using an encryption algorithm for decrypting standalone files that have been encrypted using the same algorithm and encryption keys in uploading the files to the server. 21. A computer program product of claim 19 further comprising program code for using client-side encryption method, program code for creating a reference encrypted mark, and program code for determining if a client-side encryption algorithm is common as the encryption algorithm used by the server in creating the encrypted mark and the reference encrypted mark. 22. A computer program product of claim 20 further comprising program code for sending a verification page for testing an encrypted file, prompting the first user to enter one or two encryption keys correspondent to the keys used in uploading the file, sending the user-entered encryption keys to the server, downloading the decrypted file to the client computer of the first user for inspection, decrypting the uploaded file, prompting the first user to indicate if the uploaded file is good, and marking the uploaded file as a verified file upon successful verification feedback. 23. A computer program product of claim 19 further comprising program code for granting right of access to at least one file of the first user to a safe of a second user and program code for decrypting the file by the second user by using encryption keys, and downloading the at least one file to the client computer of the second user. | An online file storage system having secure file drawer and safe is disclosed for securely storing and sharing confidential files. The system comprises a web-based user interface, tools for setting up server-side encryption method and client-side encryption method, tools for synchronizing encryption between different computers, tools for uploading files, tools for tracking files, tools for granting the right of access to files to the owner of other safes, and tools for generating authenticity certificate for proving the upload time and the substance of the files in a future time.1. A file storing system, comprising a server having a network interface, and at least one client computer having a network interface, both the server and the at least one client computer being connected to the Internet, the system comprising:
means for creating a user account as a safe by a first user by using safe name and password; means for encrypting a mark with an encryption key and saving the encrypted mark, known as E-mark, on the server; means for determining if an encryption algorithm and a key are compatible with the algorithm and the key used to encrypt the encrypted mark; means for generating a file-uploading form; means for uploading a file in the safe of the first user; means for encrypting the file on the server or the client computer by using one or two encryption keys; means for saving the uploaded and encrypted file along with tracking information on the server; means for showing the file among other files in the secure file drawer or the safe of the first user; means for showing any of the files and deleting any of the files in the secure file drawer and safe of the first user; and means for generating a file-downloading page for a selected file, decrypting the selected file on the server or the client computer by using user-provided key, and downloading the selected file to the client computer of the first user. 2. The system of claim 1 comprising means for selecting an encryption machine and means for saving the location information of the encryption key on the server so the server is able to generate a proper script for getting the encryption key on the client computer. 3. The system of claim 1 further comprising means for allowing the first user to get an authenticity certificate for each of the files in the safe of the first user, the authenticity certificate containing file uploading time, file size, and file description. 4. The system of claim 1 further comprising means for authorizing the safe of the second user to retrieve from the server an authenticity certificate for the at least one file of the safe of the first user or the means for sending an authenticity certificate to the second user by email. 5. The system of claim 1 further comprising means for making a file in the first safe to be globally accessible so that any user of the system can access it and any user having proper encryption key can decrypt and download the file. 6. The system of claim 2 further comprising means for granting right of access to at least one file in the safe of the first user to a safe of a second user, means for the second user to select a file from the at least one file of the safe of the first user, means for allowing the second user to provide proper encryption keys, means for decrypting the selected file on the server or the client computer, and means for downloading the selected file to the client computer of the second user. 7. The system of claim 6 further comprising means for allowing the second user to get an authenticity certificate for each of the files of the first user from the safe of the second user, the authenticity certificate containing file uploading time, file size, and file description. 8. The system of claim 1 further comprising means for downloading a program using an encryption algorithm for decrypting standalone files that have been encrypted using the same algorithm and encryption keys in uploading the files to the server. 9. The system of claim 1 further comprising means for ordering at least one hard copy file together with an authenticity certificate certifying the file description, uploading time, and file size. 10. A method of storing confidential files on a server and client system for future proof of the substance and creation time of the files, the method comprising the steps of:
creating a user account as a safe by a first user using a safe name and safe password; encrypting a mark with an encryption key and saving the encrypted mark, known as E-mark, on the server; determining if an encryption algorithm and a key are compatible with the algorithm and the key used to encrypt the encrypted mark; generating an uploading form by the server containing one or two input boxes for accepting an encryption key; uploading a file from the client computer of the first user; encrypting the file by using the one or two encryption keys that the first user has provided; saving the uploaded and encrypted file along with tracking information on the server; sending a file summary page to the client computer of the first user to display file information about the files in the safe of the first user, the file summary page containing file descriptions, uploading times and file sizes; displaying any of the files, and deleting any of the files in the safe of the first user; and generating a file-downloading page containing one or two input boxes for accepting an encryption key for a selected file, sending to the server proper encryption keys correspondent to the encryption keys used in encrypting the selected file during uploading, decrypting the selected file on the server or on the client computer using user-provided encryption keys, and downloading the selected file to the client computer of the first user. 11. The method of claim 10 further comprising the steps of granting right of access to at least one file of the safe of the first user to a safe of a second user, enabling the second user to access the file of the first user, decrypt the file, and download the file to the client computer of the second user. 12. The method of claim 10 further comprising a step of allowing the first user to get an authenticity certificate for any of the encrypted files in the safe of the first user, wherein the authenticity certificate contains file uploading time, file size, and file description. 13. The method of claim 11 further comprising a step of authorizing the safe of the second user to retrieve an authenticity certificate for the files of the first user or a step of sending the authenticity to the second user by email. 14. The method of claim 10 further comprising a step of making a file in the safe of the first user to be globally accessible so that any user of the system can access the file and any user having proper encryption keys can decrypt and download the file. 15. The method of claim 10 further comprising the means for setting client-side encryption method, means for encrypting a copy of the mark by an account password, saving the encrypted mark, which is known as R-mark, on the server, and means for determining if the client computer's encryption algorithm is common with the server's encryption algorithm by comparing a first mark decrypted from the E-mark with a second mark decrypted from the R-mark. 16. The method of claim 15 further comprising the steps of sending a verification page for verifying the encrypted file, prompting the first user to enter one or two encryption keys corresponding to the one or two encryption keys used in encrypting the file in uploading, sending the encryption keys to the server and decrypting the uploaded file on the server by using the received encryption keys, downloading the decrypted file to the client computer of the first user for inspection, and marking the uploaded file as a verified file upon successful verification feedback. 17. The method of claim 10 wherein the uploading form contains an input box for accepting a hint for each of the one or two encryption keys and the file-downloading page displays each hint that has been entered for each of the encryption keys and has been saved on the server. 18. The method of claim 10 further comprising a step of ordering by the second user hard copy files granted to the second user, together with an authenticity certificate certifying to? the file descriptions, uploading times, and file sizes. 19. A computer program product for use in operating file storage system comprising a server and at least one client computer, the computer program product comprising a computer usable medium having computer readable code embodied on the medium, the computer program code further comprising:
program code for creating a user account as a safe by using a safe name or account number and safe password; program code for encrypting a mark with an encryption key and saving the encrypted mark on the server; program code for determining if an encryption algorithm and a user-provided key are compatible with the algorithm and the key that have been used to encrypt the encrypted mark; program code for generating an uploading form; program code for uploading files to the server; program code for encrypting files on the server or on the client computer by using one or two encryption keys that the first user has provided; program code for saving the uploaded file with tracking information on the server; program code for sending a page for displaying the files, and deleting the files in any safe on the server; and program code for generating a file-downloading page containing one or two input boxes for accepting an encryption key for a selected file, decrypting the selected file using the encryption keys the first user has provided, and downloading the selected file to the client computer of the first user. 20. A computer program product of claim 19 further comprising program code for using an encryption algorithm for decrypting standalone files that have been encrypted using the same algorithm and encryption keys in uploading the files to the server. 21. A computer program product of claim 19 further comprising program code for using client-side encryption method, program code for creating a reference encrypted mark, and program code for determining if a client-side encryption algorithm is common as the encryption algorithm used by the server in creating the encrypted mark and the reference encrypted mark. 22. A computer program product of claim 20 further comprising program code for sending a verification page for testing an encrypted file, prompting the first user to enter one or two encryption keys correspondent to the keys used in uploading the file, sending the user-entered encryption keys to the server, downloading the decrypted file to the client computer of the first user for inspection, decrypting the uploaded file, prompting the first user to indicate if the uploaded file is good, and marking the uploaded file as a verified file upon successful verification feedback. 23. A computer program product of claim 19 further comprising program code for granting right of access to at least one file of the first user to a safe of a second user and program code for decrypting the file by the second user by using encryption keys, and downloading the at least one file to the client computer of the second user. | 2,400 |
7,649 | 7,649 | 13,144,904 | 2,469 | A network distribution, point ( 1 ) for operation as a node in a telecommunications system intermediate between a remote access server ( 41 ) and a plurality of individual termination points ( 1 ) served from the remote access server ( 41 ) by respective digital subscriber loops ( 30 ), in particular at an optical fibre/copper wire interface ( 17 ), incorporates a dynamic line management system ( 18 ) for processing data relating to the capabilities of each of the digital subscriber loops ( 30 ), and generating a pro file of each digital subscriber loop ( 30 ) for transmission to the remote access server ( 49 ) to allow control of the transmission of data to the individual termination points. | 1. A network distribution point for operation as a node in a telecommunications system intermediate between a remote access server and a plurality of individual termination points served from the remote access server by respective digital subscriber loops, the network distribution point incorporating a dynamic line management system for processing data relating to the capabilities of each of the digital subscriber loops, and generating a profile of each digital subscriber loop and used for setting a rate profile to allow control of the transmission of data to the individual termination points. 2. A network distribution point according to claim 1, arranged to transmit the rate profile so generated to the remote access server. 3. A network distribution point according to claim 1, wherein the dynamic line management system comprises an Artificial Neural Network for processing of data relating to the physical layer of a digital subscriber loop. 4. A network distribution point according to claim 3, wherein the artificial neural network is a Multilayer Perceptron. 5. A network distribution point according to claim 1, in which the connection to the remote access server is by means of an optical fiber connection and the connections to the individual termination points are made by electrical means. 6. A method of controlling the transmission of data to individual network terminations served from a remote access server by respective digital subscriber loops through a common distribution point, wherein data relating to the capabilities of each of the digital subscriber loops is processed by a dynamic line management system associated with the distribution point, and a profile of each digital subscriber loop is generated and used for setting a rate profile 7. A method according to claim 6, wherein the rate profile is transmitted transmitted to the remote access server. 8. A method according to claim 6, wherein the dynamic line management system comprises an Artificial Neural Network for processing of data relating to the physical layer of a digital subscriber loop. 9. A method according to claim 8, wherein the artificial neural network is a Multilayer Perceptron. 10. A method according to claim 8, wherein the neural net is trained prior to installation and then instantiated in the distribution point, and wherein each analysis of the input data is a simple single iteration through the neural net. 11. A method according to claim 10, wherein after installation each neural network is allowed to mutate to allow optimization for statistics generated by the individual subscriber connections attached to the respective distribution point. 12. A method according to claim 7, in which the connection to the remote access server is by means of an optical fiber connection and the connections to the individual termination points are made by electrical means. | A network distribution, point ( 1 ) for operation as a node in a telecommunications system intermediate between a remote access server ( 41 ) and a plurality of individual termination points ( 1 ) served from the remote access server ( 41 ) by respective digital subscriber loops ( 30 ), in particular at an optical fibre/copper wire interface ( 17 ), incorporates a dynamic line management system ( 18 ) for processing data relating to the capabilities of each of the digital subscriber loops ( 30 ), and generating a pro file of each digital subscriber loop ( 30 ) for transmission to the remote access server ( 49 ) to allow control of the transmission of data to the individual termination points.1. A network distribution point for operation as a node in a telecommunications system intermediate between a remote access server and a plurality of individual termination points served from the remote access server by respective digital subscriber loops, the network distribution point incorporating a dynamic line management system for processing data relating to the capabilities of each of the digital subscriber loops, and generating a profile of each digital subscriber loop and used for setting a rate profile to allow control of the transmission of data to the individual termination points. 2. A network distribution point according to claim 1, arranged to transmit the rate profile so generated to the remote access server. 3. A network distribution point according to claim 1, wherein the dynamic line management system comprises an Artificial Neural Network for processing of data relating to the physical layer of a digital subscriber loop. 4. A network distribution point according to claim 3, wherein the artificial neural network is a Multilayer Perceptron. 5. A network distribution point according to claim 1, in which the connection to the remote access server is by means of an optical fiber connection and the connections to the individual termination points are made by electrical means. 6. A method of controlling the transmission of data to individual network terminations served from a remote access server by respective digital subscriber loops through a common distribution point, wherein data relating to the capabilities of each of the digital subscriber loops is processed by a dynamic line management system associated with the distribution point, and a profile of each digital subscriber loop is generated and used for setting a rate profile 7. A method according to claim 6, wherein the rate profile is transmitted transmitted to the remote access server. 8. A method according to claim 6, wherein the dynamic line management system comprises an Artificial Neural Network for processing of data relating to the physical layer of a digital subscriber loop. 9. A method according to claim 8, wherein the artificial neural network is a Multilayer Perceptron. 10. A method according to claim 8, wherein the neural net is trained prior to installation and then instantiated in the distribution point, and wherein each analysis of the input data is a simple single iteration through the neural net. 11. A method according to claim 10, wherein after installation each neural network is allowed to mutate to allow optimization for statistics generated by the individual subscriber connections attached to the respective distribution point. 12. A method according to claim 7, in which the connection to the remote access server is by means of an optical fiber connection and the connections to the individual termination points are made by electrical means. | 2,400 |
7,650 | 7,650 | 15,513,888 | 2,463 | A shared Radio Network Node, RNN, ( 102 ) and a method for managing overload in a core network ( 110 ). The shared RNN is configured to serve a wireless device ( 104 ), and the wireless device and the RNN are operating in a wireless communications network ( 105 ) connected to the core network. The RNN receives a connection request from the wireless device, wherein the connection request comprises a mapping parameter configured to map to an MME ( 112 ) connected to the RNN. Further, the MME is logically partitioned into several MMEs and configured to support multiple MME Codes, MMECs, each of which MMECs is pointing at a sharing operator. The mapping parameter comprises an MMEC configured to map to one MMEC supported by the MME. Further, the RNN rejects or redirects the connection request when the MMEC configured to map to one MMEC supported by the MME is associated with an overload action. | 1-58. (canceled) 59. A method performed by a shared Radio Network Node (RNN) for managing overload in at least one core network, wherein the shared RNN is configured to serve a wireless device, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the method comprises:
receiving a connection request from the wireless device, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME; and rejecting or redirecting the connection request when the MMEC configured to map to one of the MMECs supported by the MME is associated with an overload action. 60. The method of claim 59, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber identity (S-TMSI) that provides an identification of the core network node. 61. The method of claim 59, wherein the mapping parameter is a random value that provides an identification of the core network node. 62. The method of claim 59, wherein rejecting the connection request further comprises:
rejecting the connection request based on one or more parameters signaled by the wireless device during connection request. 63. The method of claim 59, further comprising:
releasing the wireless device in dependence of an indication of overload. 64. The method of claim 59, wherein redirecting the connection request further comprises:
redirecting the connection request based on one or more parameters signaled by the wireless device during connection setup completion. 65. A shared Radio Network Node (RNN) for managing overload in at least one core network, wherein the shared RNN is configured to serve a wireless device, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the shared RNN comprises a processor and a memory, which memory contains instructions executable by the processor, whereby the shared RNN is operative to:
receive a connection request from the wireless device, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME; and reject or redirect the connection request when the MMEC configured to map to one of the MMECs supported by the MME is associated with an overload action. 66. The shared RNN of claim 65, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber identity (S-TMSI) that provides an identification of the core network node. 67. The shared RNN of claim 65, wherein the mapping parameter is a random value that provides an identification of the core network node. 68. The shared RNN of claim 65, wherein the shared RNN is operative to reject the connection request by further being operative to:
reject the connection request based on one or more parameters signaled by the wireless device during connection request. 69. The shared RNN of claim 65, wherein the shared RNN further is operative to:
release the wireless device in dependence of an indication of overload. 70. The shared RNN of claim 65, wherein the shared RNN is operative to redirect the connection request by further being operative to:
redirect the connection request based on one or more parameters signaled by the wireless device during connection setup completion. 71. The shared RNN of claim 66, wherein the shared RNN is operative to redirect the connection request by further being operative to:
indicate, to the wireless device, a fictitious redirecting target that is not available or that cannot serve the wireless device. 72. The shared RNN of claim 71, wherein the fictitious redirecting target comprises an unused frequency and/or an identity of an RNN not in range and/or an identity of a cell not in use or not in range. 73. The shared RNN of claim 65, wherein the shared RNN is operative to redirect the connection request by further being operative to:
redirect the wireless device to a different MME that has not indicated overload. 74. A method performed by a wireless device for assisting a shared Radio Network Node (RNN) in managing overload in at least one core network, wherein the wireless device is configured to be served by the shared RNN, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the method comprises:
transmitting a connection request to the shared RNN, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME, whereby the wireless device assists the shared RNN in managing overload in the at least one core network. 75. The method of claim 74, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber Identity (S-TMSI) that provides an identification of the core network node. 76. The method of claim 74, wherein the mapping parameter is a random value that provides an identification of the core network node. 77. A wireless device for assisting a shared Radio Network Node (RNN) in managing overload in at least one core network, wherein the wireless device is configured to be served by the shared RNN, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the wireless device comprises a processor and a memory, which memory contains instructions executable by the processor, whereby the wireless device is operative to:
transmit a connection request to the shared RNN, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME, whereby the wireless device assists the shared RNN in managing overload in the at least one core network. 78. The wireless device of claim 77, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber Identity (S-TMSI) that provides an identification of the core network node. 79. The wireless device of claim 77, wherein the mapping parameter is a random value that provides an identification of the core network node. 80. The wireless device of claim 77, wherein the wireless device is further operative to:
receive, from the shared RNN, a fictitious redirecting target that is not available or that cannot serve the wireless device. 81. The wireless device of claim 79, wherein the fictitious redirecting target comprises an unused frequency and/or an identity of an RNN not in range and/or an identity of a cell not in use or not in range. | A shared Radio Network Node, RNN, ( 102 ) and a method for managing overload in a core network ( 110 ). The shared RNN is configured to serve a wireless device ( 104 ), and the wireless device and the RNN are operating in a wireless communications network ( 105 ) connected to the core network. The RNN receives a connection request from the wireless device, wherein the connection request comprises a mapping parameter configured to map to an MME ( 112 ) connected to the RNN. Further, the MME is logically partitioned into several MMEs and configured to support multiple MME Codes, MMECs, each of which MMECs is pointing at a sharing operator. The mapping parameter comprises an MMEC configured to map to one MMEC supported by the MME. Further, the RNN rejects or redirects the connection request when the MMEC configured to map to one MMEC supported by the MME is associated with an overload action.1-58. (canceled) 59. A method performed by a shared Radio Network Node (RNN) for managing overload in at least one core network, wherein the shared RNN is configured to serve a wireless device, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the method comprises:
receiving a connection request from the wireless device, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME; and rejecting or redirecting the connection request when the MMEC configured to map to one of the MMECs supported by the MME is associated with an overload action. 60. The method of claim 59, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber identity (S-TMSI) that provides an identification of the core network node. 61. The method of claim 59, wherein the mapping parameter is a random value that provides an identification of the core network node. 62. The method of claim 59, wherein rejecting the connection request further comprises:
rejecting the connection request based on one or more parameters signaled by the wireless device during connection request. 63. The method of claim 59, further comprising:
releasing the wireless device in dependence of an indication of overload. 64. The method of claim 59, wherein redirecting the connection request further comprises:
redirecting the connection request based on one or more parameters signaled by the wireless device during connection setup completion. 65. A shared Radio Network Node (RNN) for managing overload in at least one core network, wherein the shared RNN is configured to serve a wireless device, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the shared RNN comprises a processor and a memory, which memory contains instructions executable by the processor, whereby the shared RNN is operative to:
receive a connection request from the wireless device, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME; and reject or redirect the connection request when the MMEC configured to map to one of the MMECs supported by the MME is associated with an overload action. 66. The shared RNN of claim 65, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber identity (S-TMSI) that provides an identification of the core network node. 67. The shared RNN of claim 65, wherein the mapping parameter is a random value that provides an identification of the core network node. 68. The shared RNN of claim 65, wherein the shared RNN is operative to reject the connection request by further being operative to:
reject the connection request based on one or more parameters signaled by the wireless device during connection request. 69. The shared RNN of claim 65, wherein the shared RNN further is operative to:
release the wireless device in dependence of an indication of overload. 70. The shared RNN of claim 65, wherein the shared RNN is operative to redirect the connection request by further being operative to:
redirect the connection request based on one or more parameters signaled by the wireless device during connection setup completion. 71. The shared RNN of claim 66, wherein the shared RNN is operative to redirect the connection request by further being operative to:
indicate, to the wireless device, a fictitious redirecting target that is not available or that cannot serve the wireless device. 72. The shared RNN of claim 71, wherein the fictitious redirecting target comprises an unused frequency and/or an identity of an RNN not in range and/or an identity of a cell not in use or not in range. 73. The shared RNN of claim 65, wherein the shared RNN is operative to redirect the connection request by further being operative to:
redirect the wireless device to a different MME that has not indicated overload. 74. A method performed by a wireless device for assisting a shared Radio Network Node (RNN) in managing overload in at least one core network, wherein the wireless device is configured to be served by the shared RNN, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the method comprises:
transmitting a connection request to the shared RNN, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME, whereby the wireless device assists the shared RNN in managing overload in the at least one core network. 75. The method of claim 74, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber Identity (S-TMSI) that provides an identification of the core network node. 76. The method of claim 74, wherein the mapping parameter is a random value that provides an identification of the core network node. 77. A wireless device for assisting a shared Radio Network Node (RNN) in managing overload in at least one core network, wherein the wireless device is configured to be served by the shared RNN, wherein the wireless device and the shared RNN are configured to operate in a wireless communications network connected to the at least one core network, and wherein the wireless device comprises a processor and a memory, which memory contains instructions executable by the processor, whereby the wireless device is operative to:
transmit a connection request to the shared RNN, wherein the connection request comprises a mapping parameter configured to map to a Mobility Management Entity (MME) comprised in the at least one core network and connected to the shared RNN, wherein the MME is logically partitioned into several MMEs and configured to support multiple MME Codes (MMECs), each of which MMECs is pointing at a sharing operator, and wherein the mapping parameter comprises an MMEC configured to map to one of the MMECs supported by the MME, whereby the wireless device assists the shared RNN in managing overload in the at least one core network. 78. The wireless device of claim 77, wherein the mapping parameter is a System Architecture Evolution (SAE)—Temporary Mobile Subscriber Identity (S-TMSI) that provides an identification of the core network node. 79. The wireless device of claim 77, wherein the mapping parameter is a random value that provides an identification of the core network node. 80. The wireless device of claim 77, wherein the wireless device is further operative to:
receive, from the shared RNN, a fictitious redirecting target that is not available or that cannot serve the wireless device. 81. The wireless device of claim 79, wherein the fictitious redirecting target comprises an unused frequency and/or an identity of an RNN not in range and/or an identity of a cell not in use or not in range. | 2,400 |
7,651 | 7,651 | 12,866,978 | 2,477 | The invention provides a method for enabling inter-RAT handover in a communication system comprising a first network utilizing a first radio access technology and a second network utilizing a second radio access technology. When a user equipment moves from the first network into the second network and a handover is to be made, processing protocol data units (PDUs) in non-IP packet format and buffered in the first network or in the user equipment into IP packets in response to a handover confirmation (HOcfm) sent by the second network; forwarding the processed IP packets from the first network to the second network if the PDUs are buffered in the first network; and retransmitting the processed IP packets after the user equipment is switched to the second network. An user equipment and a communication system corresponding with the method of the invention are also provided. | 1. A method for enabling inter-radio access technology handover in a communication system comprising a first network utilizing a first radio access technology and a second network utilizing a second radio access technology, when a user equipment moves from the first network into the second network and a handover is to be made, said method comprising the steps of:
processing protocol data units (PDUs) in non-IP packet format and buffered in the first network or in the user equipment into IP packets in response to a handover confirmation (HOcfm) sent by the second network; forwarding the processed IP packets from the first network to the second network if the PDUs are buffered in the first network; and retransmitting the processed IP packets after the user equipment is switched to the second network. 2. The method according to claim 1, if the PDUs are buffered in the first network, the steps of processing and forwarding are implemented by the first network, and the step of retransmitting is implemented by the second network. 3. The method according to claim 1, if the PDUs are buffered in the user equipment, the steps of processing and retransmitting are implemented by the user equipment. 4. The method according to claim 1, wherein said step of processing comprising extracting the sequence number of the PDUs, cancelling the padding of the PDUs if they have, deciphering the PDUs if they are ciphered, and decompressing the PDUs if they are compressed. 5. The method according to claim 1, wherein one of the first radio access technology and the second radio access technology is UMTS Terrestrial Radio Access technology (UTRA) and the other is evolved UMTS Terrestrial Radio Access technology (eUTRA). 6. An user equipment adapted to communicate with a first network utilizing a first radio access technology or communicate with a second network utilizing a second radio access technology, when the user equipment moves from the first network into the second network and a handover is to be made, said user equipment comprising:
processing means for processing protocol data units (PDUs) in non-IP packet format and buffered in the user equipment into IP packets in response to a handover confirmation (HOcfm) sent by the second network; and retransmitting means for retransmitting the processed IP packets after the user equipment is switched to the second network. 7. The user equipment according to claim 6, wherein the processing means further comprises input module for receiving handover confirmation message (HOcfm) and the buffered PDUs, processing module for turning the buffered PDUs into IP packets, and output module for outputting the processed IP packets to the retransmitting means. 8. The user equipment according to claim 7, wherein the processing module is adapted to extract the sequence number of the PDUs, cancel the padding of the PDUs if they have, decipher the PDUs if they are ciphered, and decompress the PDUs if they are compressed. 9. The user equipment according to claim 6, wherein one of the first radio access technology and the second radio access technology is UMTS Terrestrial Radio Access technology (UTRA) and the other is evolved UMTS Terrestrial Radio Access technology (eUTRA). 10. A communication system comprising a first network utilizing a first radio access technology and a second network utilizing a second radio access technology, when a user equipment moves from the first network into the second network and a handover is to be made, the communication system is characterized by:
the first network comprising processing means for processing protocol data units (PDUs) in non-IP packet format and buffered in the first network into IP packets in response to a handover confirmation (HOcfm) sent by the second network and forwarding means for forwarding the processed IP packets from the first network to the second network; and the second network comprising retransmitting means for retransmitting the processed IP packets after the user equipment is switched to the second network. 11. The communication system according to claim 10, wherein the processing means further comprises input module for receiving handover confirmation message (HOcfm) and the buffered PDUs, processing module for turning the buffered PDUs into IP packets, and output module for outputting the processed IP packets to the forwarding means. 12. The communication system according to claim 11, wherein the processing module is adapted to extract the sequence number of the PDUs, cancel the padding of the PDUs if they have, decipher the PDUs if they are ciphered, and decompress the PDUs if they are compressed. 13. The communication system according to claim 10, wherein one of the first radio access technology and the second radio access technology is UMTS Terrestrial Radio Access technology (UTRA) and the other is evolved UMTS Terrestrial Radio Access technology (eUTRA). | The invention provides a method for enabling inter-RAT handover in a communication system comprising a first network utilizing a first radio access technology and a second network utilizing a second radio access technology. When a user equipment moves from the first network into the second network and a handover is to be made, processing protocol data units (PDUs) in non-IP packet format and buffered in the first network or in the user equipment into IP packets in response to a handover confirmation (HOcfm) sent by the second network; forwarding the processed IP packets from the first network to the second network if the PDUs are buffered in the first network; and retransmitting the processed IP packets after the user equipment is switched to the second network. An user equipment and a communication system corresponding with the method of the invention are also provided.1. A method for enabling inter-radio access technology handover in a communication system comprising a first network utilizing a first radio access technology and a second network utilizing a second radio access technology, when a user equipment moves from the first network into the second network and a handover is to be made, said method comprising the steps of:
processing protocol data units (PDUs) in non-IP packet format and buffered in the first network or in the user equipment into IP packets in response to a handover confirmation (HOcfm) sent by the second network; forwarding the processed IP packets from the first network to the second network if the PDUs are buffered in the first network; and retransmitting the processed IP packets after the user equipment is switched to the second network. 2. The method according to claim 1, if the PDUs are buffered in the first network, the steps of processing and forwarding are implemented by the first network, and the step of retransmitting is implemented by the second network. 3. The method according to claim 1, if the PDUs are buffered in the user equipment, the steps of processing and retransmitting are implemented by the user equipment. 4. The method according to claim 1, wherein said step of processing comprising extracting the sequence number of the PDUs, cancelling the padding of the PDUs if they have, deciphering the PDUs if they are ciphered, and decompressing the PDUs if they are compressed. 5. The method according to claim 1, wherein one of the first radio access technology and the second radio access technology is UMTS Terrestrial Radio Access technology (UTRA) and the other is evolved UMTS Terrestrial Radio Access technology (eUTRA). 6. An user equipment adapted to communicate with a first network utilizing a first radio access technology or communicate with a second network utilizing a second radio access technology, when the user equipment moves from the first network into the second network and a handover is to be made, said user equipment comprising:
processing means for processing protocol data units (PDUs) in non-IP packet format and buffered in the user equipment into IP packets in response to a handover confirmation (HOcfm) sent by the second network; and retransmitting means for retransmitting the processed IP packets after the user equipment is switched to the second network. 7. The user equipment according to claim 6, wherein the processing means further comprises input module for receiving handover confirmation message (HOcfm) and the buffered PDUs, processing module for turning the buffered PDUs into IP packets, and output module for outputting the processed IP packets to the retransmitting means. 8. The user equipment according to claim 7, wherein the processing module is adapted to extract the sequence number of the PDUs, cancel the padding of the PDUs if they have, decipher the PDUs if they are ciphered, and decompress the PDUs if they are compressed. 9. The user equipment according to claim 6, wherein one of the first radio access technology and the second radio access technology is UMTS Terrestrial Radio Access technology (UTRA) and the other is evolved UMTS Terrestrial Radio Access technology (eUTRA). 10. A communication system comprising a first network utilizing a first radio access technology and a second network utilizing a second radio access technology, when a user equipment moves from the first network into the second network and a handover is to be made, the communication system is characterized by:
the first network comprising processing means for processing protocol data units (PDUs) in non-IP packet format and buffered in the first network into IP packets in response to a handover confirmation (HOcfm) sent by the second network and forwarding means for forwarding the processed IP packets from the first network to the second network; and the second network comprising retransmitting means for retransmitting the processed IP packets after the user equipment is switched to the second network. 11. The communication system according to claim 10, wherein the processing means further comprises input module for receiving handover confirmation message (HOcfm) and the buffered PDUs, processing module for turning the buffered PDUs into IP packets, and output module for outputting the processed IP packets to the forwarding means. 12. The communication system according to claim 11, wherein the processing module is adapted to extract the sequence number of the PDUs, cancel the padding of the PDUs if they have, decipher the PDUs if they are ciphered, and decompress the PDUs if they are compressed. 13. The communication system according to claim 10, wherein one of the first radio access technology and the second radio access technology is UMTS Terrestrial Radio Access technology (UTRA) and the other is evolved UMTS Terrestrial Radio Access technology (eUTRA). | 2,400 |
7,652 | 7,652 | 14,371,881 | 2,473 | One embodiment includes a method and apparatus for routing messages in a machine-type communication (MTC) architecture. The method includes receiving a request at a MTC-proxy residing at an egress of a network. The request includes an international mobile subscriber identity (IMSI) for which a destination is outside the network. The method further includes replacing, by the MTC-proxy, the IMSI in the request with an external identifier. | 1-21. (canceled) 22. A method, comprising:
receiving a request at a machine-type communication proxy residing at an egress of a network, the request comprising an international mobile subscriber identity for which a destination is outside the network; and replacing, by the machine-type communication proxy, the international mobile subscriber identity in the request with an external identifier. 23. The method according to claim 22, further comprising forwarding the request to an external network element. 24. The method according to claim 22, further comprising:
receiving a response from the external network element, the response comprising the external identifier; replacing the external identifier with the corresponding international mobile subscriber identity; and forwarding the response to an internal network element. 25. The method according to claim 22, further comprising querying a home subscriber server with the international mobile subscriber identity to retrieve the corresponding external identifier. 26. The method according to claim 22, further comprising storing a mapping of the international mobile subscriber identity to the corresponding external identifier. 27. The method according to claim 22, wherein the receiving comprises receiving a device trigger request. 28. The method according to claim 22, further comprising storing the internal network element information corresponding to the request to assist in the forwarding of the response to the internal network element. 29. The method according to claim 22, further comprising using routing information in a routing header of the request to forward the response to the internal network element. 30. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, the at least one memory and the computer program code configured, with the at least one processor, to cause the apparatus at least to receive a request at an egress of a network, the request comprising an international mobile subscriber identity for which a destination is outside the network; and replace the international mobile subscriber identity in the request with an external identifier. 31. The apparatus according to claim 30, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to forward the request to an external network element. 32. The apparatus according to claim 30, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to:
receive a response from the external network element, the response comprising the external identifier; replace the external identifier with the corresponding international mobile subscriber identity; and forward the response to an internal network element. 33. A computer program embodied on a non-transitory computer readable medium, the computer program configured to control a processor to perform a process, the process comprising:
receiving a request comprising an international mobile subscriber identity for which a destination is outside the network; and replacing the international mobile subscriber identity in the request with an external identifier. 34. The computer program according to claim 33, further comprising forwarding the request to an external network element. 35. The computer program according to claim 33, further comprising:
receiving a response from the external network element, the response comprising the external identifier; replacing the external identifier with the corresponding international mobile subscriber identity; and forwarding the response to an internal network element. 36. The computer program according to claim 33, further comprising querying a home subscriber server with the international mobile subscriber identity to retrieve the corresponding external identifier. | One embodiment includes a method and apparatus for routing messages in a machine-type communication (MTC) architecture. The method includes receiving a request at a MTC-proxy residing at an egress of a network. The request includes an international mobile subscriber identity (IMSI) for which a destination is outside the network. The method further includes replacing, by the MTC-proxy, the IMSI in the request with an external identifier.1-21. (canceled) 22. A method, comprising:
receiving a request at a machine-type communication proxy residing at an egress of a network, the request comprising an international mobile subscriber identity for which a destination is outside the network; and replacing, by the machine-type communication proxy, the international mobile subscriber identity in the request with an external identifier. 23. The method according to claim 22, further comprising forwarding the request to an external network element. 24. The method according to claim 22, further comprising:
receiving a response from the external network element, the response comprising the external identifier; replacing the external identifier with the corresponding international mobile subscriber identity; and forwarding the response to an internal network element. 25. The method according to claim 22, further comprising querying a home subscriber server with the international mobile subscriber identity to retrieve the corresponding external identifier. 26. The method according to claim 22, further comprising storing a mapping of the international mobile subscriber identity to the corresponding external identifier. 27. The method according to claim 22, wherein the receiving comprises receiving a device trigger request. 28. The method according to claim 22, further comprising storing the internal network element information corresponding to the request to assist in the forwarding of the response to the internal network element. 29. The method according to claim 22, further comprising using routing information in a routing header of the request to forward the response to the internal network element. 30. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, the at least one memory and the computer program code configured, with the at least one processor, to cause the apparatus at least to receive a request at an egress of a network, the request comprising an international mobile subscriber identity for which a destination is outside the network; and replace the international mobile subscriber identity in the request with an external identifier. 31. The apparatus according to claim 30, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to forward the request to an external network element. 32. The apparatus according to claim 30, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus at least to:
receive a response from the external network element, the response comprising the external identifier; replace the external identifier with the corresponding international mobile subscriber identity; and forward the response to an internal network element. 33. A computer program embodied on a non-transitory computer readable medium, the computer program configured to control a processor to perform a process, the process comprising:
receiving a request comprising an international mobile subscriber identity for which a destination is outside the network; and replacing the international mobile subscriber identity in the request with an external identifier. 34. The computer program according to claim 33, further comprising forwarding the request to an external network element. 35. The computer program according to claim 33, further comprising:
receiving a response from the external network element, the response comprising the external identifier; replacing the external identifier with the corresponding international mobile subscriber identity; and forwarding the response to an internal network element. 36. The computer program according to claim 33, further comprising querying a home subscriber server with the international mobile subscriber identity to retrieve the corresponding external identifier. | 2,400 |
7,653 | 7,653 | 15,160,065 | 2,477 | A communication system and method are disclosed for transmitting packets of information in at least one first format over a communications link that utilizes packets of information in a second format. In certain embodiments, the packets of information in a first format are converted to packets of information in the second format prior to transmission via the communications link by packing and fragmenting the information in the first format in a coordinated manner. Embodiments may also utilize packing subheaders and fragmentation control bits in the packing and fragmentation processes. | 1. A base station that communicates over a wireless communication link with mobile subscriber units, comprising:
one or more processors operable to,
establish a service connection from the base station to a mobile subscriber unit,
map variable length service data units (SDUs) associated with the service connection into variable length protocol data units (PDUs) associated with the service connection, the SDUs being mapped into the PDUs based at least in part on data carrying capacity provided by the base station for transmission to the mobile subscriber unit in a physical downlink frame, the data carrying capacity based on at least one of a priority associated with the service connection, a modulation scheme and an error correction scheme, and
map the PDUs for the mobile subscriber unit into the physical downlink frame; and
a transmitter operable to transmit the physical downlink frame over the wireless communication link using the modulation scheme and the error correction scheme. 2. A base station in a wireless communication system, comprising:
one or more processors; a computer readable storage medium storing instructions which when executed by the one or more processors cause the one or more processors to
establish a service connection from the base station to a mobile subscriber unit,
map variable length service data units (SDUs) associated with the service connection into variable length protocol data units (PDUs) associated with the service connection, based at least in part on data carrying capacity provided for transmission to the mobile subscriber unit in a physical downlink frame, the data carrying capacity based on at least one of a priority associated with the service connection, a modulation scheme and an error correction scheme, and
map the PDUs for the mobile subscriber unit into the physical downlink frame; and
a transmitter operable to transmit the physical downlink frame to the subscriber unit using the modulation scheme and the error correction scheme. 3. A method for operating a base station in a wireless communication system, comprising:
establishing a service connection from the base station to a mobile subscriber unit; mapping variable length service data units (SDUs) associated with the service connection into variable length protocol data units (PDUs) associated with the service connection, based at least in part on data carrying capacity provided for transmission to the mobile subscriber unit in a physical downlink frame, the data carrying capacity based on at least one of a priority associated with the service connection, a modulation scheme and an error correction scheme; mapping the PDUs for the mobile subscriber unit into the physical downlink frame; and transmitting the physical downlink frame to the subscriber unit using the modulation scheme and the error correction scheme. | A communication system and method are disclosed for transmitting packets of information in at least one first format over a communications link that utilizes packets of information in a second format. In certain embodiments, the packets of information in a first format are converted to packets of information in the second format prior to transmission via the communications link by packing and fragmenting the information in the first format in a coordinated manner. Embodiments may also utilize packing subheaders and fragmentation control bits in the packing and fragmentation processes.1. A base station that communicates over a wireless communication link with mobile subscriber units, comprising:
one or more processors operable to,
establish a service connection from the base station to a mobile subscriber unit,
map variable length service data units (SDUs) associated with the service connection into variable length protocol data units (PDUs) associated with the service connection, the SDUs being mapped into the PDUs based at least in part on data carrying capacity provided by the base station for transmission to the mobile subscriber unit in a physical downlink frame, the data carrying capacity based on at least one of a priority associated with the service connection, a modulation scheme and an error correction scheme, and
map the PDUs for the mobile subscriber unit into the physical downlink frame; and
a transmitter operable to transmit the physical downlink frame over the wireless communication link using the modulation scheme and the error correction scheme. 2. A base station in a wireless communication system, comprising:
one or more processors; a computer readable storage medium storing instructions which when executed by the one or more processors cause the one or more processors to
establish a service connection from the base station to a mobile subscriber unit,
map variable length service data units (SDUs) associated with the service connection into variable length protocol data units (PDUs) associated with the service connection, based at least in part on data carrying capacity provided for transmission to the mobile subscriber unit in a physical downlink frame, the data carrying capacity based on at least one of a priority associated with the service connection, a modulation scheme and an error correction scheme, and
map the PDUs for the mobile subscriber unit into the physical downlink frame; and
a transmitter operable to transmit the physical downlink frame to the subscriber unit using the modulation scheme and the error correction scheme. 3. A method for operating a base station in a wireless communication system, comprising:
establishing a service connection from the base station to a mobile subscriber unit; mapping variable length service data units (SDUs) associated with the service connection into variable length protocol data units (PDUs) associated with the service connection, based at least in part on data carrying capacity provided for transmission to the mobile subscriber unit in a physical downlink frame, the data carrying capacity based on at least one of a priority associated with the service connection, a modulation scheme and an error correction scheme; mapping the PDUs for the mobile subscriber unit into the physical downlink frame; and transmitting the physical downlink frame to the subscriber unit using the modulation scheme and the error correction scheme. | 2,400 |
7,654 | 7,654 | 15,716,881 | 2,456 | A system and method in a building or vehicle for an actuator operation in response to a sensor according to a control logic, the system comprising a router or a gateway communicating with a device associated with the sensor and a device associated with the actuator over in-building or in-vehicle networks, and an external Internet-connected control server associated with the control logic implementing a PID closed linear control loop and communicating with the router over external network for controlling the in-building or in-vehicle phenomenon. The sensor may be a microphone or a camera, and the system may include voice or image processing as part of the control logic. A redundancy is used by using multiple sensors or actuators, or by using multiple data paths over the building or vehicle internal or external communication. The networks may be wired or wireless, and may be BAN, PAN, LAN, WAN, or home networks. | 1. A device for use with a single wire pair in a vehicle, the wire pair concurrently carrying DC power and bi-directional digital data signals that is carried over a frequency band above and distinct from the DC power using Frequency Division Multiplexing (FDM), the device comprising:
a connector for connecting to the wire pair; a power/data splitter having first, second and third ports, wherein the digital data signal is passed only between the first and second ports, and the DC power signal is passed only between the first and third ports, and wherein the first port is connected to the connector; a software and a processor for executing the software; a transceiver coupled between the processor and the second port for transmitting digital data to, and receiving digital data from, the wire pair via the connector; a sensor for sensing a first phenomenon in the vehicle, the sensor having an output coupled for transmitting to the processor a value responsive to the first phenomenon; and a single enclosure mountable in the vehicle for housing the connector, the power/data splitter, the processor, and the transceiver , wherein the transceiver and the processor are coupled to the third port for being powered from the DC power via the connector, and wherein the device is operative to transmit the value to the wire pair via the connector. 2. The device according to claim 1, wherein the single enclosure further comprises the sensor. 3. The device according to claim 1, wherein the sensor is external to the single enclosure, or wherein the sensor is mountable in the vehicle. 4. The device according to claim 1, wherein the sensor outputs an analog signal, and the device further comprising an Analog to Digital (A/D) converter coupled between the sensor and the processor for converting the analog signal to a digital data. 5. The device according to claim 1, wherein the power/data splitter comprises an High Pass Filter (HPF) between the first and second ports and a Low Pass Filter (LPF) between the first and third ports. 6. The device according to claim 5, wherein the HPF comprises two capacitors. 7. The device according to claim 5, wherein the LPF or the HPF comprises an inductor or two coupled inductors. 8. The device according to claim 7, wherein the two coupled inductors form a transformer. 9. The device according to claim 5, wherein the power/data splitter comprising a transformer and a capacitor connected to the transformer windings. 10. The device according to claim 1, wherein the DC power and digital data signals are carried substantially according to IEEE 802.3af-2003 or IEEE 802.3at-2009 standards. 11. The device according to claim 1, wherein the DC power signal level is at least 44 Volts. 12. The device according to claim 1, wherein the data rate over the wire pair is above 100 Mb/s or 1 Gb/s. 13. The device according to claim 1, wherein the vehicle is adapted for travelling on land. 14. The device according to claim 1, wherein the vehicle is adapted for travelling on water, or is airborne. 15. The device according to claim 1, wherein the vehicle is one out of a bicycle, a car, a motorcycle, a train, a ship, an aircraft, a boat, a spacecraft, a boat, a submarine, a dirigible, an electric scooter, a subway, a train, a trolleybus, a tram, a sailboat, a yacht, and an airplane. 16. A vehicle comprising the device according to claim 1. 17. An Electronic Control Unit (ECU) in the vehicle comprising the device according to claim 1. 18. The device according to claim 1, wherein the vehicle is an automobile, and wherein the device comprises an Electronic Control Unit (ECU), an Engine Control Unit (ECU), a Transmission Control Unit (TCU), an Anti-Lock Braking Device (ABS), or Body Control Modules (BCM). 19. The device according to claim 1, further for use with parking help, cruise control, lane keeping, road sign recognition, surveillance, speed limit warning, restricted entries, and pull-over commands, travel information, cooperative adaptive cruise control, cooperative forward collision warning, intersection collision avoidance, approaching emergency vehicle warning, vehicle safety inspection, transit or emergency vehicle signal priority, electronic parking payments, commercial vehicle clearance and safety inspections, in-vehicle signing, rollover warning, probe data collection, highway-rail intersection warning, or electronic toll collection, the device is further integrated with, or being part of, a vehicular communication device used for improved safety, traffic flow control, traffic reporting, or traffic management. 20. The device according to claim 1, wherein the communication over the single wire pair is according to, or based on, Control Area Network (CAN) or Local Interconnect Network (LIN). 21. The device according to claim 1, wherein the sensor is a piezoelectric sensor that includes single crystal material or a piezoelectric ceramics and uses a transverse, longitudinal, or shear effect mode of the piezoelectric effect. 22. The device according to claim 1, further comprising multiple sensors arranged as a directional sensor array operative to estimate the number, magnitude, frequency, Direction-Of-Arrival (DOA), distance, or speed of the phenomenon impinging the sensor array. 23. The device according to claim 1, wherein the sensor is a thermoelectric sensor that responds to a temperature or to a temperature gradient of an object using conduction, convection, or radiation, and wherein the thermoelectric sensor consists of, or comprises, a Positive Temperature Coefficient (PTC) thermistor, a Negative Temperature Coefficient (NTC) thermistor, a thermocouple, a quartz crystal, or a Resistance Temperature Detector (RTD). 24. The device according to claim 1, wherein the sensor consists of, or comprises, a nanosensor, a crystal, or a semiconductor, or wherein: the sensor is an ultrasonic based, the sensor is an eddy-current sensor, the sensor is a proximity sensor, the sensor is a bulk or surface acoustic sensor, or the sensor is an atmospheric or an environmental sensor. 25. The device according to claim 1, wherein the sensor is a radiation sensor that responds to radioactivity, nuclear radiation, alpha particles, beta particles, or gamma rays, and is based on gas ionization. 26. The device according to claim 1, wherein the sensor is a photoelectric sensor that responds to a visible or an invisible light, the invisible light is infrared, ultraviolet, X-rays, or gamma rays, and wherein the photoelectric sensor is based on the photoelectric or photovoltaic effect, and consists of, or comprises, a semiconductor component that consists of, or comprises, a photodiode, a phototransistor, or a solar cell. 27. The device according to claim 26, wherein the photoelectric sensor is based on Charge-Coupled Device (CCD) or a Complementary Metal-Oxide Semiconductor (CMOS) element. 28. The device according to claim 1, wherein the sensor is a photosensitive image sensor array comprising multiple photoelectric sensors, for capturing an image and producing electronic image information representing the image, and the device further comprising one or more optical lens for focusing the received light and to guide the image, and wherein the image sensor is disposed approximately at an image focal point plane of the one or more optical lens for properly capturing the image. 29. The device according to claim 1, wherein the sensor is an electrochemical sensor that responds to an object chemical structure, properties, composition, or reactions. 30. The device according to claim 29, wherein the electrochemical sensor is a pH meter or a gas sensor responding to a presence of radon, hydrogen, oxygen, or Carbon-Monoxide (CO), or wherein the electrochemical sensor is based on optical detection or on ionization and is a smoke, a flame, or a fire detector, or is responsive to combustible, flammable, or toxic gas. 31. The device according to claim 1, wherein the sensor is an electroacoustic sensor that responds to an audible or inaudible sound. 32. The device according to claim 31, wherein the electroacoustic sensor is an omnidirectional, unidirectional, or bidirectional microphone that is based on the sensing the incident sound based motion of a diaphragm or a ribbon, and the microphone consists of, or comprising, a condenser, an electret, a dynamic, a ribbon, a carbon, or a piezoelectric microphone. 33. The device according to claim 1, further being part of, or connectable to, a network via the wire pair, and wherein the device is addressable in the network using a digital address uniquely identifying the device in the network. 34. The device according to claim 33, wherein the digital address is a MAC layer address that is MAC-48, EUI-48, or EUI-64 address type. 35. The device according to claim 33, wherein the digital address is a layer 3 address and is static or dynamic IP address that is IPv4 or IPv6 type address. 36. The device according to claim 33, wherein the digital address is autonomously assigned or is assigned by another device via a communication interface using DHCP. 37. The device according to claim 33, wherein the network is a frame based network, and wherein the wire pair consists of, or comprises, an Unshielded Twisted wire Pair (UTP). 38. The device according to claim 37, wherein the frame based network is according to, based on, or compatible with, Ethernet or IEEE 802.3-2008 standard. 39. The device according to claim 38, wherein the frame based network is according to, based on, or compatible with, 10Base-T, 100Base-T, 100Base-TX, 100Base-T2, 100Base-T4, 1000Base-T, 1000Base-TX, 10GBase-CX4, or 10GBase-T. 40. The device according to claim 1, wherein the communication over the wire-pair is full duplex. 41. The device according to claim 1, further comprising an actuator that affects a second phenomenon in response to an actuator command, the actuator is coupled to the receive actuator command from the processor. 42. The device according to claim 41, wherein the actuator is coupled to be powered from the DC power signal. 43. The device according to claim 41, wherein the actuator command is responsive to the sensor output value. 44. The device according to claim 41, wherein the single enclosure further comprises the actuator. 45. The device according to claim 41, wherein the actuator is external to the single enclosure. 46. The device according to claim 41, wherein the actuator is mountable in the vehicle. 47. The device according to claim 41, wherein the actuator is operative to affect the second phenomenon inside the vehicle. 48. The device according to claim 41, wherein the actuator is operative to affect the second phenomenon external to the vehicle, or associated with surroundings around the vehicle. 49. The device according to claim 41, wherein the second phenomenon is the same as the first phenomenon. 50. The device according to claim 49, further operative for affecting a control loop for controlling the phenomenon, and wherein the control loop is a closed linear control loop where the sensor value serves as a feedback to command the actuator based of the loop deviation from a setpoint or a reference value. 51. The device according to claim 50, wherein the closed control loop is a proportional-based, an integral-based, a derivative-based, or a Proportional, Integral, and Derivative (PID) based control loop, wherein the control loop uses feed-forward, Bistable, Bang-Bang, Hysteretic, or fuzzy logic based control. 52. The device according to claim 50, wherein the control loop involves randomness based on random numbers; and the device further comprises a random number generator for generating random numbers, and wherein the random number generator is hardware-based using thermal noise, shot noise, nuclear decaying radiation, photoelectric effect, or quantum phenomena, or wherein the random number generator is software-based and executes an algorithm for generating pseudo-random numbers. 53. The device according to claim 50, wherein the setpoint is fixed, set by a user, or is time dependent. 54. The device according to claim 50, further comprising an additional sensor responsive to a phenomenon distinct from the first phenomenon, and wherein the setpoint is dependent upon the output of the additional sensor. 55. The device according to claim 41, further comprising an electrically actuated switch coupled for switching power to the actuator from the DC power, and wherein the electrically actuated switch coupled to the processor and is actuated in response to the actuator command. 56. The device according to claim 55, wherein the electrically actuated switch is ‘normally open’ type, ‘normally closed’ type, or a changeover switch, wherein the electrically actuated switch is ‘make-before-break’ or ‘break-before-make’ type, or wherein the electrically actuated switch have two or more poles or two or more throws, and the contacts of the first electrically actuated switch are arranged as a Single-Pole-Double-Throw (SPDT), Double-Pole-Double-Throw (DPDT), Double-Pole-Single-Throw (DPST), or Single-Pole-Changeover (SPCO). 57. The device according to claim 55, wherein the electrically actuated switch is a latching or non-latching type relay, and the relay is a solenoid-based electromagnetic relay that is a reed relay, wherein the relay is solid-state or semiconductor based, or wherein the relay is a Solid State Relay (SSR). 58. The device according to claim 41, wherein the actuator is a light source that emits visible or non-visible light for illumination or indication, the non-visible light is infrared, ultraviolet, X-rays, or gamma rays, and wherein the light source is an electric light source for converting electrical energy into light. 59. The device according to claim 58, wherein the electric light source consists of, or comprises, a lamp, an incandescent lamp, a gas discharge lamp, a fluorescent lamp, a Solid-State Lighting (SSL), a Light Emitting Diode (LED), an Organic LED (OLED), a polymer LED (PLED), or a laser diode. 60. The device according to claim 41, wherein the actuator is a motion actuator that causes linear or rotary motion, and the device further comprising a conversion mechanism for respectfully converting to rotary or linear motion based on a screw, a wheel and axle, or a cam. 61. The device according to claim 41, wherein the actuator is a sounder for converting an electrical energy to omnidirectional, unidirectional, or bidirectional pattern emitted, audible or inaudible, sound waves. 62. The device according to claim 41, wherein the actuator is a motion actuator that causes linear or rotary motion, and the device further comprising a conversion mechanism for respectfully converting to rotary or linear motion based on a screw, a wheel and axle, or a cam. 63. The device according to claim 62, wherein the motion actuator is an electrical motor. 64. The device according to claim 63, wherein the electrical motor is a brushed, a brushless, or an uncommutated DC motor, or wherein the DC motor is a stepper motor that is a Permanent Magnet (PM) motor, a Variable reluctance (VR) motor, or a hybrid synchronous stepper. 65. The device according to claim 63, wherein the electrical motor is an AC motor that is an induction motor, a synchronous motor, or an eddy current motor, and wherein the AC motor is a single-phase AC induction motor, a two-phase AC servo motor, or a three-phase AC synchronous motor, and the AC motor is a split-phase motor, a capacitor-start motor, or a Permanent-Split Capacitor (PSC) motor. 66. The device according to claim 62, wherein the motion actuator is a linear hydraulic actuator, a linear pneumatic actuator, a linear induction electric motor (LIM), or a Linear Synchronous electric Motor (LSM). 67. The device according to claim 62, wherein the motion actuator is based on a piezoelectric motor, a Surface Acoustic Wave (SAW) motor, a Squiggle motor, an ultrasonic motor, or a micro- or nanometer comb-drive capacitive actuator, a Dielectric or Ionic based Electroactive Polymers (EAPs) actuator, a solenoid, a thermal bimorph, or a piezoelectric unimorph actuator. 68. The device according to claim 41, wherein the actuator is a compressor or a pump and is operative to move, force, or compress liquid, gas or slurry, and the actuator. 69. The device according to claim 41, wherein the actuator is an electric thermoelectric actuator and is a heater or a cooler, operative for affecting the temperature of a solid, a liquid, or a gas object, and is coupled to the object by conduction, convection, force convention, thermal radiation, or by the transfer of energy by phase changes. 70. The device according to claim 69, wherein the thermoelectric actuator is a cooler based on a heat pump driving a refrigeration cycle using a compressor-based electric motor, or wherein the thermoelectric actuator is an electric heater that is a resistance heater or a dielectric heater. | A system and method in a building or vehicle for an actuator operation in response to a sensor according to a control logic, the system comprising a router or a gateway communicating with a device associated with the sensor and a device associated with the actuator over in-building or in-vehicle networks, and an external Internet-connected control server associated with the control logic implementing a PID closed linear control loop and communicating with the router over external network for controlling the in-building or in-vehicle phenomenon. The sensor may be a microphone or a camera, and the system may include voice or image processing as part of the control logic. A redundancy is used by using multiple sensors or actuators, or by using multiple data paths over the building or vehicle internal or external communication. The networks may be wired or wireless, and may be BAN, PAN, LAN, WAN, or home networks.1. A device for use with a single wire pair in a vehicle, the wire pair concurrently carrying DC power and bi-directional digital data signals that is carried over a frequency band above and distinct from the DC power using Frequency Division Multiplexing (FDM), the device comprising:
a connector for connecting to the wire pair; a power/data splitter having first, second and third ports, wherein the digital data signal is passed only between the first and second ports, and the DC power signal is passed only between the first and third ports, and wherein the first port is connected to the connector; a software and a processor for executing the software; a transceiver coupled between the processor and the second port for transmitting digital data to, and receiving digital data from, the wire pair via the connector; a sensor for sensing a first phenomenon in the vehicle, the sensor having an output coupled for transmitting to the processor a value responsive to the first phenomenon; and a single enclosure mountable in the vehicle for housing the connector, the power/data splitter, the processor, and the transceiver , wherein the transceiver and the processor are coupled to the third port for being powered from the DC power via the connector, and wherein the device is operative to transmit the value to the wire pair via the connector. 2. The device according to claim 1, wherein the single enclosure further comprises the sensor. 3. The device according to claim 1, wherein the sensor is external to the single enclosure, or wherein the sensor is mountable in the vehicle. 4. The device according to claim 1, wherein the sensor outputs an analog signal, and the device further comprising an Analog to Digital (A/D) converter coupled between the sensor and the processor for converting the analog signal to a digital data. 5. The device according to claim 1, wherein the power/data splitter comprises an High Pass Filter (HPF) between the first and second ports and a Low Pass Filter (LPF) between the first and third ports. 6. The device according to claim 5, wherein the HPF comprises two capacitors. 7. The device according to claim 5, wherein the LPF or the HPF comprises an inductor or two coupled inductors. 8. The device according to claim 7, wherein the two coupled inductors form a transformer. 9. The device according to claim 5, wherein the power/data splitter comprising a transformer and a capacitor connected to the transformer windings. 10. The device according to claim 1, wherein the DC power and digital data signals are carried substantially according to IEEE 802.3af-2003 or IEEE 802.3at-2009 standards. 11. The device according to claim 1, wherein the DC power signal level is at least 44 Volts. 12. The device according to claim 1, wherein the data rate over the wire pair is above 100 Mb/s or 1 Gb/s. 13. The device according to claim 1, wherein the vehicle is adapted for travelling on land. 14. The device according to claim 1, wherein the vehicle is adapted for travelling on water, or is airborne. 15. The device according to claim 1, wherein the vehicle is one out of a bicycle, a car, a motorcycle, a train, a ship, an aircraft, a boat, a spacecraft, a boat, a submarine, a dirigible, an electric scooter, a subway, a train, a trolleybus, a tram, a sailboat, a yacht, and an airplane. 16. A vehicle comprising the device according to claim 1. 17. An Electronic Control Unit (ECU) in the vehicle comprising the device according to claim 1. 18. The device according to claim 1, wherein the vehicle is an automobile, and wherein the device comprises an Electronic Control Unit (ECU), an Engine Control Unit (ECU), a Transmission Control Unit (TCU), an Anti-Lock Braking Device (ABS), or Body Control Modules (BCM). 19. The device according to claim 1, further for use with parking help, cruise control, lane keeping, road sign recognition, surveillance, speed limit warning, restricted entries, and pull-over commands, travel information, cooperative adaptive cruise control, cooperative forward collision warning, intersection collision avoidance, approaching emergency vehicle warning, vehicle safety inspection, transit or emergency vehicle signal priority, electronic parking payments, commercial vehicle clearance and safety inspections, in-vehicle signing, rollover warning, probe data collection, highway-rail intersection warning, or electronic toll collection, the device is further integrated with, or being part of, a vehicular communication device used for improved safety, traffic flow control, traffic reporting, or traffic management. 20. The device according to claim 1, wherein the communication over the single wire pair is according to, or based on, Control Area Network (CAN) or Local Interconnect Network (LIN). 21. The device according to claim 1, wherein the sensor is a piezoelectric sensor that includes single crystal material or a piezoelectric ceramics and uses a transverse, longitudinal, or shear effect mode of the piezoelectric effect. 22. The device according to claim 1, further comprising multiple sensors arranged as a directional sensor array operative to estimate the number, magnitude, frequency, Direction-Of-Arrival (DOA), distance, or speed of the phenomenon impinging the sensor array. 23. The device according to claim 1, wherein the sensor is a thermoelectric sensor that responds to a temperature or to a temperature gradient of an object using conduction, convection, or radiation, and wherein the thermoelectric sensor consists of, or comprises, a Positive Temperature Coefficient (PTC) thermistor, a Negative Temperature Coefficient (NTC) thermistor, a thermocouple, a quartz crystal, or a Resistance Temperature Detector (RTD). 24. The device according to claim 1, wherein the sensor consists of, or comprises, a nanosensor, a crystal, or a semiconductor, or wherein: the sensor is an ultrasonic based, the sensor is an eddy-current sensor, the sensor is a proximity sensor, the sensor is a bulk or surface acoustic sensor, or the sensor is an atmospheric or an environmental sensor. 25. The device according to claim 1, wherein the sensor is a radiation sensor that responds to radioactivity, nuclear radiation, alpha particles, beta particles, or gamma rays, and is based on gas ionization. 26. The device according to claim 1, wherein the sensor is a photoelectric sensor that responds to a visible or an invisible light, the invisible light is infrared, ultraviolet, X-rays, or gamma rays, and wherein the photoelectric sensor is based on the photoelectric or photovoltaic effect, and consists of, or comprises, a semiconductor component that consists of, or comprises, a photodiode, a phototransistor, or a solar cell. 27. The device according to claim 26, wherein the photoelectric sensor is based on Charge-Coupled Device (CCD) or a Complementary Metal-Oxide Semiconductor (CMOS) element. 28. The device according to claim 1, wherein the sensor is a photosensitive image sensor array comprising multiple photoelectric sensors, for capturing an image and producing electronic image information representing the image, and the device further comprising one or more optical lens for focusing the received light and to guide the image, and wherein the image sensor is disposed approximately at an image focal point plane of the one or more optical lens for properly capturing the image. 29. The device according to claim 1, wherein the sensor is an electrochemical sensor that responds to an object chemical structure, properties, composition, or reactions. 30. The device according to claim 29, wherein the electrochemical sensor is a pH meter or a gas sensor responding to a presence of radon, hydrogen, oxygen, or Carbon-Monoxide (CO), or wherein the electrochemical sensor is based on optical detection or on ionization and is a smoke, a flame, or a fire detector, or is responsive to combustible, flammable, or toxic gas. 31. The device according to claim 1, wherein the sensor is an electroacoustic sensor that responds to an audible or inaudible sound. 32. The device according to claim 31, wherein the electroacoustic sensor is an omnidirectional, unidirectional, or bidirectional microphone that is based on the sensing the incident sound based motion of a diaphragm or a ribbon, and the microphone consists of, or comprising, a condenser, an electret, a dynamic, a ribbon, a carbon, or a piezoelectric microphone. 33. The device according to claim 1, further being part of, or connectable to, a network via the wire pair, and wherein the device is addressable in the network using a digital address uniquely identifying the device in the network. 34. The device according to claim 33, wherein the digital address is a MAC layer address that is MAC-48, EUI-48, or EUI-64 address type. 35. The device according to claim 33, wherein the digital address is a layer 3 address and is static or dynamic IP address that is IPv4 or IPv6 type address. 36. The device according to claim 33, wherein the digital address is autonomously assigned or is assigned by another device via a communication interface using DHCP. 37. The device according to claim 33, wherein the network is a frame based network, and wherein the wire pair consists of, or comprises, an Unshielded Twisted wire Pair (UTP). 38. The device according to claim 37, wherein the frame based network is according to, based on, or compatible with, Ethernet or IEEE 802.3-2008 standard. 39. The device according to claim 38, wherein the frame based network is according to, based on, or compatible with, 10Base-T, 100Base-T, 100Base-TX, 100Base-T2, 100Base-T4, 1000Base-T, 1000Base-TX, 10GBase-CX4, or 10GBase-T. 40. The device according to claim 1, wherein the communication over the wire-pair is full duplex. 41. The device according to claim 1, further comprising an actuator that affects a second phenomenon in response to an actuator command, the actuator is coupled to the receive actuator command from the processor. 42. The device according to claim 41, wherein the actuator is coupled to be powered from the DC power signal. 43. The device according to claim 41, wherein the actuator command is responsive to the sensor output value. 44. The device according to claim 41, wherein the single enclosure further comprises the actuator. 45. The device according to claim 41, wherein the actuator is external to the single enclosure. 46. The device according to claim 41, wherein the actuator is mountable in the vehicle. 47. The device according to claim 41, wherein the actuator is operative to affect the second phenomenon inside the vehicle. 48. The device according to claim 41, wherein the actuator is operative to affect the second phenomenon external to the vehicle, or associated with surroundings around the vehicle. 49. The device according to claim 41, wherein the second phenomenon is the same as the first phenomenon. 50. The device according to claim 49, further operative for affecting a control loop for controlling the phenomenon, and wherein the control loop is a closed linear control loop where the sensor value serves as a feedback to command the actuator based of the loop deviation from a setpoint or a reference value. 51. The device according to claim 50, wherein the closed control loop is a proportional-based, an integral-based, a derivative-based, or a Proportional, Integral, and Derivative (PID) based control loop, wherein the control loop uses feed-forward, Bistable, Bang-Bang, Hysteretic, or fuzzy logic based control. 52. The device according to claim 50, wherein the control loop involves randomness based on random numbers; and the device further comprises a random number generator for generating random numbers, and wherein the random number generator is hardware-based using thermal noise, shot noise, nuclear decaying radiation, photoelectric effect, or quantum phenomena, or wherein the random number generator is software-based and executes an algorithm for generating pseudo-random numbers. 53. The device according to claim 50, wherein the setpoint is fixed, set by a user, or is time dependent. 54. The device according to claim 50, further comprising an additional sensor responsive to a phenomenon distinct from the first phenomenon, and wherein the setpoint is dependent upon the output of the additional sensor. 55. The device according to claim 41, further comprising an electrically actuated switch coupled for switching power to the actuator from the DC power, and wherein the electrically actuated switch coupled to the processor and is actuated in response to the actuator command. 56. The device according to claim 55, wherein the electrically actuated switch is ‘normally open’ type, ‘normally closed’ type, or a changeover switch, wherein the electrically actuated switch is ‘make-before-break’ or ‘break-before-make’ type, or wherein the electrically actuated switch have two or more poles or two or more throws, and the contacts of the first electrically actuated switch are arranged as a Single-Pole-Double-Throw (SPDT), Double-Pole-Double-Throw (DPDT), Double-Pole-Single-Throw (DPST), or Single-Pole-Changeover (SPCO). 57. The device according to claim 55, wherein the electrically actuated switch is a latching or non-latching type relay, and the relay is a solenoid-based electromagnetic relay that is a reed relay, wherein the relay is solid-state or semiconductor based, or wherein the relay is a Solid State Relay (SSR). 58. The device according to claim 41, wherein the actuator is a light source that emits visible or non-visible light for illumination or indication, the non-visible light is infrared, ultraviolet, X-rays, or gamma rays, and wherein the light source is an electric light source for converting electrical energy into light. 59. The device according to claim 58, wherein the electric light source consists of, or comprises, a lamp, an incandescent lamp, a gas discharge lamp, a fluorescent lamp, a Solid-State Lighting (SSL), a Light Emitting Diode (LED), an Organic LED (OLED), a polymer LED (PLED), or a laser diode. 60. The device according to claim 41, wherein the actuator is a motion actuator that causes linear or rotary motion, and the device further comprising a conversion mechanism for respectfully converting to rotary or linear motion based on a screw, a wheel and axle, or a cam. 61. The device according to claim 41, wherein the actuator is a sounder for converting an electrical energy to omnidirectional, unidirectional, or bidirectional pattern emitted, audible or inaudible, sound waves. 62. The device according to claim 41, wherein the actuator is a motion actuator that causes linear or rotary motion, and the device further comprising a conversion mechanism for respectfully converting to rotary or linear motion based on a screw, a wheel and axle, or a cam. 63. The device according to claim 62, wherein the motion actuator is an electrical motor. 64. The device according to claim 63, wherein the electrical motor is a brushed, a brushless, or an uncommutated DC motor, or wherein the DC motor is a stepper motor that is a Permanent Magnet (PM) motor, a Variable reluctance (VR) motor, or a hybrid synchronous stepper. 65. The device according to claim 63, wherein the electrical motor is an AC motor that is an induction motor, a synchronous motor, or an eddy current motor, and wherein the AC motor is a single-phase AC induction motor, a two-phase AC servo motor, or a three-phase AC synchronous motor, and the AC motor is a split-phase motor, a capacitor-start motor, or a Permanent-Split Capacitor (PSC) motor. 66. The device according to claim 62, wherein the motion actuator is a linear hydraulic actuator, a linear pneumatic actuator, a linear induction electric motor (LIM), or a Linear Synchronous electric Motor (LSM). 67. The device according to claim 62, wherein the motion actuator is based on a piezoelectric motor, a Surface Acoustic Wave (SAW) motor, a Squiggle motor, an ultrasonic motor, or a micro- or nanometer comb-drive capacitive actuator, a Dielectric or Ionic based Electroactive Polymers (EAPs) actuator, a solenoid, a thermal bimorph, or a piezoelectric unimorph actuator. 68. The device according to claim 41, wherein the actuator is a compressor or a pump and is operative to move, force, or compress liquid, gas or slurry, and the actuator. 69. The device according to claim 41, wherein the actuator is an electric thermoelectric actuator and is a heater or a cooler, operative for affecting the temperature of a solid, a liquid, or a gas object, and is coupled to the object by conduction, convection, force convention, thermal radiation, or by the transfer of energy by phase changes. 70. The device according to claim 69, wherein the thermoelectric actuator is a cooler based on a heat pump driving a refrigeration cycle using a compressor-based electric motor, or wherein the thermoelectric actuator is an electric heater that is a resistance heater or a dielectric heater. | 2,400 |
7,655 | 7,655 | 14,914,088 | 2,438 | Example embodiments disclosed herein relate to distributed pattern discovery. Single item itemsets are received. A new candidate item set is built for the respective single item itemsets if the respective single item itemsets are a new single item set or an item set size of a respective transaction set of the respective single item itemset is below a threshold. The new candidate item set and a respective transaction identifier is outputted to a set of nodes. | 1. A system for distributed pattern discovery comprising:
a plurality of nodes each comprising at least one processor and memory, wherein a first one of the nodes is a transaction itemset builder node that receives a plurality of itemset and transaction identifier pairs from a plurality of the other nodes; wherein the first node determines if the itemset and transaction identifier pairs are new compared to a frequent item set table; wherein the first node determines whether the respective itemset and transaction identifier pairs have a count that is below a threshold item set size for a transaction; and if the respective itemset and transaction identifier pairs have the count that is below the threshold item set size, the first node generates a new candidate itemset paired with its respective transaction identifier and sends the new candidate itemset pair to a second one of the nodes. 2. The system of claim 1, further comprising;
the second one of the nodes that is an item set counter node that receives the new candidate itemset pair; wherein the second node tracks a plurality of transaction sets for each of the new candidate itemset pairs and merges the respective transaction identifier with a transaction set of the same candidate item set to generate a new tuple. 3. The system of claim 2,
wherein the second node determines whether the new tuple is a frequent item set based on a set of rules; and wherein, if the new tuple is a frequent item set, the new triple is sent to a third node of the nodes. 4. The system of claim 3, further comprising:
the third node that is a pattern output node, wherein the pattern output node receives the new tuple and generates pattern data associated with the new tuple. 5. The system of claim 1, further comprising:
a fourth one of the nodes that maintains a single item-transaction set table, wherein if a size of a transaction set for a single item and it's respective transaction identifier is larger than a threshold, the single item is marked as a frequent single item and one of the itemset and transaction identifier pairs is generated. 6. The system of claim 5, further comprising;
a fifth one of the nodes that receives transaction data from data collectors, generates the single item and respective transaction identifier, and outputs the single item and respective transaction identifier to the fourth node. 7. A method for distributed pattern discovery comprising:
receiving transaction data from collectors at a first set of nodes; determining a plurality of single item and transaction identifier pairs from the transaction data; outputting the single item and transaction identifier pairs to a second set of nodes, wherein the second set of nodes determine if a transaction size of a transaction set for each of the single items is larger than a threshold and if so, the respective single item is marked as a respective frequent single item and a respective single item itemset is generated, wherein the respective single item itemset and the respective transaction set are sent to a third set of nodes. 8. The method of claim 7, further comprising:
receiving the respective single item itemsets at the third set of nodes; determining whether the respective single item itemsets is a new single tern set or an item set size of the respective transaction set is below a threshold, building a new candidate item set for the respective single item itemsets; outputting the new candidate item set and respective transaction identifier to a fourth set of nodes. 9. The method of claim 8, further comprising:
receiving, at the fourth set of nodes, the new candidate item set; merging the new candidate item set transaction identifier with a corresponding transaction set for the candidate item set to generate a new tuple. 10. The method of claim 9, further comprising:
checking the new tuple to determine whether the new tuple makes the candidate item set a frequent item set based on a set of rules. 11. The method of claim 10, further comprising:
outputting the new tuple to a fifth set of nodes, wherein the fifth set of nodes generates an associated pattern for the frequent item set. 12. A non-transitory machine-readable storage medium storing instructions that, if executed by at least one processor of a device for distributed pattern discovery, cause the device to:
receive single item itemsets; build a new candidate item set for the respective single item itemsets if the respective single item itemsets are a new single item set or an item set size of a respective transaction set of the respective single item itemset is below a threshold, and output the new candidate item set and respective transaction identifier to a set of nodes. 13. The non-transitory machine-readable storage medium of claim 12, wherein the respective single item itemsets are received from a plurality of nodes and correspond to respective items whose respective transaction set size is larger than a threshold. 14. The non-transitory machine-readable storage medium of claim 13, wherein the respective single tern itemsets are further based on data collectors processed at another plurality of nodes. 15. The non-transitory machine-readable storage medium of claim 13, wherein the device is selected to receive the respective single item itemsets based on load balancing. | Example embodiments disclosed herein relate to distributed pattern discovery. Single item itemsets are received. A new candidate item set is built for the respective single item itemsets if the respective single item itemsets are a new single item set or an item set size of a respective transaction set of the respective single item itemset is below a threshold. The new candidate item set and a respective transaction identifier is outputted to a set of nodes.1. A system for distributed pattern discovery comprising:
a plurality of nodes each comprising at least one processor and memory, wherein a first one of the nodes is a transaction itemset builder node that receives a plurality of itemset and transaction identifier pairs from a plurality of the other nodes; wherein the first node determines if the itemset and transaction identifier pairs are new compared to a frequent item set table; wherein the first node determines whether the respective itemset and transaction identifier pairs have a count that is below a threshold item set size for a transaction; and if the respective itemset and transaction identifier pairs have the count that is below the threshold item set size, the first node generates a new candidate itemset paired with its respective transaction identifier and sends the new candidate itemset pair to a second one of the nodes. 2. The system of claim 1, further comprising;
the second one of the nodes that is an item set counter node that receives the new candidate itemset pair; wherein the second node tracks a plurality of transaction sets for each of the new candidate itemset pairs and merges the respective transaction identifier with a transaction set of the same candidate item set to generate a new tuple. 3. The system of claim 2,
wherein the second node determines whether the new tuple is a frequent item set based on a set of rules; and wherein, if the new tuple is a frequent item set, the new triple is sent to a third node of the nodes. 4. The system of claim 3, further comprising:
the third node that is a pattern output node, wherein the pattern output node receives the new tuple and generates pattern data associated with the new tuple. 5. The system of claim 1, further comprising:
a fourth one of the nodes that maintains a single item-transaction set table, wherein if a size of a transaction set for a single item and it's respective transaction identifier is larger than a threshold, the single item is marked as a frequent single item and one of the itemset and transaction identifier pairs is generated. 6. The system of claim 5, further comprising;
a fifth one of the nodes that receives transaction data from data collectors, generates the single item and respective transaction identifier, and outputs the single item and respective transaction identifier to the fourth node. 7. A method for distributed pattern discovery comprising:
receiving transaction data from collectors at a first set of nodes; determining a plurality of single item and transaction identifier pairs from the transaction data; outputting the single item and transaction identifier pairs to a second set of nodes, wherein the second set of nodes determine if a transaction size of a transaction set for each of the single items is larger than a threshold and if so, the respective single item is marked as a respective frequent single item and a respective single item itemset is generated, wherein the respective single item itemset and the respective transaction set are sent to a third set of nodes. 8. The method of claim 7, further comprising:
receiving the respective single item itemsets at the third set of nodes; determining whether the respective single item itemsets is a new single tern set or an item set size of the respective transaction set is below a threshold, building a new candidate item set for the respective single item itemsets; outputting the new candidate item set and respective transaction identifier to a fourth set of nodes. 9. The method of claim 8, further comprising:
receiving, at the fourth set of nodes, the new candidate item set; merging the new candidate item set transaction identifier with a corresponding transaction set for the candidate item set to generate a new tuple. 10. The method of claim 9, further comprising:
checking the new tuple to determine whether the new tuple makes the candidate item set a frequent item set based on a set of rules. 11. The method of claim 10, further comprising:
outputting the new tuple to a fifth set of nodes, wherein the fifth set of nodes generates an associated pattern for the frequent item set. 12. A non-transitory machine-readable storage medium storing instructions that, if executed by at least one processor of a device for distributed pattern discovery, cause the device to:
receive single item itemsets; build a new candidate item set for the respective single item itemsets if the respective single item itemsets are a new single item set or an item set size of a respective transaction set of the respective single item itemset is below a threshold, and output the new candidate item set and respective transaction identifier to a set of nodes. 13. The non-transitory machine-readable storage medium of claim 12, wherein the respective single item itemsets are received from a plurality of nodes and correspond to respective items whose respective transaction set size is larger than a threshold. 14. The non-transitory machine-readable storage medium of claim 13, wherein the respective single tern itemsets are further based on data collectors processed at another plurality of nodes. 15. The non-transitory machine-readable storage medium of claim 13, wherein the device is selected to receive the respective single item itemsets based on load balancing. | 2,400 |
7,656 | 7,656 | 14,482,197 | 2,457 | Methods and systems for admitting new streaming sessions while preventing latency variations of existing sessions from exceeding their respective limits, including the steps of: receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session that is established over an existing path. Estimating, before the new streaming session is established, an estimated end-to-end latency variation of the existing streaming session, supposing the new streaming session is established over the new path. Determining, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit. And rejecting the request, based on the determination. | 1. A network configured to admit streaming sessions, comprising:
an admission controller and a latency variation calculator; the admission controller is configured to receive a request to establish a new streaming session over a new path, in presence of an existing streaming session; wherein the existing streaming session is established over an existing path, the new path and the existing path pass through an output port of a switch, and the existing streaming session is associated with a limit for its end-to-end latency variation; the latency variation calculator is configured to estimate, before the new streaming session is established, an estimated end-to-end latency variation of the existing streaming session, supposing the new streaming session is established over the new path; and the admission controller is further configured to: determine, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit, and reject the first request based on the determination. 2. The network of claim 1, wherein the admission controller is further configured to receive a second request to establish a second new streaming session over a second new path; the second new path and the existing path pass through a second output port of a second switch; the latency variation calculator is further configured to estimate, before the second new streaming session is established, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; and the admission controller is further configured to: determine, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, and admit the second request based on the second determination. 3. The network of claim 1, wherein the admission controller is further configured to receive a second request to establish a second new streaming session over a second new path; the second new path and the existing path pass through a second output port of a second switch; the latency variation calculator is further configured to estimate, at the second switch, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the admission controller is further configured to: determine, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, provisionally admit the second request based on the second determination, and forward the provisionally admitted second request to a third switch; the second output port is coupled to an input port of the third switch; the admission controller is further configured to: identify, at a fourth switch, which is coupled to a destination of the second new streaming session, that the second request was not previously rejected, and admit the second request based on the identifying. 4. The network of claim 1, wherein the latency variation calculator is further configured to predict a predicted local latency variation of the existing session at the output port, supposing the new streaming session is established over the new path, and to estimate the estimated end-to-end latency variation of the existing streaming session based on the predicted local latency variation. 5. The network of claim 4, wherein the latency variation calculator is further configured to predict a second predicted local latency variation of the existing streaming session at a second output port of a second switch, based on the predicted local latency variation at the output port; the output port is coupled to an input port of the second switch; and the latency variation calculator is further configured to estimate the estimated end-to-end latency variation of the existing streaming session based on the second predicted local latency variation. 6. The network of claim 5, wherein the estimated end-to-end latency variation is equal to a third predicted local latency variation of the existing streaming session at a third output port of a third switch, which is coupled to a destination of the existing streaming session. 7. The network of claim 4, wherein the latency variation calculator is further configured to utilize the predicted local latency variation as a lower bound for the estimated end-to-end latency variation. 8. The network of claim 4, wherein the latency variation calculator is further configured to calculate an additional latency variation of the existing streaming session at the output port, supposing the new streaming session is established over the new path, based on a difference between the predicted local latency variation, supposing the new streaming session is established over the new path, and a current local latency variation of the existing session at the output port, before the new streaming session is established; and the latency variation calculator is further configured to estimate the estimated end-to-end latency variation of the existing streaming session based on: the additional latency variation, and a current end-to-end latency variation of the existing session. 9. The network of claim 8, wherein the latency variation calculator is further configured to estimate the estimated end-to-end latency variation of the existing streaming session by adding the additional latency variation to the current end-to-end latency variation. 10. The network of claim 1, wherein the admission controller and the latency variation calculator comprise a local admission controller and a local latency variation calculator, respectively, associated with the second switch; the local admission controller is configured to receive a second request to establish a second new streaming session over a second new path; the second new path and the existing path pass through a second output port of the second switch; the local latency variation calculator is configured to estimate a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the local admission controller is further configured to: determine, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, and provisionally admit the second request based on the second determination, and forward thereof to a third switch; wherein the second output port is coupled to an input port of the third switch; the admission controller further comprises a second local admission controller associated with a forth switch, which is coupled to a destination of the second new streaming session; the second local admission controller is configured to: receive the second request, determining, by inspecting the second request, a second determination that the second request was not previously rejected, and admit the second request based the second determination. 11. A method for admitting new streaming sessions while preventing latency variations of existing sessions from exceeding their respective limits, comprising:
receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session which is established over an existing path; wherein the new path and the existing path pass through an output port of a switch, and the existing streaming session is associated with a limit for an allowable end-to-end latency variation thereof; estimating, before the new streaming session is established, an estimated end-to-end latency variation of the existing streaming session, supposing the new streaming session is established over the new path; determining, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit; and rejecting the request, based on the determination. 12. The method of claim 11, further comprising receiving a second request to establish a second new streaming session over a second new path; wherein the second new path and the existing path pass through a second output port of a second switch; the method further comprising estimating, before the second new streaming session is established, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the method further comprising:
determining, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, and admitting the second request based on the second determination. 13. The method of claim 11, further comprising receiving a second request to establish a second new streaming session over a second new path; wherein the second new path and the existing path pass through a second output port of a second switch; the method further comprises estimating, at the second switch, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the method further comprises: determining, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, provisionally admitting the second request based on the second determination, and forwarding the provisionally admitted second request to a third switch; wherein the second output port is coupled to an input port of the third switch; the method further comprises: identifying, at a fourth switch, which is coupled to a destination of the second new streaming session, that the second request was not previously rejected, and admitting the second request based on the identifying. 14. The method of claim 11, further comprising predicting a predicted local latency variation of the existing session at the output port, supposing the new streaming session is established over the new path; wherein the estimating is based on the predicted local latency variation. 15. The method of claim 14, further comprising predicting a second predicted local latency variation of the existing streaming session at a second output port of a second switch, based on the predicted local latency variation at the output port; wherein the output port is coupled to an input port of the second switch; and the estimating is based on the second predicted local latency variation. 16. The method of claim 15, wherein the estimated end-to-end latency variation is equal to a third predicted local latency variation of the existing streaming session at a third output port of a third switch, which is coupled to a destination of the existing streaming session. 17. The method of claim 14, wherein the predicted local latency variation is utilized as a lower bound for the estimated end-to-end latency variation. 18. The method of claim 14, further comprising calculating an additional latency variation of the existing streaming session at the output port, supposing the new streaming session is established over the new path; wherein the additional latency variation is based on a difference between the predicted local latency variation, supposing the new streaming session is established over the new path, and a current local latency variation of the existing session at the output port, before the new streaming session is established; and the estimating is based on: the additional latency variation, and a current end-to-end latency variation of the existing session. 19. The method of claim 18, wherein the estimating comprises adding the additional latency variation to the current end-to-end latency variation. 20. The method of claim 11, further comprising receiving a second request to establish a second new streaming session over a second new path; wherein the second new streaming session is associated with a second limit for a second allowable end-to-end latency variation thereof; the method further comprises predicting, before the second new streaming session is established, a second predicted end-to-end latency variation of the second new streaming session, supposing the second new streaming session is established over the second path; the method further comprises: determining, by comparing the second predicted end-to-end latency variation with the second limit, a second determination that the second predicted end-to-end latency variation exceeds the second limit, and rejecting the second request based on the second determination. | Methods and systems for admitting new streaming sessions while preventing latency variations of existing sessions from exceeding their respective limits, including the steps of: receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session that is established over an existing path. Estimating, before the new streaming session is established, an estimated end-to-end latency variation of the existing streaming session, supposing the new streaming session is established over the new path. Determining, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit. And rejecting the request, based on the determination.1. A network configured to admit streaming sessions, comprising:
an admission controller and a latency variation calculator; the admission controller is configured to receive a request to establish a new streaming session over a new path, in presence of an existing streaming session; wherein the existing streaming session is established over an existing path, the new path and the existing path pass through an output port of a switch, and the existing streaming session is associated with a limit for its end-to-end latency variation; the latency variation calculator is configured to estimate, before the new streaming session is established, an estimated end-to-end latency variation of the existing streaming session, supposing the new streaming session is established over the new path; and the admission controller is further configured to: determine, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit, and reject the first request based on the determination. 2. The network of claim 1, wherein the admission controller is further configured to receive a second request to establish a second new streaming session over a second new path; the second new path and the existing path pass through a second output port of a second switch; the latency variation calculator is further configured to estimate, before the second new streaming session is established, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; and the admission controller is further configured to: determine, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, and admit the second request based on the second determination. 3. The network of claim 1, wherein the admission controller is further configured to receive a second request to establish a second new streaming session over a second new path; the second new path and the existing path pass through a second output port of a second switch; the latency variation calculator is further configured to estimate, at the second switch, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the admission controller is further configured to: determine, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, provisionally admit the second request based on the second determination, and forward the provisionally admitted second request to a third switch; the second output port is coupled to an input port of the third switch; the admission controller is further configured to: identify, at a fourth switch, which is coupled to a destination of the second new streaming session, that the second request was not previously rejected, and admit the second request based on the identifying. 4. The network of claim 1, wherein the latency variation calculator is further configured to predict a predicted local latency variation of the existing session at the output port, supposing the new streaming session is established over the new path, and to estimate the estimated end-to-end latency variation of the existing streaming session based on the predicted local latency variation. 5. The network of claim 4, wherein the latency variation calculator is further configured to predict a second predicted local latency variation of the existing streaming session at a second output port of a second switch, based on the predicted local latency variation at the output port; the output port is coupled to an input port of the second switch; and the latency variation calculator is further configured to estimate the estimated end-to-end latency variation of the existing streaming session based on the second predicted local latency variation. 6. The network of claim 5, wherein the estimated end-to-end latency variation is equal to a third predicted local latency variation of the existing streaming session at a third output port of a third switch, which is coupled to a destination of the existing streaming session. 7. The network of claim 4, wherein the latency variation calculator is further configured to utilize the predicted local latency variation as a lower bound for the estimated end-to-end latency variation. 8. The network of claim 4, wherein the latency variation calculator is further configured to calculate an additional latency variation of the existing streaming session at the output port, supposing the new streaming session is established over the new path, based on a difference between the predicted local latency variation, supposing the new streaming session is established over the new path, and a current local latency variation of the existing session at the output port, before the new streaming session is established; and the latency variation calculator is further configured to estimate the estimated end-to-end latency variation of the existing streaming session based on: the additional latency variation, and a current end-to-end latency variation of the existing session. 9. The network of claim 8, wherein the latency variation calculator is further configured to estimate the estimated end-to-end latency variation of the existing streaming session by adding the additional latency variation to the current end-to-end latency variation. 10. The network of claim 1, wherein the admission controller and the latency variation calculator comprise a local admission controller and a local latency variation calculator, respectively, associated with the second switch; the local admission controller is configured to receive a second request to establish a second new streaming session over a second new path; the second new path and the existing path pass through a second output port of the second switch; the local latency variation calculator is configured to estimate a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the local admission controller is further configured to: determine, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, and provisionally admit the second request based on the second determination, and forward thereof to a third switch; wherein the second output port is coupled to an input port of the third switch; the admission controller further comprises a second local admission controller associated with a forth switch, which is coupled to a destination of the second new streaming session; the second local admission controller is configured to: receive the second request, determining, by inspecting the second request, a second determination that the second request was not previously rejected, and admit the second request based the second determination. 11. A method for admitting new streaming sessions while preventing latency variations of existing sessions from exceeding their respective limits, comprising:
receiving a request to establish a new streaming session over a new path, in presence of an existing streaming session which is established over an existing path; wherein the new path and the existing path pass through an output port of a switch, and the existing streaming session is associated with a limit for an allowable end-to-end latency variation thereof; estimating, before the new streaming session is established, an estimated end-to-end latency variation of the existing streaming session, supposing the new streaming session is established over the new path; determining, by comparing the estimated end-to-end latency variation with the limit, a determination that the estimated end-to-end latency variation exceeds the limit; and rejecting the request, based on the determination. 12. The method of claim 11, further comprising receiving a second request to establish a second new streaming session over a second new path; wherein the second new path and the existing path pass through a second output port of a second switch; the method further comprising estimating, before the second new streaming session is established, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the method further comprising:
determining, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, and admitting the second request based on the second determination. 13. The method of claim 11, further comprising receiving a second request to establish a second new streaming session over a second new path; wherein the second new path and the existing path pass through a second output port of a second switch; the method further comprises estimating, at the second switch, a second estimated end-to-end latency variation of the existing streaming session, supposing the second new streaming session is established over the second new path; the method further comprises: determining, by comparing the second estimated end-to-end latency variation with the limit, a second determination that the second estimated end-to-end latency variation does not exceed the limit, provisionally admitting the second request based on the second determination, and forwarding the provisionally admitted second request to a third switch; wherein the second output port is coupled to an input port of the third switch; the method further comprises: identifying, at a fourth switch, which is coupled to a destination of the second new streaming session, that the second request was not previously rejected, and admitting the second request based on the identifying. 14. The method of claim 11, further comprising predicting a predicted local latency variation of the existing session at the output port, supposing the new streaming session is established over the new path; wherein the estimating is based on the predicted local latency variation. 15. The method of claim 14, further comprising predicting a second predicted local latency variation of the existing streaming session at a second output port of a second switch, based on the predicted local latency variation at the output port; wherein the output port is coupled to an input port of the second switch; and the estimating is based on the second predicted local latency variation. 16. The method of claim 15, wherein the estimated end-to-end latency variation is equal to a third predicted local latency variation of the existing streaming session at a third output port of a third switch, which is coupled to a destination of the existing streaming session. 17. The method of claim 14, wherein the predicted local latency variation is utilized as a lower bound for the estimated end-to-end latency variation. 18. The method of claim 14, further comprising calculating an additional latency variation of the existing streaming session at the output port, supposing the new streaming session is established over the new path; wherein the additional latency variation is based on a difference between the predicted local latency variation, supposing the new streaming session is established over the new path, and a current local latency variation of the existing session at the output port, before the new streaming session is established; and the estimating is based on: the additional latency variation, and a current end-to-end latency variation of the existing session. 19. The method of claim 18, wherein the estimating comprises adding the additional latency variation to the current end-to-end latency variation. 20. The method of claim 11, further comprising receiving a second request to establish a second new streaming session over a second new path; wherein the second new streaming session is associated with a second limit for a second allowable end-to-end latency variation thereof; the method further comprises predicting, before the second new streaming session is established, a second predicted end-to-end latency variation of the second new streaming session, supposing the second new streaming session is established over the second path; the method further comprises: determining, by comparing the second predicted end-to-end latency variation with the second limit, a second determination that the second predicted end-to-end latency variation exceeds the second limit, and rejecting the second request based on the second determination. | 2,400 |
7,657 | 7,657 | 13,753,278 | 2,483 | A device comprising a video file creation module is configured to obtain a plurality of slices of coded video content. Parameter sets are associated with the coded video content. The video creation module encapsulates the plurality of slices of coded video content within one or more access units of a video stream. A first type of parameter set may be encapsulated within one or more access units of the video stream. A second type of parameter set may be encapsulated within a sample description. The sample description may include an indicator identifying a number of parameter sets stored within one or more access units of the video stream. | 1. A method of generating a video file including coded video content, the method comprising:
obtaining a plurality of slices of coded video content; obtaining a plurality of parameter sets associated with the plurality of slices of video content; encapsulating the plurality of slices of coded video content within a plurality of access units of a video stream; encapsulating the plurality of access units within a plurality of samples in a file track; and encapsulating a first plurality of parameter sets within the plurality of samples. 2. The method of claim 1, further comprising encapsulating a second plurality of parameter sets within a sample description of the file track. 3. The method of claim 2, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 4. The method of claim 3, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 5. The method of claim 3, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 6. The method of claim 2, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 7. The method of claim 2, wherein the second plurality of parameter sets consists of parameter sets of different types. 8. The method of claim 7, wherein encapsulating a second plurality of parameter sets within a sample description includes storing parameter set network abstraction layer units of each type in a dedicated array in the sample description. 9. The method of claim 8, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 10. The method of claim 2, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 11. The method of claim 10, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 12. The method of claim 1, wherein the first plurality of parameter sets consists of parameter sets of different types. 13. The method of claim 1, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 14. The method of claim 1, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 15. The method of claim 1, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 16. A device comprising a video file creation module configured to:
obtain a plurality of slices of coded video content; obtain a plurality of parameter sets associated with the plurality of slices of video content; encapsulate the plurality of slices of coded video content within a plurality of access units of a video stream; encapsulate the plurality of access units within a plurality of samples in a file track; and encapsulate a first plurality of parameter sets within the plurality of samples. 17. The device of claim 16, wherein the video file creation module is further configured to:
encapsulate a second plurality of parameter sets within a sample description of the file track. 18. The device of claim 17, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 19. The device of claim 18, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 20. The device of claim 18, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 21. The device of claim 17, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 22. The device of claim 17, wherein the second plurality of parameter sets consists of parameter sets of different types. 23. The device of claim 22, wherein encapsulating a second plurality of parameter sets within a sample description includes storing parameter set network abstraction layer units of each type in a dedicated array in the sample description. 24. The device of claim 23, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 25. The device of claim 17, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 26. The device of claim 25, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 27. The device of claim 16, wherein the first plurality of parameter sets consists of parameter sets of different types. 28. The device of claim 16, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 29. The device of claim 16, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 30. The device of claim 16, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 31. A non-transitory computer-readable storage medium having instructions stored thereon that upon execution cause one or more processors of a video coding device to:
obtain a plurality of slices of coded video content; obtain a plurality of parameter sets associated with the plurality of slices of video content; encapsulate the plurality of slices of coded video content within a plurality of access units of a video stream; encapsulate the plurality of access units within a plurality of samples in a file track; and encapsulate a first plurality of parameter sets within the plurality of samples. 32. The non-transitory computer readable medium of claim 31, wherein the instructions, when executed, further cause one or more processors to:
encapsulate a second plurality of parameter sets within a sample description of the file track. 33. The non-transitory computer readable medium of claim 32, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 34. The non-transitory computer readable medium of claim 33, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 35. The non-transitory computer readable medium of claim 33, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 36. The non-transitory computer readable medium of claim 32, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 37. The non-transitory computer readable medium of claim 32, wherein the second plurality of parameter sets consists of parameter sets of different types. 38. The non-transitory computer readable medium of claim 37, wherein encapsulating a second plurality of parameter sets within a sample description includes storing parameter set network abstraction layer units of each type in a dedicated array in the sample description. 39. The non-transitory computer readable medium of claim 38, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 40. The non-transitory computer readable medium of claim 32, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 41. The non-transitory computer readable medium of claim 40, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 42. The non-transitory computer readable medium of claim 31, wherein the first plurality of parameter sets consists of parameter sets of different types. 43. The non-transitory computer readable medium of claim 31, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 44. The non-transitory computer readable medium of claim 31, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 45. The non-transitory computer readable medium of claim 31, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 46. An apparatus configured to generate a video file including coded video content, the apparatus comprising:
means for obtaining a plurality of slices of coded video content; means for obtaining a plurality of parameter sets associated with the plurality of slices of video content; means for encapsulating the plurality of slices of coded video content within a plurality of access units of a video stream; means for encapsulating the plurality of access units within a plurality of samples in a file track; and means for encapsulating a first plurality of parameter sets within the plurality of samples. 47. A method of processing a video file including coded video content, the method comprising:
obtaining a file track including a plurality of samples; decapsulating a plurality of access units from the plurality of samples of a video stream in the file track; decapsulating a plurality of slices of coded video content from the plurality of access units; and decapsulating a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. 48. The method of claim 47, further comprising decapsulating a second plurality of parameter sets from a sample description of the file track. 49. The method of claim 48, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 50. The method of claim 49, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 51. The method of claim 49, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 52. The method of claim 48, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 53. The method of claim 48, wherein the second plurality of parameter sets consists of parameter sets of different types. 54. The method of claim 53, wherein parameter set network abstraction layer units of each type are stored in a dedicated array in the sample description. 55. The method of claim 54, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 56. The method of claim 48, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 57. The method of claim 56, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 58. The method of claim 47, wherein the first plurality of parameter sets consists of parameter sets of different types. 59. The method of claim 47, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 60. The method of claim 47, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 61. The method of claim 47, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 62. A device comprising a processor configured to:
obtain a file track including a plurality of samples; decapsulate a plurality of access units from the plurality of samples of a video stream in the file track; decapsulate a plurality of slices of coded video content from the plurality of access units; and decapsulate a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. 63. The device of claim 62, wherein the processor is further configured to decapsulate a second plurality of parameter sets from a sample description of the file track. 64. The device of claim 63, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 65. The device of claim 64, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 66. The device of claim 64, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 67. The device of claim 63, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 68. The device of claim 63, wherein the second plurality of parameter sets consists of parameter sets of different types. 69. The device of claim 68, wherein parameter set network abstraction layer units of each type are stored in a dedicated array in the sample description. 70. The device of claim 69, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 71. The device of claim 63, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 72. The device of claim 71, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 73. The device of claim 62, wherein the first plurality of parameter sets consists of parameter sets of different types. 74. The device of claim 62, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 75. The device of claim 62, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 76. The device of claim 62, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 77. A non-transitory computer-readable storage medium having instructions stored thereon that upon execution cause one or more processors of a video coding device to:
obtain a file track including a plurality of samples; decapsulate a plurality of access units from the plurality of samples of a video stream in the file track; decapsulate a plurality of slices of coded video content from the plurality of access units; and decapsulate a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. 78. The non-transitory computer-readable medium of claim 77, wherein the instructions, when executed, further cause one or more processors to decapsulate a second plurality of parameter sets from a sample description of the file track. 79. The non-transitory computer-readable medium of claim 78, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 80. The non-transitory computer-readable medium of claim 79, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 81. The non-transitory computer-readable medium of claim 79, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 82. The non-transitory computer-readable medium of claim 78, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 83. The non-transitory computer-readable medium of claim 78, wherein the second plurality of parameter sets consists of parameter sets of different types. 84. The non-transitory computer-readable medium of claim 83, wherein parameter set network abstraction layer units of each type are stored in a dedicated array in the sample description. 85. The non-transitory computer-readable medium of claim 84, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 86. The non-transitory computer-readable medium of claim 78, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 87. The non-transitory computer-readable medium of claim 86, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 88. The non-transitory computer-readable medium of claim 77, wherein the first plurality of parameter sets consists of parameter sets of different types. 89. The non-transitory computer-readable medium of claim 77, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 90. The non-transitory computer-readable medium of claim 77, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 91. The non-transitory computer-readable medium of claim 77, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 92. An apparatus configured to process a video file including coded video content, the apparatus comprising:
means for obtaining a file track including a plurality of samples; means for decapsulating a plurality of access units from the plurality of samples of a video stream in the file track; means for decapsulating a plurality of slices of coded video content from the plurality of access units; and means for decapsulating a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. | A device comprising a video file creation module is configured to obtain a plurality of slices of coded video content. Parameter sets are associated with the coded video content. The video creation module encapsulates the plurality of slices of coded video content within one or more access units of a video stream. A first type of parameter set may be encapsulated within one or more access units of the video stream. A second type of parameter set may be encapsulated within a sample description. The sample description may include an indicator identifying a number of parameter sets stored within one or more access units of the video stream.1. A method of generating a video file including coded video content, the method comprising:
obtaining a plurality of slices of coded video content; obtaining a plurality of parameter sets associated with the plurality of slices of video content; encapsulating the plurality of slices of coded video content within a plurality of access units of a video stream; encapsulating the plurality of access units within a plurality of samples in a file track; and encapsulating a first plurality of parameter sets within the plurality of samples. 2. The method of claim 1, further comprising encapsulating a second plurality of parameter sets within a sample description of the file track. 3. The method of claim 2, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 4. The method of claim 3, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 5. The method of claim 3, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 6. The method of claim 2, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 7. The method of claim 2, wherein the second plurality of parameter sets consists of parameter sets of different types. 8. The method of claim 7, wherein encapsulating a second plurality of parameter sets within a sample description includes storing parameter set network abstraction layer units of each type in a dedicated array in the sample description. 9. The method of claim 8, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 10. The method of claim 2, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 11. The method of claim 10, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 12. The method of claim 1, wherein the first plurality of parameter sets consists of parameter sets of different types. 13. The method of claim 1, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 14. The method of claim 1, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 15. The method of claim 1, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 16. A device comprising a video file creation module configured to:
obtain a plurality of slices of coded video content; obtain a plurality of parameter sets associated with the plurality of slices of video content; encapsulate the plurality of slices of coded video content within a plurality of access units of a video stream; encapsulate the plurality of access units within a plurality of samples in a file track; and encapsulate a first plurality of parameter sets within the plurality of samples. 17. The device of claim 16, wherein the video file creation module is further configured to:
encapsulate a second plurality of parameter sets within a sample description of the file track. 18. The device of claim 17, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 19. The device of claim 18, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 20. The device of claim 18, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 21. The device of claim 17, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 22. The device of claim 17, wherein the second plurality of parameter sets consists of parameter sets of different types. 23. The device of claim 22, wherein encapsulating a second plurality of parameter sets within a sample description includes storing parameter set network abstraction layer units of each type in a dedicated array in the sample description. 24. The device of claim 23, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 25. The device of claim 17, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 26. The device of claim 25, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 27. The device of claim 16, wherein the first plurality of parameter sets consists of parameter sets of different types. 28. The device of claim 16, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 29. The device of claim 16, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 30. The device of claim 16, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 31. A non-transitory computer-readable storage medium having instructions stored thereon that upon execution cause one or more processors of a video coding device to:
obtain a plurality of slices of coded video content; obtain a plurality of parameter sets associated with the plurality of slices of video content; encapsulate the plurality of slices of coded video content within a plurality of access units of a video stream; encapsulate the plurality of access units within a plurality of samples in a file track; and encapsulate a first plurality of parameter sets within the plurality of samples. 32. The non-transitory computer readable medium of claim 31, wherein the instructions, when executed, further cause one or more processors to:
encapsulate a second plurality of parameter sets within a sample description of the file track. 33. The non-transitory computer readable medium of claim 32, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 34. The non-transitory computer readable medium of claim 33, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 35. The non-transitory computer readable medium of claim 33, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 36. The non-transitory computer readable medium of claim 32, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 37. The non-transitory computer readable medium of claim 32, wherein the second plurality of parameter sets consists of parameter sets of different types. 38. The non-transitory computer readable medium of claim 37, wherein encapsulating a second plurality of parameter sets within a sample description includes storing parameter set network abstraction layer units of each type in a dedicated array in the sample description. 39. The non-transitory computer readable medium of claim 38, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 40. The non-transitory computer readable medium of claim 32, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 41. The non-transitory computer readable medium of claim 40, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 42. The non-transitory computer readable medium of claim 31, wherein the first plurality of parameter sets consists of parameter sets of different types. 43. The non-transitory computer readable medium of claim 31, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 44. The non-transitory computer readable medium of claim 31, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 45. The non-transitory computer readable medium of claim 31, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 46. An apparatus configured to generate a video file including coded video content, the apparatus comprising:
means for obtaining a plurality of slices of coded video content; means for obtaining a plurality of parameter sets associated with the plurality of slices of video content; means for encapsulating the plurality of slices of coded video content within a plurality of access units of a video stream; means for encapsulating the plurality of access units within a plurality of samples in a file track; and means for encapsulating a first plurality of parameter sets within the plurality of samples. 47. A method of processing a video file including coded video content, the method comprising:
obtaining a file track including a plurality of samples; decapsulating a plurality of access units from the plurality of samples of a video stream in the file track; decapsulating a plurality of slices of coded video content from the plurality of access units; and decapsulating a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. 48. The method of claim 47, further comprising decapsulating a second plurality of parameter sets from a sample description of the file track. 49. The method of claim 48, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 50. The method of claim 49, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 51. The method of claim 49, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 52. The method of claim 48, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 53. The method of claim 48, wherein the second plurality of parameter sets consists of parameter sets of different types. 54. The method of claim 53, wherein parameter set network abstraction layer units of each type are stored in a dedicated array in the sample description. 55. The method of claim 54, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 56. The method of claim 48, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 57. The method of claim 56, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 58. The method of claim 47, wherein the first plurality of parameter sets consists of parameter sets of different types. 59. The method of claim 47, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 60. The method of claim 47, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 61. The method of claim 47, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 62. A device comprising a processor configured to:
obtain a file track including a plurality of samples; decapsulate a plurality of access units from the plurality of samples of a video stream in the file track; decapsulate a plurality of slices of coded video content from the plurality of access units; and decapsulate a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. 63. The device of claim 62, wherein the processor is further configured to decapsulate a second plurality of parameter sets from a sample description of the file track. 64. The device of claim 63, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 65. The device of claim 64, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 66. The device of claim 64, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 67. The device of claim 63, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 68. The device of claim 63, wherein the second plurality of parameter sets consists of parameter sets of different types. 69. The device of claim 68, wherein parameter set network abstraction layer units of each type are stored in a dedicated array in the sample description. 70. The device of claim 69, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 71. The device of claim 63, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 72. The device of claim 71, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 73. The device of claim 62, wherein the first plurality of parameter sets consists of parameter sets of different types. 74. The device of claim 62, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 75. The device of claim 62, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 76. The device of claim 62, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 77. A non-transitory computer-readable storage medium having instructions stored thereon that upon execution cause one or more processors of a video coding device to:
obtain a file track including a plurality of samples; decapsulate a plurality of access units from the plurality of samples of a video stream in the file track; decapsulate a plurality of slices of coded video content from the plurality of access units; and decapsulate a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. 78. The non-transitory computer-readable medium of claim 77, wherein the instructions, when executed, further cause one or more processors to decapsulate a second plurality of parameter sets from a sample description of the file track. 79. The non-transitory computer-readable medium of claim 78, wherein the first plurality of parameter sets consists of parameter sets of a first type and the second plurality of parameter sets consists of parameter sets of a second type. 80. The non-transitory computer-readable medium of claim 79, wherein the first type is a picture parameter set, and the second type is a sequence parameter set. 81. The non-transitory computer-readable medium of claim 79, wherein the sample description includes an indicator identifying a number of parameter sets of the second type stored within the sample description. 82. The non-transitory computer-readable medium of claim 78, wherein the sample description includes an indicator identifying a number of parameter sets stored within the sample description. 83. The non-transitory computer-readable medium of claim 78, wherein the second plurality of parameter sets consists of parameter sets of different types. 84. The non-transitory computer-readable medium of claim 83, wherein parameter set network abstraction layer units of each type are stored in a dedicated array in the sample description. 85. The non-transitory computer-readable medium of claim 84, wherein the sample description further includes an array including supplemental enhancement information network abstraction layer units. 86. The non-transitory computer-readable medium of claim 78, wherein the first plurality of parameter sets and the second plurality of parameter sets consists of parameter sets of the same type. 87. The non-transitory computer-readable medium of claim 86, wherein the file track includes an indication of whether there may be parameter sets encapsulated both within a sample and within a sample description. 88. The non-transitory computer-readable medium of claim 77, wherein the first plurality of parameter sets consists of parameter sets of different types. 89. The non-transitory computer-readable medium of claim 77, wherein the sample description includes information associated with at least one of a frame rate and a spatial resolution of the video stream. 90. The non-transitory computer-readable medium of claim 77, wherein the video stream includes multiple temporal layers and wherein the sample description further includes an indication of the number of temporal layers of the video stream. 91. The non-transitory computer-readable medium of claim 77, wherein the file track contains a representation of the assignment of the samples in the track to temporal layers as well as a characteristics description for each of the temporal layers, wherein the characteristics includes at least one of temporal layer identification, profile, level, bitrate, and frame rate. 92. An apparatus configured to process a video file including coded video content, the apparatus comprising:
means for obtaining a file track including a plurality of samples; means for decapsulating a plurality of access units from the plurality of samples of a video stream in the file track; means for decapsulating a plurality of slices of coded video content from the plurality of access units; and means for decapsulating a plurality of parameter sets associated with the plurality of slices of video content from the plurality of samples. | 2,400 |
7,658 | 7,658 | 15,406,887 | 2,423 | Methods and systems to authorize devices and/or perform other actions based on identifying content distributors are described. In some example embodiments, the methods and systems access video content playing at a client device, calculate fingerprints of a portion of the video content, identify a distributor of the video content based on the fingerprints, and perform an action in response to the identification of the distributor of the video content, such as actions to authorize the client device or other associated devices (e.g., second screens) to receive content from the distributor, actions to present sponsored content to the client device or associated devices, and so on. | 1. A method, comprising:
accessing multiple video streams, each video stream being distributed by a different content distribution system among multiple content distribution systems, each video stream including same video content provided by a single content source to the multiple content distribution systems and including different distributor-specific content that is unique to the corresponding content distribution system that distributes the video stream, a video stream of the multiple video streams being available from a content distribution system of the multiple content distribution systems to a client device. for each of the multiple video streams:
generating a set of reference fingerprints of the distributor-specific content included within the video stream accessed from the corresponding content distribution system, and
associating the set of reference fingerprints with the corresponding content distribution system that distributes the video stream;
accessing a set of query fingerprints received from the client device, the set of query fingerprints being calculated from at least a portion of the distributor-specific content playing at the client device; querying a reference database that includes the sets of reference fingerprints to identify a set of reference fingerprints that corresponds to the set of query fingerprints: identifying content distribution system among the multiple content distribution systems and associated with the set of reference fingerprints that corresponds to the set of query fingerprints thereby to identify the content distribution system providing the video stream to the client device; accessing information that identifies a location of the client device; and performing an action dependent upon the identifying of the content distribution system among the multiple content distribution systems and the location of the client device. 2. The method of claim 1, wherein the performing of the action includes authorizing the client device to receive additional video content from the identified content distribution system. 3. The method of claim 1, wherein:
the client device is a first client device; and the performing of the action includes authorizing a second client device associated with the first client device to receive the video stream from the identified content distribution system. 4. The method of claim 1, wherein the performing of the action includes providing sponsored content that is associated with the identified content distribution system. 5. The method of claim 1, wherein:
the client device is a first client device; and the performing of the action includes providing supplemental content associated with the video stream to a second device associated with the first client device. 6. The method of claim 1, wherein:
the accessing of the information that identifies the location of the client device comprises receiving information that identifies the location of the client device; and the identifying of the content distribution system is based on the received information that identifies the location of the client device. 7. The method of claim 1, wherein the identifying of the content distribution system includes identifying a multichannel distributor that receives the video stream from the single content source and provides the video stream to the client device. 8. The method of claim 1, wherein the identifying of the content distribution system includes identifying at least one of a cable television system, a direct broadcast satellite system, or a wireline video provider of the video stream. 9. The method of claim 1, wherein the identifying of the content distribution system includes identifying an over-the-top content provider. 10. A system comprising:
a memory that stores instructions; and one or more processors configured by the instructions to perform operations comprising:
accessing multiple video streams, each video stream being distributed by a different content distribution system among multiple content distribution systems, each video stream including same video content provided by a single content source to the multiple content distribution systems and including different distributor-specific content that is unique to the corresponding content distribution system that distributes the video stream, a video stream of the multiple video streams being available from a content distribution system of the multiple content distribution systems to a client device;
for each of the multiple video streams:
generating a set of reference fingerprints of the distributor-specific content included within the video stream accessed from the corresponding content distribution system; and
associating the set of reference fingerprints with the corresponding content distribution system that distributes the video stream;
accessing a set of query fingerprints received from the client device, the set of query fingerprints being calculated from at least a portion of the distributor-specific content playing at the client device;
querying a reference database that includes the sets of reference fingerprints to identify a set of reference fingerprints that corresponds to the set of query fingerprints;
identifying the content distribution system among the multiple content distribution systems and associated with the set of reference fingerprints that corresponds to the set of query fingerprints thereby to identify the content distribution system providing the video stream to the client device;
accessing information that identifies a location of the client device; and
performing an action dependent upon the identifying of the content distribution system among the multiple content distribution systems and the location of the client device. 11. The system of claim 10, wherein the performing of the action includes authorizing the client device to receive additional video content from the identified content distribution system. 12. The system of claim 10, wherein:
the client device is a first client device; and the performing of the action includes authorizing a second client device associated with the first client device to receive the video stream from the identified content distribution system. 13. The system of claim 10, wherein the performing of the action includes providing sponsored content that is associated with the identified content distribution system. 14. The system of claim 10, wherein:
the client device is a first client device; and the performing of the action includes providing supplemental content associated with the video stream to a second device associated with the first client device. 15. The system of claim 10, wherein:
the accessing of the information that identifies the location of the client device comprises receiving information that identifies the location of the client device; and the identifying of the content distribution system is based on the received information that identifies the location of the client device. 16. The system of claim 10, wherein the identifying of the content distribution system includes identifying a multichannel distributor that receives the video stream from the single content source and provides the video stream to the client device. 17. The system of claim 10, wherein the identifying of the content distribution system includes identifying at least one of a cable television system, a direct broadcast satellite system, or a wireline video provider of the video stream. 18. The system of claim 10, wherein the identifying of the content distribution system includes identifying an over-the-top content provider. 19. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
accessing multiple video streams, each video stream being distributed by a different content distribution system among multiple content distribution systems, each video stream including same video content provided by a single content source to the multiple content distribution systems and including different distributor-specific content that is unique to the corresponding content distribution system that distributes the video stream, a video stream of the multiple video streams being available from a content distribution system of the multiple content distribution systems to a client device; for each of the multiple video streams:
generating a set of reference fingerprints of the distributor-specific content included within the video stream accessed from the corresponding content distribution system; and
associating the set of reference fingerprints with the corresponding content distribution system that distributes the video stream;
accessing a set of query fingerprints received from the client device, the set of query fingerprints being calculated from at least a portion of the distributor-specific content playing at the client device; querying a reference database that includes the sets of reference fingerprints to identify a set of reference fingerprints that corresponds to the set of query fingerprints; identifying the content distribution system among the multiple content distribution systems and associated with the set of reference fingerprints that corresponds to the set of query fingerprints thereby to identify the content distribution system providing the video stream to the client device; accessing information that identifies a location of the client device; and performing an action dependent upon the identifying of the content distribution system among the multiple content distribution systems and the location of the client device. 20. The non-transitory machine-readable storage medium of claim 19, wherein the performing of the action includes authorizing the client device to receive additional video content from the identified content distribution system. | Methods and systems to authorize devices and/or perform other actions based on identifying content distributors are described. In some example embodiments, the methods and systems access video content playing at a client device, calculate fingerprints of a portion of the video content, identify a distributor of the video content based on the fingerprints, and perform an action in response to the identification of the distributor of the video content, such as actions to authorize the client device or other associated devices (e.g., second screens) to receive content from the distributor, actions to present sponsored content to the client device or associated devices, and so on.1. A method, comprising:
accessing multiple video streams, each video stream being distributed by a different content distribution system among multiple content distribution systems, each video stream including same video content provided by a single content source to the multiple content distribution systems and including different distributor-specific content that is unique to the corresponding content distribution system that distributes the video stream, a video stream of the multiple video streams being available from a content distribution system of the multiple content distribution systems to a client device. for each of the multiple video streams:
generating a set of reference fingerprints of the distributor-specific content included within the video stream accessed from the corresponding content distribution system, and
associating the set of reference fingerprints with the corresponding content distribution system that distributes the video stream;
accessing a set of query fingerprints received from the client device, the set of query fingerprints being calculated from at least a portion of the distributor-specific content playing at the client device; querying a reference database that includes the sets of reference fingerprints to identify a set of reference fingerprints that corresponds to the set of query fingerprints: identifying content distribution system among the multiple content distribution systems and associated with the set of reference fingerprints that corresponds to the set of query fingerprints thereby to identify the content distribution system providing the video stream to the client device; accessing information that identifies a location of the client device; and performing an action dependent upon the identifying of the content distribution system among the multiple content distribution systems and the location of the client device. 2. The method of claim 1, wherein the performing of the action includes authorizing the client device to receive additional video content from the identified content distribution system. 3. The method of claim 1, wherein:
the client device is a first client device; and the performing of the action includes authorizing a second client device associated with the first client device to receive the video stream from the identified content distribution system. 4. The method of claim 1, wherein the performing of the action includes providing sponsored content that is associated with the identified content distribution system. 5. The method of claim 1, wherein:
the client device is a first client device; and the performing of the action includes providing supplemental content associated with the video stream to a second device associated with the first client device. 6. The method of claim 1, wherein:
the accessing of the information that identifies the location of the client device comprises receiving information that identifies the location of the client device; and the identifying of the content distribution system is based on the received information that identifies the location of the client device. 7. The method of claim 1, wherein the identifying of the content distribution system includes identifying a multichannel distributor that receives the video stream from the single content source and provides the video stream to the client device. 8. The method of claim 1, wherein the identifying of the content distribution system includes identifying at least one of a cable television system, a direct broadcast satellite system, or a wireline video provider of the video stream. 9. The method of claim 1, wherein the identifying of the content distribution system includes identifying an over-the-top content provider. 10. A system comprising:
a memory that stores instructions; and one or more processors configured by the instructions to perform operations comprising:
accessing multiple video streams, each video stream being distributed by a different content distribution system among multiple content distribution systems, each video stream including same video content provided by a single content source to the multiple content distribution systems and including different distributor-specific content that is unique to the corresponding content distribution system that distributes the video stream, a video stream of the multiple video streams being available from a content distribution system of the multiple content distribution systems to a client device;
for each of the multiple video streams:
generating a set of reference fingerprints of the distributor-specific content included within the video stream accessed from the corresponding content distribution system; and
associating the set of reference fingerprints with the corresponding content distribution system that distributes the video stream;
accessing a set of query fingerprints received from the client device, the set of query fingerprints being calculated from at least a portion of the distributor-specific content playing at the client device;
querying a reference database that includes the sets of reference fingerprints to identify a set of reference fingerprints that corresponds to the set of query fingerprints;
identifying the content distribution system among the multiple content distribution systems and associated with the set of reference fingerprints that corresponds to the set of query fingerprints thereby to identify the content distribution system providing the video stream to the client device;
accessing information that identifies a location of the client device; and
performing an action dependent upon the identifying of the content distribution system among the multiple content distribution systems and the location of the client device. 11. The system of claim 10, wherein the performing of the action includes authorizing the client device to receive additional video content from the identified content distribution system. 12. The system of claim 10, wherein:
the client device is a first client device; and the performing of the action includes authorizing a second client device associated with the first client device to receive the video stream from the identified content distribution system. 13. The system of claim 10, wherein the performing of the action includes providing sponsored content that is associated with the identified content distribution system. 14. The system of claim 10, wherein:
the client device is a first client device; and the performing of the action includes providing supplemental content associated with the video stream to a second device associated with the first client device. 15. The system of claim 10, wherein:
the accessing of the information that identifies the location of the client device comprises receiving information that identifies the location of the client device; and the identifying of the content distribution system is based on the received information that identifies the location of the client device. 16. The system of claim 10, wherein the identifying of the content distribution system includes identifying a multichannel distributor that receives the video stream from the single content source and provides the video stream to the client device. 17. The system of claim 10, wherein the identifying of the content distribution system includes identifying at least one of a cable television system, a direct broadcast satellite system, or a wireline video provider of the video stream. 18. The system of claim 10, wherein the identifying of the content distribution system includes identifying an over-the-top content provider. 19. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
accessing multiple video streams, each video stream being distributed by a different content distribution system among multiple content distribution systems, each video stream including same video content provided by a single content source to the multiple content distribution systems and including different distributor-specific content that is unique to the corresponding content distribution system that distributes the video stream, a video stream of the multiple video streams being available from a content distribution system of the multiple content distribution systems to a client device; for each of the multiple video streams:
generating a set of reference fingerprints of the distributor-specific content included within the video stream accessed from the corresponding content distribution system; and
associating the set of reference fingerprints with the corresponding content distribution system that distributes the video stream;
accessing a set of query fingerprints received from the client device, the set of query fingerprints being calculated from at least a portion of the distributor-specific content playing at the client device; querying a reference database that includes the sets of reference fingerprints to identify a set of reference fingerprints that corresponds to the set of query fingerprints; identifying the content distribution system among the multiple content distribution systems and associated with the set of reference fingerprints that corresponds to the set of query fingerprints thereby to identify the content distribution system providing the video stream to the client device; accessing information that identifies a location of the client device; and performing an action dependent upon the identifying of the content distribution system among the multiple content distribution systems and the location of the client device. 20. The non-transitory machine-readable storage medium of claim 19, wherein the performing of the action includes authorizing the client device to receive additional video content from the identified content distribution system. | 2,400 |
7,659 | 7,659 | 14,329,687 | 2,491 | A computer-implemented technique for determining whether a first computing device has the correct version of a software program may be used to provide a secure approach to verifying that a client computing device has a secure and approved version of content player software implemented for consuming downloaded copyright media content. With this technique, copyright media content providers are able to ensure that only secure and approved content players are implemented to access the content. | 1. A method, comprising:
receiving an application update for an application installed on a computing system, wherein the application update includes initial setup values for a key exchange protocol to be performed with a server machine, and the initial setup values are associated with a current version of the application; storing the initial setup values in a secure communication module associated with the computing system; applying the application update to the application; performing the key exchange protocol with the server machine to generate a key; and storing the key in the secure communication module. 2. The method of claim 1, wherein the initial setup values include a generator element value and a prime element value. 3. The method of claim 2, wherein the secure communication module includes a secret module in which the generator element value and the prime element value are stored, the secret module comprising an obfuscated module that cannot be accessed by an end-user. 4. The method of claim 1, wherein applying the application update comprises updating version information associated with the application to reflect the current version of the application. 5. The method of claim 1, wherein performing the key exchange protocol comprises:
computing a private value; computing a public value based on the private value and at least one of the initial setup values; sending the public value to the server machine; receiving a second public value from the server machine; and computing the key based on the second public value received from the server machine, the private value, and at least one of the initial setup values. 6. The method of claim 5, wherein the application comprises a content player, and further comprising transmitting a request to the server machine to download content from the server machine. 7. The method of claim 6, further comprising, in response to the request, receiving an encrypted message from the server machine. 8. The method of claim 7, decrypting encrypted message received from the server machine, transmitting the decrypted message to the server machine, and, in response to successfully decrypting the message, receiving downloaded content from the server machine. 9. The method of claim 1, wherein the key exchange protocol performed with the server machine is based on the Diffie-Hellman key exchange algorithm, the ElGamal encryption algorithm, or the Digital Signature Algorithm. 10. A computer system, comprising:
a memory storing instructions; and a processor that, when executing the instructions, performs the steps of:
receiving an application update for an application installed on the computing system, wherein the application update includes initial setup values for a key exchange protocol to be performed with a server machine, and the initial setup values are associated with a current version of the application,
storing the initial setup values in a secure communication module,
applying the application update to the application,
performing the key exchange protocol with the server machine to generate a key, and
storing the key in the secure communication module. 11. The computer system of claim 10, wherein the initial setup values include a generator element value and a prime element value. 12. The computer system of claim 11, wherein the secure communication module includes a secret module in which the generator element value and the prime element value are stored, the secret module comprising an obfuscated module that cannot be accessed by an end-user. 13. The computer system of claim 10, wherein applying the application update comprises updating version information associated with the application to reflect the current version of the application. 14. The computer system of claim 10, wherein performing the key exchange protocol comprises:
computing a private value; computing a public value based on the private value and at least one of the initial setup values; sending the public value to the server machine; receiving a second public value from the server machine; and computing the key based on the second public value received from the server machine, the private value, and at least one of the initial setup values. 15. The computer system of claim 14, wherein the application comprises a content player, and further comprising transmitting a request to the server machine to download content from the server machine. 16. The computer system of claim 15, further comprising, in response to the request, receiving an encrypted message from the server machine. 17. The computer system of claim 16, decrypting encrypted message received from the server machine, transmitting the decrypted message to the server machine, and, in response to successfully decrypting the message, receiving downloaded content from the server machine. 18. The computer system of claim 10, wherein the key exchange protocol performed with the server machine is based on the Diffie-Hellman key exchange algorithm, the ElGamal encryption algorithm, or the Digital Signature Algorithm. 19. A non-transitory computer-readable storage medium including instructions that, when executed by a processor within a computer system, cause the processor to perform the steps of:
receiving an application update for an application installed on the computing system, wherein the application update includes initial setup values for a key exchange protocol to be performed with a server machine, and the initial setup values are associated with a current version of the application; storing the initial setup values in a secure communication module; applying the application update to the application; performing the key exchange protocol with the server machine to generate a key; and storing the key in the secure communication module. 20. The computer-readable medium of claim 19, wherein the secure communication module includes a secret module in which the generator element value and the prime element value are stored, the secret module comprising an obfuscated module that cannot be accessed by an end-user. 21. The computer-readable medium of claim 19, wherein the key exchange protocol performed with the server machine is based on the Diffie-Hellman key exchange algorithm, the ElGamal encryption algorithm, or the Digital Signature Algorithm. | A computer-implemented technique for determining whether a first computing device has the correct version of a software program may be used to provide a secure approach to verifying that a client computing device has a secure and approved version of content player software implemented for consuming downloaded copyright media content. With this technique, copyright media content providers are able to ensure that only secure and approved content players are implemented to access the content.1. A method, comprising:
receiving an application update for an application installed on a computing system, wherein the application update includes initial setup values for a key exchange protocol to be performed with a server machine, and the initial setup values are associated with a current version of the application; storing the initial setup values in a secure communication module associated with the computing system; applying the application update to the application; performing the key exchange protocol with the server machine to generate a key; and storing the key in the secure communication module. 2. The method of claim 1, wherein the initial setup values include a generator element value and a prime element value. 3. The method of claim 2, wherein the secure communication module includes a secret module in which the generator element value and the prime element value are stored, the secret module comprising an obfuscated module that cannot be accessed by an end-user. 4. The method of claim 1, wherein applying the application update comprises updating version information associated with the application to reflect the current version of the application. 5. The method of claim 1, wherein performing the key exchange protocol comprises:
computing a private value; computing a public value based on the private value and at least one of the initial setup values; sending the public value to the server machine; receiving a second public value from the server machine; and computing the key based on the second public value received from the server machine, the private value, and at least one of the initial setup values. 6. The method of claim 5, wherein the application comprises a content player, and further comprising transmitting a request to the server machine to download content from the server machine. 7. The method of claim 6, further comprising, in response to the request, receiving an encrypted message from the server machine. 8. The method of claim 7, decrypting encrypted message received from the server machine, transmitting the decrypted message to the server machine, and, in response to successfully decrypting the message, receiving downloaded content from the server machine. 9. The method of claim 1, wherein the key exchange protocol performed with the server machine is based on the Diffie-Hellman key exchange algorithm, the ElGamal encryption algorithm, or the Digital Signature Algorithm. 10. A computer system, comprising:
a memory storing instructions; and a processor that, when executing the instructions, performs the steps of:
receiving an application update for an application installed on the computing system, wherein the application update includes initial setup values for a key exchange protocol to be performed with a server machine, and the initial setup values are associated with a current version of the application,
storing the initial setup values in a secure communication module,
applying the application update to the application,
performing the key exchange protocol with the server machine to generate a key, and
storing the key in the secure communication module. 11. The computer system of claim 10, wherein the initial setup values include a generator element value and a prime element value. 12. The computer system of claim 11, wherein the secure communication module includes a secret module in which the generator element value and the prime element value are stored, the secret module comprising an obfuscated module that cannot be accessed by an end-user. 13. The computer system of claim 10, wherein applying the application update comprises updating version information associated with the application to reflect the current version of the application. 14. The computer system of claim 10, wherein performing the key exchange protocol comprises:
computing a private value; computing a public value based on the private value and at least one of the initial setup values; sending the public value to the server machine; receiving a second public value from the server machine; and computing the key based on the second public value received from the server machine, the private value, and at least one of the initial setup values. 15. The computer system of claim 14, wherein the application comprises a content player, and further comprising transmitting a request to the server machine to download content from the server machine. 16. The computer system of claim 15, further comprising, in response to the request, receiving an encrypted message from the server machine. 17. The computer system of claim 16, decrypting encrypted message received from the server machine, transmitting the decrypted message to the server machine, and, in response to successfully decrypting the message, receiving downloaded content from the server machine. 18. The computer system of claim 10, wherein the key exchange protocol performed with the server machine is based on the Diffie-Hellman key exchange algorithm, the ElGamal encryption algorithm, or the Digital Signature Algorithm. 19. A non-transitory computer-readable storage medium including instructions that, when executed by a processor within a computer system, cause the processor to perform the steps of:
receiving an application update for an application installed on the computing system, wherein the application update includes initial setup values for a key exchange protocol to be performed with a server machine, and the initial setup values are associated with a current version of the application; storing the initial setup values in a secure communication module; applying the application update to the application; performing the key exchange protocol with the server machine to generate a key; and storing the key in the secure communication module. 20. The computer-readable medium of claim 19, wherein the secure communication module includes a secret module in which the generator element value and the prime element value are stored, the secret module comprising an obfuscated module that cannot be accessed by an end-user. 21. The computer-readable medium of claim 19, wherein the key exchange protocol performed with the server machine is based on the Diffie-Hellman key exchange algorithm, the ElGamal encryption algorithm, or the Digital Signature Algorithm. | 2,400 |
7,660 | 7,660 | 14,568,181 | 2,454 | A cluster compute server stores different types of data at different storage volumes in order to reduce data duplication at the storage volumes. The storage volumes are categorized into two classes: common storage volumes and dedicated storage volumes, wherein the common storage volumes store data to be accessed and used by multiple compute nodes (or multiple virtual servers) of the cluster compute server. The dedicated storage volumes, in contrast, store data to be accessed only by a corresponding compute node (or virtual server). | 1. A server system, comprising:
a fabric interconnect; a plurality of compute nodes coupled to the fabric interconnect to execute services for the server system, the plurality of compute nodes comprising a first compute node; and a first storage volume and a second storage volume coupled to the fabric interconnect, wherein:
in response to a first read request from the first compute node targeted to a first location of the first storage volume, the first storage volume provides data at the first location to the first compute node; and
in response to a first write request from the first compute node targeted to the first location of the first storage volume, the second storage volume writes data to a second location of the second storage volume. 2. The server system of claim 1, wherein:
in response to a second read request from the first compute node targeted to the first location after the first write request, the second storage volume provides data from the second location to the first compute node. 3. The server system of claim 2, further comprising:
a storage controller associated with the first compute node, the storage controller to:
write an address associated with the first location to a data structure in response to the first write request; and
provide the second read request to the second storage volume in response to identifying the address associated with the first location is stored at the data structure. 4. The server system of claim 3, wherein the data structure comprises a bloom filter. 5. The server system of claim 2, wherein:
the plurality of compute nodes comprises a second compute node; and in response to a second read request from the second compute node targeted to the first location of the first storage volume, the first storage volume provides data at the first location to the second compute node. 6. The server system of claim 5, further comprising:
a third storage volume coupled to the fabric interconnect; and wherein in response to a second write request from the second compute node targeted to the first location, the second storage volume writes data to a third storage location of the third storage volume. 7. The server system of claim 6, wherein:
in response to a third read request from the second compute node targeted to the first location, the third storage volume provides data from the third storage location to the second compute node. 8. The server system of claim 5, further comprising:
a first storage controller associated with the first compute node to encrypt data of the first write request according to a first encryption for storage at the second location. 9. The server system of claim 8, further comprising:
a first storage controller associated with the first compute node to encrypt data of the second write request according to a second encryption for storage at a third storage location, the second encryption different than the first. 10. The server system of claim 1, further comprising:
a third storage volume coupled to the fabric interconnect; and wherein in response to the first write request the third storage volume writes data to a third location of the second volume. 11. A server system, comprising:
a fabric interconnect to route messages; a common storage volume coupled to the fabric interconnect; a plurality of storage volumes coupled to the fabric interconnect; a plurality of compute nodes coupled to the fabric interconnect to execute services for the server system, each of the plurality of compute nodes to:
retrieve a first type of data from the common storage volume; and
store modifications of the first type of data at corresponding different ones of the plurality of storage volumes. 12. The server system of claim 11, wherein:
each of the plurality of compute nodes is to retrieve and store a second type of data at its corresponding different one of the plurality of storage volumes. 13. The server system of claim 12, wherein:
the first type of data comprises operating system configuration data for a server executing at a corresponding compute node of the plurality of compute nodes. 14. The server system of claim 13, wherein:
the second type of data comprises application data generated during execution of an application at the corresponding compute node of the plurality of compute nodes. 15. At a cluster compute server comprising a fabric interconnect and a plurality of compute nodes coupled to the fabric interconnect, a method comprising:
in response to a first read request from a first compute node targeted to a first location of a first storage volume coupled to the fabric interconnect, providing data at the first location to the first compute node; and in response to a first write request from the first compute node targeted to the first location of the first storage volume, writing data of the first write request to a second location of a second storage volume coupled to the fabric interconnect. 16. The method of claim 15, further comprising:
in response to a second read request from the first compute node targeted to the first location after the first write request, providing data from the second location to the first compute node. 17. The method of claim 16, further comprising:
writing an address associated with the first location to a data structure in response to the first write request; and providing the second read request to the second storage volume in response to identifying the address associated with the first location is stored at the data structure. 18. The method of claim 17, wherein the data structure comprises a bloom filter. 19. The method of claim 16, further comprising:
in response to a second read request from a second compute node targeted to the first location of the first storage volume, providing data at the first location to the second compute node. 20. The method of claim 19, further comprising:
in response to a second write request from the second compute node targeted to the first location, writing data to a third storage location of a third storage volume. | A cluster compute server stores different types of data at different storage volumes in order to reduce data duplication at the storage volumes. The storage volumes are categorized into two classes: common storage volumes and dedicated storage volumes, wherein the common storage volumes store data to be accessed and used by multiple compute nodes (or multiple virtual servers) of the cluster compute server. The dedicated storage volumes, in contrast, store data to be accessed only by a corresponding compute node (or virtual server).1. A server system, comprising:
a fabric interconnect; a plurality of compute nodes coupled to the fabric interconnect to execute services for the server system, the plurality of compute nodes comprising a first compute node; and a first storage volume and a second storage volume coupled to the fabric interconnect, wherein:
in response to a first read request from the first compute node targeted to a first location of the first storage volume, the first storage volume provides data at the first location to the first compute node; and
in response to a first write request from the first compute node targeted to the first location of the first storage volume, the second storage volume writes data to a second location of the second storage volume. 2. The server system of claim 1, wherein:
in response to a second read request from the first compute node targeted to the first location after the first write request, the second storage volume provides data from the second location to the first compute node. 3. The server system of claim 2, further comprising:
a storage controller associated with the first compute node, the storage controller to:
write an address associated with the first location to a data structure in response to the first write request; and
provide the second read request to the second storage volume in response to identifying the address associated with the first location is stored at the data structure. 4. The server system of claim 3, wherein the data structure comprises a bloom filter. 5. The server system of claim 2, wherein:
the plurality of compute nodes comprises a second compute node; and in response to a second read request from the second compute node targeted to the first location of the first storage volume, the first storage volume provides data at the first location to the second compute node. 6. The server system of claim 5, further comprising:
a third storage volume coupled to the fabric interconnect; and wherein in response to a second write request from the second compute node targeted to the first location, the second storage volume writes data to a third storage location of the third storage volume. 7. The server system of claim 6, wherein:
in response to a third read request from the second compute node targeted to the first location, the third storage volume provides data from the third storage location to the second compute node. 8. The server system of claim 5, further comprising:
a first storage controller associated with the first compute node to encrypt data of the first write request according to a first encryption for storage at the second location. 9. The server system of claim 8, further comprising:
a first storage controller associated with the first compute node to encrypt data of the second write request according to a second encryption for storage at a third storage location, the second encryption different than the first. 10. The server system of claim 1, further comprising:
a third storage volume coupled to the fabric interconnect; and wherein in response to the first write request the third storage volume writes data to a third location of the second volume. 11. A server system, comprising:
a fabric interconnect to route messages; a common storage volume coupled to the fabric interconnect; a plurality of storage volumes coupled to the fabric interconnect; a plurality of compute nodes coupled to the fabric interconnect to execute services for the server system, each of the plurality of compute nodes to:
retrieve a first type of data from the common storage volume; and
store modifications of the first type of data at corresponding different ones of the plurality of storage volumes. 12. The server system of claim 11, wherein:
each of the plurality of compute nodes is to retrieve and store a second type of data at its corresponding different one of the plurality of storage volumes. 13. The server system of claim 12, wherein:
the first type of data comprises operating system configuration data for a server executing at a corresponding compute node of the plurality of compute nodes. 14. The server system of claim 13, wherein:
the second type of data comprises application data generated during execution of an application at the corresponding compute node of the plurality of compute nodes. 15. At a cluster compute server comprising a fabric interconnect and a plurality of compute nodes coupled to the fabric interconnect, a method comprising:
in response to a first read request from a first compute node targeted to a first location of a first storage volume coupled to the fabric interconnect, providing data at the first location to the first compute node; and in response to a first write request from the first compute node targeted to the first location of the first storage volume, writing data of the first write request to a second location of a second storage volume coupled to the fabric interconnect. 16. The method of claim 15, further comprising:
in response to a second read request from the first compute node targeted to the first location after the first write request, providing data from the second location to the first compute node. 17. The method of claim 16, further comprising:
writing an address associated with the first location to a data structure in response to the first write request; and providing the second read request to the second storage volume in response to identifying the address associated with the first location is stored at the data structure. 18. The method of claim 17, wherein the data structure comprises a bloom filter. 19. The method of claim 16, further comprising:
in response to a second read request from a second compute node targeted to the first location of the first storage volume, providing data at the first location to the second compute node. 20. The method of claim 19, further comprising:
in response to a second write request from the second compute node targeted to the first location, writing data to a third storage location of a third storage volume. | 2,400 |
7,661 | 7,661 | 14,975,899 | 2,454 | To realize some of the advantages discussed above, there is provided a computerized method for dynamic shared compression between a first node and at least a second node communicatively connected over a network. The method comprises receiving by the first node a first plurality of data inputs from the at least a second node. At least a pattern corresponding to the received first plurality of data inputs is continuously determined. Compression metadata corresponding to the at least a pattern are periodically generated. The compression metadata is stored in a memory. The compression metadata is provided to the at least a second node. | 1. A computerized method for dynamic shared compression between a first node and at least a second node communicatively connected over a network, the method comprising:
receiving by the first node a first plurality of data inputs from the at least a second node; continuously determining at least a pattern corresponding to the received first plurality of data inputs; periodically generating compression metadata corresponding to the at least a pattern; storing the compression metadata in a memory; and providing the compression metadata to the at least a second node wherein the compression metadata comprises a data set smaller than a data set of the determined pattern. 2. The computerized method of claim 1, further comprising:
receiving by the first node a second plurality of data inputs from the at least a second node, the second plurality of data inputs compressed using the compression metadata; and decompressing at the first node the second plurality of data inputs using the stored compression metadata. 3. The computerized method of claim 2, wherein the compression metadata further comprises a version number. 4. The computerized method of claim 2, wherein the received second plurality of data inputs further comprise a first compression metadata version number, and the stored compression metadata further comprises a second version number. 5. The computerized method of claim 4, wherein decompressing is performed upon determination that the first compression metadata version number and the second version number are identical. 6. The computerized method of claim 1, wherein the first node provides unique compression metadata to each of a plurality of second nodes. 7. The computerized method of claim 1, wherein the first node provides shared compression metadata to each of a plurality of second nodes. 8. The computerized method of claim 1, wherein the compression metadata is any of: a symbol map, and delta encoding. 9. A computerized method for dynamic shared compression, the method comprising:
receiving a first plurality of data inputs; continuously determining at least a pattern corresponding to the received first plurality of data inputs; periodically generating compression metadata further corresponding to the at least a pattern, such that the compression metadata is smaller than the determined at least a pattern; using the compression metadata for compression and decompression of data. 10. The computerized method of claim 9, wherein the compression metadata further comprises a version number. 11. The computerized method of claim 9, wherein the compression metadata is shared with one or more computer nodes. 12. The computerized method of claim 9, wherein the compression metadata is any of: a symbol map, and delta encoding. 13. A computer node for performing dynamic shared data compression comprising:
a processing unit; a memory communicatively connected to the processing unit; the memory comprising instructions to enable the processing unit to: continuously determine at least a pattern from received input data; and generate metadata from the determined at least a pattern, wherein the metadata is smaller than the generated at least a pattern. 14. The computer node of claim 13, wherein the compression metadata further comprises a version number. 15. The computer node of claim 13, wherein the compression metadata is shared with one or more computer nodes. 16. The computer node of claim 13, wherein the compression metadata is any of: a symbol map, and delta encoding. | To realize some of the advantages discussed above, there is provided a computerized method for dynamic shared compression between a first node and at least a second node communicatively connected over a network. The method comprises receiving by the first node a first plurality of data inputs from the at least a second node. At least a pattern corresponding to the received first plurality of data inputs is continuously determined. Compression metadata corresponding to the at least a pattern are periodically generated. The compression metadata is stored in a memory. The compression metadata is provided to the at least a second node.1. A computerized method for dynamic shared compression between a first node and at least a second node communicatively connected over a network, the method comprising:
receiving by the first node a first plurality of data inputs from the at least a second node; continuously determining at least a pattern corresponding to the received first plurality of data inputs; periodically generating compression metadata corresponding to the at least a pattern; storing the compression metadata in a memory; and providing the compression metadata to the at least a second node wherein the compression metadata comprises a data set smaller than a data set of the determined pattern. 2. The computerized method of claim 1, further comprising:
receiving by the first node a second plurality of data inputs from the at least a second node, the second plurality of data inputs compressed using the compression metadata; and decompressing at the first node the second plurality of data inputs using the stored compression metadata. 3. The computerized method of claim 2, wherein the compression metadata further comprises a version number. 4. The computerized method of claim 2, wherein the received second plurality of data inputs further comprise a first compression metadata version number, and the stored compression metadata further comprises a second version number. 5. The computerized method of claim 4, wherein decompressing is performed upon determination that the first compression metadata version number and the second version number are identical. 6. The computerized method of claim 1, wherein the first node provides unique compression metadata to each of a plurality of second nodes. 7. The computerized method of claim 1, wherein the first node provides shared compression metadata to each of a plurality of second nodes. 8. The computerized method of claim 1, wherein the compression metadata is any of: a symbol map, and delta encoding. 9. A computerized method for dynamic shared compression, the method comprising:
receiving a first plurality of data inputs; continuously determining at least a pattern corresponding to the received first plurality of data inputs; periodically generating compression metadata further corresponding to the at least a pattern, such that the compression metadata is smaller than the determined at least a pattern; using the compression metadata for compression and decompression of data. 10. The computerized method of claim 9, wherein the compression metadata further comprises a version number. 11. The computerized method of claim 9, wherein the compression metadata is shared with one or more computer nodes. 12. The computerized method of claim 9, wherein the compression metadata is any of: a symbol map, and delta encoding. 13. A computer node for performing dynamic shared data compression comprising:
a processing unit; a memory communicatively connected to the processing unit; the memory comprising instructions to enable the processing unit to: continuously determine at least a pattern from received input data; and generate metadata from the determined at least a pattern, wherein the metadata is smaller than the generated at least a pattern. 14. The computer node of claim 13, wherein the compression metadata further comprises a version number. 15. The computer node of claim 13, wherein the compression metadata is shared with one or more computer nodes. 16. The computer node of claim 13, wherein the compression metadata is any of: a symbol map, and delta encoding. | 2,400 |
7,662 | 7,662 | 14,655,168 | 2,465 | A packet processing architecture includes a plurality of packet processing stages, wherein at least one of the packet processing stages includes multiple next processing stage modules that are operably coupled to respective further processing stages, wherein the multiple next processing stage modules are dynamically configurable. | 1. A packet processing architecture comprising a plurality of packet processing stages, wherein at least one of the packet processing stages comprises multiple next processing stage modules that are operably coupled to respective further processing stages, wherein the multiple next processing stage modules are dynamically configurable. 2. The packet processing architecture of claim 1 wherein multiple packet processing stages comprise multiple next processing stage modules. 3. The packet processing architecture of claim 1 wherein at least one of the packet processing stages is arranged to process a received data packet passing there through and in response thereto dynamically configure at least one of the multiple next processing stage modules operably coupled thereto. 4. The packet processing architecture of claim 3 wherein at least one of the packet processing stages is arranged to process the received data packet passing there through to determine a processing stage of the received data packet. 5. The packet processing architecture of claim 3 wherein at least one of the packet processing stages is arranged to process the received data packet passing there through to determine content of the received data packet. 6. The packet processing architecture of claim 3 wherein processing the data packet comprises performing a stateful examination of the packet content. 7. The packet processing architecture of claim 1 wherein at least one of the multiple next processing stage modules is arranged to feedback a received data packet to one or more previous processing stages. 8. The packet processing architecture of claim 7 wherein at least one of the multiple next processing stage modules forms a repeat feedback loop between processing stages. 9. The packet processing architecture of claim 1 wherein at least one of the multiple next processing stage modules is arranged to bypass one or more processing stages. 10. A method for a packet processing architecture comprising a plurality of packet processing stages, wherein at least one of the packet processing stages comprises multiple next processing stage modules, the method comprising:
dynamically configuring at least one of the next processing stage modules to route a data packet to one of the plurality of data stages. 11. The method for a packet processing architecture of claim 9, further comprising processing a received data packet passing through at least one of the processing stages and in response thereto dynamically configuring at least one of the multiple next processing stage modules operably coupled thereto. 12. The method for a packet processing architecture of claim 10 wherein processing the received data packet passing through comprises determining a processing stage of the received data packet. 13. The method for a packet processing architecture of claim 10 wherein processing the received data packet passing through comprises determining content of the received data packet. 14. The method for a packet processing architecture of claim 10 further comprising feeding back a received data packet to one or more previous processing stages. 15. The method for a packet processing architecture of claim 13 further comprising forming a repeat feedback look between processing stages. 16. The method for a packet processing architecture of claim 10 further comprising bypassing one or more processing stages. | A packet processing architecture includes a plurality of packet processing stages, wherein at least one of the packet processing stages includes multiple next processing stage modules that are operably coupled to respective further processing stages, wherein the multiple next processing stage modules are dynamically configurable.1. A packet processing architecture comprising a plurality of packet processing stages, wherein at least one of the packet processing stages comprises multiple next processing stage modules that are operably coupled to respective further processing stages, wherein the multiple next processing stage modules are dynamically configurable. 2. The packet processing architecture of claim 1 wherein multiple packet processing stages comprise multiple next processing stage modules. 3. The packet processing architecture of claim 1 wherein at least one of the packet processing stages is arranged to process a received data packet passing there through and in response thereto dynamically configure at least one of the multiple next processing stage modules operably coupled thereto. 4. The packet processing architecture of claim 3 wherein at least one of the packet processing stages is arranged to process the received data packet passing there through to determine a processing stage of the received data packet. 5. The packet processing architecture of claim 3 wherein at least one of the packet processing stages is arranged to process the received data packet passing there through to determine content of the received data packet. 6. The packet processing architecture of claim 3 wherein processing the data packet comprises performing a stateful examination of the packet content. 7. The packet processing architecture of claim 1 wherein at least one of the multiple next processing stage modules is arranged to feedback a received data packet to one or more previous processing stages. 8. The packet processing architecture of claim 7 wherein at least one of the multiple next processing stage modules forms a repeat feedback loop between processing stages. 9. The packet processing architecture of claim 1 wherein at least one of the multiple next processing stage modules is arranged to bypass one or more processing stages. 10. A method for a packet processing architecture comprising a plurality of packet processing stages, wherein at least one of the packet processing stages comprises multiple next processing stage modules, the method comprising:
dynamically configuring at least one of the next processing stage modules to route a data packet to one of the plurality of data stages. 11. The method for a packet processing architecture of claim 9, further comprising processing a received data packet passing through at least one of the processing stages and in response thereto dynamically configuring at least one of the multiple next processing stage modules operably coupled thereto. 12. The method for a packet processing architecture of claim 10 wherein processing the received data packet passing through comprises determining a processing stage of the received data packet. 13. The method for a packet processing architecture of claim 10 wherein processing the received data packet passing through comprises determining content of the received data packet. 14. The method for a packet processing architecture of claim 10 further comprising feeding back a received data packet to one or more previous processing stages. 15. The method for a packet processing architecture of claim 13 further comprising forming a repeat feedback look between processing stages. 16. The method for a packet processing architecture of claim 10 further comprising bypassing one or more processing stages. | 2,400 |
7,663 | 7,663 | 15,121,695 | 2,416 | A wireless network including a wireless access gateway (WAG) and methods are provided for routing traffic between non-cellular and cellular networks. The WAG interconnects at least one non-cellular network and at least one cellular network in an at least one-to-many relationship. The WAG receives a first IP address for the UE in the cellular domain and the WAG allocates a second IP address for the UE in the non-cellular domain. The WAG creates a routing rule including the first and second IP addresses for the UE and an additional data path identifier. | 1. A method of controlling a wireless access gateway (WAG) the WAG interconnecting at least one non-cellular network and at least one cellular network in an at least one-to-many relationship, the method comprising:
a WAG receiving a first IP address for a User Equipment from a first cellular network; the WAG allocating a second IP address for the UE and sending the second IP address to a first non-cellular network; and the WAG defining a routing rule including the first and second IP addresses for the UE and a data path identifier. 2. A method as claimed in claim 1, wherein the data path identifier is a first cellular network identifier. 3. A method as claimed in claim 1, wherein, before the WAG receives the first IP address for the UE, the method further comprises:
the WAG receiving a GPRS Tunnelling Protocol, GTP, request message from the first non-cellular network. 4. A method as claimed in claim 3, further comprising:
establishing a GTP tunnel between the WAG and the first non-cellular network. 5. A method as claimed in claim 1, further comprising, initially:
the WAG sending an authentication message for the UE to the first cellular network; and the WAG receiving an authentication vector for the UE from the first cellular network. 6. A method as claimed in claim 1, wherein the WAG allocates the second IP address for the UE from a dedicated pool of IP addresses for the first non-cellular network. 7. A method as claimed in claim 5, wherein the WAG interconnects a plurality of non-cellular networks to a cellular network, the method further comprising the steps of:
the WAG allocating a third IP address for the UE, the third IP address allocated from an IP address range dedicated to a second non-cellular network; the WAG sending the third IP address to the second non-cellular network; and the WAG updating the routing rule to include the first and third IP addresses for the UE. 8. A method as claimed in claim 7, wherein the WAG receives a plurality of authentication vectors for the UE from the first cellular network, the method further comprising:
storing an authentication vector of the plurality of authentication vectors; and using the stored authentication vector for the UE to authenticate the UE. 9. A method as claimed in claim 1, further comprising:
routing traffic according to the routing rule. 10. A method as claimed in claim 1, wherein the WAG also defines a translation rule including the first and second IP addresses for the UE. 11. A computer program containing computer-executable code which, when executed on a computer, causes the computer to perform the method of claim 1. 12. A device adapted to interconnect at least one non-cellular network and at least one cellular network in an at least one-to-many relationship, the device comprising:
a communications interface adapted to receive a first IP address for a User Equipment (UE) from a first cellular network; and a processor adapted to allocate a second IP address for the UE, wherein the communications interface is further adapted to send the second IP address to the first non-cellular network, and the processor is further adapted to create a routing rule including the first and second IP addresses for the UE and an additional data path identifier. 13. A device as claimed in claim 12, wherein the data path identifier is a first cellular network identifier. 14. A device as claimed in claim 12, wherein the communications interface is further adapted to receive a GPRS Tunneling Protocol, GTP, request message from the first non-cellular network. 15. A device as claimed in claim 14, wherein the processor is further adapted to establish a GTP tunnel with the first non-cellular network. 16. A device as claimed in claim 12, wherein the communications interface is adapted to send an authentication message for the UE to the first cellular network and to receive an authentication vector for the UE from the first cellular network. 17. A device as claimed in claim 12, wherein the processor is adapted to allocate the first IP address for the UE from an IP address range dedicated to the first non-cellular network. 18. A device as claimed in claim 16, adapted to interconnect a plurality of non-cellular networks to a cellular network, wherein the processor is further adapted to allocate a third IP address for the UE, the third IP address allocated from an IP address range dedicated to a second non-cellular network, the communications interface is further adapted to send the third IP address to the second non-cellular network, and the processor is adapted to update the routing rule to include the first and third IP addresses for the UE. 19. A device as claimed in claim 18, wherein the communications interface is adapted to receive a plurality of authentication vectors for the UE from the first cellular network, and the device further includes a memory adapted to store an authentication vector of the plurality of authentication vectors, and the processor is further adapted to use the stored authentication vector for the UE to authenticate the UE. 20. A device as claimed in claim 12, wherein the processor is adapted to route traffic according to the routing rule. 21. A device as claimed in claim 12, wherein the processor is also adapted to create a translation rule including the first and second IP addresses. 22. A device as claimed in claim 12, further comprising a Network Address Translation (NAT) wherein the processor is further adapted to update the NAT with the routing rule and the NAT is adapted to route traffic according to the routing rule. 23. A wireless network comprising the device as claimed in claim 12. | A wireless network including a wireless access gateway (WAG) and methods are provided for routing traffic between non-cellular and cellular networks. The WAG interconnects at least one non-cellular network and at least one cellular network in an at least one-to-many relationship. The WAG receives a first IP address for the UE in the cellular domain and the WAG allocates a second IP address for the UE in the non-cellular domain. The WAG creates a routing rule including the first and second IP addresses for the UE and an additional data path identifier.1. A method of controlling a wireless access gateway (WAG) the WAG interconnecting at least one non-cellular network and at least one cellular network in an at least one-to-many relationship, the method comprising:
a WAG receiving a first IP address for a User Equipment from a first cellular network; the WAG allocating a second IP address for the UE and sending the second IP address to a first non-cellular network; and the WAG defining a routing rule including the first and second IP addresses for the UE and a data path identifier. 2. A method as claimed in claim 1, wherein the data path identifier is a first cellular network identifier. 3. A method as claimed in claim 1, wherein, before the WAG receives the first IP address for the UE, the method further comprises:
the WAG receiving a GPRS Tunnelling Protocol, GTP, request message from the first non-cellular network. 4. A method as claimed in claim 3, further comprising:
establishing a GTP tunnel between the WAG and the first non-cellular network. 5. A method as claimed in claim 1, further comprising, initially:
the WAG sending an authentication message for the UE to the first cellular network; and the WAG receiving an authentication vector for the UE from the first cellular network. 6. A method as claimed in claim 1, wherein the WAG allocates the second IP address for the UE from a dedicated pool of IP addresses for the first non-cellular network. 7. A method as claimed in claim 5, wherein the WAG interconnects a plurality of non-cellular networks to a cellular network, the method further comprising the steps of:
the WAG allocating a third IP address for the UE, the third IP address allocated from an IP address range dedicated to a second non-cellular network; the WAG sending the third IP address to the second non-cellular network; and the WAG updating the routing rule to include the first and third IP addresses for the UE. 8. A method as claimed in claim 7, wherein the WAG receives a plurality of authentication vectors for the UE from the first cellular network, the method further comprising:
storing an authentication vector of the plurality of authentication vectors; and using the stored authentication vector for the UE to authenticate the UE. 9. A method as claimed in claim 1, further comprising:
routing traffic according to the routing rule. 10. A method as claimed in claim 1, wherein the WAG also defines a translation rule including the first and second IP addresses for the UE. 11. A computer program containing computer-executable code which, when executed on a computer, causes the computer to perform the method of claim 1. 12. A device adapted to interconnect at least one non-cellular network and at least one cellular network in an at least one-to-many relationship, the device comprising:
a communications interface adapted to receive a first IP address for a User Equipment (UE) from a first cellular network; and a processor adapted to allocate a second IP address for the UE, wherein the communications interface is further adapted to send the second IP address to the first non-cellular network, and the processor is further adapted to create a routing rule including the first and second IP addresses for the UE and an additional data path identifier. 13. A device as claimed in claim 12, wherein the data path identifier is a first cellular network identifier. 14. A device as claimed in claim 12, wherein the communications interface is further adapted to receive a GPRS Tunneling Protocol, GTP, request message from the first non-cellular network. 15. A device as claimed in claim 14, wherein the processor is further adapted to establish a GTP tunnel with the first non-cellular network. 16. A device as claimed in claim 12, wherein the communications interface is adapted to send an authentication message for the UE to the first cellular network and to receive an authentication vector for the UE from the first cellular network. 17. A device as claimed in claim 12, wherein the processor is adapted to allocate the first IP address for the UE from an IP address range dedicated to the first non-cellular network. 18. A device as claimed in claim 16, adapted to interconnect a plurality of non-cellular networks to a cellular network, wherein the processor is further adapted to allocate a third IP address for the UE, the third IP address allocated from an IP address range dedicated to a second non-cellular network, the communications interface is further adapted to send the third IP address to the second non-cellular network, and the processor is adapted to update the routing rule to include the first and third IP addresses for the UE. 19. A device as claimed in claim 18, wherein the communications interface is adapted to receive a plurality of authentication vectors for the UE from the first cellular network, and the device further includes a memory adapted to store an authentication vector of the plurality of authentication vectors, and the processor is further adapted to use the stored authentication vector for the UE to authenticate the UE. 20. A device as claimed in claim 12, wherein the processor is adapted to route traffic according to the routing rule. 21. A device as claimed in claim 12, wherein the processor is also adapted to create a translation rule including the first and second IP addresses. 22. A device as claimed in claim 12, further comprising a Network Address Translation (NAT) wherein the processor is further adapted to update the NAT with the routing rule and the NAT is adapted to route traffic according to the routing rule. 23. A wireless network comprising the device as claimed in claim 12. | 2,400 |
7,664 | 7,664 | 14,944,922 | 2,484 | The present invention relates to a method and apparatus for visualizing information of a digital video stream is disclosed. The apparatus comprises: a memory arranged to store a series of merged image frames which is formed by merging groups of image frames of the digital video stream; a blending module arranged to blend multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and a display arranged to display the series of blended image frames. | 1. A method for visualizing information of a digital video stream, the method comprising:
receiving a series of merged image frames which is formed by merging groups of image frames of the digital video stream; blending multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and displaying, on a display, the series of blended image frames. 2. The method according to claim 1, further comprising setting number of image frames contributing to each merged frame. 3. The method according to claim 1, further comprising setting number of merged image frames contributing to each blended image frame. 4. The method according to claim 1, wherein a merged image frame contributing weight is set to change between at least two of the blended image frames to which the merged image frame contributes. 5. The method according to claim 1, wherein a merged image frame contributing weight is set to be constant for each of the blended image frames to which the merged image frame contributes. 6. The method according to claim 1, wherein the displaying of the series of blended image frames is performed by displaying the blended image frames consecutively as a video stream of blended image frames. 7. The method according to claim 1, wherein the displaying of the series of blended image frames is performed by displaying the blended image frames side by side on the display. 8. The method according to claim 1, further comprising merging groups of image frames of the digital video stream into the series of merged image frames. 9. The method according to claim 8, further comprising reducing the resolution of the image frames before merging groups of image frames from the video stream into the series of merged image frames. 10. The method according to claim 8, further comprising reducing the resolution of the image frames upon merging groups of image frames from the video stream into the series of merged image frames. 11. The method according to claim 8, further comprising detecting an event of interest in the digital video stream and setting an image frame contributing weight for an image frame of the digital video stream comprising the event differently than an image frame contributing weight for an image frame of the digital video stream not comprising the event. 12. The method according to claim 1, further comprising detecting an event of interest in the digital video stream and setting a merged image frame contributing weight for a merged image frame comprising the event differently than a merged image frame contributing weight for a merged image frame not comprising the event. 13. An apparatus for visualizing information of a digital video stream, the apparatus comprising:
a memory arranged to store a series of merged image frames which is formed by merging groups of image frames of the digital video stream; a blending module arranged to blend multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and a display arranged to display the series of blended image frames. 14. The apparatus according to claim 13, further comprising a merging module arranged to merge groups of image frames from the digital video stream into the series of merged image frames. 15. A non-transitory computer readable recording medium configured to store a set of instructions that, when executed on a device having processor capabilities, cause the device to perform a method for visualizing information of a digital video stream, the method comprising:
receiving a series of merged image frames which is formed by merging groups of image frames of the digital video stream; blending multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and displaying, on a display, the series of blended image frames. | The present invention relates to a method and apparatus for visualizing information of a digital video stream is disclosed. The apparatus comprises: a memory arranged to store a series of merged image frames which is formed by merging groups of image frames of the digital video stream; a blending module arranged to blend multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and a display arranged to display the series of blended image frames.1. A method for visualizing information of a digital video stream, the method comprising:
receiving a series of merged image frames which is formed by merging groups of image frames of the digital video stream; blending multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and displaying, on a display, the series of blended image frames. 2. The method according to claim 1, further comprising setting number of image frames contributing to each merged frame. 3. The method according to claim 1, further comprising setting number of merged image frames contributing to each blended image frame. 4. The method according to claim 1, wherein a merged image frame contributing weight is set to change between at least two of the blended image frames to which the merged image frame contributes. 5. The method according to claim 1, wherein a merged image frame contributing weight is set to be constant for each of the blended image frames to which the merged image frame contributes. 6. The method according to claim 1, wherein the displaying of the series of blended image frames is performed by displaying the blended image frames consecutively as a video stream of blended image frames. 7. The method according to claim 1, wherein the displaying of the series of blended image frames is performed by displaying the blended image frames side by side on the display. 8. The method according to claim 1, further comprising merging groups of image frames of the digital video stream into the series of merged image frames. 9. The method according to claim 8, further comprising reducing the resolution of the image frames before merging groups of image frames from the video stream into the series of merged image frames. 10. The method according to claim 8, further comprising reducing the resolution of the image frames upon merging groups of image frames from the video stream into the series of merged image frames. 11. The method according to claim 8, further comprising detecting an event of interest in the digital video stream and setting an image frame contributing weight for an image frame of the digital video stream comprising the event differently than an image frame contributing weight for an image frame of the digital video stream not comprising the event. 12. The method according to claim 1, further comprising detecting an event of interest in the digital video stream and setting a merged image frame contributing weight for a merged image frame comprising the event differently than a merged image frame contributing weight for a merged image frame not comprising the event. 13. An apparatus for visualizing information of a digital video stream, the apparatus comprising:
a memory arranged to store a series of merged image frames which is formed by merging groups of image frames of the digital video stream; a blending module arranged to blend multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and a display arranged to display the series of blended image frames. 14. The apparatus according to claim 13, further comprising a merging module arranged to merge groups of image frames from the digital video stream into the series of merged image frames. 15. A non-transitory computer readable recording medium configured to store a set of instructions that, when executed on a device having processor capabilities, cause the device to perform a method for visualizing information of a digital video stream, the method comprising:
receiving a series of merged image frames which is formed by merging groups of image frames of the digital video stream; blending multiple merged frames into a series of blended image frames, wherein each of a plurality of the merged image frames contributes to a plurality of the blended image frames; and displaying, on a display, the series of blended image frames. | 2,400 |
7,665 | 7,665 | 15,057,492 | 2,426 | A generation apparatus according to an embodiment includes an acquiring unit and a generating unit. The acquiring unit acquires information on usage of a moving image content used via a partial moving image that is used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image. The generating unit generates a partial moving image corresponding to the moving image content on the basis of the information acquired by the acquiring unit. | 1. A generation apparatus comprising:
an acquiring unit that acquires information on usage of a moving image content corresponding to a partial moving image used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image; and a generating unit that generates a partial moving image corresponding to the moving image content on the basis of the information acquired by the acquiring unit. 2. The generation apparatus according to claim 1, wherein
the acquiring unit acquires, as the information on the usage, information on a user corresponding to the terminal device, and the generating unit generates the partial moving image corresponding to each user class classified by user attribute information, on the basis of the information on the user acquired by the acquiring unit. 3. The generation apparatus according to claim 2, wherein
the acquiring unit acquires, as the information on the user, a social graph that is information indicating a correlation of users in a network environment, and the generating unit generates the partial moving image corresponding to each user class classified by the social graph acquired by the acquiring unit. 4. The generation apparatus according to claim 1, further comprising:
an evaluating unit that evaluates the partial moving image by an index value indicating an impact of the partial moving image on viewing of the moving image content, on the basis of the information acquired by the acquiring unit, wherein the generating unit generates a partial moving image from the moving image content on the basis of a result of evaluation performed by the evaluating unit. 5. The generation apparatus according to claim 4, wherein
the evaluating unit performs machine learning about a correlation between the index value and information on a user who operates the terminal device, and the generating unit generates a partial moving image for which the index value with respect to a user as a distribution destination is expected to meet a predetermined condition, on the basis of a result of the machine learning. 6. The generation apparatus according to claim 4, further comprising a distributing unit that distributes the partial moving image to the terminal device in accordance with a distribution rate that is calculated based on the result of the evaluation performed by the evaluating unit. 7. The generation apparatus according to claim 1, wherein
the acquiring unit acquires, as the information on the usage, at least one of a rate at which a user selects the partial moving image, a completion rate of a moving image content viewed via the partial moving image, and a bookmark rate of the moving image content, and the generating unit generates the partial moving image on the basis of the information on the usage acquired by the acquiring unit. 8. A generation method implemented by a computer, comprising:
acquiring information on usage of a moving image content corresponding to a partial moving image used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image; and generating a partial moving image corresponding to the moving image content on the basis of the information acquired at the acquiring. 9. A non-transitory computer readable storage medium having stored therein a generation program causing a computer to execute a process comprising:
acquiring information on usage of a moving image content corresponding to a partial moving image used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image; and generating a partial moving image corresponding to the moving image content on the basis of the information acquired at the acquiring. | A generation apparatus according to an embodiment includes an acquiring unit and a generating unit. The acquiring unit acquires information on usage of a moving image content used via a partial moving image that is used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image. The generating unit generates a partial moving image corresponding to the moving image content on the basis of the information acquired by the acquiring unit.1. A generation apparatus comprising:
an acquiring unit that acquires information on usage of a moving image content corresponding to a partial moving image used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image; and a generating unit that generates a partial moving image corresponding to the moving image content on the basis of the information acquired by the acquiring unit. 2. The generation apparatus according to claim 1, wherein
the acquiring unit acquires, as the information on the usage, information on a user corresponding to the terminal device, and the generating unit generates the partial moving image corresponding to each user class classified by user attribute information, on the basis of the information on the user acquired by the acquiring unit. 3. The generation apparatus according to claim 2, wherein
the acquiring unit acquires, as the information on the user, a social graph that is information indicating a correlation of users in a network environment, and the generating unit generates the partial moving image corresponding to each user class classified by the social graph acquired by the acquiring unit. 4. The generation apparatus according to claim 1, further comprising:
an evaluating unit that evaluates the partial moving image by an index value indicating an impact of the partial moving image on viewing of the moving image content, on the basis of the information acquired by the acquiring unit, wherein the generating unit generates a partial moving image from the moving image content on the basis of a result of evaluation performed by the evaluating unit. 5. The generation apparatus according to claim 4, wherein
the evaluating unit performs machine learning about a correlation between the index value and information on a user who operates the terminal device, and the generating unit generates a partial moving image for which the index value with respect to a user as a distribution destination is expected to meet a predetermined condition, on the basis of a result of the machine learning. 6. The generation apparatus according to claim 4, further comprising a distributing unit that distributes the partial moving image to the terminal device in accordance with a distribution rate that is calculated based on the result of the evaluation performed by the evaluating unit. 7. The generation apparatus according to claim 1, wherein
the acquiring unit acquires, as the information on the usage, at least one of a rate at which a user selects the partial moving image, a completion rate of a moving image content viewed via the partial moving image, and a bookmark rate of the moving image content, and the generating unit generates the partial moving image on the basis of the information on the usage acquired by the acquiring unit. 8. A generation method implemented by a computer, comprising:
acquiring information on usage of a moving image content corresponding to a partial moving image used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image; and generating a partial moving image corresponding to the moving image content on the basis of the information acquired at the acquiring. 9. A non-transitory computer readable storage medium having stored therein a generation program causing a computer to execute a process comprising:
acquiring information on usage of a moving image content corresponding to a partial moving image used as a key image of the moving image content in a terminal device that is a distribution destination of the partial moving image; and generating a partial moving image corresponding to the moving image content on the basis of the information acquired at the acquiring. | 2,400 |
7,666 | 7,666 | 14,797,052 | 2,492 | Methods, systems, and computer readable media for managing order processing and fallout are disclosed. One exemplary method includes receiving a message object and segmenting the received message object into structural data segments and textual data segments. The method further includes utilizing a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments, creating a new message object including the structural data segments and the hashed textual data segments, and sending the new message object in lieu of the received message object to a message scanning entity for evaluation. | 1. A method comprising:
receiving a message object; segmenting the received message object into structural data segments and textual data segments; utilizing a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments; creating a new message object including the structural data segments and the hashed textual data segments; and sending the new message object in lieu of the received message object to a message scanning entity for evaluation. 2. The method of claim 1 wherein segmenting the received message object includes segmenting the received message object into the structural data segments, the textual data segments, and external content link data segments. 3. The method of claim 2 comprises accessing a whitelist or a blacklist to determine whether to process the external content link data in a manner similar to the structural data segments or the textual data segments. 4. The method of claim 1 wherein hashing the textual data segments includes:
generating a random key value;
applying, for each of the textual data segments, a single textual data segment and the random key value to a hash function to generate a hash value; and
determining if the hash value exists as an element in any of a plurality of stored tuples associated with the received message object. 5. The method of claim 4 comprising, in the event the hash value is determined to not be an element in any of the plurality of stored tuples, creating a tuple entry including the hash value, the single textual data segment, and a count value into the tuple table and replacing the single textual data segment with the hash value in the new message object. 6. The method of claim 4 comprises, in the event the hash value is determined to be an element in one of the plurality of stored tuples, rehashing the hash value by a number of times indicated by a count value element contained in the one of the plurality of stored tuples to produce a new hash value and replacing the single textual data segment with the new hash value in the new message object. 7. The method of claim 1 wherein the message object includes HTML content. 8. A system comprising:
at least one processor; a memory; and a message object management module that is stored in the memory and when executed by the at least one processor is configured to receive a message object, to segment the received message object into structural data segments and textual data segments, to utilize a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments, to create a new message object including the structural data segments and the hashed textual data segments, and to send the new message object in lieu of the received message object to a message scanning entity for evaluation. 9. The system of claim 8 wherein the message object management module is further configured to segment the received message object into the structural data segments, the textual data segments, and external content link data segments. 10. The system of claim 9 wherein the message object management module is further configured to access a whitelist or a blacklist to determine whether to process the external content link data in a manner similar to the structural data segments or the textual data segments. 11. The system of claim 8 wherein the message object management module is further configured to:
generate a random key value;
apply, for each of the textual data segments, a single textual data segment and the random key value to a hash function to generate a hash value; and
determine if the hash value exists as an element in any of a plurality of stored tuples associated with the received message object. 12. The system of claim 11 wherein the message object management module is further configured to, in the event the hash value is determined to not be an element in any of the plurality of stored tuples, create a tuple entry including the hash value, the single textual data segment, and a count value into the tuple table and replacing the single textual data segment with the hash value in the new message object. 13. The system of claim 11 the message object management module is further configured to, in the event the hash value is determined to be an element in on of the plurality of stored tuples, rehash the hash value by a number of times indicated by a count value element contained in the one of the plurality of stored tuples to produce a new hash value and replacing the single textual data segment with the new hash value in the new message object. 14. The system of claim 8 wherein the message object includes HTML content. 15. A non-transitory computer readable medium having stored thereon executable instructions that when executed by a processor of a computer cause the computer to perform steps comprising:
receiving a message object; segmenting the received message object into structural data segments and textual data segments; utilizing a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments; creating a new message object including the structural data segments and the hashed textual data segments; and sending the new message object in lieu of the received message object to a message scanning entity for evaluation. 16. The computer readable medium of claim 15 wherein segmenting the received message object includes segmenting the received message object into the structural data segments, the textual data segments, and external content link data segments. 17. The computer readable medium of claim 16 comprises accessing a whitelist or a blacklist to determine whether to process the external content link data in a manner similar to the structural data segments or the textual data segments. 18. The computer readable medium of claim 15 wherein hashing the textual data segments includes:
generating a random key value;
applying, for each of the textual data segments, a single textual data segment and the random key value to a hash function to generate a hash value; and
determining if the hash value exists as an element in any of a plurality of stored tuples associated with the received message object. 19. The computer readable medium of claim 18 comprising, in the event the hash value is determined to not be an element in any of the plurality of stored tuples, creating a tuple entry including the hash value, the single textual data segment, and a count value into the tuple table and replacing the single textual data segment with the hash value in the new message object. 20. The computer readable medium of claim 18 comprises, in the event the hash value is determined to be an element in one of the plurality of stored tuples, rehashing the hash value by a number of times indicated by a count value element contained in the one of the plurality of store tuples to produce a new hash value and replacing the single textual data segment with the new hash value in the new message object. | Methods, systems, and computer readable media for managing order processing and fallout are disclosed. One exemplary method includes receiving a message object and segmenting the received message object into structural data segments and textual data segments. The method further includes utilizing a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments, creating a new message object including the structural data segments and the hashed textual data segments, and sending the new message object in lieu of the received message object to a message scanning entity for evaluation.1. A method comprising:
receiving a message object; segmenting the received message object into structural data segments and textual data segments; utilizing a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments; creating a new message object including the structural data segments and the hashed textual data segments; and sending the new message object in lieu of the received message object to a message scanning entity for evaluation. 2. The method of claim 1 wherein segmenting the received message object includes segmenting the received message object into the structural data segments, the textual data segments, and external content link data segments. 3. The method of claim 2 comprises accessing a whitelist or a blacklist to determine whether to process the external content link data in a manner similar to the structural data segments or the textual data segments. 4. The method of claim 1 wherein hashing the textual data segments includes:
generating a random key value;
applying, for each of the textual data segments, a single textual data segment and the random key value to a hash function to generate a hash value; and
determining if the hash value exists as an element in any of a plurality of stored tuples associated with the received message object. 5. The method of claim 4 comprising, in the event the hash value is determined to not be an element in any of the plurality of stored tuples, creating a tuple entry including the hash value, the single textual data segment, and a count value into the tuple table and replacing the single textual data segment with the hash value in the new message object. 6. The method of claim 4 comprises, in the event the hash value is determined to be an element in one of the plurality of stored tuples, rehashing the hash value by a number of times indicated by a count value element contained in the one of the plurality of stored tuples to produce a new hash value and replacing the single textual data segment with the new hash value in the new message object. 7. The method of claim 1 wherein the message object includes HTML content. 8. A system comprising:
at least one processor; a memory; and a message object management module that is stored in the memory and when executed by the at least one processor is configured to receive a message object, to segment the received message object into structural data segments and textual data segments, to utilize a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments, to create a new message object including the structural data segments and the hashed textual data segments, and to send the new message object in lieu of the received message object to a message scanning entity for evaluation. 9. The system of claim 8 wherein the message object management module is further configured to segment the received message object into the structural data segments, the textual data segments, and external content link data segments. 10. The system of claim 9 wherein the message object management module is further configured to access a whitelist or a blacklist to determine whether to process the external content link data in a manner similar to the structural data segments or the textual data segments. 11. The system of claim 8 wherein the message object management module is further configured to:
generate a random key value;
apply, for each of the textual data segments, a single textual data segment and the random key value to a hash function to generate a hash value; and
determine if the hash value exists as an element in any of a plurality of stored tuples associated with the received message object. 12. The system of claim 11 wherein the message object management module is further configured to, in the event the hash value is determined to not be an element in any of the plurality of stored tuples, create a tuple entry including the hash value, the single textual data segment, and a count value into the tuple table and replacing the single textual data segment with the hash value in the new message object. 13. The system of claim 11 the message object management module is further configured to, in the event the hash value is determined to be an element in on of the plurality of stored tuples, rehash the hash value by a number of times indicated by a count value element contained in the one of the plurality of stored tuples to produce a new hash value and replacing the single textual data segment with the new hash value in the new message object. 14. The system of claim 8 wherein the message object includes HTML content. 15. A non-transitory computer readable medium having stored thereon executable instructions that when executed by a processor of a computer cause the computer to perform steps comprising:
receiving a message object; segmenting the received message object into structural data segments and textual data segments; utilizing a keyed cryptographic hash function and the textual data segments to generate corresponding hashed textual data segments; creating a new message object including the structural data segments and the hashed textual data segments; and sending the new message object in lieu of the received message object to a message scanning entity for evaluation. 16. The computer readable medium of claim 15 wherein segmenting the received message object includes segmenting the received message object into the structural data segments, the textual data segments, and external content link data segments. 17. The computer readable medium of claim 16 comprises accessing a whitelist or a blacklist to determine whether to process the external content link data in a manner similar to the structural data segments or the textual data segments. 18. The computer readable medium of claim 15 wherein hashing the textual data segments includes:
generating a random key value;
applying, for each of the textual data segments, a single textual data segment and the random key value to a hash function to generate a hash value; and
determining if the hash value exists as an element in any of a plurality of stored tuples associated with the received message object. 19. The computer readable medium of claim 18 comprising, in the event the hash value is determined to not be an element in any of the plurality of stored tuples, creating a tuple entry including the hash value, the single textual data segment, and a count value into the tuple table and replacing the single textual data segment with the hash value in the new message object. 20. The computer readable medium of claim 18 comprises, in the event the hash value is determined to be an element in one of the plurality of stored tuples, rehashing the hash value by a number of times indicated by a count value element contained in the one of the plurality of store tuples to produce a new hash value and replacing the single textual data segment with the new hash value in the new message object. | 2,400 |
7,667 | 7,667 | 13,036,927 | 2,453 | Embodiments of a system and method for low-latency content streaming are described. In various embodiments, multiple data fragments may be sequentially generated. Each data fragment may represent a distinct portion of media content generated from a live content source. Each data fragment may include multiple sub-portions. Furthermore, for each data fragment, generating that fragment may include sequentially generating each sub-portion of that fragment. Embodiments may include, responsive to receiving a request for a particular data fragment from a client during the generation of a particular sub-portion of that particular data fragment, providing the particular sub-portion to the client subsequent to that particular sub-portion being generated and prior to the generation of that particular data fragment being completed in order to reduce playback latency at the client relative to the live content source. | 1. A computer-implemented method, comprising:
sequentially generating multiple data fragments; wherein each data fragment represents a distinct portion of media content generated from a live content source; wherein each data fragment includes multiple sub-portions; wherein for a given data fragment, said generating comprises sequentially generating each sub-portion of that data fragment; and responsive to receiving a request for a particular data fragment from a client during the generation of a particular sub-portion of that particular data fragment, providing the particular sub-portion to the client subsequent to that particular sub-portion being generated and prior to the generation of that particular data fragment being completed in order to reduce playback latency at the client relative to the live content source. 2. The computer-implemented method of claim 1, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 3. The computer-implemented method of claim 2, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 4. The computer-implemented method of claim 1, wherein at least some of the sub-portions are generated to represent an equal period of time of the media content. 5. The computer-implemented method of claim 1, wherein the media content generated from the live content source is encoded according to an inter-frame compression standard utilizing key frames, wherein the method comprises generating each sub-portion of at least some of the sub portions such that that sub portion begins with a key frame and subsequent frames within that sub-portion are dependent upon that key frame. 6. The computer-implemented method of claim 1, wherein providing the particular sub-portion to the client comprises providing that sub portion to the client as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 7. The computer-implemented method of claim 6, wherein the media content generated from the live content source is formatted such that each sub portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 8. The computer-implemented method of claim 1, wherein the method comprises, prior to receiving said request from the client, providing the client with metadata that maps different time periods to respective ones of said multiple data fragments. 9. The computer-implemented method of claim 1, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 10. A computer-implemented method, comprising:
providing a request for a particular data fragment to a remote system including one or more computers that sequentially generate multiple data fragments that each include multiple sub-portions, wherein the remote system sequentially generates each sub-portion within a given data fragment, wherein each data fragment represents a distinct portion of media content generated from a live content source, wherein said request is provided during the generation of a particular sub-portion of a particular data fragment; subsequent to the particular sub-portion being generated and prior to the generation of the particular data fragment being completed, receiving that particular sub-portion from the remote system; and initiating playback of the particular sub-portion prior to the generation of the particular data fragment being completed in order to reduce playback latency relative to the live content source. 11. The computer-implemented method of claim 10, wherein the method comprises receiving multiple sub-portions of content and discarding one or more sub-portions that represent content prior to said particular sub-portion. 12. The computer-implemented method of claim 10, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 13. The computer-implemented method of claim 12, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 14. The computer-implemented method of claim 10, wherein at least some of the sub-portions are generated to represent an equal period of time of the media content. 15. The computer-implemented method of claim 10, wherein the media content is encoded according to an inter-frame compression standard utilizing key frames, wherein at least some of the sub portions begin with a key frame and wherein subsequent frames within that sub-portion are dependent upon that key frame. 16. The computer-implemented method of claim 1, wherein receiving the particular sub-portion comprises receiving that sub portion as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 17. The computer-implemented method of claim 16, wherein the media content generated from the live content source is formatted such that each sub portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 18. The computer-implemented method of claim 10, wherein the method comprises, prior to providing said request from the client, receiving metadata that maps different time periods to respective ones of said multiple data fragments. 19. The computer-implemented method of claim 18, wherein the method comprises determining a current time and determining which fragment to request based on which data fragment of said multiple data fragments corresponds to the current time as specified by the mapping of the received metadata. 20. The computer-implemented method of claim 10, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 21. A system, comprising:
a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to:
sequentially generate multiple data fragments; wherein each data fragment represents a distinct portion of media content generated from a live content source; wherein each data fragment includes multiple sub-portions; wherein for a given data fragment, wherein sequentially generating a given data fragment comprises sequentially generating each sub-portion of that data fragment; and
responsive to receiving a request for a particular data fragment from a client during the generation of a particular sub-portion of that particular data fragment, providing the particular sub-portion to the client subsequent to that particular sub-portion being generated and prior to the generation of that particular data fragment being completed in order to reduce playback latency at the client relative to the live content source. 22. The system of claim 21, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 23. The system of claim 22, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 24. The system of claim 21, wherein at least some of the sub-portions are generated to represent an equal period of time of the media content. 25. The system of claim 21, wherein the media content generated from the live content source is encoded according to an inter-frame compression standard utilizing key frames, wherein the program instructions are configured to generate each sub-portion of at least some of the sub portions such that that sub portion begins with a key frame and subsequent frames within that sub-portion are dependent upon that key frame. 26. The system of claim 21, wherein to provide the particular sub-portion to the client the program instructions are configured to provide that sub portion to the client as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 27. The system of claim 26, wherein the media content generated from the live content source is formatted such that each sub-portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 28. The system of claim 21, wherein the program instructions are configured to, prior to receiving said request from the client, provide the client with metadata that maps different time periods to respective ones of said multiple data fragments. 29. The system of claim 21, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 30. The system of claim 21, wherein the program instructions are configured to, responsive to a request for a next fragment that is to be generated after said particular data fragment, provide the next fragment to said client after that fragment has been generated. 31. A system, comprising:
a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to:
provide a request for a particular data fragment to a remote system including one or more computers that sequentially generate multiple data fragments that each include multiple sub-portions, wherein the remote system sequentially generates each sub-portion within a given data fragment, wherein each data fragment represents a distinct portion of media content generated from a live content source, wherein said request is provided during the generation of a particular sub-portion of a particular data fragment;
subsequent to the particular sub-portion being generated and prior to the generation of the particular data fragment being completed, receive that particular sub-portion from the remote system; and
initiate playback of the particular sub-portion prior to the generation of the particular data fragment being completed in order to reduce playback latency relative to the live content source. 32. The system of claim 31, wherein the program instructions are configured to receive multiple sub-portions of content and discard one or more sub-portions that represent content prior to said particular sub-portion. 33. The system of claim 31, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 34. The system of claim 33, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 35. The system of claim 31, wherein each sub-portion is generated to represent an equal period of time of the media content. 36. The system of claim 31, wherein the media content is encoded according to an inter-frame compression standard utilizing key frames, wherein at least some of the sub portions begin with a key frame and wherein subsequent frames within that sub-portion are dependent upon that key frame. 37. The system of claim 32, wherein to receive the particular sub-portion the program instructions are configured to receive that sub portion as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 38. The system of claim 37, wherein the media content generated from the live content source is formatted such that each sub portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 39. The system of claim 31, wherein the program instructions are configured to, prior to providing said request from the client, receive metadata that maps different time periods to respective ones of said multiple data fragments. 40. The system of claim 39, wherein the program instructions are configured to determine a current time and determine which fragment to request based on which data fragment of said multiple data fragments corresponds to the current time as specified by the mapping of the received metadata. 41. The system of claim 31, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 42. The system of claim 31, wherein the program instructions are configured to:
provide to the remote system, a request for a next fragment that is to be generated after said particular data fragment, and after the next fragment has been generated, receive that fragment from the remote system. | Embodiments of a system and method for low-latency content streaming are described. In various embodiments, multiple data fragments may be sequentially generated. Each data fragment may represent a distinct portion of media content generated from a live content source. Each data fragment may include multiple sub-portions. Furthermore, for each data fragment, generating that fragment may include sequentially generating each sub-portion of that fragment. Embodiments may include, responsive to receiving a request for a particular data fragment from a client during the generation of a particular sub-portion of that particular data fragment, providing the particular sub-portion to the client subsequent to that particular sub-portion being generated and prior to the generation of that particular data fragment being completed in order to reduce playback latency at the client relative to the live content source.1. A computer-implemented method, comprising:
sequentially generating multiple data fragments; wherein each data fragment represents a distinct portion of media content generated from a live content source; wherein each data fragment includes multiple sub-portions; wherein for a given data fragment, said generating comprises sequentially generating each sub-portion of that data fragment; and responsive to receiving a request for a particular data fragment from a client during the generation of a particular sub-portion of that particular data fragment, providing the particular sub-portion to the client subsequent to that particular sub-portion being generated and prior to the generation of that particular data fragment being completed in order to reduce playback latency at the client relative to the live content source. 2. The computer-implemented method of claim 1, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 3. The computer-implemented method of claim 2, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 4. The computer-implemented method of claim 1, wherein at least some of the sub-portions are generated to represent an equal period of time of the media content. 5. The computer-implemented method of claim 1, wherein the media content generated from the live content source is encoded according to an inter-frame compression standard utilizing key frames, wherein the method comprises generating each sub-portion of at least some of the sub portions such that that sub portion begins with a key frame and subsequent frames within that sub-portion are dependent upon that key frame. 6. The computer-implemented method of claim 1, wherein providing the particular sub-portion to the client comprises providing that sub portion to the client as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 7. The computer-implemented method of claim 6, wherein the media content generated from the live content source is formatted such that each sub portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 8. The computer-implemented method of claim 1, wherein the method comprises, prior to receiving said request from the client, providing the client with metadata that maps different time periods to respective ones of said multiple data fragments. 9. The computer-implemented method of claim 1, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 10. A computer-implemented method, comprising:
providing a request for a particular data fragment to a remote system including one or more computers that sequentially generate multiple data fragments that each include multiple sub-portions, wherein the remote system sequentially generates each sub-portion within a given data fragment, wherein each data fragment represents a distinct portion of media content generated from a live content source, wherein said request is provided during the generation of a particular sub-portion of a particular data fragment; subsequent to the particular sub-portion being generated and prior to the generation of the particular data fragment being completed, receiving that particular sub-portion from the remote system; and initiating playback of the particular sub-portion prior to the generation of the particular data fragment being completed in order to reduce playback latency relative to the live content source. 11. The computer-implemented method of claim 10, wherein the method comprises receiving multiple sub-portions of content and discarding one or more sub-portions that represent content prior to said particular sub-portion. 12. The computer-implemented method of claim 10, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 13. The computer-implemented method of claim 12, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 14. The computer-implemented method of claim 10, wherein at least some of the sub-portions are generated to represent an equal period of time of the media content. 15. The computer-implemented method of claim 10, wherein the media content is encoded according to an inter-frame compression standard utilizing key frames, wherein at least some of the sub portions begin with a key frame and wherein subsequent frames within that sub-portion are dependent upon that key frame. 16. The computer-implemented method of claim 1, wherein receiving the particular sub-portion comprises receiving that sub portion as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 17. The computer-implemented method of claim 16, wherein the media content generated from the live content source is formatted such that each sub portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 18. The computer-implemented method of claim 10, wherein the method comprises, prior to providing said request from the client, receiving metadata that maps different time periods to respective ones of said multiple data fragments. 19. The computer-implemented method of claim 18, wherein the method comprises determining a current time and determining which fragment to request based on which data fragment of said multiple data fragments corresponds to the current time as specified by the mapping of the received metadata. 20. The computer-implemented method of claim 10, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 21. A system, comprising:
a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to:
sequentially generate multiple data fragments; wherein each data fragment represents a distinct portion of media content generated from a live content source; wherein each data fragment includes multiple sub-portions; wherein for a given data fragment, wherein sequentially generating a given data fragment comprises sequentially generating each sub-portion of that data fragment; and
responsive to receiving a request for a particular data fragment from a client during the generation of a particular sub-portion of that particular data fragment, providing the particular sub-portion to the client subsequent to that particular sub-portion being generated and prior to the generation of that particular data fragment being completed in order to reduce playback latency at the client relative to the live content source. 22. The system of claim 21, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 23. The system of claim 22, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 24. The system of claim 21, wherein at least some of the sub-portions are generated to represent an equal period of time of the media content. 25. The system of claim 21, wherein the media content generated from the live content source is encoded according to an inter-frame compression standard utilizing key frames, wherein the program instructions are configured to generate each sub-portion of at least some of the sub portions such that that sub portion begins with a key frame and subsequent frames within that sub-portion are dependent upon that key frame. 26. The system of claim 21, wherein to provide the particular sub-portion to the client the program instructions are configured to provide that sub portion to the client as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 27. The system of claim 26, wherein the media content generated from the live content source is formatted such that each sub-portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 28. The system of claim 21, wherein the program instructions are configured to, prior to receiving said request from the client, provide the client with metadata that maps different time periods to respective ones of said multiple data fragments. 29. The system of claim 21, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 30. The system of claim 21, wherein the program instructions are configured to, responsive to a request for a next fragment that is to be generated after said particular data fragment, provide the next fragment to said client after that fragment has been generated. 31. A system, comprising:
a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to:
provide a request for a particular data fragment to a remote system including one or more computers that sequentially generate multiple data fragments that each include multiple sub-portions, wherein the remote system sequentially generates each sub-portion within a given data fragment, wherein each data fragment represents a distinct portion of media content generated from a live content source, wherein said request is provided during the generation of a particular sub-portion of a particular data fragment;
subsequent to the particular sub-portion being generated and prior to the generation of the particular data fragment being completed, receive that particular sub-portion from the remote system; and
initiate playback of the particular sub-portion prior to the generation of the particular data fragment being completed in order to reduce playback latency relative to the live content source. 32. The system of claim 31, wherein the program instructions are configured to receive multiple sub-portions of content and discard one or more sub-portions that represent content prior to said particular sub-portion. 33. The system of claim 31, wherein said multiple data fragments represent different consecutive time periods of the media content from the live content source. 34. The system of claim 33, wherein for a given data fragment, the sub portions within that data fragment represent different consecutive time periods of the media content represented by that given data fragment. 35. The system of claim 31, wherein each sub-portion is generated to represent an equal period of time of the media content. 36. The system of claim 31, wherein the media content is encoded according to an inter-frame compression standard utilizing key frames, wherein at least some of the sub portions begin with a key frame and wherein subsequent frames within that sub-portion are dependent upon that key frame. 37. The system of claim 32, wherein to receive the particular sub-portion the program instructions are configured to receive that sub portion as a chunk according to chunked transfer encoding specified by Hypertext Transfer Protocol (HTTP). 38. The system of claim 37, wherein the media content generated from the live content source is formatted such that each sub portion of a given data fragment maps to a single chunk according to said chunked transfer encoding. 39. The system of claim 31, wherein the program instructions are configured to, prior to providing said request from the client, receive metadata that maps different time periods to respective ones of said multiple data fragments. 40. The system of claim 39, wherein the program instructions are configured to determine a current time and determine which fragment to request based on which data fragment of said multiple data fragments corresponds to the current time as specified by the mapping of the received metadata. 41. The system of claim 31, wherein the media content generated from the live content source represents one or more of: a live sporting event or a live video conference. 42. The system of claim 31, wherein the program instructions are configured to:
provide to the remote system, a request for a next fragment that is to be generated after said particular data fragment, and after the next fragment has been generated, receive that fragment from the remote system. | 2,400 |
7,668 | 7,668 | 14,827,670 | 2,497 | Content creation and licensing control techniques are described. In a first example, a content creation service is configured to support content creation using an image along with functionality to locate the image or a similar image that is available for licensing. In another example, previews of images are used to generate different versions of content along with an option to license images previewed in an approved version of the content. In a further example, fingerprints are used to locate images used as part of content creation by a content creation service without leaving a context of the service. In yet another example, location of licensable versions of images is based at least in part on identification of a watermark included as part of an image. In an additional example, an image itself is used as a basis to locate other images available for licensing by a content sharing service. | 1. In a digital medium environment for control of content creation by one or more computing devices of a content creation service, a system comprising:
a content creation module implemented at least partially in hardware and configured to expose functionality via a user interface to create content; a fingerprint generation module implemented at least partially in hardware and configured to generate a fingerprint of an image received by the content creation module as part of creating the content; and a licensing module implemented at least partially in hardware that is configured to use the fingerprint to determine whether the image is available for licensing via a content sharing service and output a result of this determination for display by the content creation module in the user interface along with the exposed functionality to create the content and without leaving a display of the exposed functionality in the user interface. 2. A system as described in claim 1, wherein the licensing module is configured to output an option by the one or more computing devices of the content creation service indicating availability of another image for licensing that is similar to the received image responsive to a determination that the received image is not available via the content sharing service. 3. A system as described in claim 2, wherein the licensing module is configured to output an option to license the image from the content sharing service responsive to a determination that the image is available for licensing from the content sharing service. 4. A system as described in claim 3, wherein the image available for licensing from the content sharing service has a higher resolution than the received image. 5. A system as described in claim 3, wherein the received image includes a watermark and the image available for licensing from the content sharing service does not include a watermark. 6. A system as described in claim 5, wherein the fingerprint generation module is configured to generate the fingerprint responsive to identification of the watermark. 7. A system as described in claim 5, wherein the licensing module is configured to identify the content sharing service from a plurality of said content sharing services based on the watermark. 8. A system as described in claim 7, wherein the content creation module is configured to display the received image in a user interface having functionality to edit graphics of the content and wherein the result of the determination is displayed in the user interface without navigating away from the user interface. 9. In a digital medium environment for control of content creation by one or more computing devices of a content creation service, a system comprising:
a content creation module implemented at least partially in hardware and configured to expose functionality via a user interface to create content; a watermark identification module implemented at least partially in hardware and configured to detect a watermark included in an image received by the content creation module as part of creating the content and identify a content sharing service that corresponds to the detected watermark; and a licensing module implemented at least partially in hardware that is configured to provide an option to license the image from the identified content sharing service. 10. A system as described in claim 9, wherein the watermark identification module is configured to identify the content sharing service from a plurality of said content sharing services. 11. A system as described in claim 9, wherein the option to license the image from the content sharing service is provided through display of a user interface generated by the content sharing service having functionality to license the image. 12. A system as described in claim 11, wherein the user interface generated by the content sharing service having functionality to license the image is displayed within and without navigating away from the user interface used to create the content by the content creation module. 13. A system as described in claim 9, further comprising responsive to a determination that a user that guides creation of the content has an account with the identified content sharing service, configured the option to license the image using the account automatically and without user intervention. 14. A system as described in claim 9, wherein the content creation module is configured to display the image in the user interface along with functionality to edit graphics of the content. 15. In a digital medium environment for sharing content by one or more computing devices of a content sharing service, a method comprising
receiving an image by the one or more computing devices of the content sharing service; locating one or more other images by the one or more computing devices of the content sharing service that are available for licensing based on similarity of the received images to the located one or more other images; and outputting the located one or more images by the one or more computing devices of the content sharing service for display in a user interface concurrently with one or more options available to license the located one or more images from the content sharing service. 16. A method as described in claim 15, wherein the locating that is based on image similarity includes forming a fingerprint from the received image and comparing the fingerprint to fingerprints of the other said images that are available for licensing. 17. A method as described in claim 15, wherein the locating based on image similarity is based at least in part on metadata associated with respective said images. 18. A method as described in claim 15, wherein the image is received via a communication from a content creation service that is configured to create content that includes the image. 19. A method as described in claim 15, wherein the received image is not available for licensing, itself, from the content sharing service. 20. A method as described in claim 15, wherein the received image is available for licensing from the content sharing service and the locating includes the image. | Content creation and licensing control techniques are described. In a first example, a content creation service is configured to support content creation using an image along with functionality to locate the image or a similar image that is available for licensing. In another example, previews of images are used to generate different versions of content along with an option to license images previewed in an approved version of the content. In a further example, fingerprints are used to locate images used as part of content creation by a content creation service without leaving a context of the service. In yet another example, location of licensable versions of images is based at least in part on identification of a watermark included as part of an image. In an additional example, an image itself is used as a basis to locate other images available for licensing by a content sharing service.1. In a digital medium environment for control of content creation by one or more computing devices of a content creation service, a system comprising:
a content creation module implemented at least partially in hardware and configured to expose functionality via a user interface to create content; a fingerprint generation module implemented at least partially in hardware and configured to generate a fingerprint of an image received by the content creation module as part of creating the content; and a licensing module implemented at least partially in hardware that is configured to use the fingerprint to determine whether the image is available for licensing via a content sharing service and output a result of this determination for display by the content creation module in the user interface along with the exposed functionality to create the content and without leaving a display of the exposed functionality in the user interface. 2. A system as described in claim 1, wherein the licensing module is configured to output an option by the one or more computing devices of the content creation service indicating availability of another image for licensing that is similar to the received image responsive to a determination that the received image is not available via the content sharing service. 3. A system as described in claim 2, wherein the licensing module is configured to output an option to license the image from the content sharing service responsive to a determination that the image is available for licensing from the content sharing service. 4. A system as described in claim 3, wherein the image available for licensing from the content sharing service has a higher resolution than the received image. 5. A system as described in claim 3, wherein the received image includes a watermark and the image available for licensing from the content sharing service does not include a watermark. 6. A system as described in claim 5, wherein the fingerprint generation module is configured to generate the fingerprint responsive to identification of the watermark. 7. A system as described in claim 5, wherein the licensing module is configured to identify the content sharing service from a plurality of said content sharing services based on the watermark. 8. A system as described in claim 7, wherein the content creation module is configured to display the received image in a user interface having functionality to edit graphics of the content and wherein the result of the determination is displayed in the user interface without navigating away from the user interface. 9. In a digital medium environment for control of content creation by one or more computing devices of a content creation service, a system comprising:
a content creation module implemented at least partially in hardware and configured to expose functionality via a user interface to create content; a watermark identification module implemented at least partially in hardware and configured to detect a watermark included in an image received by the content creation module as part of creating the content and identify a content sharing service that corresponds to the detected watermark; and a licensing module implemented at least partially in hardware that is configured to provide an option to license the image from the identified content sharing service. 10. A system as described in claim 9, wherein the watermark identification module is configured to identify the content sharing service from a plurality of said content sharing services. 11. A system as described in claim 9, wherein the option to license the image from the content sharing service is provided through display of a user interface generated by the content sharing service having functionality to license the image. 12. A system as described in claim 11, wherein the user interface generated by the content sharing service having functionality to license the image is displayed within and without navigating away from the user interface used to create the content by the content creation module. 13. A system as described in claim 9, further comprising responsive to a determination that a user that guides creation of the content has an account with the identified content sharing service, configured the option to license the image using the account automatically and without user intervention. 14. A system as described in claim 9, wherein the content creation module is configured to display the image in the user interface along with functionality to edit graphics of the content. 15. In a digital medium environment for sharing content by one or more computing devices of a content sharing service, a method comprising
receiving an image by the one or more computing devices of the content sharing service; locating one or more other images by the one or more computing devices of the content sharing service that are available for licensing based on similarity of the received images to the located one or more other images; and outputting the located one or more images by the one or more computing devices of the content sharing service for display in a user interface concurrently with one or more options available to license the located one or more images from the content sharing service. 16. A method as described in claim 15, wherein the locating that is based on image similarity includes forming a fingerprint from the received image and comparing the fingerprint to fingerprints of the other said images that are available for licensing. 17. A method as described in claim 15, wherein the locating based on image similarity is based at least in part on metadata associated with respective said images. 18. A method as described in claim 15, wherein the image is received via a communication from a content creation service that is configured to create content that includes the image. 19. A method as described in claim 15, wherein the received image is not available for licensing, itself, from the content sharing service. 20. A method as described in claim 15, wherein the received image is available for licensing from the content sharing service and the locating includes the image. | 2,400 |
7,669 | 7,669 | 14,275,722 | 2,495 | A data processing system is conceived, which comprises at least two security levels and key material stored at a specific one of said security levels, wherein the key material is tagged with a minimum security level at which the key material may be stored. | 1. A data processing system comprising:
at least two security levels, and key material stored at a specific one of said security levels,
wherein the key material is tagged with a minimum security level at which the key material may be stored. 2. A data processing system as claimed in claim 1,
wherein the key material is tagged by means of an attribute attached to or comprised in said key material, and
wherein said attribute has a value that is indicative of the minimum security level at which the key material may be stored. 3. A data processing system as claimed in claim 1,
wherein one of the security levels, in particular the highest security level, is implemented as a tamper-resistant secure element. 4. A data processing system as claimed in claim 1,
wherein one of the security levels, in particular a medium security level, is implemented as a high-performance crypto accelerator. 5. A data processing system as claimed in claim 1,
being arranged to move, at least temporarily, the key material to a security level that is lower than the security level at which the key material is stored, wherein the security level to which the key material is temporarily moved is equal to or higher than the minimum security level. 6. A data processing system as claimed in claim 1,
wherein the key material is further tagged with an internal security level, and wherein said internal security level is indicative of the lowest security level at which the key material has resided. 7. A data processing system as claimed in claim 1,
wherein the key material is further tagged with a list that is indicative of a history of security levels at which the key material has resided. 8. A data processing system as claimed in claim 1,
being arranged to create temporary key material that may be exchanged and verified using key material. 9. An intelligent transportation system comprising a data processing system as claimed in claim 1. 10. A method of initializing a data processing system having at least two security levels,
wherein key material is tagged with a minimum security level at which the key material may be stored, and wherein said key material is stored at a specific one of said security levels. 11. A computer program product comprising instructions which, when being executed by a processing unit, carry out or control respective steps of a method as claimed in claim 10. | A data processing system is conceived, which comprises at least two security levels and key material stored at a specific one of said security levels, wherein the key material is tagged with a minimum security level at which the key material may be stored.1. A data processing system comprising:
at least two security levels, and key material stored at a specific one of said security levels,
wherein the key material is tagged with a minimum security level at which the key material may be stored. 2. A data processing system as claimed in claim 1,
wherein the key material is tagged by means of an attribute attached to or comprised in said key material, and
wherein said attribute has a value that is indicative of the minimum security level at which the key material may be stored. 3. A data processing system as claimed in claim 1,
wherein one of the security levels, in particular the highest security level, is implemented as a tamper-resistant secure element. 4. A data processing system as claimed in claim 1,
wherein one of the security levels, in particular a medium security level, is implemented as a high-performance crypto accelerator. 5. A data processing system as claimed in claim 1,
being arranged to move, at least temporarily, the key material to a security level that is lower than the security level at which the key material is stored, wherein the security level to which the key material is temporarily moved is equal to or higher than the minimum security level. 6. A data processing system as claimed in claim 1,
wherein the key material is further tagged with an internal security level, and wherein said internal security level is indicative of the lowest security level at which the key material has resided. 7. A data processing system as claimed in claim 1,
wherein the key material is further tagged with a list that is indicative of a history of security levels at which the key material has resided. 8. A data processing system as claimed in claim 1,
being arranged to create temporary key material that may be exchanged and verified using key material. 9. An intelligent transportation system comprising a data processing system as claimed in claim 1. 10. A method of initializing a data processing system having at least two security levels,
wherein key material is tagged with a minimum security level at which the key material may be stored, and wherein said key material is stored at a specific one of said security levels. 11. A computer program product comprising instructions which, when being executed by a processing unit, carry out or control respective steps of a method as claimed in claim 10. | 2,400 |
7,670 | 7,670 | 13,098,663 | 2,423 | The present invention teaches a method of creating and presenting a user interface comprising a Dynamic Mosaic Extended Electronic Programming Guide (DMXEPG) using video, audio, special applications, and service dynamic metadata. The system enables television or digital radio service subscribers to select and display of various programs including video, interactive TV applications, or any combination of audio or visual components grouped and presented in accordance with the dynamic program/show metadata, business rules and objectives of service providers, broadcasters, and/or personal subscriber choices, collectively referred to as mosaic element presentation criteria. | 1.-38. (canceled) 39. A method of generating a user interface (UI) presentation comprising a plurality of mosaic elements (MEs), the method comprising:
selecting a subset of available media content in accordance with ME presentation criteria; associating the selected subset of content with an ME such that the ME outputs the subset of content that is associated therewith; repeating the selecting and associating for other MEs that comprise the UI presentation; and outputting the UI presentation on physically separate primary and a secondary display devices. 40. The method of claim 39, including the step of outputting the UI presentation through a client device. 41. The method of claim 40, wherein the client device is a digital set-top box. 42. The method of claim 40, wherein the client device is a media center. 43. The method of claim 40, wherein the client device is a digital television system module. 44. The method of claim 39, wherein the secondary display devices presents a portion of the UI presentation from the primary display device through a digital TV system module. 45. The method of claim 39, including the steps of:
displaying a mosaic of MEs on one of the primary and secondary display devices; and displaying a video stream or video clip linked to one of the MEs on the other of the primary and secondary display devices. 46. The method of claim 39, including the steps of:
displaying an electronic program guide (EPG) on one of the primary and secondary display devices; and displaying a video stream or video clip linked to the EPG on the other of the primary and secondary display devices. 47. The method of claim 39, wherein the secondary display device includes a touch-screen user interface that controls the primary display device. 48. The method of claim 39, including the step of selecting between the primary display device and the secondary display device with a hand-held remote control unit. | The present invention teaches a method of creating and presenting a user interface comprising a Dynamic Mosaic Extended Electronic Programming Guide (DMXEPG) using video, audio, special applications, and service dynamic metadata. The system enables television or digital radio service subscribers to select and display of various programs including video, interactive TV applications, or any combination of audio or visual components grouped and presented in accordance with the dynamic program/show metadata, business rules and objectives of service providers, broadcasters, and/or personal subscriber choices, collectively referred to as mosaic element presentation criteria.1.-38. (canceled) 39. A method of generating a user interface (UI) presentation comprising a plurality of mosaic elements (MEs), the method comprising:
selecting a subset of available media content in accordance with ME presentation criteria; associating the selected subset of content with an ME such that the ME outputs the subset of content that is associated therewith; repeating the selecting and associating for other MEs that comprise the UI presentation; and outputting the UI presentation on physically separate primary and a secondary display devices. 40. The method of claim 39, including the step of outputting the UI presentation through a client device. 41. The method of claim 40, wherein the client device is a digital set-top box. 42. The method of claim 40, wherein the client device is a media center. 43. The method of claim 40, wherein the client device is a digital television system module. 44. The method of claim 39, wherein the secondary display devices presents a portion of the UI presentation from the primary display device through a digital TV system module. 45. The method of claim 39, including the steps of:
displaying a mosaic of MEs on one of the primary and secondary display devices; and displaying a video stream or video clip linked to one of the MEs on the other of the primary and secondary display devices. 46. The method of claim 39, including the steps of:
displaying an electronic program guide (EPG) on one of the primary and secondary display devices; and displaying a video stream or video clip linked to the EPG on the other of the primary and secondary display devices. 47. The method of claim 39, wherein the secondary display device includes a touch-screen user interface that controls the primary display device. 48. The method of claim 39, including the step of selecting between the primary display device and the secondary display device with a hand-held remote control unit. | 2,400 |
7,671 | 7,671 | 14,601,358 | 2,483 | The present disclosure relates to an image processing device and method which can accurately reproduce a dynamic range of an image.
A value on a vertical axis corresponding to a maximum white level is a digital value of the maximum white level (white 800%) which is assigned to a developed image, and is set as max_white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. A value on the vertical axis corresponding to a white level is a digital value of a white level (white 100%) which is assigned to a developed image, and is set as white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. The present disclosure is applicable to, for example, an image processing device. | 1. An image processing device, comprising:
at least one processor configured to:
encode image data to produce encoded image data; and
provide dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data. 2. The image processing device of claim 1, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 3. The image processing device of claim 1, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 4. The image processing device of claim 3, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 5. The image processing device of claim 1, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 6. The image processing device of claim 1, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. | The present disclosure relates to an image processing device and method which can accurately reproduce a dynamic range of an image.
A value on a vertical axis corresponding to a maximum white level is a digital value of the maximum white level (white 800%) which is assigned to a developed image, and is set as max_white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. A value on the vertical axis corresponding to a white level is a digital value of a white level (white 100%) which is assigned to a developed image, and is set as white_level_code_value which is one of characteristics information of the dynamic range and is transmitted. The present disclosure is applicable to, for example, an image processing device.1. An image processing device, comprising:
at least one processor configured to:
encode image data to produce encoded image data; and
provide dynamic range characteristic information associated with the image data, the dynamic range characteristic information including maximum image white level information indicating, as a percentage relative to a reference white level, a dynamic range of luminance of the image data. 2. The image processing device of claim 1, wherein the dynamic range characteristic information further includes maximum image white level code value information identifying a luminance code value of a maximum white level. 3. The image processing device of claim 1, wherein the dynamic range characteristic information further includes white level code value information identifying a luminance code value of a white level. 4. The image processing device of claim 3, wherein the white level code value information identifies a plurality of luminance code values of a plurality of white levels. 5. The image processing device of claim 1, wherein the dynamic range characteristic information further includes black level code value information identifying a luminance code value of a black level. 6. The image processing device of claim 1, wherein the dynamic range characteristic information identifies a luminance code value associated with luminance of the image data, the luminance code value being in a range between 0 and 1024. | 2,400 |
7,672 | 7,672 | 12,736,946 | 2,488 | A navigation apparatus includes an image recording device for recording image data and a processing resource configured to receive an incident signal indicative of the occurrence of an incident and to perform an image data processing operation in response to the incident signal. | 1. A navigation apparatus comprising:—
an image recording device for recording image data; and
a processing resource configured to receive an incident signal indicative of the occurrence of an incident and to perform an image data processing operation in response to the incident signal. 2. Apparatus according to claim 1, wherein the image data processing operation comprises a transmission or recording operation. 3. Apparatus according to claim 2, wherein the transmission or recording operation comprises at least one of transmitting image data to a server, recording image data and retaining recorded image data. 4. Apparatus according to claim 1, further comprising detection circuitry for detecting the occurrence of the or an incident, and for generating the or an incident signal in response to the occurrence of the or an incident. 5. Apparatus according to claim 4, wherein the navigation apparatus is installed in a vehicle, and the detection circuitry is arranged to detect movement of the vehicle, and to generate the incident signal in response to a movement of the vehicle. 6. Apparatus according to claim 4, configured to transmit the incident signal at least one of to a server and to at least one other navigation apparatus. 7. Apparatus according to claim 1, wherein the processing resource is configured to at least one of record and transmit further data in response to the incident signal. 8. Apparatus according to claim 1, further comprising a vehicle or number plate recognition module, wherein the incident signal comprises a vehicle identifier, and the image data processing operation comprises instructing the vehicle or number plate recognition module to analyse the image data for the presence of a vehicle or number plate in dependence upon the vehicle identifier. 9. A server comprising an incident monitoring module configured to transmit an incident signal to at least one navigation apparatus in response to the occurrence of an incident, the incident signal being for initiating an image data processing operation at the at least one navigation apparatus. 10. A server according to claim 9, configured to receive image data from the at least one navigation apparatus and to process the image data in response to the occurrence of the incident. 11. A server according to claim 10, further comprising a vehicle or number plate recognition module, wherein the processing of the image data comprises analysing the image data by the vehicle or number plate recognition module to identify at least one vehicle or number plate associated with the incident. 12. A server according to claim 10, wherein the processing of the image data comprises processing image data to track the identified vehicle or number plate. 13. A navigation system comprising a server comprising an incident monitoring module configured to transmit an incident signal in response to the occurrence of an incident, and at least one navigation apparatus, the or each navigation apparatus comprising an image recording device for recording image data and a processing resource configured to receive the incident signal and to perform an image data processing operation in response to the incident signal 14. A method of monitoring the scene of an incident comprising recording image data using at least one navigation apparatus at the scene of the incident. 15. A method according to claim 14, further comprising transmitting the recorded image data from the or each navigation apparatus to a server. 16. A non-transitory computer readable medium comprising computer executable instructions for, when executed on a computer, performing a method according to claim 14. | A navigation apparatus includes an image recording device for recording image data and a processing resource configured to receive an incident signal indicative of the occurrence of an incident and to perform an image data processing operation in response to the incident signal.1. A navigation apparatus comprising:—
an image recording device for recording image data; and
a processing resource configured to receive an incident signal indicative of the occurrence of an incident and to perform an image data processing operation in response to the incident signal. 2. Apparatus according to claim 1, wherein the image data processing operation comprises a transmission or recording operation. 3. Apparatus according to claim 2, wherein the transmission or recording operation comprises at least one of transmitting image data to a server, recording image data and retaining recorded image data. 4. Apparatus according to claim 1, further comprising detection circuitry for detecting the occurrence of the or an incident, and for generating the or an incident signal in response to the occurrence of the or an incident. 5. Apparatus according to claim 4, wherein the navigation apparatus is installed in a vehicle, and the detection circuitry is arranged to detect movement of the vehicle, and to generate the incident signal in response to a movement of the vehicle. 6. Apparatus according to claim 4, configured to transmit the incident signal at least one of to a server and to at least one other navigation apparatus. 7. Apparatus according to claim 1, wherein the processing resource is configured to at least one of record and transmit further data in response to the incident signal. 8. Apparatus according to claim 1, further comprising a vehicle or number plate recognition module, wherein the incident signal comprises a vehicle identifier, and the image data processing operation comprises instructing the vehicle or number plate recognition module to analyse the image data for the presence of a vehicle or number plate in dependence upon the vehicle identifier. 9. A server comprising an incident monitoring module configured to transmit an incident signal to at least one navigation apparatus in response to the occurrence of an incident, the incident signal being for initiating an image data processing operation at the at least one navigation apparatus. 10. A server according to claim 9, configured to receive image data from the at least one navigation apparatus and to process the image data in response to the occurrence of the incident. 11. A server according to claim 10, further comprising a vehicle or number plate recognition module, wherein the processing of the image data comprises analysing the image data by the vehicle or number plate recognition module to identify at least one vehicle or number plate associated with the incident. 12. A server according to claim 10, wherein the processing of the image data comprises processing image data to track the identified vehicle or number plate. 13. A navigation system comprising a server comprising an incident monitoring module configured to transmit an incident signal in response to the occurrence of an incident, and at least one navigation apparatus, the or each navigation apparatus comprising an image recording device for recording image data and a processing resource configured to receive the incident signal and to perform an image data processing operation in response to the incident signal 14. A method of monitoring the scene of an incident comprising recording image data using at least one navigation apparatus at the scene of the incident. 15. A method according to claim 14, further comprising transmitting the recorded image data from the or each navigation apparatus to a server. 16. A non-transitory computer readable medium comprising computer executable instructions for, when executed on a computer, performing a method according to claim 14. | 2,400 |
7,673 | 7,673 | 13,893,906 | 2,481 | In a communication system, parallel encoding and decoding of serially-coded data occurs in a manner that supports low latency communication. A plurality of data items may be coded as serially-coded data sequences and a transmission sequence may be built from them. An index table may be built having a plurality of entries representing respective start points of the serially-coded data sequences within the transmission sequence. The transmission sequence may be transmitted to a channel and, thereafter, the index table may be transmitted. Latencies otherwise involved in inserting an index table into the beginning of a transmission sequence may be avoided. | 1. A method, comprising:
coding a plurality of data items as serially-coded data sequences, building a transmission sequence from the serially-coded data sequences, building a table having a plurality of entries representing decoding parameters to be applied during decoding of the respective coded data sequences, and transmitting the transmission sequence and the table in a channel, wherein the transmission sequence precedes the index table in transmission order. 2. The method of claim 1, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 3. The method of claim 1, wherein the decoding parameters include checksum data for the respective coded data sequences. 4. The method of claim 1, wherein the decoding parameters include signatures for the respective coded data sequences. 5. The method of claim 1, wherein the transmission sequence and the table are transmitted in a common Network Adaptation Layer Unit. 6. The method of claim 1, wherein the table is transmitted in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is transmitted. 7. The method of claim 1, wherein the table is transmitted in a Supplemental Enhancement Information message. 8. A method, comprising:
receiving a transmission sequence and a table from a channel, wherein the transmission sequence precedes the table in reception order, parsing the transmission sequence into a plurality of serially-coded data sequences, decoding at least one of the data sequences using decoding parameters provided in the table. 9. The method of claim 8, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 10. The method of claim 8, wherein the decoding parameters include checksum data for the respective coded data sequences. 11. The method of claim 8, wherein the decoding parameters include signatures for the respective coded data sequences. 12. The method of claim 8, wherein the transmission sequence and the table are received in a common Network Adaptation Layer Unit. 13. The method of claim 8, wherein the table is received in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is received. 14. The method of claim 8, wherein the table is received in a Supplemental Enhancement Information message. 15. The method of claim 8, wherein decoding of at least one coded data sequence begins prior to reception of the table. 16. A video coder, comprising:
a coding engine to code frames of video data as serially-coded data sequences, a controller to build a table having a plurality of entries representing decoding parameters to be applied during decoding of respective coded data sequences, a buffer to store a transmission sequence built from the serially-coded data sequences and the table, wherein the transmission sequence precedes the table in transmission order, and a transmitter to transmit the transmission sequence and the table to a channel. 17. The coder of claim 16, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 18. The coder of claim 16, wherein the decoding parameters include checksum data for the respective coded data sequences. 19. The coder of claim 16, wherein the decoding parameters include signatures for the respective coded data sequences. 20. The coder of claim 16, wherein the transmission sequence and the table are transmitted in a common Network Adaptation Layer Unit. 21. The coder of claim 16, wherein the table is transmitted in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is transmitted. 22. The coder of claim 16, wherein the table is transmitted in a Supplemental Enhancement Information message. 23. A video decoder, comprising:
a receiver to receive a transmission sequence and a table from a channel, wherein the transmission sequence precedes the table in reception order, a decoding engine to decode serially-coded video sequences contained in the transmission sequence, and a controller to apply decoding parameters to the decoding of respective coded data sequences. 24. The decoder of claim 23, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 25. The decoder of claim 23, wherein the decoding parameters include checksum data for the respective coded data sequences. 26. The decoder of claim 23, wherein the decoding parameters include signatures for the respective coded data sequences. 27. The decoder of claim 23, wherein the transmission sequence and the table are received in a common Network Adaptation Layer Unit. 28. The decoder of claim 23, wherein the table is received in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is received. 29. The decoder of claim 23, wherein the table is received in a Supplemental Enhancement Information message. 30. The decoder of claim 23, wherein decoding of at least one coded data sequence begins prior to reception of the table. 31. A computer readable medium storing program instructions thereon that, when executed by a processing device, cause the device to perform a method, comprising:
coding a plurality of data items as serially-coded data sequences, building a transmission sequence from the serially-coded data sequences, building a table having a plurality of entries representing decoding parameters to be applied during decoding of the respective coded data sequences, and transmitting the transmission sequence and the table in a channel, wherein the transmission sequence precedes the index table in transmission order. 32. A computer readable medium storing program instructions thereon that, when executed by a processing device, cause the device to perform a method, comprising:
receiving a transmission sequence and a table from a channel, wherein the transmission sequence precedes the table in reception order, parsing the transmission sequence into a plurality of serially-coded data sequences, decoding at least one of the data sequences using decoding parameters provided in the table. | In a communication system, parallel encoding and decoding of serially-coded data occurs in a manner that supports low latency communication. A plurality of data items may be coded as serially-coded data sequences and a transmission sequence may be built from them. An index table may be built having a plurality of entries representing respective start points of the serially-coded data sequences within the transmission sequence. The transmission sequence may be transmitted to a channel and, thereafter, the index table may be transmitted. Latencies otherwise involved in inserting an index table into the beginning of a transmission sequence may be avoided.1. A method, comprising:
coding a plurality of data items as serially-coded data sequences, building a transmission sequence from the serially-coded data sequences, building a table having a plurality of entries representing decoding parameters to be applied during decoding of the respective coded data sequences, and transmitting the transmission sequence and the table in a channel, wherein the transmission sequence precedes the index table in transmission order. 2. The method of claim 1, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 3. The method of claim 1, wherein the decoding parameters include checksum data for the respective coded data sequences. 4. The method of claim 1, wherein the decoding parameters include signatures for the respective coded data sequences. 5. The method of claim 1, wherein the transmission sequence and the table are transmitted in a common Network Adaptation Layer Unit. 6. The method of claim 1, wherein the table is transmitted in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is transmitted. 7. The method of claim 1, wherein the table is transmitted in a Supplemental Enhancement Information message. 8. A method, comprising:
receiving a transmission sequence and a table from a channel, wherein the transmission sequence precedes the table in reception order, parsing the transmission sequence into a plurality of serially-coded data sequences, decoding at least one of the data sequences using decoding parameters provided in the table. 9. The method of claim 8, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 10. The method of claim 8, wherein the decoding parameters include checksum data for the respective coded data sequences. 11. The method of claim 8, wherein the decoding parameters include signatures for the respective coded data sequences. 12. The method of claim 8, wherein the transmission sequence and the table are received in a common Network Adaptation Layer Unit. 13. The method of claim 8, wherein the table is received in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is received. 14. The method of claim 8, wherein the table is received in a Supplemental Enhancement Information message. 15. The method of claim 8, wherein decoding of at least one coded data sequence begins prior to reception of the table. 16. A video coder, comprising:
a coding engine to code frames of video data as serially-coded data sequences, a controller to build a table having a plurality of entries representing decoding parameters to be applied during decoding of respective coded data sequences, a buffer to store a transmission sequence built from the serially-coded data sequences and the table, wherein the transmission sequence precedes the table in transmission order, and a transmitter to transmit the transmission sequence and the table to a channel. 17. The coder of claim 16, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 18. The coder of claim 16, wherein the decoding parameters include checksum data for the respective coded data sequences. 19. The coder of claim 16, wherein the decoding parameters include signatures for the respective coded data sequences. 20. The coder of claim 16, wherein the transmission sequence and the table are transmitted in a common Network Adaptation Layer Unit. 21. The coder of claim 16, wherein the table is transmitted in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is transmitted. 22. The coder of claim 16, wherein the table is transmitted in a Supplemental Enhancement Information message. 23. A video decoder, comprising:
a receiver to receive a transmission sequence and a table from a channel, wherein the transmission sequence precedes the table in reception order, a decoding engine to decode serially-coded video sequences contained in the transmission sequence, and a controller to apply decoding parameters to the decoding of respective coded data sequences. 24. The decoder of claim 23, wherein the decoding parameters include deblocking filter information for the respective coded data sequences. 25. The decoder of claim 23, wherein the decoding parameters include checksum data for the respective coded data sequences. 26. The decoder of claim 23, wherein the decoding parameters include signatures for the respective coded data sequences. 27. The decoder of claim 23, wherein the transmission sequence and the table are received in a common Network Adaptation Layer Unit. 28. The decoder of claim 23, wherein the table is received in a Network Adaptation Layer (NAL) Unit separate from NAL Unit(s) in which the transmission sequence is received. 29. The decoder of claim 23, wherein the table is received in a Supplemental Enhancement Information message. 30. The decoder of claim 23, wherein decoding of at least one coded data sequence begins prior to reception of the table. 31. A computer readable medium storing program instructions thereon that, when executed by a processing device, cause the device to perform a method, comprising:
coding a plurality of data items as serially-coded data sequences, building a transmission sequence from the serially-coded data sequences, building a table having a plurality of entries representing decoding parameters to be applied during decoding of the respective coded data sequences, and transmitting the transmission sequence and the table in a channel, wherein the transmission sequence precedes the index table in transmission order. 32. A computer readable medium storing program instructions thereon that, when executed by a processing device, cause the device to perform a method, comprising:
receiving a transmission sequence and a table from a channel, wherein the transmission sequence precedes the table in reception order, parsing the transmission sequence into a plurality of serially-coded data sequences, decoding at least one of the data sequences using decoding parameters provided in the table. | 2,400 |
7,674 | 7,674 | 15,244,074 | 2,439 | A secure network communication system and method for secure data exchange using TCP are disclosed. The system provides data exchange between a client and server, through an agent and broker interconnected to exchange data over an unsecured network. Upon receipt of a control packet from the client, the broker forwards a modified control packet to the agent using a secure protocol. The agent inspects the modified control packet and forwards it to the server. Upon receipt of a response packet from the server, the agent forwards the response packet to the broker using a secure protocol. Upon receipt of the response packet, the agent modifies the response packet and forwards it to the client. If the exchange of control packets indicates establishment of a TCP session, the agent and the broker establish a data channel between themselves to create a transparent TCP channel between the client and the server. | 1. (canceled) 2. A data transmission system for secure data exchange using transmission control protocol (TCP) comprising:
a broker connected to a client; an agent connected to a server; an unsecured network link between the broker and the agent, wherein:
the agent and the broker are connected through at least a firewall device to exchange data over the unsecured network link and a layer 5 behavior of each one of the broker, the client, the agent, and the server are modified such that:
the agent is operative to establish a secure control session with the broker using a secure transport over the unsecured network link;
upon receipt of a TCP Synchronize (SYN) packet from the client, the broker is operative to capture the TCP SYN packet, generate a modified control packet based on the TCP SYN packet, and send the modified control packet to the agent using the secure control session;
the agent is operative to receive the modified control packet from the broker, generate a new TCP SYN packet based on the modified control packet, and send the new TCP SYN packet to the server;
upon receipt of a first response packet from the server, the agent is operative to send a second response packet to the broker using the secure control session;
upon receipt of the second response packet from the agent, the broker is operative to send a third response packet to the client, wherein in the case that an exchange of TCP control packets between the agent and the server indicates establishment of a TCP session, the agent is operative to establish a data channel between the agent and the broker to create a transparent TCP channel between the client and the server and in the case that an exchange of TCP control packets between the agent and the server indicates failure to establish a TCP session, the third response packet forwarded by the broker to the client indicates that a connection has failed. 3. The data transmission system of claim 2 wherein the broker is connected to the client via a first secure connection and the agent is connected to the server via a second secure connection. 4. The data transmission system of claim 2 wherein the secure control session is a transport layer security (TLS) protocol connection over TCP port 443. 5. The data transmission system of claim 4 wherein the TLS protocol connection is made over a local proxy. 6. The data transmission system of claim 5 wherein the local proxy uses an HTTP CONNECT protocol. 7. The data transmission system of claim 2 wherein the first response packet, the second response packet, and the third response packet are one of TCP SYN Acknowledge (ACK) packets, TCP Reset (RST) ACK packets, and Internet Control Message Protocol (ICMP) packets. 8. The data transmission system of claim 2 wherein:
in the case that the exchange of TCP control packets between the agent and the server indicates failure to establish a TCP session, the agent is configured to inform the broker of a type of failure that occurred; and
in response to receipt of the type of failure, the broker is configured to generate an error packet indicating the type of failure and send the error packet to the client. 9. The data transmission system of claim 8 wherein if the type of failure indicates that the server refused the connection, the error packet is generated such that it appears to have originated from the server. 10. The data transmission system of claim 9 wherein if the type of failure indicates that the server is unreachable, the error packet is generated such that it appears to have originated from the broker. 11. A data transmission system for secure data exchange comprising:
a client; a broker connected to the client via a first secure network link; a server; an agent connected to the server via a second secure network link and connected to the broker via an unsecured network link; and one or more of a firewall, a proxy, and a network address translation (NAT) device connected between the broker and the agent, wherein:
the client is configured to send a control packet to the broker via the first secure network link;
in response to receipt of the control packet, the broker is configured to generate and send a modified version of the control packet to the agent via the unsecured network link;
in response to receipt of the modified version of the control packet, the agent is configured to initiate a connection with the server via the second secure network link;
in response to establishment of the connection between the agent and the server, the agent is configured to initiate a secure connection with the broker via the unsecured network link and the one or more of the firewall, the proxy, and the NAT device; and
in response to establishment of the secure connection between the agent and the broker, the broker is configured to send a response to the control packet from the client such that a connection is established between the client and the broker. 12. The data transmission system of claim 11 wherein initiating the connection with the server via the second secure network link comprises generating a new control packet and sending the new control packet to the server. 13. The data transmission system of claim 12 wherein the new control packet is a Transport Control Protocol Synchronize (TCP SYN) packet. 14. The data transmission system of claim 12 wherein the control packet, the modified version of the control packet, and the new control packet are Transport Control Protocol Synchronize (TCP SYN) packets. 15. The data transmission system of claim 12 wherein generating the modified version of the control packet, generating the new control packet, and initiating the secure connection with the broker via the unsecured network link are layer 5 operations. 16. The data transmission system of claim 11 wherein generating the modified version of the control packet, initiating the connection with the sever via the second secure network link, and initiating the secure connection with the broker via the unsecured network link are layer 5 operations. 17. The data transmission system of claim 11 wherein:
in response to failure of the connection between the agent and the server, the agent is configured to inform the broker of a type of failure that occurred; and
in response to receipt of the type of failure, the broker is configured to generate an error packet indicating the type of failure and send the error packet to the client. 18. The data transmission system of claim 17 wherein if the type of failure indicates that the server refused the connection, the error packet is generated such that it appears to have originated from the server. 19. The data transmission system of claim 18 wherein if the type of failure indicates that the server is unreachable, the error packet is generated such that it appears to have originated from the broker. 20. The data transmission system of claim 19 wherein initiating the connection with the server via the second secure network link comprises generating a new control packet and sending the new control packet to the server. 21. The data transmission system of claim 19 wherein generating the modified version of the control packet, initiating the connection with the sever via the second secure network link, initiating the secure connection with the broker via the unsecured network link, and generating the error packet are layer 5 operations. 22. A method for facilitating secure data exchange between a client and a server, the method comprising:
sending a control packet from the client to a broker via a first secure network link; in response to receipt of the control packet, generating a modified version of the control packet at the broker and sending the modified version of the control packet to an agent via an unsecured network link and one or more of a firewall, a proxy, and a network address translation (NAT) device; in response to receipt of the modified version of the control packet, initiating a connection from the agent to the server via a second secure network link; in response to establishment of the connection between the agent and the server, initiating a secure connection from the agent to the broker via the unsecured network link and the one or more of the firewall, the proxy, and the NAT device; and in response to establishment of the secure connection between the agent and the broker, sending a response to the control packet from the broker to the client such that a connection is established between the client and the broker. 23. The method of claim 22 wherein initiating the connection from the agent to the server comprises generating a new control packet at the agent and sending the new control packet to the server. 24. The method of claim 23 wherein generating the modified version of the control packet at the broker, generating the new control packet at the agent, and initiating the secure connection from the agent to the broker are layer 5 operations. 25. The method of claim 22 wherein generating the modified version of the control packet at the broker, initiating the connection from the agent to the server, and initiating the connection from the agent to the broker are layer 5 operations. 26. The method of claim 22 further comprising:
in response to failure of the connection between the agent and the server, informing the broker of a type of failure that occurred; and
in response to receipt of the type of failure, generating an error packet indicating the type of failure at the broker and sending the error packet to the client. 27. The method of claim 26 wherein if the type of failure indicates that the server refused the connection, the error packet is generated such that it appears to have originated from the server. 28. The method of claim 27 wherein if the type of failure indicates that the server is unreachable, the error packet is generated such that it appears to have originated from the broker. 29. The method of claim 28 wherein initiating the connection between the agent and the server comprises generating a new control packet at the agent and sending the new control packet to the server. 30. The method of claim 28 wherein generating the modified version of the control packet at the broker, initiating the connection from the agent to the server, initiating the connection from the agent to the broker, and generating the error packet are layer 5 operations. | A secure network communication system and method for secure data exchange using TCP are disclosed. The system provides data exchange between a client and server, through an agent and broker interconnected to exchange data over an unsecured network. Upon receipt of a control packet from the client, the broker forwards a modified control packet to the agent using a secure protocol. The agent inspects the modified control packet and forwards it to the server. Upon receipt of a response packet from the server, the agent forwards the response packet to the broker using a secure protocol. Upon receipt of the response packet, the agent modifies the response packet and forwards it to the client. If the exchange of control packets indicates establishment of a TCP session, the agent and the broker establish a data channel between themselves to create a transparent TCP channel between the client and the server.1. (canceled) 2. A data transmission system for secure data exchange using transmission control protocol (TCP) comprising:
a broker connected to a client; an agent connected to a server; an unsecured network link between the broker and the agent, wherein:
the agent and the broker are connected through at least a firewall device to exchange data over the unsecured network link and a layer 5 behavior of each one of the broker, the client, the agent, and the server are modified such that:
the agent is operative to establish a secure control session with the broker using a secure transport over the unsecured network link;
upon receipt of a TCP Synchronize (SYN) packet from the client, the broker is operative to capture the TCP SYN packet, generate a modified control packet based on the TCP SYN packet, and send the modified control packet to the agent using the secure control session;
the agent is operative to receive the modified control packet from the broker, generate a new TCP SYN packet based on the modified control packet, and send the new TCP SYN packet to the server;
upon receipt of a first response packet from the server, the agent is operative to send a second response packet to the broker using the secure control session;
upon receipt of the second response packet from the agent, the broker is operative to send a third response packet to the client, wherein in the case that an exchange of TCP control packets between the agent and the server indicates establishment of a TCP session, the agent is operative to establish a data channel between the agent and the broker to create a transparent TCP channel between the client and the server and in the case that an exchange of TCP control packets between the agent and the server indicates failure to establish a TCP session, the third response packet forwarded by the broker to the client indicates that a connection has failed. 3. The data transmission system of claim 2 wherein the broker is connected to the client via a first secure connection and the agent is connected to the server via a second secure connection. 4. The data transmission system of claim 2 wherein the secure control session is a transport layer security (TLS) protocol connection over TCP port 443. 5. The data transmission system of claim 4 wherein the TLS protocol connection is made over a local proxy. 6. The data transmission system of claim 5 wherein the local proxy uses an HTTP CONNECT protocol. 7. The data transmission system of claim 2 wherein the first response packet, the second response packet, and the third response packet are one of TCP SYN Acknowledge (ACK) packets, TCP Reset (RST) ACK packets, and Internet Control Message Protocol (ICMP) packets. 8. The data transmission system of claim 2 wherein:
in the case that the exchange of TCP control packets between the agent and the server indicates failure to establish a TCP session, the agent is configured to inform the broker of a type of failure that occurred; and
in response to receipt of the type of failure, the broker is configured to generate an error packet indicating the type of failure and send the error packet to the client. 9. The data transmission system of claim 8 wherein if the type of failure indicates that the server refused the connection, the error packet is generated such that it appears to have originated from the server. 10. The data transmission system of claim 9 wherein if the type of failure indicates that the server is unreachable, the error packet is generated such that it appears to have originated from the broker. 11. A data transmission system for secure data exchange comprising:
a client; a broker connected to the client via a first secure network link; a server; an agent connected to the server via a second secure network link and connected to the broker via an unsecured network link; and one or more of a firewall, a proxy, and a network address translation (NAT) device connected between the broker and the agent, wherein:
the client is configured to send a control packet to the broker via the first secure network link;
in response to receipt of the control packet, the broker is configured to generate and send a modified version of the control packet to the agent via the unsecured network link;
in response to receipt of the modified version of the control packet, the agent is configured to initiate a connection with the server via the second secure network link;
in response to establishment of the connection between the agent and the server, the agent is configured to initiate a secure connection with the broker via the unsecured network link and the one or more of the firewall, the proxy, and the NAT device; and
in response to establishment of the secure connection between the agent and the broker, the broker is configured to send a response to the control packet from the client such that a connection is established between the client and the broker. 12. The data transmission system of claim 11 wherein initiating the connection with the server via the second secure network link comprises generating a new control packet and sending the new control packet to the server. 13. The data transmission system of claim 12 wherein the new control packet is a Transport Control Protocol Synchronize (TCP SYN) packet. 14. The data transmission system of claim 12 wherein the control packet, the modified version of the control packet, and the new control packet are Transport Control Protocol Synchronize (TCP SYN) packets. 15. The data transmission system of claim 12 wherein generating the modified version of the control packet, generating the new control packet, and initiating the secure connection with the broker via the unsecured network link are layer 5 operations. 16. The data transmission system of claim 11 wherein generating the modified version of the control packet, initiating the connection with the sever via the second secure network link, and initiating the secure connection with the broker via the unsecured network link are layer 5 operations. 17. The data transmission system of claim 11 wherein:
in response to failure of the connection between the agent and the server, the agent is configured to inform the broker of a type of failure that occurred; and
in response to receipt of the type of failure, the broker is configured to generate an error packet indicating the type of failure and send the error packet to the client. 18. The data transmission system of claim 17 wherein if the type of failure indicates that the server refused the connection, the error packet is generated such that it appears to have originated from the server. 19. The data transmission system of claim 18 wherein if the type of failure indicates that the server is unreachable, the error packet is generated such that it appears to have originated from the broker. 20. The data transmission system of claim 19 wherein initiating the connection with the server via the second secure network link comprises generating a new control packet and sending the new control packet to the server. 21. The data transmission system of claim 19 wherein generating the modified version of the control packet, initiating the connection with the sever via the second secure network link, initiating the secure connection with the broker via the unsecured network link, and generating the error packet are layer 5 operations. 22. A method for facilitating secure data exchange between a client and a server, the method comprising:
sending a control packet from the client to a broker via a first secure network link; in response to receipt of the control packet, generating a modified version of the control packet at the broker and sending the modified version of the control packet to an agent via an unsecured network link and one or more of a firewall, a proxy, and a network address translation (NAT) device; in response to receipt of the modified version of the control packet, initiating a connection from the agent to the server via a second secure network link; in response to establishment of the connection between the agent and the server, initiating a secure connection from the agent to the broker via the unsecured network link and the one or more of the firewall, the proxy, and the NAT device; and in response to establishment of the secure connection between the agent and the broker, sending a response to the control packet from the broker to the client such that a connection is established between the client and the broker. 23. The method of claim 22 wherein initiating the connection from the agent to the server comprises generating a new control packet at the agent and sending the new control packet to the server. 24. The method of claim 23 wherein generating the modified version of the control packet at the broker, generating the new control packet at the agent, and initiating the secure connection from the agent to the broker are layer 5 operations. 25. The method of claim 22 wherein generating the modified version of the control packet at the broker, initiating the connection from the agent to the server, and initiating the connection from the agent to the broker are layer 5 operations. 26. The method of claim 22 further comprising:
in response to failure of the connection between the agent and the server, informing the broker of a type of failure that occurred; and
in response to receipt of the type of failure, generating an error packet indicating the type of failure at the broker and sending the error packet to the client. 27. The method of claim 26 wherein if the type of failure indicates that the server refused the connection, the error packet is generated such that it appears to have originated from the server. 28. The method of claim 27 wherein if the type of failure indicates that the server is unreachable, the error packet is generated such that it appears to have originated from the broker. 29. The method of claim 28 wherein initiating the connection between the agent and the server comprises generating a new control packet at the agent and sending the new control packet to the server. 30. The method of claim 28 wherein generating the modified version of the control packet at the broker, initiating the connection from the agent to the server, initiating the connection from the agent to the broker, and generating the error packet are layer 5 operations. | 2,400 |
7,675 | 7,675 | 12,311,481 | 2,486 | A series of memory management operation commands are described for the memory management of decoded reference pictures that are stored within a memory ( 1110 ), a multiview video coding operation. The video coding operation will consider the view for which a picture is to be coded as compared against the view associated with the stored reference picture ( 1120 ), where a memory management operation command is enabled affecting the memory status of the stored reference pictures where such an effect may be designation of a reference picture ( 1125 ) being a short term reference picture, a long term reference picture, or designating the reference picture as not being needed. | 1. A method for memory management of a reference picture used multiview video coding comprising the steps of:
storing a reference picture in a memory, where the reference picture is associated with a memory status and a view; coding a video picture with information which affects the memory status of said stored reference picture, and said coding step is implemented when the view associated with said reference picture is different than a view associated with said coded video picture. 2. The method of claim 1, where said memory status change is implemented using a memory management operation command. 3. The method of claim 2, wherein said coding step is implemented when the view associated with said reference picture is the same as the video associated with the coded video picture. 4. The method of claim 2, wherein
a second stored reference picture is of a second view which is different than said view; and said memory management operation command affects all of the reference pictures associated with said view without affecting the reference pictures associated with said second view. 5. The method of claim 2, where said memory status associated with said stored reference frame is changed from a status selected from: long term reference frame, short term reference frame, and non-used for reference to a status selected from: long term reference frame, short term reference frame, and non-used for reference. 6. The method of claim 2, wherein said reference picture is initially coded using an H.264 based coding operation and said memory status change is performed during a multiview coding operation. 7. The method of claim 2, wherein said reference picture is coded and said change in said memory status is performed in a video coding operation that does both temporal and inter-view coding. 8. The method of claim 1, where a marking mode syntax element flag is called to select between the reference marking modes of said picture that is currently being coded. 9. A coding apparatus for performing the method of claim 1. | A series of memory management operation commands are described for the memory management of decoded reference pictures that are stored within a memory ( 1110 ), a multiview video coding operation. The video coding operation will consider the view for which a picture is to be coded as compared against the view associated with the stored reference picture ( 1120 ), where a memory management operation command is enabled affecting the memory status of the stored reference pictures where such an effect may be designation of a reference picture ( 1125 ) being a short term reference picture, a long term reference picture, or designating the reference picture as not being needed.1. A method for memory management of a reference picture used multiview video coding comprising the steps of:
storing a reference picture in a memory, where the reference picture is associated with a memory status and a view; coding a video picture with information which affects the memory status of said stored reference picture, and said coding step is implemented when the view associated with said reference picture is different than a view associated with said coded video picture. 2. The method of claim 1, where said memory status change is implemented using a memory management operation command. 3. The method of claim 2, wherein said coding step is implemented when the view associated with said reference picture is the same as the video associated with the coded video picture. 4. The method of claim 2, wherein
a second stored reference picture is of a second view which is different than said view; and said memory management operation command affects all of the reference pictures associated with said view without affecting the reference pictures associated with said second view. 5. The method of claim 2, where said memory status associated with said stored reference frame is changed from a status selected from: long term reference frame, short term reference frame, and non-used for reference to a status selected from: long term reference frame, short term reference frame, and non-used for reference. 6. The method of claim 2, wherein said reference picture is initially coded using an H.264 based coding operation and said memory status change is performed during a multiview coding operation. 7. The method of claim 2, wherein said reference picture is coded and said change in said memory status is performed in a video coding operation that does both temporal and inter-view coding. 8. The method of claim 1, where a marking mode syntax element flag is called to select between the reference marking modes of said picture that is currently being coded. 9. A coding apparatus for performing the method of claim 1. | 2,400 |
7,676 | 7,676 | 14,714,372 | 2,412 | Disclosed a methods, circuits, apparatuses and associated computer executable code for regulating congestion levels on at least one segment of a data communication network. According to some embodiments, a data communication network may include an access point along with both uplink and downlink data paths. The network may include a traffic management appliance. The appliance or functionally associated device may include a traffic monitor to measure a downlink congestion level on a segment of the network downlink. The appliance or a functionally associated device may include a transmission manager to intercept or suppress uplink data traffic when the traffic monitor indicates a downlink congestion level exceeding a first threshold level. | 1. A data traffic management appliance for a mobile communication network, said appliance comprising:
a traffic monitor to measure a downlink congestion level on a segment of the network downlink; and a transmission manager to intercept or suppress uplink data traffic when said traffic monitor indicates a downlink congestion level exceeding a first threshold level. 2. The appliance according to claim 1, further comprising a data buffer to temporarily store intercepted uplink data traffic. 3. The appliance according to claim 2, wherein the intercepted uplink data traffic is released and forwarded to an intended destination upon the downlink congestion level falling below a second threshold level. 4. The appliance according to claim 3, wherein a receipt acknowledgement generated by the intended destination of the uplink data traffic is intercepted or suppressed. 5. The appliance according to claim 1, further comprising an acknowledgment unit to generate a receipt acknowledgement for intercepted uplink data traffic, wherein the receipt acknowledgment is configured to emulate a receipt acknowledgement from an intended destination of the intercepted uplink traffic. 6. The appliance according to claim 5, wherein the generated receipt acknowledgement is transmitted to the source of the uplink traffic when a congestion level of the downlink permits. 7. The appliance according to claim 1, wherein the traffic monitor measures a downlink congestion level on a wireless segment of the downlink. 8. A data traffic network comprising:
a least one wireless access point; and a traffic management appliance comprising: (a) a traffic monitor to measure a downlink congestion level on a segment of the network downlink; and (b) a transmission manager to intercept or suppress uplink data traffic when said traffic monitor indicates a downlink congestion level exceeding a first threshold level. 9. The network according to claim 8, further comprising a data buffer to temporarily store intercepted uplink data traffic. 10. The network according to claim 9, wherein the intercepted uplink data traffic is released and forwarded to an intended destination upon the downlink congestion level falling below a second threshold level. 11. The network according to claim 10, wherein a receipt acknowledgement generated by the intended destination of the uplink data traffic is intercepted or suppressed. 12. The network according to claim 8, further comprising an acknowledgment unit to generate a receipt acknowledgement for intercepted uplink data traffic, wherein the receipt acknowledgment is configured to emulate a receipt acknowledgement from an intended destination of the intercepted uplink traffic. 13. The network according to claim 12, wherein the generated receipt acknowledgement is transmitted to the source of the uplink traffic when a congestion level of the downlink permits. 14. The network according to claim 8, wherein the traffic monitor measures a downlink congestion level on a wireless segment of the downlink. 15. A method of managing data traffic on a mobile communication network, said method comprising:
measuring a downlink congestion level on a segment of the network downlink; and intercepting or suppressing uplink data traffic when a downlink congestion level exceeds a first threshold level. 16. The method according to claim 15, further comprising buffering intercepted uplink data traffic. 17. The method according to claim 16, wherein the intercepted uplink data traffic is released and forwarded to an intended destination upon the downlink congestion level falling below a second threshold level. 18. The method according to claim 17, further comprising intercepting or suppressing a receipt acknowledgement generated by the intended destination of the uplink data traffic. 19. The method according to claim 15, further comprising generating a receipt acknowledgement for intercepted uplink data traffic, wherein the receipt acknowledgment is configured to emulate a receipt acknowledgement from an intended destination of the intercepted uplink traffic. 20. The method according to claim 19, wherein the generated receipt acknowledgement is transmitted to the source of the uplink traffic when a congestion level of the downlink permits. | Disclosed a methods, circuits, apparatuses and associated computer executable code for regulating congestion levels on at least one segment of a data communication network. According to some embodiments, a data communication network may include an access point along with both uplink and downlink data paths. The network may include a traffic management appliance. The appliance or functionally associated device may include a traffic monitor to measure a downlink congestion level on a segment of the network downlink. The appliance or a functionally associated device may include a transmission manager to intercept or suppress uplink data traffic when the traffic monitor indicates a downlink congestion level exceeding a first threshold level.1. A data traffic management appliance for a mobile communication network, said appliance comprising:
a traffic monitor to measure a downlink congestion level on a segment of the network downlink; and a transmission manager to intercept or suppress uplink data traffic when said traffic monitor indicates a downlink congestion level exceeding a first threshold level. 2. The appliance according to claim 1, further comprising a data buffer to temporarily store intercepted uplink data traffic. 3. The appliance according to claim 2, wherein the intercepted uplink data traffic is released and forwarded to an intended destination upon the downlink congestion level falling below a second threshold level. 4. The appliance according to claim 3, wherein a receipt acknowledgement generated by the intended destination of the uplink data traffic is intercepted or suppressed. 5. The appliance according to claim 1, further comprising an acknowledgment unit to generate a receipt acknowledgement for intercepted uplink data traffic, wherein the receipt acknowledgment is configured to emulate a receipt acknowledgement from an intended destination of the intercepted uplink traffic. 6. The appliance according to claim 5, wherein the generated receipt acknowledgement is transmitted to the source of the uplink traffic when a congestion level of the downlink permits. 7. The appliance according to claim 1, wherein the traffic monitor measures a downlink congestion level on a wireless segment of the downlink. 8. A data traffic network comprising:
a least one wireless access point; and a traffic management appliance comprising: (a) a traffic monitor to measure a downlink congestion level on a segment of the network downlink; and (b) a transmission manager to intercept or suppress uplink data traffic when said traffic monitor indicates a downlink congestion level exceeding a first threshold level. 9. The network according to claim 8, further comprising a data buffer to temporarily store intercepted uplink data traffic. 10. The network according to claim 9, wherein the intercepted uplink data traffic is released and forwarded to an intended destination upon the downlink congestion level falling below a second threshold level. 11. The network according to claim 10, wherein a receipt acknowledgement generated by the intended destination of the uplink data traffic is intercepted or suppressed. 12. The network according to claim 8, further comprising an acknowledgment unit to generate a receipt acknowledgement for intercepted uplink data traffic, wherein the receipt acknowledgment is configured to emulate a receipt acknowledgement from an intended destination of the intercepted uplink traffic. 13. The network according to claim 12, wherein the generated receipt acknowledgement is transmitted to the source of the uplink traffic when a congestion level of the downlink permits. 14. The network according to claim 8, wherein the traffic monitor measures a downlink congestion level on a wireless segment of the downlink. 15. A method of managing data traffic on a mobile communication network, said method comprising:
measuring a downlink congestion level on a segment of the network downlink; and intercepting or suppressing uplink data traffic when a downlink congestion level exceeds a first threshold level. 16. The method according to claim 15, further comprising buffering intercepted uplink data traffic. 17. The method according to claim 16, wherein the intercepted uplink data traffic is released and forwarded to an intended destination upon the downlink congestion level falling below a second threshold level. 18. The method according to claim 17, further comprising intercepting or suppressing a receipt acknowledgement generated by the intended destination of the uplink data traffic. 19. The method according to claim 15, further comprising generating a receipt acknowledgement for intercepted uplink data traffic, wherein the receipt acknowledgment is configured to emulate a receipt acknowledgement from an intended destination of the intercepted uplink traffic. 20. The method according to claim 19, wherein the generated receipt acknowledgement is transmitted to the source of the uplink traffic when a congestion level of the downlink permits. | 2,400 |
7,677 | 7,677 | 14,177,461 | 2,481 | Disclosed is an approach for encoding a current video frame that includes labeling points/regions for the current video frame using graphics information for the current video frame, matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame and deriving motion vectors for the points/regions of the current video frame. | 1. A method for encoding a current video frame comprising:
labeling points/regions for the current video frame using graphics information for the current video frame; matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame; and deriving motion vectors for the points/regions of the current video frame. 2. The method of claim 1, wherein a point/region for the current video frame is labeled using a draw call associated with the point/region for the current video frame. 3. The method of claim 2, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same draw call label. 4. The method of claim 2, wherein the point/region for the current video frame is also labeled using a model space coordinate associated with the point/region for the current video frame. 5. The method of claim 4, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same draw call label and a similar model space coordinate. 6. The method of claim 1, wherein a point/region for the current video frame is labeled using a primitive associated with the point/region for the current video frame. 7. The method of claim 6, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same primitive label. 8. The method of claim 6, wherein the point/region for the current video frame is also labeled using a texture coordinate. 9. The method of claim 8, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same primitive label and a similar texture coordinate. 10. The method of claim 1, wherein matching the points/regions of the current video frame comprises matching the points/regions of the current video frame with points/regions of more than one previous video frame. 11. The method of claim 1, wherein the graphics information is obtained by intercepting the graphics information generated by a video program. 12. The method of claim 1, wherein the graphics information is obtained by retrieving the graphics information from a graphics processing unit (GPU). 13. The method of claim 1, wherein deriving the motion vectors for the points/regions of the current video frame comprises using at least one of: a sum of absolute transformed differences (SATD), a sum of absolute differences (SAD), a sum of squared differences (SSD), or a sum of absolute inverse discrete cosine transform (IDCT) coefficients. 14. The method of claim 1, further comprising:
creating a predicted current frame using the motion vectors derived for the current frame; comparing the predicted current frame to the current frame to generate residuals for the current frame; encoding the current frame with the derived motion vectors when the residuals are less than a threshold; performing an alternative motion estimation algorithm for the current frame when the residuals are greater than a threshold. 15. A computer program product comprising a non-transitory computer usable medium having executable code to execute a method for encoding a current video frame, the method comprising:
labeling points/regions for the current video frame using graphics information for the current video frame; matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame; and deriving motion vectors for the points/regions of the current video frame. 16. A system for encoding a current video frame, comprising:
a computer processor to execute a set of program code instructions; a memory to hold the program code instructions, in which the program code instructions comprises program code for:
labeling points/regions for the current video frame using graphics information for the current video frame;
matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame; and
deriving motion vectors for the points/regions of the current video frame. 17. A method for encoding a current video frame comprising:
deriving geometry information for the current video frame; deriving geometry information for a previous video frame; calculating a motion vector for each vertex of the current video frame by comparing the geometry information for the current video frame to the geometry information for the previous video frame. 18. The method of claim 17, wherein the geometry information is obtained by intercepting graphics information generated by a video program and transforming the graphics information into the geometry information. 19. The method of claim 17, wherein the geometry information is retrieved from a graphics processing unit (GPU). 20. The method of claim 17, wherein the geometry information for the current video frame comprises screen coordinates for vertices of the current video frame and the geometry information for the previous video frame comprises screen coordinates for vertices of the previous video frame. 21. The method of claim 20, wherein calculating a motion vector for a vertex of the current video frame comprises subtracting screen coordinates for a matching vertex in the previous frame from screen coordinates for the vertex in the current frame. 22. A computer program product comprising a non-transitory computer usable medium having executable code to execute a method for encoding a current video frame, the method comprising:
deriving geometry information for the current video frame; deriving geometry information for a previous video frame; calculating a motion vector for each vertex of the current video frame by comparing the geometry information for the current video frame to the geometry information for the previous video frame. 23. The computer program product of claim 22, wherein the geometry information is obtained by intercepting graphics information generated by a video program and transforming the graphics information into the geometry information. 24. The computer program product of claim 22, wherein the geometry information is retrieved from a graphics processing unit (GPU). 25. The computer program product of claim 22, wherein the geometry information for the current video frame comprises screen coordinates for vertices of the current video frame and the geometry information for the previous video frame comprises screen coordinates for vertices of the previous video frame. 26. The computer program product of claim 25, wherein calculating a motion vector for a vertex of the current video frame comprises subtracting screen coordinates for a matching vertex in the previous frame from screen coordinates for the vertex in the current frame. 27. A system for encoding a current video frame, comprising:
a computer processor to execute a set of program code instructions; a memory to hold the program code instructions, in which the program code instructions comprises program code for:
deriving geometry information for the current video frame;
deriving geometry information for a previous video frame;
calculating a motion vector for each vertex of the current video frame by comparing the geometry information for the current video frame to the geometry information for the previous video frame. 28. The computer program product of claim 27, wherein the geometry information is obtained by intercepting graphics information generated by a video program and transforming the graphics information into the geometry information. 29. The computer program product of claim 27, wherein the geometry information is retrieved from a graphics processing unit (GPU). 30. The computer program product of claim 27, wherein the geometry information for the current video frame comprises screen coordinates for vertices of the current video frame and the geometry information for the previous video frame comprises screen coordinates for vertices of the previous video frame. 31. The computer program product of claim 30, wherein calculating a motion vector for a vertex of the current video frame comprises subtracting screen coordinates for a matching vertex in the previous frame from screen coordinates for the vertex in the current frame. | Disclosed is an approach for encoding a current video frame that includes labeling points/regions for the current video frame using graphics information for the current video frame, matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame and deriving motion vectors for the points/regions of the current video frame.1. A method for encoding a current video frame comprising:
labeling points/regions for the current video frame using graphics information for the current video frame; matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame; and deriving motion vectors for the points/regions of the current video frame. 2. The method of claim 1, wherein a point/region for the current video frame is labeled using a draw call associated with the point/region for the current video frame. 3. The method of claim 2, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same draw call label. 4. The method of claim 2, wherein the point/region for the current video frame is also labeled using a model space coordinate associated with the point/region for the current video frame. 5. The method of claim 4, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same draw call label and a similar model space coordinate. 6. The method of claim 1, wherein a point/region for the current video frame is labeled using a primitive associated with the point/region for the current video frame. 7. The method of claim 6, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same primitive label. 8. The method of claim 6, wherein the point/region for the current video frame is also labeled using a texture coordinate. 9. The method of claim 8, wherein the point/region for the current video frame is matched with a point/region of the previous video frame having a same primitive label and a similar texture coordinate. 10. The method of claim 1, wherein matching the points/regions of the current video frame comprises matching the points/regions of the current video frame with points/regions of more than one previous video frame. 11. The method of claim 1, wherein the graphics information is obtained by intercepting the graphics information generated by a video program. 12. The method of claim 1, wherein the graphics information is obtained by retrieving the graphics information from a graphics processing unit (GPU). 13. The method of claim 1, wherein deriving the motion vectors for the points/regions of the current video frame comprises using at least one of: a sum of absolute transformed differences (SATD), a sum of absolute differences (SAD), a sum of squared differences (SSD), or a sum of absolute inverse discrete cosine transform (IDCT) coefficients. 14. The method of claim 1, further comprising:
creating a predicted current frame using the motion vectors derived for the current frame; comparing the predicted current frame to the current frame to generate residuals for the current frame; encoding the current frame with the derived motion vectors when the residuals are less than a threshold; performing an alternative motion estimation algorithm for the current frame when the residuals are greater than a threshold. 15. A computer program product comprising a non-transitory computer usable medium having executable code to execute a method for encoding a current video frame, the method comprising:
labeling points/regions for the current video frame using graphics information for the current video frame; matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame; and deriving motion vectors for the points/regions of the current video frame. 16. A system for encoding a current video frame, comprising:
a computer processor to execute a set of program code instructions; a memory to hold the program code instructions, in which the program code instructions comprises program code for:
labeling points/regions for the current video frame using graphics information for the current video frame;
matching the points/regions of the current video frame with points/regions of a previous video frame using the labels for the points/regions of the current video frame; and
deriving motion vectors for the points/regions of the current video frame. 17. A method for encoding a current video frame comprising:
deriving geometry information for the current video frame; deriving geometry information for a previous video frame; calculating a motion vector for each vertex of the current video frame by comparing the geometry information for the current video frame to the geometry information for the previous video frame. 18. The method of claim 17, wherein the geometry information is obtained by intercepting graphics information generated by a video program and transforming the graphics information into the geometry information. 19. The method of claim 17, wherein the geometry information is retrieved from a graphics processing unit (GPU). 20. The method of claim 17, wherein the geometry information for the current video frame comprises screen coordinates for vertices of the current video frame and the geometry information for the previous video frame comprises screen coordinates for vertices of the previous video frame. 21. The method of claim 20, wherein calculating a motion vector for a vertex of the current video frame comprises subtracting screen coordinates for a matching vertex in the previous frame from screen coordinates for the vertex in the current frame. 22. A computer program product comprising a non-transitory computer usable medium having executable code to execute a method for encoding a current video frame, the method comprising:
deriving geometry information for the current video frame; deriving geometry information for a previous video frame; calculating a motion vector for each vertex of the current video frame by comparing the geometry information for the current video frame to the geometry information for the previous video frame. 23. The computer program product of claim 22, wherein the geometry information is obtained by intercepting graphics information generated by a video program and transforming the graphics information into the geometry information. 24. The computer program product of claim 22, wherein the geometry information is retrieved from a graphics processing unit (GPU). 25. The computer program product of claim 22, wherein the geometry information for the current video frame comprises screen coordinates for vertices of the current video frame and the geometry information for the previous video frame comprises screen coordinates for vertices of the previous video frame. 26. The computer program product of claim 25, wherein calculating a motion vector for a vertex of the current video frame comprises subtracting screen coordinates for a matching vertex in the previous frame from screen coordinates for the vertex in the current frame. 27. A system for encoding a current video frame, comprising:
a computer processor to execute a set of program code instructions; a memory to hold the program code instructions, in which the program code instructions comprises program code for:
deriving geometry information for the current video frame;
deriving geometry information for a previous video frame;
calculating a motion vector for each vertex of the current video frame by comparing the geometry information for the current video frame to the geometry information for the previous video frame. 28. The computer program product of claim 27, wherein the geometry information is obtained by intercepting graphics information generated by a video program and transforming the graphics information into the geometry information. 29. The computer program product of claim 27, wherein the geometry information is retrieved from a graphics processing unit (GPU). 30. The computer program product of claim 27, wherein the geometry information for the current video frame comprises screen coordinates for vertices of the current video frame and the geometry information for the previous video frame comprises screen coordinates for vertices of the previous video frame. 31. The computer program product of claim 30, wherein calculating a motion vector for a vertex of the current video frame comprises subtracting screen coordinates for a matching vertex in the previous frame from screen coordinates for the vertex in the current frame. | 2,400 |
7,678 | 7,678 | 14,221,371 | 2,413 | A method and system are disclosed for providing near-real-time competitive insights associated with user interactions within a social media environment. A first and second set of social media data, respectively associated with a first and second set of social media interactions, are processed to generate a first and second set of social network advocacy (SNA) data in near-real-time. The resulting first and second sets of SNA data are then processed to generate a first and second set of competitive insight data, which respectively indicate a near-real-time measurement of sentiment and advocacy related to various aspects of a first and second product. The first and second sets of social pricing index data are then processed to generate a set of competitive insight differential data, which indicates a corresponding improvement or decline in sentiment or advocacy related to various aspects of the first and second products. | 1. A computer-implementable method for providing near-real-time competitive insights associated with user interactions within a social media environment, comprising:
processing a first set of social media data to generate a first set of SNA data in near-real-time, the first set of social media data associated with a first set of user interactions within a social media environment corresponding to a first product; processing the first set of SNA data to generate a first set of SNA Pulse (SNAP) metric data; and processing the first set of SNAP metric data to generate a first set of competitive insight data corresponding to the first product. 2. The method of claim 1, further comprising:
processing a second set of social media data to generate a second set of SNA data in near-real-time, the second set of social media data associated with a second set of user interactions within a social media environment corresponding to a second product; processing the second set of SNA data to generate a second set of SNAP metric data; processing the second set of SNAP metric data to generate a second set of competitive insight data corresponding to the second product; and processing the first and second sets of competitive insight data to generate a set of competitive insight differential data. 3. The method of claim 2, wherein:
the first set of competitive insight data is processed to generate a first aggregate competitive insight value; and the second set of competitive insight data is processed to generate a second aggregate competitive insight value. 4. The method of claim 3, wherein the first and second sets of competitive insight data are processed to generate an aggregate competitive insight differential value. 5. The method of claim 4, wherein the first and second sets of competitive insight data respectively correspond to a set of product aspects comprising at least one member of the set of:
a product feature; a product capability; a product performance metric; a product's pricing; a product's quality; a product's purchase experience; a product's delivery experience; and a product's associated customer service. 6. The method of claim 5, wherein a predetermined weighting factor is applied to individual members of the first and second sets of competitive insight data to generate a first and second set of weighted competitive insight data. 7. A system comprising:
a processor; a data bus coupled to the processor; and a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for near-real-time competitive insights associated with user interactions within a social media environment and comprising instructions executable by the processor and configured for:
processing a first set of social media data to generate a first set of SNA data in near-real-time, the first set of social media data associated with a first set of user interactions within a social media environment corresponding to a first product;
processing the first set of SNA data to generate a first set of SNA Pulse (SNAP) metric data; and
processing the first set of SNAP metric data to generate a first set of competitive insight data corresponding to the first product. 8. The system of claim 7, further comprising:
processing a second set of social media data to generate a second set of SNA data in near-real-time, the second set of social media data associated with a second set of user interactions within a social media environment corresponding to a second product; processing the second set of SNA data to generate a second set of SNAP metric data; processing the second set of SNAP metric data to generate a second set of competitive insight data corresponding to the second product; and processing the first and second sets of competitive insight data to generate a set of competitive insight differential data. 9. The system of claim 8, wherein:
the first set of competitive insight data is processed to generate a first aggregate competitive insight value; and the second set of competitive insight data is processed to generate a second aggregate competitive insight value. 10. The system of claim 9, wherein the first and second sets of competitive insight data are processed to generate an aggregate competitive insight differential value. 11. The system of claim 10, wherein the first and second sets of competitive insight data respectively correspond to a set of product aspects comprising at least one member of the set of:
a product feature; a product capability; a product performance metric; a product's pricing; a product's quality; a product's purchase experience; a product's delivery experience; and a product's associated customer service. 12. The system of claim 11, wherein a predetermined weighting factor is applied to individual members of the first and second sets of competitive insight data to generate a first and second set of weighted competitive insight data. 13. A non-transitory, computer-readable medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
processing a first set of social media data to generate a first set of SNA data in near-real-time, the first set of social media data associated with a first set of user interactions within a social media environment corresponding to a first product; processing the first set of SNA data to generate a first set of SNA Pulse (SNAP) metric data; and processing the first set of SNAP metric data to generate a first set of competitive insight data corresponding to the first product. 14. The non-transitory, computer-readable medium of claim 13, further comprising:
processing a second set of social media data to generate a second set of SNA data in near-real-time, the second set of social media data associated with a second set of user interactions within a social media environment corresponding to a second product; processing the second set of SNA data to generate a second set of SNAP metric data; processing the second set of SNAP metric data to generate a second set of competitive insight data corresponding to the second product; and processing the first and second sets of competitive insight data to generate a set of competitive insight differential data. 15. The non-transitory, computer-readable medium of claim 14, wherein:
the first set of competitive insight data is processed to generate a first aggregate competitive insight value; and the second set of competitive insight data is processed to generate a second aggregate competitive insight value. 16. The non-transitory, computer-readable medium of claim 15, wherein the first and second sets of competitive insight data are processed to generate an aggregate competitive insight differential value. 17. The non-transitory, computer-readable medium of claim 16, wherein the first and second sets of competitive insight data respectively correspond to a set of product aspects comprising at least one member of the set of:
a product feature; a product capability; a product performance metric; a product's pricing; a product's quality; a product's purchase experience; a product's delivery experience; and a product's associated customer service. 18. The non-transitory, computer-readable medium of claim 17, wherein a predetermined weighting factor is applied to individual members of the first and second sets of competitive insight data to generate a first and second set of weighted competitive insight data. 19. The non-transitory, computer-readable medium of claim 13, wherein the computer executable instructions are deployable to a client computer from a server at a remote location. 20. The non-transitory, computer-readable medium of claim 13, wherein the computer executable instructions are provided by a service provider to a user on an on-demand basis. | A method and system are disclosed for providing near-real-time competitive insights associated with user interactions within a social media environment. A first and second set of social media data, respectively associated with a first and second set of social media interactions, are processed to generate a first and second set of social network advocacy (SNA) data in near-real-time. The resulting first and second sets of SNA data are then processed to generate a first and second set of competitive insight data, which respectively indicate a near-real-time measurement of sentiment and advocacy related to various aspects of a first and second product. The first and second sets of social pricing index data are then processed to generate a set of competitive insight differential data, which indicates a corresponding improvement or decline in sentiment or advocacy related to various aspects of the first and second products.1. A computer-implementable method for providing near-real-time competitive insights associated with user interactions within a social media environment, comprising:
processing a first set of social media data to generate a first set of SNA data in near-real-time, the first set of social media data associated with a first set of user interactions within a social media environment corresponding to a first product; processing the first set of SNA data to generate a first set of SNA Pulse (SNAP) metric data; and processing the first set of SNAP metric data to generate a first set of competitive insight data corresponding to the first product. 2. The method of claim 1, further comprising:
processing a second set of social media data to generate a second set of SNA data in near-real-time, the second set of social media data associated with a second set of user interactions within a social media environment corresponding to a second product; processing the second set of SNA data to generate a second set of SNAP metric data; processing the second set of SNAP metric data to generate a second set of competitive insight data corresponding to the second product; and processing the first and second sets of competitive insight data to generate a set of competitive insight differential data. 3. The method of claim 2, wherein:
the first set of competitive insight data is processed to generate a first aggregate competitive insight value; and the second set of competitive insight data is processed to generate a second aggregate competitive insight value. 4. The method of claim 3, wherein the first and second sets of competitive insight data are processed to generate an aggregate competitive insight differential value. 5. The method of claim 4, wherein the first and second sets of competitive insight data respectively correspond to a set of product aspects comprising at least one member of the set of:
a product feature; a product capability; a product performance metric; a product's pricing; a product's quality; a product's purchase experience; a product's delivery experience; and a product's associated customer service. 6. The method of claim 5, wherein a predetermined weighting factor is applied to individual members of the first and second sets of competitive insight data to generate a first and second set of weighted competitive insight data. 7. A system comprising:
a processor; a data bus coupled to the processor; and a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for near-real-time competitive insights associated with user interactions within a social media environment and comprising instructions executable by the processor and configured for:
processing a first set of social media data to generate a first set of SNA data in near-real-time, the first set of social media data associated with a first set of user interactions within a social media environment corresponding to a first product;
processing the first set of SNA data to generate a first set of SNA Pulse (SNAP) metric data; and
processing the first set of SNAP metric data to generate a first set of competitive insight data corresponding to the first product. 8. The system of claim 7, further comprising:
processing a second set of social media data to generate a second set of SNA data in near-real-time, the second set of social media data associated with a second set of user interactions within a social media environment corresponding to a second product; processing the second set of SNA data to generate a second set of SNAP metric data; processing the second set of SNAP metric data to generate a second set of competitive insight data corresponding to the second product; and processing the first and second sets of competitive insight data to generate a set of competitive insight differential data. 9. The system of claim 8, wherein:
the first set of competitive insight data is processed to generate a first aggregate competitive insight value; and the second set of competitive insight data is processed to generate a second aggregate competitive insight value. 10. The system of claim 9, wherein the first and second sets of competitive insight data are processed to generate an aggregate competitive insight differential value. 11. The system of claim 10, wherein the first and second sets of competitive insight data respectively correspond to a set of product aspects comprising at least one member of the set of:
a product feature; a product capability; a product performance metric; a product's pricing; a product's quality; a product's purchase experience; a product's delivery experience; and a product's associated customer service. 12. The system of claim 11, wherein a predetermined weighting factor is applied to individual members of the first and second sets of competitive insight data to generate a first and second set of weighted competitive insight data. 13. A non-transitory, computer-readable medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
processing a first set of social media data to generate a first set of SNA data in near-real-time, the first set of social media data associated with a first set of user interactions within a social media environment corresponding to a first product; processing the first set of SNA data to generate a first set of SNA Pulse (SNAP) metric data; and processing the first set of SNAP metric data to generate a first set of competitive insight data corresponding to the first product. 14. The non-transitory, computer-readable medium of claim 13, further comprising:
processing a second set of social media data to generate a second set of SNA data in near-real-time, the second set of social media data associated with a second set of user interactions within a social media environment corresponding to a second product; processing the second set of SNA data to generate a second set of SNAP metric data; processing the second set of SNAP metric data to generate a second set of competitive insight data corresponding to the second product; and processing the first and second sets of competitive insight data to generate a set of competitive insight differential data. 15. The non-transitory, computer-readable medium of claim 14, wherein:
the first set of competitive insight data is processed to generate a first aggregate competitive insight value; and the second set of competitive insight data is processed to generate a second aggregate competitive insight value. 16. The non-transitory, computer-readable medium of claim 15, wherein the first and second sets of competitive insight data are processed to generate an aggregate competitive insight differential value. 17. The non-transitory, computer-readable medium of claim 16, wherein the first and second sets of competitive insight data respectively correspond to a set of product aspects comprising at least one member of the set of:
a product feature; a product capability; a product performance metric; a product's pricing; a product's quality; a product's purchase experience; a product's delivery experience; and a product's associated customer service. 18. The non-transitory, computer-readable medium of claim 17, wherein a predetermined weighting factor is applied to individual members of the first and second sets of competitive insight data to generate a first and second set of weighted competitive insight data. 19. The non-transitory, computer-readable medium of claim 13, wherein the computer executable instructions are deployable to a client computer from a server at a remote location. 20. The non-transitory, computer-readable medium of claim 13, wherein the computer executable instructions are provided by a service provider to a user on an on-demand basis. | 2,400 |
7,679 | 7,679 | 15,058,707 | 2,421 | Methods, systems, and computer program products for alerting users to media events of interest using social media analysis are provided herein. A computer-implemented method includes collecting user media preferences indicating events of interest to a given user; buffering at least a portion of media content associated with the collected user media preferences of the given user; monitoring social media for one or more events of interest to the given user based on the collected user media preferences of the given user; identifying at least one event that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of the given user; and notifying the given user of the at least one event of interest. | 1. A computer-implemented method, comprising:
collecting user media preferences indicating events of interest to a given user; buffering at least a portion of media content associated with the collected user media preferences of the given user; monitoring, using at least one processing device, social media for one or more media events of interest to the given user based on the collected user media preferences of said given user; identifying, using said at least one processing device, at least one media event in said buffered media content that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of said given user; and notifying, using said at least one processing device, the given user of the at least one media event of interest. 2. The computer-implemented method of claim 1, wherein said step of collecting user media preferences further comprises one or more of obtaining an explicit user designation of media preferences and mining social media postings of the given user. 3. The computer-implemented method of claim 1, wherein said step of buffering at least said portion of media content comprises buffering media content based on the collected user media preferences for a plurality of users as surrogate for the given user. 4. The computer-implemented method of claim 1, wherein said step of monitoring social media further comprises the step of identifying a mention of a media item that satisfies one or more predefined interest criteria. 5. The computer-implemented method of claim 1, further comprising the step of providing the given user with substantially immediate access, with respect to said identifying, to the buffered media content associated with the at least one media event of interest. 6. The computer-implemented method of claim 5, wherein said providing step further comprises one or more of sending a link to the given user for the buffered media content associated with the at least one media event of interest and embedding the buffered media content associated with the at least one media event of interest in one or more of the alert and a pop-up window on a display. 7. The computer-implemented method of claim 5, further comprising the step of aligning a segment of the buffered media content associated with the at least one media event of interest, based on the monitored social media contributions of the other parties. 8. The computer-implemented method of claim 1, wherein the one or more predefined interest criteria comprises one or more of a host of a television program that includes the at least one media event raising his or her voice in an excited manner above a predefined volume threshold; a volume of crowd noise relating to the at least one media event exceeding a predefined noise threshold; a number of social media posts about the at least one media event exceeding a predefined posting number threshold; one or more predefined keywords occurring about the media event; and a predefined action occurring involving a particular person or group. 9. A computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by at least one processing device to cause the at least one processing device to:
collect user media preferences indicating events of interest to a given user; buffer at least a portion of media content associated with the collected user media preferences of the given user; monitor, using said at least one processing device, social media for one or more media events of interest to the given user based on the collected user media preferences of said given user; identify, using said at least one processing device, at least one media event in said buffered media content that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of said given user; and notify, using said at least one processing device, the given user of the at least one media event of interest. 10. The computer program product of claim 9, wherein said user media preferences are collected by one or more of obtaining an explicit user designation of media preferences and mining social media postings of the given user. 11. The computer program product of claim 9, wherein said at least said portion of media content is buffered by buffering media content based on the collected user media preferences for a plurality of users as surrogate for the given user. 12. The computer program product of claim 9, wherein said social media are monitored by identifying a mention of a media item that satisfies one or more predefined interest criteria. 13. The computer program product of claim 9, wherein the given user is provided with substantially immediate access, with respect to said identifying, to the buffered media content associated with the at least one media event of interest by one or more of sending a link to the given user for the buffered media content associated with the at least one media event of interest and embedding the buffered media content associated with the at least one media event of interest in one or more of the alert and a pop-up window on a display. 14. The computer program product of claim 9, wherein the one or more predefined interest criteria comprises one or more of a host of a television program that includes the at least one media event raising his or her voice in an excited manner above a predefined volume threshold; a volume of crowd noise relating to the at least one media event exceeding a predefined noise threshold; a number of social media posts about the at least one media event exceeding a predefined posting number threshold; one or more predefined keywords occurring about the media event; and a predefined action occurring involving a particular person or group. 15. A system comprising:
a memory; and at least one processor coupled to the memory and configured for: collecting user media preferences indicating events of interest to a given user; buffering at least a portion of media content associated with the collected user media preferences of the given user; monitoring, using said at least one processor, social media for one or more media events of interest to the given user based on the collected user media preferences of said given user; identifying, using said at least one processor, at least one media event in said buffered media content that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of said given user; and notifying, using said at least one processor, the given user of the at least one media event of interest. 16. The system of claim 15, wherein said user media preferences are collected by one or more of obtaining an explicit user designation of media preferences and mining social media postings of the given user. 17. The system of claim 15, wherein said at least said portion of media content is buffered by buffering media content based on the collected user media preferences for a plurality of users as surrogate for the given user. 18. The system of claim 15, wherein said social media are monitored by identifying a mention of a media item that satisfies one or more predefined interest criteria. 19. The system of claim 15, wherein the given user is provided with substantially immediate access, with respect to said identifying, to the buffered media content associated with the at least one media event of interest by one or more of sending a link to the given user for the buffered media content associated with the at least one media event of interest and embedding the buffered media content associated with the at least one media event of interest in one or more of the alert and a pop-up window on a display. 20. The system of claim 15, wherein the one or more predefined interest criteria comprises one or more of a host of a television program that includes the at least one media event raising his or her voice in an excited manner above a predefined volume threshold; a volume of crowd noise relating to the at least one media event exceeding a predefined noise threshold; a number of social media posts about the at least one media event exceeding a predefined posting number threshold; one or more predefined keywords occurring about the media event; and a predefined action occurring involving a particular person or group. | Methods, systems, and computer program products for alerting users to media events of interest using social media analysis are provided herein. A computer-implemented method includes collecting user media preferences indicating events of interest to a given user; buffering at least a portion of media content associated with the collected user media preferences of the given user; monitoring social media for one or more events of interest to the given user based on the collected user media preferences of the given user; identifying at least one event that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of the given user; and notifying the given user of the at least one event of interest.1. A computer-implemented method, comprising:
collecting user media preferences indicating events of interest to a given user; buffering at least a portion of media content associated with the collected user media preferences of the given user; monitoring, using at least one processing device, social media for one or more media events of interest to the given user based on the collected user media preferences of said given user; identifying, using said at least one processing device, at least one media event in said buffered media content that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of said given user; and notifying, using said at least one processing device, the given user of the at least one media event of interest. 2. The computer-implemented method of claim 1, wherein said step of collecting user media preferences further comprises one or more of obtaining an explicit user designation of media preferences and mining social media postings of the given user. 3. The computer-implemented method of claim 1, wherein said step of buffering at least said portion of media content comprises buffering media content based on the collected user media preferences for a plurality of users as surrogate for the given user. 4. The computer-implemented method of claim 1, wherein said step of monitoring social media further comprises the step of identifying a mention of a media item that satisfies one or more predefined interest criteria. 5. The computer-implemented method of claim 1, further comprising the step of providing the given user with substantially immediate access, with respect to said identifying, to the buffered media content associated with the at least one media event of interest. 6. The computer-implemented method of claim 5, wherein said providing step further comprises one or more of sending a link to the given user for the buffered media content associated with the at least one media event of interest and embedding the buffered media content associated with the at least one media event of interest in one or more of the alert and a pop-up window on a display. 7. The computer-implemented method of claim 5, further comprising the step of aligning a segment of the buffered media content associated with the at least one media event of interest, based on the monitored social media contributions of the other parties. 8. The computer-implemented method of claim 1, wherein the one or more predefined interest criteria comprises one or more of a host of a television program that includes the at least one media event raising his or her voice in an excited manner above a predefined volume threshold; a volume of crowd noise relating to the at least one media event exceeding a predefined noise threshold; a number of social media posts about the at least one media event exceeding a predefined posting number threshold; one or more predefined keywords occurring about the media event; and a predefined action occurring involving a particular person or group. 9. A computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by at least one processing device to cause the at least one processing device to:
collect user media preferences indicating events of interest to a given user; buffer at least a portion of media content associated with the collected user media preferences of the given user; monitor, using said at least one processing device, social media for one or more media events of interest to the given user based on the collected user media preferences of said given user; identify, using said at least one processing device, at least one media event in said buffered media content that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of said given user; and notify, using said at least one processing device, the given user of the at least one media event of interest. 10. The computer program product of claim 9, wherein said user media preferences are collected by one or more of obtaining an explicit user designation of media preferences and mining social media postings of the given user. 11. The computer program product of claim 9, wherein said at least said portion of media content is buffered by buffering media content based on the collected user media preferences for a plurality of users as surrogate for the given user. 12. The computer program product of claim 9, wherein said social media are monitored by identifying a mention of a media item that satisfies one or more predefined interest criteria. 13. The computer program product of claim 9, wherein the given user is provided with substantially immediate access, with respect to said identifying, to the buffered media content associated with the at least one media event of interest by one or more of sending a link to the given user for the buffered media content associated with the at least one media event of interest and embedding the buffered media content associated with the at least one media event of interest in one or more of the alert and a pop-up window on a display. 14. The computer program product of claim 9, wherein the one or more predefined interest criteria comprises one or more of a host of a television program that includes the at least one media event raising his or her voice in an excited manner above a predefined volume threshold; a volume of crowd noise relating to the at least one media event exceeding a predefined noise threshold; a number of social media posts about the at least one media event exceeding a predefined posting number threshold; one or more predefined keywords occurring about the media event; and a predefined action occurring involving a particular person or group. 15. A system comprising:
a memory; and at least one processor coupled to the memory and configured for: collecting user media preferences indicating events of interest to a given user; buffering at least a portion of media content associated with the collected user media preferences of the given user; monitoring, using said at least one processor, social media for one or more media events of interest to the given user based on the collected user media preferences of said given user; identifying, using said at least one processor, at least one media event in said buffered media content that satisfies one or more predefined interest criteria for the given user based on the monitored social media contributions of other parties and the collected user media preferences of said given user; and notifying, using said at least one processor, the given user of the at least one media event of interest. 16. The system of claim 15, wherein said user media preferences are collected by one or more of obtaining an explicit user designation of media preferences and mining social media postings of the given user. 17. The system of claim 15, wherein said at least said portion of media content is buffered by buffering media content based on the collected user media preferences for a plurality of users as surrogate for the given user. 18. The system of claim 15, wherein said social media are monitored by identifying a mention of a media item that satisfies one or more predefined interest criteria. 19. The system of claim 15, wherein the given user is provided with substantially immediate access, with respect to said identifying, to the buffered media content associated with the at least one media event of interest by one or more of sending a link to the given user for the buffered media content associated with the at least one media event of interest and embedding the buffered media content associated with the at least one media event of interest in one or more of the alert and a pop-up window on a display. 20. The system of claim 15, wherein the one or more predefined interest criteria comprises one or more of a host of a television program that includes the at least one media event raising his or her voice in an excited manner above a predefined volume threshold; a volume of crowd noise relating to the at least one media event exceeding a predefined noise threshold; a number of social media posts about the at least one media event exceeding a predefined posting number threshold; one or more predefined keywords occurring about the media event; and a predefined action occurring involving a particular person or group. | 2,400 |
7,680 | 7,680 | 14,139,716 | 2,487 | An apparatus may include a memory to receive an image frame to encode; and a modular motion estimation engine to process the image frame. The modular motion estimation engine includes modular motion estimation circuitry comprising a multiplicity of motion estimation circuits, and a motion estimation kernel for execution on the modular motion estimation circuitry to send the image frame through one or more configurable execution pipelines that each execute motion estimation over one or more of the motion estimation circuits. | 1. An apparatus, comprising:
a memory to receive an image frame to encode; and a modular motion estimation engine to process the image frame, the modular motion estimation engine comprising:
modular motion estimation circuitry comprising a multiplicity of motion estimation circuits; and
a motion estimation kernel for execution on the modular motion estimation circuitry to send the image frame through one or more configurable execution pipelines that each executes motion estimation over one or more of the motion estimation circuits. 2. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to generate a multiplicity of parallel execution pipelines to perform motion estimation on the image frame. 3. The apparatus of claim 1, the one or more configurable execution pipelines comprising one or more integer motion estimation (IME) pipelines and one or more check and refinement motion estimation (CRE) pipelines. 4. The apparatus of claim 3, the one or more IME pipeline comprising execution via an integer motion estimation circuit of the modular motion estimation circuitry, and the one or more CRE pipeline comprising execution via one or more of a skip check module, intra frame estimation module, fractional motion estimation circuit, and bidirectional motion estimation circuit. 5. The apparatus of claim 1, the one or more motion estimation circuits to process the image frame by comparing a macroblock within the image frame to a block of a reference frame or reference frames using a block matching algorithm. 6. The apparatus of claim 5, the modular motion estimation circuitry comprising a multiplicity of entry points to receive the macroblock and a multiplicity of exit points to generate motion estimation output for the macroblock. 7. The apparatus of claim 1, the modular motion estimation engine comprising a mode decision engine to receive output from the one or more configurable execution pipelines and to select a mode for encoding the image frame based upon the received output. 8. The apparatus of claim 1, the modular motion estimation circuitry comprising a skip check module for forward transform processing. 9. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform motion estimation using multi-reference search over multiple reference frames. 10. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform accelerated chroma intra frame prediction. 11. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform accelerated chroma inter frame prediction. 12. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform a weighted sum-of-absolute-differences (SAD) procedure for true motion estimation. 13. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to:
determine a present workload based upon the image frame and one or more additional image frames; and generate one or more tailored execution pipelines that each executes motion estimation over one or more of the motion estimation circuits and is tailored for processing the present workload. 14. At least one computer-readable storage medium comprising instructions that, when executed, cause a system to generate, responsive to receipt of an image frame, generate signals to send the image frame through one or more configurable execution pipelines that each executes motion estimation over one or more hardware circuits. 15. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to generate a multiplicity of parallel execution pipelines to perform motion estimation on the image frame. 16. The at least one computer-readable storage medium of claim 14, the one or more configurable execution pipelines comprising one or more integer motion estimation (IME) pipelines and one or more check and refinement motion estimation (CRE) pipelines, the one or more IME pipeline comprising execution via an integer motion estimation circuit of the modular motion estimation circuitry, and the one or more CRE pipeline comprising execution via one or more of a skip check module, intra frame estimation module, fractional motion estimation circuit, and bidirectional motion estimation circuit. 17. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to process the image frame by comparing a macroblock within the image frame to a block of a reference frame or reference frames using a block matching algorithm. 18. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to:
receive output from the one or more configurable execution pipelines; and
select a mode for encoding the image frame based upon the received output. 19. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to perform motion estimation using multi-reference search over multiple reference frames. 20. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to perform accelerated chroma intra frame prediction or perform accelerated chroma inter frame prediction. 21. A computer implemented method, comprising:
receiving an image frame; and sending the image frame through one or more configurable execution pipelines that each executes motion estimation over one or more hardware circuits. 22. The computer implemented method of claim 21 comprising generating a multiplicity of parallel execution pipelines pipelines to perform motion estimation on the image frame. 23. The computer implemented method of claim 21, the one or more configurable execution pipelines comprising one or more integer motion estimation (IME) pipelines and one or more check and refinement motion estimation (CRE) pipelines, the one or more IME pipeline comprising execution via an integer motion estimation circuit of the modular motion estimation circuitry, and the one or more CRE pipeline comprising execution via one or more of a skip check module, intra frame estimation module, fractional motion estimation circuit, and bidirectional motion estimation circuit. 24. The computer implemented method of claim 21 comprising:
receiving output from the one or more configurable execution pipelines; and
selecting a mode for encoding the image frame based upon the received output. 25. The computer implemented method of claim 21, comprising:
determining a present workload based upon the received image frame and one or more additional image frames; and generating one or more tailored execution pipelines that each executes motion estimation over one or more of the motion estimation circuits and is tailored for processing the present workload. | An apparatus may include a memory to receive an image frame to encode; and a modular motion estimation engine to process the image frame. The modular motion estimation engine includes modular motion estimation circuitry comprising a multiplicity of motion estimation circuits, and a motion estimation kernel for execution on the modular motion estimation circuitry to send the image frame through one or more configurable execution pipelines that each execute motion estimation over one or more of the motion estimation circuits.1. An apparatus, comprising:
a memory to receive an image frame to encode; and a modular motion estimation engine to process the image frame, the modular motion estimation engine comprising:
modular motion estimation circuitry comprising a multiplicity of motion estimation circuits; and
a motion estimation kernel for execution on the modular motion estimation circuitry to send the image frame through one or more configurable execution pipelines that each executes motion estimation over one or more of the motion estimation circuits. 2. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to generate a multiplicity of parallel execution pipelines to perform motion estimation on the image frame. 3. The apparatus of claim 1, the one or more configurable execution pipelines comprising one or more integer motion estimation (IME) pipelines and one or more check and refinement motion estimation (CRE) pipelines. 4. The apparatus of claim 3, the one or more IME pipeline comprising execution via an integer motion estimation circuit of the modular motion estimation circuitry, and the one or more CRE pipeline comprising execution via one or more of a skip check module, intra frame estimation module, fractional motion estimation circuit, and bidirectional motion estimation circuit. 5. The apparatus of claim 1, the one or more motion estimation circuits to process the image frame by comparing a macroblock within the image frame to a block of a reference frame or reference frames using a block matching algorithm. 6. The apparatus of claim 5, the modular motion estimation circuitry comprising a multiplicity of entry points to receive the macroblock and a multiplicity of exit points to generate motion estimation output for the macroblock. 7. The apparatus of claim 1, the modular motion estimation engine comprising a mode decision engine to receive output from the one or more configurable execution pipelines and to select a mode for encoding the image frame based upon the received output. 8. The apparatus of claim 1, the modular motion estimation circuitry comprising a skip check module for forward transform processing. 9. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform motion estimation using multi-reference search over multiple reference frames. 10. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform accelerated chroma intra frame prediction. 11. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform accelerated chroma inter frame prediction. 12. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to perform a weighted sum-of-absolute-differences (SAD) procedure for true motion estimation. 13. The apparatus of claim 1, the motion estimation kernel for execution on the modular motion estimation circuitry to:
determine a present workload based upon the image frame and one or more additional image frames; and generate one or more tailored execution pipelines that each executes motion estimation over one or more of the motion estimation circuits and is tailored for processing the present workload. 14. At least one computer-readable storage medium comprising instructions that, when executed, cause a system to generate, responsive to receipt of an image frame, generate signals to send the image frame through one or more configurable execution pipelines that each executes motion estimation over one or more hardware circuits. 15. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to generate a multiplicity of parallel execution pipelines to perform motion estimation on the image frame. 16. The at least one computer-readable storage medium of claim 14, the one or more configurable execution pipelines comprising one or more integer motion estimation (IME) pipelines and one or more check and refinement motion estimation (CRE) pipelines, the one or more IME pipeline comprising execution via an integer motion estimation circuit of the modular motion estimation circuitry, and the one or more CRE pipeline comprising execution via one or more of a skip check module, intra frame estimation module, fractional motion estimation circuit, and bidirectional motion estimation circuit. 17. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to process the image frame by comparing a macroblock within the image frame to a block of a reference frame or reference frames using a block matching algorithm. 18. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to:
receive output from the one or more configurable execution pipelines; and
select a mode for encoding the image frame based upon the received output. 19. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to perform motion estimation using multi-reference search over multiple reference frames. 20. The at least one computer-readable storage medium of claim 14 comprising instructions that, when executed, cause a system to perform accelerated chroma intra frame prediction or perform accelerated chroma inter frame prediction. 21. A computer implemented method, comprising:
receiving an image frame; and sending the image frame through one or more configurable execution pipelines that each executes motion estimation over one or more hardware circuits. 22. The computer implemented method of claim 21 comprising generating a multiplicity of parallel execution pipelines pipelines to perform motion estimation on the image frame. 23. The computer implemented method of claim 21, the one or more configurable execution pipelines comprising one or more integer motion estimation (IME) pipelines and one or more check and refinement motion estimation (CRE) pipelines, the one or more IME pipeline comprising execution via an integer motion estimation circuit of the modular motion estimation circuitry, and the one or more CRE pipeline comprising execution via one or more of a skip check module, intra frame estimation module, fractional motion estimation circuit, and bidirectional motion estimation circuit. 24. The computer implemented method of claim 21 comprising:
receiving output from the one or more configurable execution pipelines; and
selecting a mode for encoding the image frame based upon the received output. 25. The computer implemented method of claim 21, comprising:
determining a present workload based upon the received image frame and one or more additional image frames; and generating one or more tailored execution pipelines that each executes motion estimation over one or more of the motion estimation circuits and is tailored for processing the present workload. | 2,400 |
7,681 | 7,681 | 14,691,253 | 2,454 | A communication device sends a Session Initiation Protocol (SIP) INVITE message to establish a call. In response, the call is forked. For example, in parallel forking, the SIP INVITE may be sent to two different communication devices. The forking causes each communication device to send at least one provisional response message. In this case, first and second SIP provisional response messages are received that include Session Description Protocol (SDP) information for a media stream. A first media stream associated with one of the first or second SIP provisional response messages is received and played. A second media stream associated with the other one of the first or second SIP provisional response messages is received within a first time period. In response to receiving the second media stream within the first time period, the first media stream is discarded and the second media stream is played. | 1. A method comprising:
sending a Session Initiation Protocol (SIP) INVITE message to establish a call; in response to sending the SIP INVITE message, receiving first and second SIP provisional response messages; receiving a first media stream associated with one of the first or the second SIP provisional response messages; playing the first media stream; receiving a second media stream associated with the other one of the first or the second SIP provisional response messages, wherein the first and second media streams are received within a first time period; and in response to receiving the second media stream, discarding the first media stream in favor of playing the second media stream. 2. The method of claim 1, further comprising:
in response to receiving the first and second SIP provisional response messages, determining if either of the first or second media streams have been received within a second time period, wherein the second time period is shorter than the first time period; and in response to determining that neither of the first or second media streams have been received within the second time period, playing a local progress tone. 3. The method of claim 1, further comprising
receiving a SIP 180 RINGING message; determining that the first time period has expired before receiving the SIP 180 RINGING message; and in response to determining that the first time period has expired before receiving the SIP 180 RINGING message, discarding the second media stream and begin playing a local ring back signal. 4. The method of claim 1, wherein the second SIP provisional response message is a SIP 181 call is being forwarded message and further comprising: deleting any information associated with the first SIP provisional response message in response to receiving the SIP 181 call being forwarded message. 5. The method of claim 1, further comprising:
detecting that the second media stream has ended; in response to detecting that the second media stream has ended, determining if the first media stream is still active; in response to determining that the first media stream is still active, playing the first media stream; and in response to determining that the first media stream is not active, playing a local progress tone. 6. The method of claim 5, wherein detecting that the second media stream has ended is based on receiving a SIP UPDATE message that indicates the second media stream is inactive or identifies a 0 port number. 7. The method of claim 1, further comprising:
receiving a SIP 200 OK message in response to the SIP INVITE; in response to receiving the SIP 200 OK message, determining if the SIP 200 OK message includes Session Description Protocol (SDP) information; and if the SIP 200 OK message includes the SDP information:
determining if the SDP information is associated with the first media stream; and
in response to determining that the SDP information is associated with the first media stream, playing the first media stream. 8. The method of claim 1, wherein the first and second media streams use Real-Time Protocol. 9. The method of claim 1, wherein the first and second SIP provisional response messages comprise at least one of the following: a SIP 180 RINGING message, a SIP 181 Call is Being Forwarded message, a SIP 182 Queued message, and a SIP 183 Session in Progress message. 10. The method of claim 1, further comprising:
time stamping receipt of the first and second SIP provisional response messages; time stamping receipt of the first and second media streams; and tracking SIP Synchronization Source Identifiers for the first and second media streams. 11. A communication device comprising:
a call processing module configured to send a Session Initiation Protocol (SIP) INVITE message to establish a call and receive first and second SIP provisional response messages in response to sending the SIP INVITE message; a media module configured to receive a first media stream associated with one of the first or the second SIP provisional response messages, play the first media stream, receive a second media stream associated with the other one of the first or the second SIP provisional response messages, discard the first media stream and play the second media stream in response to receiving the second media stream; and a timer module configured to determine the first and second media streams are received within a first time period. 12. The communication device of claim 11, wherein:
the timer module is further configured to determine if either of the first or second media streams have been received within a second time period, which is shorter than the first time period, in response to receiving the first and second SIP provisional response messages; and the media module is further configured to playing a local progress tone in response to determining that neither of the first or second media streams have been received within the second time period. 13. The communication device of claim 11, wherein:
the call processing module is further configured to receive a SIP 180 RINGING message; the timer module is further configured to determine that the first time period has expired before receiving the SIP 180 RINGING message; and the media module is further configured to discard the second media stream and begin playing a local ring back signal in response to determining that the first time period has expired before receiving the SIP 180 RINGING message. 14. The communication device of claim 11, wherein the second SIP provisional response message is a SIP 181 call is being forwarded message and wherein the call processing module deletes any information associated with the first SIP provisional response message in response to receiving the SIP 181 call being forwarded message. 15. The communication device of claim 11, wherein:
the media module is further configured to detect that the second media stream has ended, determine if the first media stream is still active in response to detecting that the second media stream has ended, play the first media stream in response to determining that the first media stream is still active, and play a local progress tone in response to determining that the first media stream is not active. 16. The communication device of claim 15, wherein detecting that the second media stream has ended is based on receiving a SIP UPDATE message that indicates the second media stream is inactive or identifies a 0 port number. 17. The communication device of claim 11, wherein:
the call processing module is further configured to receive a SIP 200 OK message in response to the SIP INVITE, determine if the SIP 200 OK message includes Session Description Protocol (SDP) information in response to receiving the SIP 200 OK message, and if the SIP 200 OK message includes the SDP information: determine if the SDP information is associated with the first media stream and play the first media stream in response to determining that the SDP information is associated with the first media stream. 18. The communication device of claim 11, wherein:
the call processing module is further configured to receive a SIP 200 OK message in response to the SIP INVITE, determine if the SIP 200 OK message includes Session Description Protocol (SDP) information in response to receiving the SIP 200 OK message, and use an identifier in one of the first or second SIP provisional response message to identify which of the first or second media streams needs to be played if the SIP 200 OK message does not include the SDP information. 19. The communication device of claim 11, wherein:
the call processing module is further configured to time stamp receipt of the first and second SIP provisional response messages; and the media module is further configured to time stamp receipt of the first and second media streams, and track SIP Synchronization Source Identifiers for the first and second media streams. 20. A method comprising:
sending a Session Initiation Protocol (SIP) INVITE message to establish a call; starting a timer to detect sequential forking; in response to sending the SIP INVITE message, receiving a first provisional response message; receiving a first media stream associated with the first provisional response message; playing the first media stream; receiving a second provisional response message after the timer to detect sequential forking has expired; and in response to receiving the second provisional response message after the timer to detect sequential forking has expired, doing at least one of:
playing a local progress tone; and
playing an early media stream associated with the second provisional response message. | A communication device sends a Session Initiation Protocol (SIP) INVITE message to establish a call. In response, the call is forked. For example, in parallel forking, the SIP INVITE may be sent to two different communication devices. The forking causes each communication device to send at least one provisional response message. In this case, first and second SIP provisional response messages are received that include Session Description Protocol (SDP) information for a media stream. A first media stream associated with one of the first or second SIP provisional response messages is received and played. A second media stream associated with the other one of the first or second SIP provisional response messages is received within a first time period. In response to receiving the second media stream within the first time period, the first media stream is discarded and the second media stream is played.1. A method comprising:
sending a Session Initiation Protocol (SIP) INVITE message to establish a call; in response to sending the SIP INVITE message, receiving first and second SIP provisional response messages; receiving a first media stream associated with one of the first or the second SIP provisional response messages; playing the first media stream; receiving a second media stream associated with the other one of the first or the second SIP provisional response messages, wherein the first and second media streams are received within a first time period; and in response to receiving the second media stream, discarding the first media stream in favor of playing the second media stream. 2. The method of claim 1, further comprising:
in response to receiving the first and second SIP provisional response messages, determining if either of the first or second media streams have been received within a second time period, wherein the second time period is shorter than the first time period; and in response to determining that neither of the first or second media streams have been received within the second time period, playing a local progress tone. 3. The method of claim 1, further comprising
receiving a SIP 180 RINGING message; determining that the first time period has expired before receiving the SIP 180 RINGING message; and in response to determining that the first time period has expired before receiving the SIP 180 RINGING message, discarding the second media stream and begin playing a local ring back signal. 4. The method of claim 1, wherein the second SIP provisional response message is a SIP 181 call is being forwarded message and further comprising: deleting any information associated with the first SIP provisional response message in response to receiving the SIP 181 call being forwarded message. 5. The method of claim 1, further comprising:
detecting that the second media stream has ended; in response to detecting that the second media stream has ended, determining if the first media stream is still active; in response to determining that the first media stream is still active, playing the first media stream; and in response to determining that the first media stream is not active, playing a local progress tone. 6. The method of claim 5, wherein detecting that the second media stream has ended is based on receiving a SIP UPDATE message that indicates the second media stream is inactive or identifies a 0 port number. 7. The method of claim 1, further comprising:
receiving a SIP 200 OK message in response to the SIP INVITE; in response to receiving the SIP 200 OK message, determining if the SIP 200 OK message includes Session Description Protocol (SDP) information; and if the SIP 200 OK message includes the SDP information:
determining if the SDP information is associated with the first media stream; and
in response to determining that the SDP information is associated with the first media stream, playing the first media stream. 8. The method of claim 1, wherein the first and second media streams use Real-Time Protocol. 9. The method of claim 1, wherein the first and second SIP provisional response messages comprise at least one of the following: a SIP 180 RINGING message, a SIP 181 Call is Being Forwarded message, a SIP 182 Queued message, and a SIP 183 Session in Progress message. 10. The method of claim 1, further comprising:
time stamping receipt of the first and second SIP provisional response messages; time stamping receipt of the first and second media streams; and tracking SIP Synchronization Source Identifiers for the first and second media streams. 11. A communication device comprising:
a call processing module configured to send a Session Initiation Protocol (SIP) INVITE message to establish a call and receive first and second SIP provisional response messages in response to sending the SIP INVITE message; a media module configured to receive a first media stream associated with one of the first or the second SIP provisional response messages, play the first media stream, receive a second media stream associated with the other one of the first or the second SIP provisional response messages, discard the first media stream and play the second media stream in response to receiving the second media stream; and a timer module configured to determine the first and second media streams are received within a first time period. 12. The communication device of claim 11, wherein:
the timer module is further configured to determine if either of the first or second media streams have been received within a second time period, which is shorter than the first time period, in response to receiving the first and second SIP provisional response messages; and the media module is further configured to playing a local progress tone in response to determining that neither of the first or second media streams have been received within the second time period. 13. The communication device of claim 11, wherein:
the call processing module is further configured to receive a SIP 180 RINGING message; the timer module is further configured to determine that the first time period has expired before receiving the SIP 180 RINGING message; and the media module is further configured to discard the second media stream and begin playing a local ring back signal in response to determining that the first time period has expired before receiving the SIP 180 RINGING message. 14. The communication device of claim 11, wherein the second SIP provisional response message is a SIP 181 call is being forwarded message and wherein the call processing module deletes any information associated with the first SIP provisional response message in response to receiving the SIP 181 call being forwarded message. 15. The communication device of claim 11, wherein:
the media module is further configured to detect that the second media stream has ended, determine if the first media stream is still active in response to detecting that the second media stream has ended, play the first media stream in response to determining that the first media stream is still active, and play a local progress tone in response to determining that the first media stream is not active. 16. The communication device of claim 15, wherein detecting that the second media stream has ended is based on receiving a SIP UPDATE message that indicates the second media stream is inactive or identifies a 0 port number. 17. The communication device of claim 11, wherein:
the call processing module is further configured to receive a SIP 200 OK message in response to the SIP INVITE, determine if the SIP 200 OK message includes Session Description Protocol (SDP) information in response to receiving the SIP 200 OK message, and if the SIP 200 OK message includes the SDP information: determine if the SDP information is associated with the first media stream and play the first media stream in response to determining that the SDP information is associated with the first media stream. 18. The communication device of claim 11, wherein:
the call processing module is further configured to receive a SIP 200 OK message in response to the SIP INVITE, determine if the SIP 200 OK message includes Session Description Protocol (SDP) information in response to receiving the SIP 200 OK message, and use an identifier in one of the first or second SIP provisional response message to identify which of the first or second media streams needs to be played if the SIP 200 OK message does not include the SDP information. 19. The communication device of claim 11, wherein:
the call processing module is further configured to time stamp receipt of the first and second SIP provisional response messages; and the media module is further configured to time stamp receipt of the first and second media streams, and track SIP Synchronization Source Identifiers for the first and second media streams. 20. A method comprising:
sending a Session Initiation Protocol (SIP) INVITE message to establish a call; starting a timer to detect sequential forking; in response to sending the SIP INVITE message, receiving a first provisional response message; receiving a first media stream associated with the first provisional response message; playing the first media stream; receiving a second provisional response message after the timer to detect sequential forking has expired; and in response to receiving the second provisional response message after the timer to detect sequential forking has expired, doing at least one of:
playing a local progress tone; and
playing an early media stream associated with the second provisional response message. | 2,400 |
7,682 | 7,682 | 14,644,069 | 2,457 | A system provides secure messaging of healthcare data and prompts message responses using prioritized hierarchical reminders. Messages can be sent and received through an application executing on a mobile device or on a web browser or application executing on any computer. The system can provide message notifications and multiple reminders to ensure that a user is reliably receiving and also reading messages. If an in-application message is not read within a time period, the message can followed by a reminder message informing the recipient that there is a secure message waiting. The reminder message can be sent using an application notification or through other channels, such as by SMS text message, automated voice telephone call, or e-mail, without including sensitive patient healthcare information. | 1. A computer system for secure healthcare messaging and reminder management, the computer system comprising:
a communication device for receiving and sending messages; a coding unit configured to encode messages for secure transmission through the communication device; and a message processor configured to:
receive a first message securely transmitted from a sending user device by a sending user,
identify a recipient user device of a recipient user based on the received first message,
use the coding unit to securely transmit the first message to the recipient user device,
transmit a first notification to the recipient user indicating that there is a secure message for the recipient user,
monitor for a communication from the recipient user device indicating that the first message has been read,
after expiration of a first timer without having received a communication that the first message has been read, send a first reminder to the recipient user indicating that there is a secure message for the recipient user, and
after expiration of a second timer without having received a communication that the first message has been read, send a second reminder to the recipient user indicating that there is a secure message for the recipient user, wherein the second reminder is of a different type than the first reminder. 2. The computer system of claim 1, wherein one of the first notification, the first reminder and the second reminder causes the recipient device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue caused by another of the first notification, the first reminder and the second reminder. 3. The computer system of claim 1, wherein the first notification, the first reminder and the second reminder are each of a type selected from the group consisting of app notification, automated phone call, text message, and e-mail. 4. The computer system of claim 3, wherein at least two of the first notification, the first reminder and the second reminder are each of a different type. 5. The computer system of claim 1, wherein the first notification, the first reminder and the second reminder are each transmitted using a non-secure communication. 6. The computer system of claim 1, wherein the message processor is further configured to:
after expiration of a third timer without having received a communication that the first message has been read, send a notification to the sending user indicating that the first message has not been read. 7. The computer system of claim 1, wherein the message processor is further configured to:
receive a second message transmitted from the sending user device by the sending user, wherein the second message is of a different format than the first message, and in response to receiving the second message, transmit a second notification to the recipient user device that causes the recipient user device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue provided in association with the first notification. 8. The computer system of claim 7, wherein the format of the second message incorporates a request that the recipient user call a phone number of the sending user or a request that the recipient user contact the sending user. 9. The computer system of claim 1, wherein the message processor is further configured to build a contacts list for the sending user by at least:
checking for users with which the sending user has had active conversations; checking for users in a group associated with the sending user; checking for users in a global contacts list associated with the group; checking for users outside of the group that have referred patients to the sending user or checking for users outside of the group that have referred patients to the group; checking for users outside of the group that have access to the group; and checking for users outside of the group that have a common patient in association with the sending user. 10. The computer system of claim 9, wherein the message processor is configured to build the contacts list for the sending user by further:
checking for users within communities of users to which the sending user belongs. 11. A method for secure healthcare messaging and reminder management, the method comprising, on a computer system:
receiving a first message securely transmitted from a sending user device by a sending user; identifying a recipient user device of a recipient user based on the received first message; securely transmitting the first message to the recipient user device; transmitting a first notification to the recipient user indicating that there is a secure message for the recipient user; monitoring for a communication from the recipient user device indicating that the first message has been read; after expiration of a first timer without having received a communication that the first message has been read, sending a first reminder to the recipient user indicating that there is a secure message for the recipient user; and after expiration of a second timer without having received a communication that the first message has been read, sending a second reminder to the recipient user indicating that there is a secure message for the recipient user, wherein the second reminder is of a different type than the first reminder. 12. The method of claim 11, wherein one of the first notification, the first reminder and the second reminder causes the recipient device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue caused by another of the first notification, the first reminder and the second reminder. 13. The method of claim 11, wherein the first notification, the first reminder and the second reminder are each of a type selected from the group consisting of app notification, automated phone call, text message, and e-mail. 14. The method of claim 13, wherein at least two of the first notification, the first reminder and the second reminder are each of a different type. 15. The method of claim 11, wherein the first notification, the first reminder and the second reminder are each transmitted using a non-secure communication. 16. The method of claim 11, further comprising, on the computer system:
after expiration of a third timer without having received a communication that the first message has been read, sending a notification to the sending user indicating that the first message has not been read. 17. The method of claim 11, further comprising, on the computer system:
receiving a second message transmitted from the sending user device by the sending user, wherein the second message is of a different format than the first message, and in response to receiving the second message, transmitting a second notification to the recipient user device that causes the recipient user device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue provided in association with the first notification. 18. The method of claim 17, wherein the format of the second message incorporates a request that the recipient user call a phone number of the sending user or a request that the recipient user contact the sending user. 19. The method of claim 11, further comprising, on the computer system, building a contacts list for the sending user by at least:
checking for users with which the sending user has had active conversations; checking for users in a group associated with the sending user; checking for users in a global contacts list associated with the group; checking for users outside of the group that have referred patients to the sending user or checking for users outside of the group that have referred patients to the group; checking for users outside of the group that have access to the group; and checking for users outside of the group that have a common patient in association with the sending user. 20. The method of claim 19, wherein the building of the contacts list for the sending user is performed by further:
checking for users within communities of users to which the sending user belongs. | A system provides secure messaging of healthcare data and prompts message responses using prioritized hierarchical reminders. Messages can be sent and received through an application executing on a mobile device or on a web browser or application executing on any computer. The system can provide message notifications and multiple reminders to ensure that a user is reliably receiving and also reading messages. If an in-application message is not read within a time period, the message can followed by a reminder message informing the recipient that there is a secure message waiting. The reminder message can be sent using an application notification or through other channels, such as by SMS text message, automated voice telephone call, or e-mail, without including sensitive patient healthcare information.1. A computer system for secure healthcare messaging and reminder management, the computer system comprising:
a communication device for receiving and sending messages; a coding unit configured to encode messages for secure transmission through the communication device; and a message processor configured to:
receive a first message securely transmitted from a sending user device by a sending user,
identify a recipient user device of a recipient user based on the received first message,
use the coding unit to securely transmit the first message to the recipient user device,
transmit a first notification to the recipient user indicating that there is a secure message for the recipient user,
monitor for a communication from the recipient user device indicating that the first message has been read,
after expiration of a first timer without having received a communication that the first message has been read, send a first reminder to the recipient user indicating that there is a secure message for the recipient user, and
after expiration of a second timer without having received a communication that the first message has been read, send a second reminder to the recipient user indicating that there is a secure message for the recipient user, wherein the second reminder is of a different type than the first reminder. 2. The computer system of claim 1, wherein one of the first notification, the first reminder and the second reminder causes the recipient device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue caused by another of the first notification, the first reminder and the second reminder. 3. The computer system of claim 1, wherein the first notification, the first reminder and the second reminder are each of a type selected from the group consisting of app notification, automated phone call, text message, and e-mail. 4. The computer system of claim 3, wherein at least two of the first notification, the first reminder and the second reminder are each of a different type. 5. The computer system of claim 1, wherein the first notification, the first reminder and the second reminder are each transmitted using a non-secure communication. 6. The computer system of claim 1, wherein the message processor is further configured to:
after expiration of a third timer without having received a communication that the first message has been read, send a notification to the sending user indicating that the first message has not been read. 7. The computer system of claim 1, wherein the message processor is further configured to:
receive a second message transmitted from the sending user device by the sending user, wherein the second message is of a different format than the first message, and in response to receiving the second message, transmit a second notification to the recipient user device that causes the recipient user device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue provided in association with the first notification. 8. The computer system of claim 7, wherein the format of the second message incorporates a request that the recipient user call a phone number of the sending user or a request that the recipient user contact the sending user. 9. The computer system of claim 1, wherein the message processor is further configured to build a contacts list for the sending user by at least:
checking for users with which the sending user has had active conversations; checking for users in a group associated with the sending user; checking for users in a global contacts list associated with the group; checking for users outside of the group that have referred patients to the sending user or checking for users outside of the group that have referred patients to the group; checking for users outside of the group that have access to the group; and checking for users outside of the group that have a common patient in association with the sending user. 10. The computer system of claim 9, wherein the message processor is configured to build the contacts list for the sending user by further:
checking for users within communities of users to which the sending user belongs. 11. A method for secure healthcare messaging and reminder management, the method comprising, on a computer system:
receiving a first message securely transmitted from a sending user device by a sending user; identifying a recipient user device of a recipient user based on the received first message; securely transmitting the first message to the recipient user device; transmitting a first notification to the recipient user indicating that there is a secure message for the recipient user; monitoring for a communication from the recipient user device indicating that the first message has been read; after expiration of a first timer without having received a communication that the first message has been read, sending a first reminder to the recipient user indicating that there is a secure message for the recipient user; and after expiration of a second timer without having received a communication that the first message has been read, sending a second reminder to the recipient user indicating that there is a secure message for the recipient user, wherein the second reminder is of a different type than the first reminder. 12. The method of claim 11, wherein one of the first notification, the first reminder and the second reminder causes the recipient device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue caused by another of the first notification, the first reminder and the second reminder. 13. The method of claim 11, wherein the first notification, the first reminder and the second reminder are each of a type selected from the group consisting of app notification, automated phone call, text message, and e-mail. 14. The method of claim 13, wherein at least two of the first notification, the first reminder and the second reminder are each of a different type. 15. The method of claim 11, wherein the first notification, the first reminder and the second reminder are each transmitted using a non-secure communication. 16. The method of claim 11, further comprising, on the computer system:
after expiration of a third timer without having received a communication that the first message has been read, sending a notification to the sending user indicating that the first message has not been read. 17. The method of claim 11, further comprising, on the computer system:
receiving a second message transmitted from the sending user device by the sending user, wherein the second message is of a different format than the first message, and in response to receiving the second message, transmitting a second notification to the recipient user device that causes the recipient user device to produce an audible, visual or vibration cue that is different than an audible, visual or vibration cue provided in association with the first notification. 18. The method of claim 17, wherein the format of the second message incorporates a request that the recipient user call a phone number of the sending user or a request that the recipient user contact the sending user. 19. The method of claim 11, further comprising, on the computer system, building a contacts list for the sending user by at least:
checking for users with which the sending user has had active conversations; checking for users in a group associated with the sending user; checking for users in a global contacts list associated with the group; checking for users outside of the group that have referred patients to the sending user or checking for users outside of the group that have referred patients to the group; checking for users outside of the group that have access to the group; and checking for users outside of the group that have a common patient in association with the sending user. 20. The method of claim 19, wherein the building of the contacts list for the sending user is performed by further:
checking for users within communities of users to which the sending user belongs. | 2,400 |
7,683 | 7,683 | 14,846,598 | 2,463 | Methods and apparatuses for cell detection, synchronization and measurement on unlicensed spectrum. A method for receiving a discovery reference signal (DRS) includes identifying, based on a DRS measurement timing configuration (DMTC), a DRS detection/measurement gap duration and a periodicity; and listening for the DRS on a carrier in an unlicensed spectrum during the identified gap duration at the identified periodicity. An apparatus for an eNodeB associated with a cell includes a controller and a transceiver. The controller is configured to configure a DMTC including a DRS detection/measurement gap duration and periodicity. The transceiver is configured to transmit the DRS on a carrier in an unlicensed spectrum during the gap duration at the periodicity. | 1. A method for receiving a discovery reference signal (DRS), the method comprising:
identifying, based on a DRS measurement timing configuration (DMTC), a DRS detection/measurement gap duration and a periodicity; and listening for the DRS on a carrier in an unlicensed spectrum during the identified gap duration at the identified periodicity. 2. The method of claim 1, wherein the DRS is transmitted in at least one of a number of time positions within the identified gap duration subject to application of a listen-before-talk (LBT) protocol. 3. The method of claim 1, further comprising
identifying a subframe range in which a secondary synchronization signal (SSS) included in the DRS is transmitted; identifying a sequence for the SSS based on the identified subframe range in which the SSS is transmitted. 4. The method of claim 3, further comprising:
generating common reference signal (CRS) sequences for CRS detection based on slot number values corresponding to the identified subframe range in which the SSS is transmitted; and determining a slot number for a CRS included in the DRS based on the CRS detection. 5. The method of claim 4, further comprising generating a channel state information reference signal (CSI-RS) sequences for CSI-RS detection based on the determined slot number for the CRS. 6. The method of claim 1, further comprising:
detecting a common reference signal (CRS) associated with a cell in the DRS; and detecting a downlink transmission in the unlicensed spectrum from the cell based on the detected CRS. 7. The method of claim 6, further comprising receiving the downlink transmission in a first subframe where the CRS is detected. 8. The method of claim 6, wherein when the DRS detection/measurement gap duration and the downlink transmission overlap, the DRS is transmitted in a first subframe of the DRS detection/measurement gap duration. 9. A user equipment (UE) for receiving a discovery reference signal (DRS), the apparatus comprising:
a controller configured to identify, based on a DRS measurement timing configuration (DMTC), a DRS detection/measurement gap duration and a periodicity; and a transceiver configured to listen for the DRS on a carrier in an unlicensed spectrum during the identified gap duration at the identified periodicity. 10. The UE of claim 9, wherein the DRS is transmitted in at least one of a number of time positions within the identified gap duration subject to application of a listen-before-talk (LBT) protocol. 11. The UE of claim 9, wherein the controller is configured to:
identify a subframe range in which a secondary synchronization signal (SSS) included in the DRS is transmitted; and identify a sequence for the SSS based on the identified subframe range in which the SSS is transmitted. 12. The UE of claim 11, wherein the controller is configured to:
generate common reference signal (CRS) sequences for CRS detection based on slot number values corresponding to the identified subframe range in which the SSS is transmitted; and determine a slot number for a CRS included in the DRS based on the CRS detection. 13. The UE of claim 12, wherein the controller is configured to generate a channel state information reference signal (CSI-RS) sequences for CSI-RS detection based on the determined slot number for the CRS. 14. The UE of claim 9, wherein the controller is configured to:
detect, via the transceiver, a common reference signal (CRS) associated with a cell in the DRS; and detect, via the transceiver, a downlink transmission in the unlicensed spectrum from the cell based on the detected CRS. 15. The UE of claim 14, wherein the transceiver is configured to receive the downlink transmission in a first subframe where the CRS is detected. 16. The UE of claim 14, wherein when the DRS detection/measurement gap duration and the downlink transmission overlap, the DRS is transmitted in a first subframe of the DRS detection/measurement gap duration. 17. An apparatus for a eNodeB (eNB) associated with a cell, the apparatus comprising:
a controller configured to configure a discovery reference signal (DRS) measurement timing configuration (DMTC) including a DRS detection/measurement gap duration and a periodicity; and a transceiver configured to transmit the DRS on a carrier in an unlicensed spectrum during the gap duration at the periodicity. 18. The apparatus of claim 17, wherein the DRS is transmitted in at least one of a number of time positions within the identified gap duration subject to application of a listen-before-talk (LBT) protocol. 19. The apparatus of claim 17, wherein the transceiver is configured to:
transmit a common reference signal (CRS) associated with the cell in the DRS; and transmit a downlink transmission in the unlicensed spectrum based on the transmitted CRS. 20. The apparatus of claim 19, wherein the transmitter is configured to transmit the downlink transmission in a first subframe where the CRS is transmitted. | Methods and apparatuses for cell detection, synchronization and measurement on unlicensed spectrum. A method for receiving a discovery reference signal (DRS) includes identifying, based on a DRS measurement timing configuration (DMTC), a DRS detection/measurement gap duration and a periodicity; and listening for the DRS on a carrier in an unlicensed spectrum during the identified gap duration at the identified periodicity. An apparatus for an eNodeB associated with a cell includes a controller and a transceiver. The controller is configured to configure a DMTC including a DRS detection/measurement gap duration and periodicity. The transceiver is configured to transmit the DRS on a carrier in an unlicensed spectrum during the gap duration at the periodicity.1. A method for receiving a discovery reference signal (DRS), the method comprising:
identifying, based on a DRS measurement timing configuration (DMTC), a DRS detection/measurement gap duration and a periodicity; and listening for the DRS on a carrier in an unlicensed spectrum during the identified gap duration at the identified periodicity. 2. The method of claim 1, wherein the DRS is transmitted in at least one of a number of time positions within the identified gap duration subject to application of a listen-before-talk (LBT) protocol. 3. The method of claim 1, further comprising
identifying a subframe range in which a secondary synchronization signal (SSS) included in the DRS is transmitted; identifying a sequence for the SSS based on the identified subframe range in which the SSS is transmitted. 4. The method of claim 3, further comprising:
generating common reference signal (CRS) sequences for CRS detection based on slot number values corresponding to the identified subframe range in which the SSS is transmitted; and determining a slot number for a CRS included in the DRS based on the CRS detection. 5. The method of claim 4, further comprising generating a channel state information reference signal (CSI-RS) sequences for CSI-RS detection based on the determined slot number for the CRS. 6. The method of claim 1, further comprising:
detecting a common reference signal (CRS) associated with a cell in the DRS; and detecting a downlink transmission in the unlicensed spectrum from the cell based on the detected CRS. 7. The method of claim 6, further comprising receiving the downlink transmission in a first subframe where the CRS is detected. 8. The method of claim 6, wherein when the DRS detection/measurement gap duration and the downlink transmission overlap, the DRS is transmitted in a first subframe of the DRS detection/measurement gap duration. 9. A user equipment (UE) for receiving a discovery reference signal (DRS), the apparatus comprising:
a controller configured to identify, based on a DRS measurement timing configuration (DMTC), a DRS detection/measurement gap duration and a periodicity; and a transceiver configured to listen for the DRS on a carrier in an unlicensed spectrum during the identified gap duration at the identified periodicity. 10. The UE of claim 9, wherein the DRS is transmitted in at least one of a number of time positions within the identified gap duration subject to application of a listen-before-talk (LBT) protocol. 11. The UE of claim 9, wherein the controller is configured to:
identify a subframe range in which a secondary synchronization signal (SSS) included in the DRS is transmitted; and identify a sequence for the SSS based on the identified subframe range in which the SSS is transmitted. 12. The UE of claim 11, wherein the controller is configured to:
generate common reference signal (CRS) sequences for CRS detection based on slot number values corresponding to the identified subframe range in which the SSS is transmitted; and determine a slot number for a CRS included in the DRS based on the CRS detection. 13. The UE of claim 12, wherein the controller is configured to generate a channel state information reference signal (CSI-RS) sequences for CSI-RS detection based on the determined slot number for the CRS. 14. The UE of claim 9, wherein the controller is configured to:
detect, via the transceiver, a common reference signal (CRS) associated with a cell in the DRS; and detect, via the transceiver, a downlink transmission in the unlicensed spectrum from the cell based on the detected CRS. 15. The UE of claim 14, wherein the transceiver is configured to receive the downlink transmission in a first subframe where the CRS is detected. 16. The UE of claim 14, wherein when the DRS detection/measurement gap duration and the downlink transmission overlap, the DRS is transmitted in a first subframe of the DRS detection/measurement gap duration. 17. An apparatus for a eNodeB (eNB) associated with a cell, the apparatus comprising:
a controller configured to configure a discovery reference signal (DRS) measurement timing configuration (DMTC) including a DRS detection/measurement gap duration and a periodicity; and a transceiver configured to transmit the DRS on a carrier in an unlicensed spectrum during the gap duration at the periodicity. 18. The apparatus of claim 17, wherein the DRS is transmitted in at least one of a number of time positions within the identified gap duration subject to application of a listen-before-talk (LBT) protocol. 19. The apparatus of claim 17, wherein the transceiver is configured to:
transmit a common reference signal (CRS) associated with the cell in the DRS; and transmit a downlink transmission in the unlicensed spectrum based on the transmitted CRS. 20. The apparatus of claim 19, wherein the transmitter is configured to transmit the downlink transmission in a first subframe where the CRS is transmitted. | 2,400 |
7,684 | 7,684 | 13,369,739 | 2,432 | A system and method for managing access policies where the result of an intersection performed on policy sets associated with each of two nodes based on the nodes' attributes determines whether the two nodes may interact. | 1. A method for managing an action from one node to another node on a computer network, the method comprising the steps of:
defining a rule for the action based on at least one value derived from one or more attributes of the nodes; defining at least one policy based on the rule to facilitate implementation of the rule; associating the one node with a first policy set wherein the first policy set is configured to include policies; associating the another node with a second policy set wherein the second policy is configured to include policies; assigning the at least one policy to the first policy set based on the at least one derived value of the one or more attributes of the one node; assigning the at least one policy to the second policy set based on the at least one derived value of the one or more attributes of the another node; comparing the first policy set with the second policy set to find an intersection between the first and second policy sets; and managing the action based on the intersection. 2. The method of claim 1 wherein the step of managing the action based on the intersection comprises denying the action. 3. The method of claim 1 wherein the step of managing the action based on the intersection comprising allowing the action. 4. The method of claim 1 further comprising managing the action based on a rule associated with the action. 5. The method of claim 1 further comprising defining a plurality of policies based on the rule to facilitate implementation of the rule. 6. The method of claim 5 further comprising organizing the plurality of policies into a multi-level hierarchy. 7. The method of claim 6 further comprising assigning a priority to each level of the multi-level hierarchy and managing the action based on the priority of each level. 8. The method of claim 5 further comprising managing the action based on a priority associated with the intersection. 9. The method of claim 1 wherein the action is selected from the group comprising communicating, accessing a resource, executing a program, reading a file. 10. The method of claim 1 further comprising managing a second action from the one node to the another node based on the intersection. 11. A method for managing an action between a first node and a second node on a computer network, wherein a rule for the action is based on a first derived value from a first attribute of the nodes, a first policy is based on the rule to facilitate implementation of the rule, the first node is associated with a first policy set, the second node is associated with a second policy set, the first policy is assigned to the first policy set based on the first derived value of the first attribute of the node, and the first policy is assigned to the second policy set based on the first derived value of the first attribute of the another node, the method comprising the steps of:
receiving a request for the action from one of the nodes; and managing the action based on whether there is an intersection between the first and second policy sets. 12. The method of claim 11 further comprising allowing the action if the intersection exists. 13. The method of claim 11 further comprising denying the action if the intersection exits. 14. The method of claim 11 further comprising managing the action based on a priority associated with the first policy. 15. The method of claim 11 wherein the action is a transmission of an electronic message. 16. The method of claim 11 wherein the action is a posting on a web log. 17. A system for managing an action between nodes on a computer network comprising:
a processing device; and memory operatively connected to the processing device, wherein the memory comprises instructions that, when executed by the processing device, cause the processing device to: identify a first node and a second node from the action; retrieve a first set associated with the first node, wherein the first set represents policy groups to which the one node is associated, wherein the policy groups are defined based on a rule for the action, wherein the rule is based on derived values of attributes associated with the nodes; retrieve a second set associated with the second node, wherein the second set represents policy groups to which the another node is associated; and manage the action based on whether there is an intersection between the first and second sets. 18. The system of claim 17 wherein each policy group is expressed as a numeric value. | A system and method for managing access policies where the result of an intersection performed on policy sets associated with each of two nodes based on the nodes' attributes determines whether the two nodes may interact.1. A method for managing an action from one node to another node on a computer network, the method comprising the steps of:
defining a rule for the action based on at least one value derived from one or more attributes of the nodes; defining at least one policy based on the rule to facilitate implementation of the rule; associating the one node with a first policy set wherein the first policy set is configured to include policies; associating the another node with a second policy set wherein the second policy is configured to include policies; assigning the at least one policy to the first policy set based on the at least one derived value of the one or more attributes of the one node; assigning the at least one policy to the second policy set based on the at least one derived value of the one or more attributes of the another node; comparing the first policy set with the second policy set to find an intersection between the first and second policy sets; and managing the action based on the intersection. 2. The method of claim 1 wherein the step of managing the action based on the intersection comprises denying the action. 3. The method of claim 1 wherein the step of managing the action based on the intersection comprising allowing the action. 4. The method of claim 1 further comprising managing the action based on a rule associated with the action. 5. The method of claim 1 further comprising defining a plurality of policies based on the rule to facilitate implementation of the rule. 6. The method of claim 5 further comprising organizing the plurality of policies into a multi-level hierarchy. 7. The method of claim 6 further comprising assigning a priority to each level of the multi-level hierarchy and managing the action based on the priority of each level. 8. The method of claim 5 further comprising managing the action based on a priority associated with the intersection. 9. The method of claim 1 wherein the action is selected from the group comprising communicating, accessing a resource, executing a program, reading a file. 10. The method of claim 1 further comprising managing a second action from the one node to the another node based on the intersection. 11. A method for managing an action between a first node and a second node on a computer network, wherein a rule for the action is based on a first derived value from a first attribute of the nodes, a first policy is based on the rule to facilitate implementation of the rule, the first node is associated with a first policy set, the second node is associated with a second policy set, the first policy is assigned to the first policy set based on the first derived value of the first attribute of the node, and the first policy is assigned to the second policy set based on the first derived value of the first attribute of the another node, the method comprising the steps of:
receiving a request for the action from one of the nodes; and managing the action based on whether there is an intersection between the first and second policy sets. 12. The method of claim 11 further comprising allowing the action if the intersection exists. 13. The method of claim 11 further comprising denying the action if the intersection exits. 14. The method of claim 11 further comprising managing the action based on a priority associated with the first policy. 15. The method of claim 11 wherein the action is a transmission of an electronic message. 16. The method of claim 11 wherein the action is a posting on a web log. 17. A system for managing an action between nodes on a computer network comprising:
a processing device; and memory operatively connected to the processing device, wherein the memory comprises instructions that, when executed by the processing device, cause the processing device to: identify a first node and a second node from the action; retrieve a first set associated with the first node, wherein the first set represents policy groups to which the one node is associated, wherein the policy groups are defined based on a rule for the action, wherein the rule is based on derived values of attributes associated with the nodes; retrieve a second set associated with the second node, wherein the second set represents policy groups to which the another node is associated; and manage the action based on whether there is an intersection between the first and second sets. 18. The system of claim 17 wherein each policy group is expressed as a numeric value. | 2,400 |
7,685 | 7,685 | 15,441,205 | 2,461 | In general, the present invention relates to a virtual platform in which one or more distributed virtual switches can be created for use in virtual networking. According to some aspects, the distributed virtual switch according to the invention provides the ability for virtual and physical machines to more readily, securely, and efficiently communicate with each other even if they are not located on the same physical host and/or in the same subnet or VLAN. According other aspects, the distributed virtual switches of the invention can support integration with traditional IP networks and support sophisticated IP technologies including NAT functionality, stateful firewalling, and notifying the IP network of workload migration. According to further aspects, the virtual platform of the invention creates one or more distributed virtual switches which may be allocated to a tenant, application, or other entity requiring isolation and/or independent configuration state. According to still further aspects, the virtual platform of the invention manages and/or uses VLAN or tunnels (e.g., GRE) to create a distributed virtual switch for a network while working with existing switches and routers in the network. The present invention finds utility in both enterprise networks, datacenters and other facilities. | 1-26. (canceled) 27. For a network controller of a system that comprises a plurality of hosts and a plurality of physical forwarding elements, a method comprising:
defining data for a set of physical forwarding elements to use to implement a logical forwarding element that handles communications between machines of a first tenant while isolating the first tenant's machines from the machines of other tenants hosted within the system; and distributing the data to the set of physical forwarding elements, wherein a particular physical forwarding element uses the data to forward a packet received from a machine of the first tenant by identifying a logical egress port of the logical forwarding element for the packet and mapping the identified logical egress port to a physical port of the particular physical forwarding element. 28. The method of claim 27, wherein each of the physical forwarding elements of the set of physical forwarding elements uses the data to forward packets received from machines of the first tenant. 29. The method of claim 27, wherein the logical forwarding decision comprises at least one of (i) a L2 lookup for a logical switch and (ii) a sequence of lookups for a logical L3 router. 30. The method of claim 27, wherein the particular physical forwarding element maps the identified logical egress port to a physical port of the particular physical forwarding element by mapping the identified logical egress port to a physical next hop address, encapsulating the packet with the physical next hop address, and forwarding the packet out of the physical port of the particular physical forwarding element. 31. The method of claim 27, wherein the plurality of machines comprises a plurality of virtual machines. 32. The method of claim 27, wherein the plurality of physical forwarding elements implement logical forwarding elements that handle communications between machines of the other tenants while isolating the machines of each other tenant. 33. The method of claim 27, wherein the data comprises flow entries, wherein the flow entries are distributed using OpenFlow. 34. The method of claim 33, wherein the distributed flow entries are used to modify flow tables of the physical forwarding elements. 35. The method of claim 27, wherein distributing the data to the set of physical forwarding elements comprises using a set of secure channels between the network controller and the physical forwarding elements. 36. The method of claim 27, wherein the physical forwarding elements comprise virtual switches operating in hypervisors. 37. A non-transitory machine readable medium storing a program which when executed by at least one processing unit implements a network controller of a system that comprises a plurality of hosts and a plurality of physical forwarding elements, the program comprising sets of instructions for:
defining data for a set of physical forwarding elements to use to implement a logical forwarding element that handles communications between machines of a first tenant while isolating the first tenant's machines from the machines of other tenants hosted within the system; and distributing the data to the set of physical forwarding elements, wherein a particular physical forwarding element uses the data to forward a packet received from a machine of the first tenant by identifying a logical egress port of the logical forwarding element for the packet and mapping the identified logical egress port to a physical port of the particular physical forwarding element. 38. The non-transitory machine readable medium of claim 37, wherein each of the physical forwarding elements of the set of physical forwarding elements uses the data to forward packets received from machines of the first tenant. 39. The non-transitory machine readable medium of claim 37, wherein the logical forwarding decision comprises at least one of (i) a L3 lookup for a logical switch and (ii) a sequence of lookups for a logical L3 router. 40. The non-transitory machine readable medium of claim 37, wherein the particular physical forwarding element maps the identified logical egress port to a physical port of the particular physical forwarding element by mapping the identified logical egress port to a physical next hop address, encapsulating the packet with the physical next hop address, and forwarding the packet out of the physical port of the particular physical forwarding element. 41. The non-transitory machine readable medium of claim 37, wherein the plurality of machines comprises a plurality of virtual machines. 42. The non-transitory machine readable medium of claim 37, wherein the plurality of physical forwarding elements implement logical forwarding elements that handle communications between machines of the other tenants while isolating the machines of each other tenant. 43. The non-transitory machine readable medium of claim 37, wherein the data comprises flow entries, wherein the flow entries are distributed using OpenFlow. 44. The non-transitory machine readable medium of claim 43, wherein the distributed flow entries are used to modify flow tables of the physical forwarding elements. 45. The non-transitory machine readable medium of claim 37, wherein the set of instructions for distributing the data to the set of physical forwarding elements comprises a set of instructions for using a set of secure channels between the network controller and the physical forwarding elements. 46. The non-transitory machine readable medium of claim 37, wherein the physical forwarding elements comprise virtual switches operating in hypervisors. | In general, the present invention relates to a virtual platform in which one or more distributed virtual switches can be created for use in virtual networking. According to some aspects, the distributed virtual switch according to the invention provides the ability for virtual and physical machines to more readily, securely, and efficiently communicate with each other even if they are not located on the same physical host and/or in the same subnet or VLAN. According other aspects, the distributed virtual switches of the invention can support integration with traditional IP networks and support sophisticated IP technologies including NAT functionality, stateful firewalling, and notifying the IP network of workload migration. According to further aspects, the virtual platform of the invention creates one or more distributed virtual switches which may be allocated to a tenant, application, or other entity requiring isolation and/or independent configuration state. According to still further aspects, the virtual platform of the invention manages and/or uses VLAN or tunnels (e.g., GRE) to create a distributed virtual switch for a network while working with existing switches and routers in the network. The present invention finds utility in both enterprise networks, datacenters and other facilities.1-26. (canceled) 27. For a network controller of a system that comprises a plurality of hosts and a plurality of physical forwarding elements, a method comprising:
defining data for a set of physical forwarding elements to use to implement a logical forwarding element that handles communications between machines of a first tenant while isolating the first tenant's machines from the machines of other tenants hosted within the system; and distributing the data to the set of physical forwarding elements, wherein a particular physical forwarding element uses the data to forward a packet received from a machine of the first tenant by identifying a logical egress port of the logical forwarding element for the packet and mapping the identified logical egress port to a physical port of the particular physical forwarding element. 28. The method of claim 27, wherein each of the physical forwarding elements of the set of physical forwarding elements uses the data to forward packets received from machines of the first tenant. 29. The method of claim 27, wherein the logical forwarding decision comprises at least one of (i) a L2 lookup for a logical switch and (ii) a sequence of lookups for a logical L3 router. 30. The method of claim 27, wherein the particular physical forwarding element maps the identified logical egress port to a physical port of the particular physical forwarding element by mapping the identified logical egress port to a physical next hop address, encapsulating the packet with the physical next hop address, and forwarding the packet out of the physical port of the particular physical forwarding element. 31. The method of claim 27, wherein the plurality of machines comprises a plurality of virtual machines. 32. The method of claim 27, wherein the plurality of physical forwarding elements implement logical forwarding elements that handle communications between machines of the other tenants while isolating the machines of each other tenant. 33. The method of claim 27, wherein the data comprises flow entries, wherein the flow entries are distributed using OpenFlow. 34. The method of claim 33, wherein the distributed flow entries are used to modify flow tables of the physical forwarding elements. 35. The method of claim 27, wherein distributing the data to the set of physical forwarding elements comprises using a set of secure channels between the network controller and the physical forwarding elements. 36. The method of claim 27, wherein the physical forwarding elements comprise virtual switches operating in hypervisors. 37. A non-transitory machine readable medium storing a program which when executed by at least one processing unit implements a network controller of a system that comprises a plurality of hosts and a plurality of physical forwarding elements, the program comprising sets of instructions for:
defining data for a set of physical forwarding elements to use to implement a logical forwarding element that handles communications between machines of a first tenant while isolating the first tenant's machines from the machines of other tenants hosted within the system; and distributing the data to the set of physical forwarding elements, wherein a particular physical forwarding element uses the data to forward a packet received from a machine of the first tenant by identifying a logical egress port of the logical forwarding element for the packet and mapping the identified logical egress port to a physical port of the particular physical forwarding element. 38. The non-transitory machine readable medium of claim 37, wherein each of the physical forwarding elements of the set of physical forwarding elements uses the data to forward packets received from machines of the first tenant. 39. The non-transitory machine readable medium of claim 37, wherein the logical forwarding decision comprises at least one of (i) a L3 lookup for a logical switch and (ii) a sequence of lookups for a logical L3 router. 40. The non-transitory machine readable medium of claim 37, wherein the particular physical forwarding element maps the identified logical egress port to a physical port of the particular physical forwarding element by mapping the identified logical egress port to a physical next hop address, encapsulating the packet with the physical next hop address, and forwarding the packet out of the physical port of the particular physical forwarding element. 41. The non-transitory machine readable medium of claim 37, wherein the plurality of machines comprises a plurality of virtual machines. 42. The non-transitory machine readable medium of claim 37, wherein the plurality of physical forwarding elements implement logical forwarding elements that handle communications between machines of the other tenants while isolating the machines of each other tenant. 43. The non-transitory machine readable medium of claim 37, wherein the data comprises flow entries, wherein the flow entries are distributed using OpenFlow. 44. The non-transitory machine readable medium of claim 43, wherein the distributed flow entries are used to modify flow tables of the physical forwarding elements. 45. The non-transitory machine readable medium of claim 37, wherein the set of instructions for distributing the data to the set of physical forwarding elements comprises a set of instructions for using a set of secure channels between the network controller and the physical forwarding elements. 46. The non-transitory machine readable medium of claim 37, wherein the physical forwarding elements comprise virtual switches operating in hypervisors. | 2,400 |
7,686 | 7,686 | 13,764,079 | 2,453 | An exemplary information-processing system includes: an execution unit configured to execute an application program; a prompting unit configured to prompt a user to post to a service for sharing posted information, in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and a posting unit configured to post posted information corresponding to the predetermined condition to the service in accordance with a user input with respect to the prompting unit. | 1. An information-processing system comprising:
an execution unit configured to execute an application program; a prompting unit configured to prompt a user to post to a service for sharing posted information, in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and a posting unit configured to post posted information corresponding to the predetermined condition to the service in accordance with a user input with respect to the prompting unit. 2. The information-processing system according to claim 1, wherein
the application program is a program for executing a plurality of events that proceed in at least one of a virtual time and a virtual space, and the prompting unit is further configured to prompt a user to post to the service for sharing posted information, if one event occurs a predetermined number of times within a predetermined time period in the virtual time or within a predetermined range in the virtual space in the application program executed by the execution unit. 3. The information-processing system according to claim 1, wherein
the application program includes an event relating to a plurality of virtual objects, and the prompting unit is further configured to prompt a user to post to the service for sharing posted information if an event relating to one virtual object occurs a predetermined number of times in the application program executed by the execution unit. 4. The information-processing system according to claim 1, further comprising
an obtaining unit configured to obtain, from the service, posted information from another user; and a display control unit configured to control a display unit to display the posted information obtained by the obtaining unit when the predetermined condition is satisfied. 5. The information-processing system according to claim 1, wherein
the obtaining unit is further configured to obtain posted information corresponding to each of the plurality of events, and if the one event occurs, the display control unit is further configured to control the display unit to display the posted information corresponding to the one event. 6. The information-processing system according to claim 5, wherein
the display control unit is further configured to display information from a user that satisfies a predetermined condition, out of the posted information obtained by the obtaining unit. 7. The information-processing system according to claim 5, wherein
when the one event occurs, the display control unit is further configured to control the display unit to display the posted information corresponding to the one event, at a location corresponding to the one event. 8. The information-processing system according to claim 1, wherein
the prompting unit is further configured to prompt again a user to post to the service if the predetermined condition is further satisfied a predetermined number of times after posting to the service was prompted last time. 9. The information-processing system according to claim 1, further comprising
a storage unit configured to store a user image corresponding to a user, wherein the posting unit is further configured to post, to the service, the posted information including information indicating the user image stored in the storage unit. 10. An information-processing apparatus comprising:
an execution unit configured to execute an application program; a prompting unit configured to prompt a user to post to a service for sharing posted information in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and a posting unit configured to post posted information corresponding to the predetermined condition to the service in accordance with a user input responding to the prompting unit. 11. An information-processing method comprising:
executing an application program by an execution unit; prompting a user to post to a service for sharing posted information in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and posting posted information corresponding to the predetermined condition to the service in accordance with a user input responding to the prompting. 12. A computer-readable non-transitory storage medium storing a program causing a computer device to execute a process, the process comprising:
executing an application program by an execution unit; prompting a user to post to a service for sharing posted information in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and posting posted information corresponding to the predetermined condition to the service in accordance with a user input responding to the prompting. | An exemplary information-processing system includes: an execution unit configured to execute an application program; a prompting unit configured to prompt a user to post to a service for sharing posted information, in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and a posting unit configured to post posted information corresponding to the predetermined condition to the service in accordance with a user input with respect to the prompting unit.1. An information-processing system comprising:
an execution unit configured to execute an application program; a prompting unit configured to prompt a user to post to a service for sharing posted information, in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and a posting unit configured to post posted information corresponding to the predetermined condition to the service in accordance with a user input with respect to the prompting unit. 2. The information-processing system according to claim 1, wherein
the application program is a program for executing a plurality of events that proceed in at least one of a virtual time and a virtual space, and the prompting unit is further configured to prompt a user to post to the service for sharing posted information, if one event occurs a predetermined number of times within a predetermined time period in the virtual time or within a predetermined range in the virtual space in the application program executed by the execution unit. 3. The information-processing system according to claim 1, wherein
the application program includes an event relating to a plurality of virtual objects, and the prompting unit is further configured to prompt a user to post to the service for sharing posted information if an event relating to one virtual object occurs a predetermined number of times in the application program executed by the execution unit. 4. The information-processing system according to claim 1, further comprising
an obtaining unit configured to obtain, from the service, posted information from another user; and a display control unit configured to control a display unit to display the posted information obtained by the obtaining unit when the predetermined condition is satisfied. 5. The information-processing system according to claim 1, wherein
the obtaining unit is further configured to obtain posted information corresponding to each of the plurality of events, and if the one event occurs, the display control unit is further configured to control the display unit to display the posted information corresponding to the one event. 6. The information-processing system according to claim 5, wherein
the display control unit is further configured to display information from a user that satisfies a predetermined condition, out of the posted information obtained by the obtaining unit. 7. The information-processing system according to claim 5, wherein
when the one event occurs, the display control unit is further configured to control the display unit to display the posted information corresponding to the one event, at a location corresponding to the one event. 8. The information-processing system according to claim 1, wherein
the prompting unit is further configured to prompt again a user to post to the service if the predetermined condition is further satisfied a predetermined number of times after posting to the service was prompted last time. 9. The information-processing system according to claim 1, further comprising
a storage unit configured to store a user image corresponding to a user, wherein the posting unit is further configured to post, to the service, the posted information including information indicating the user image stored in the storage unit. 10. An information-processing apparatus comprising:
an execution unit configured to execute an application program; a prompting unit configured to prompt a user to post to a service for sharing posted information in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and a posting unit configured to post posted information corresponding to the predetermined condition to the service in accordance with a user input responding to the prompting unit. 11. An information-processing method comprising:
executing an application program by an execution unit; prompting a user to post to a service for sharing posted information in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and posting posted information corresponding to the predetermined condition to the service in accordance with a user input responding to the prompting. 12. A computer-readable non-transitory storage medium storing a program causing a computer device to execute a process, the process comprising:
executing an application program by an execution unit; prompting a user to post to a service for sharing posted information in response to a predetermined condition being satisfied a predetermined number of times in the application program executed by the execution unit; and posting posted information corresponding to the predetermined condition to the service in accordance with a user input responding to the prompting. | 2,400 |
7,687 | 7,687 | 15,044,906 | 2,441 | A communication device of an industrial automation system and method for configuring the communication device, wherein a communication network address assigned to the communication device is independently generated from at least one prefix communicated via router advertisement messages by at least one router assigned within a subnetwork and from a device-specific interface identifier, where the communication device interrogates at at least one server of a name service system, in accordance with a name resolution protocol, which communication network addresses are assigned to its communication device name, the communication network addresses interrogated at the at least one server of the name service system are checked with regard to correspondence to the prefix, and where the communication device assigns to itself only those communication network addresses interrogated at the server of the name service system which have a correspondence to the prefix communicated by the router. | 1. A method for configuring a communication device of an industrial automation system, comprising:
generating, by the communication device independently, a communication network address assigned to the communication device from at least one prefix communicated via router advertisement messages by at least one router assigned within the subnetwork of said communication device and from a device-specific interface identifier; interrogating, by the communication device, at at least one server of a name service system, in accordance with a name resolution protocol, which communication network addresses are assigned to its communication device name; checking, by the communication device, the communication network addresses interrogated at the at least one server of the name service system to determine correspondence to the prefix communicated by the at least one router; and assigning, by the communication device, only those communication network addresses interrogated at the at least one server of the name service system which have a correspondence to the prefix communicated by the router, said communication addresses being assigned to the communication device. 2. The method as claimed in claim 1, wherein the communication device determines, for the communication network addresses interrogated at the at least one server of the name service system, a validity period, defined in the name service system, of an assignment between its communication device name and the respective communication network address; and wherein the communication device independently cancels its assignment of the respective communication network address after the determined validity period has elapsed. 3. The method as claimed in claim 2, wherein the communication device independently cancels its assignment of the respective communication network address only after a multiple of the determined validity period has elapsed. 4. The method as claimed in claim 1, wherein the server of the name service system is a domain name system (DNS) server which provides a name service to DNS clients in accordance with a DNS protocol. 5. The method as claimed in claim 4, wherein the communication device interrogates at at least one of (i) a primary DNS server and (ii) a secondary DNS server which communication network addresses are assigned to its communication device name. 6. The method as claimed in claim 4, wherein the communication device comprises at least one of (i) a DNS monitor and (ii) a DNS client; and wherein the communication device interrogates via at least one of (i) the DNS monitor and (ii) the DNS client which communication network addresses are assigned to its communication device name. 7. The method as claimed in claim 5, wherein the communication device comprises at least one of (i) a DNS monitor and (ii) a DNS client; and wherein the communication device interrogates via at least one of (i) the DNS monitor and (ii) the DNS client which communication network addresses are assigned to its communication device name. 8. The method as claimed in claim 4, wherein the communication device comprises a client for dynamic DNS, via which said communication device requests storage of the assignment of its communication device name to an independently generated communication network address in the name service system. 9. The method as claimed in claim 8, wherein a data record comprising the assignment is created in the name service system in an event of a successful request of the storage of the assignment of the communication device name to the respective communication network address. 10. The method as claimed in claim 9, wherein the communication network address is an IPv6 address; and wherein a data record is an AAAA resource record which is erased from the name service system after its defined validity period has elapsed. 11. The method as claimed in claim 1, wherein a prefix communicated via router advertisement messages is an IPv6 prefix; and wherein the communication device meets its assigned communication network address according to stateless address autoconfiguration. 12. The method as claimed in claim 1, wherein the communication device performs a uniqueness check at least within its subnetwork before an independent assignment of communication device addresses; and wherein the communication device assigns to itself only unique communication device addresses. 13. The method as claimed in claim 12, wherein the communication device performs the uniqueness check in accordance with a neighbor discovery protocol. 14. The method as claimed in claim 1, wherein the communication device is a replacement communication device for an exchanged communication device; and
wherein the communication network addresses interrogated at the at least one server of the name service system by the replacement communication device are previously assigned to the exchanged communication device. 15. The method as claimed in claim 1, wherein the communication device interrogates within the context of a device exchange at the at least one server of the name service system which communication network addresses are assigned to its communication device name. 16. The method as claimed in claim 1, wherein the communication device one of (i) comprises an automation device and (ii) is integrated into the automation device. 17. A communication device for an industrial automation system, comprising:
at least one transmitter/receiver; at least one controller which coordinates access to a communication medium; a configurator for independently generating a communication network address assigned to the communication device from at least one prefix communicated via router advertisement messages and from a device-specific interface identifier; a monitor configured to interrogate at at least one server of a name service system, in accordance with a mean resolution protocol, which communication network addresses are assigned to a communication device name of the communication device; wherein the communication device is configured to check the communication network addresses interrogated at the at least one server of the name service system for correspondence to the communicated prefix; and wherein the communication device is further configured to assign to itself only those communication network addresses interrogated at the at least one server of the name service system which have a correspondence to the prefix communicated by a router. | A communication device of an industrial automation system and method for configuring the communication device, wherein a communication network address assigned to the communication device is independently generated from at least one prefix communicated via router advertisement messages by at least one router assigned within a subnetwork and from a device-specific interface identifier, where the communication device interrogates at at least one server of a name service system, in accordance with a name resolution protocol, which communication network addresses are assigned to its communication device name, the communication network addresses interrogated at the at least one server of the name service system are checked with regard to correspondence to the prefix, and where the communication device assigns to itself only those communication network addresses interrogated at the server of the name service system which have a correspondence to the prefix communicated by the router.1. A method for configuring a communication device of an industrial automation system, comprising:
generating, by the communication device independently, a communication network address assigned to the communication device from at least one prefix communicated via router advertisement messages by at least one router assigned within the subnetwork of said communication device and from a device-specific interface identifier; interrogating, by the communication device, at at least one server of a name service system, in accordance with a name resolution protocol, which communication network addresses are assigned to its communication device name; checking, by the communication device, the communication network addresses interrogated at the at least one server of the name service system to determine correspondence to the prefix communicated by the at least one router; and assigning, by the communication device, only those communication network addresses interrogated at the at least one server of the name service system which have a correspondence to the prefix communicated by the router, said communication addresses being assigned to the communication device. 2. The method as claimed in claim 1, wherein the communication device determines, for the communication network addresses interrogated at the at least one server of the name service system, a validity period, defined in the name service system, of an assignment between its communication device name and the respective communication network address; and wherein the communication device independently cancels its assignment of the respective communication network address after the determined validity period has elapsed. 3. The method as claimed in claim 2, wherein the communication device independently cancels its assignment of the respective communication network address only after a multiple of the determined validity period has elapsed. 4. The method as claimed in claim 1, wherein the server of the name service system is a domain name system (DNS) server which provides a name service to DNS clients in accordance with a DNS protocol. 5. The method as claimed in claim 4, wherein the communication device interrogates at at least one of (i) a primary DNS server and (ii) a secondary DNS server which communication network addresses are assigned to its communication device name. 6. The method as claimed in claim 4, wherein the communication device comprises at least one of (i) a DNS monitor and (ii) a DNS client; and wherein the communication device interrogates via at least one of (i) the DNS monitor and (ii) the DNS client which communication network addresses are assigned to its communication device name. 7. The method as claimed in claim 5, wherein the communication device comprises at least one of (i) a DNS monitor and (ii) a DNS client; and wherein the communication device interrogates via at least one of (i) the DNS monitor and (ii) the DNS client which communication network addresses are assigned to its communication device name. 8. The method as claimed in claim 4, wherein the communication device comprises a client for dynamic DNS, via which said communication device requests storage of the assignment of its communication device name to an independently generated communication network address in the name service system. 9. The method as claimed in claim 8, wherein a data record comprising the assignment is created in the name service system in an event of a successful request of the storage of the assignment of the communication device name to the respective communication network address. 10. The method as claimed in claim 9, wherein the communication network address is an IPv6 address; and wherein a data record is an AAAA resource record which is erased from the name service system after its defined validity period has elapsed. 11. The method as claimed in claim 1, wherein a prefix communicated via router advertisement messages is an IPv6 prefix; and wherein the communication device meets its assigned communication network address according to stateless address autoconfiguration. 12. The method as claimed in claim 1, wherein the communication device performs a uniqueness check at least within its subnetwork before an independent assignment of communication device addresses; and wherein the communication device assigns to itself only unique communication device addresses. 13. The method as claimed in claim 12, wherein the communication device performs the uniqueness check in accordance with a neighbor discovery protocol. 14. The method as claimed in claim 1, wherein the communication device is a replacement communication device for an exchanged communication device; and
wherein the communication network addresses interrogated at the at least one server of the name service system by the replacement communication device are previously assigned to the exchanged communication device. 15. The method as claimed in claim 1, wherein the communication device interrogates within the context of a device exchange at the at least one server of the name service system which communication network addresses are assigned to its communication device name. 16. The method as claimed in claim 1, wherein the communication device one of (i) comprises an automation device and (ii) is integrated into the automation device. 17. A communication device for an industrial automation system, comprising:
at least one transmitter/receiver; at least one controller which coordinates access to a communication medium; a configurator for independently generating a communication network address assigned to the communication device from at least one prefix communicated via router advertisement messages and from a device-specific interface identifier; a monitor configured to interrogate at at least one server of a name service system, in accordance with a mean resolution protocol, which communication network addresses are assigned to a communication device name of the communication device; wherein the communication device is configured to check the communication network addresses interrogated at the at least one server of the name service system for correspondence to the communicated prefix; and wherein the communication device is further configured to assign to itself only those communication network addresses interrogated at the at least one server of the name service system which have a correspondence to the prefix communicated by a router. | 2,400 |
7,688 | 7,688 | 12,015,348 | 2,454 | One embodiment of the present invention provides a system that automatic discovers and monitors enterprise components. During operation, the system scans an enterprise environment for an item of meta-data. Next, the system analyzes the item of meta-data to determine a monitoring instruction for a corresponding enterprise component. Finally, the system performs the monitoring instruction for the corresponding enterprise component. | 1. A method for providing automatic discovery and monitoring of enterprise components, the method comprising:
scanning an enterprise environment for an item of meta-data; analyzing the item of meta-data to determine a monitoring instruction for a corresponding enterprise component; and performing the monitoring instruction for the corresponding enterprise component. 2. The method of claim 1, further comprising saving the item of meta-data to a meta-data tree, wherein the meta-data tree comprises multiple items of meta-data corresponding to multiple enterprise components that comprise an enterprise application. 3. The method of claim 2, further comprising:
receiving a designation of a second meta-data tree from a user; and in response to receiving the designation, performing monitoring instructions for the enterprise application as specified by the second meta-data tree. 4. The method of claim 1, further comprising:
receiving a command from a user to modify the item of meta-data; in response to the command, modifying the item of meta-data; and performing the monitoring instruction for the corresponding enterprise component from the modified item of meta-data without restarting a system comprising the corresponding enterprise component. 5. The method of claim 1, wherein the monitoring instruction specifies a monitoring system to manage the corresponding enterprise component. 6. The method of claim 1, wherein the monitoring instruction specifies a group membership of the corresponding enterprise component. 7. The method of claim 6, wherein the group membership specifies an enterprise application comprising the enterprise component. 8. The method of claim 1, wherein the monitoring instruction specifies central or local monitoring of the corresponding enterprise component. 9. The method of claim 1, wherein the monitoring instruction instructs a monitoring system to stop managing the corresponding enterprise component. 10. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for providing automatic discovery and monitoring of enterprise components, the method comprising:
scanning an enterprise environment for an item of meta-data; analyzing the item of meta-data to determine a monitoring instruction for a corresponding enterprise component; and performing the monitoring instruction for the corresponding enterprise component. 11. The computer-readable storage medium of claim 10, wherein the method further comprises saving the item of meta-data to a meta-data tree, wherein the meta-data tree comprises multiple items of meta-data corresponding to multiple enterprise components that comprise an enterprise application. 12. The computer-readable storage medium of claim 11, wherein the method further comprises:
receiving a designation of a second meta-data tree from a user; and in response to receiving the designation, performing monitoring instructions for the enterprise application as specified by the second meta-data tree. 13. The computer-readable storage medium of claim 10, wherein the method further comprises:
receiving a command from a user to modify the item of meta-data; in response to the command, modifying the item of meta-data; and performing the monitoring instruction for the corresponding enterprise component from the modified item of meta-data without restarting a system comprising the corresponding enterprise component. 14. The computer-readable storage medium of claim 10, wherein the monitoring instruction specifies a monitoring system to manage the corresponding enterprise component. 15. The computer-readable storage medium of claim 10, wherein the monitoring instruction specifies a group membership of the corresponding enterprise component. 16. The computer-readable storage medium of claim 15, wherein the group membership specifies an enterprise application comprising the enterprise component. 17. The computer-readable storage medium of claim 10, wherein the monitoring instruction specifies central or local monitoring of the corresponding enterprise component. 18. The computer-readable storage medium of claim 10, wherein the monitoring instruction instructs a monitoring system to stop managing the corresponding enterprise component. 19. An apparatus configured to provide automatic discovery and monitoring of enterprise components, comprising:
a scanning mechanism configured to scan an enterprise environment for an item of meta-data; an analysis mechanism configured to analyze the item of meta-data to determine a monitoring instruction for a corresponding enterprise component; and an execution mechanism configured to perform the monitoring instruction for the corresponding enterprise component. 20. The apparatus of claim 19, further comprising a storage mechanism configured to save the item of meta-data to a meta-data tree, wherein the meta-data tree comprises multiple items of meta-data corresponding to multiple enterprise components that comprise an enterprise application. | One embodiment of the present invention provides a system that automatic discovers and monitors enterprise components. During operation, the system scans an enterprise environment for an item of meta-data. Next, the system analyzes the item of meta-data to determine a monitoring instruction for a corresponding enterprise component. Finally, the system performs the monitoring instruction for the corresponding enterprise component.1. A method for providing automatic discovery and monitoring of enterprise components, the method comprising:
scanning an enterprise environment for an item of meta-data; analyzing the item of meta-data to determine a monitoring instruction for a corresponding enterprise component; and performing the monitoring instruction for the corresponding enterprise component. 2. The method of claim 1, further comprising saving the item of meta-data to a meta-data tree, wherein the meta-data tree comprises multiple items of meta-data corresponding to multiple enterprise components that comprise an enterprise application. 3. The method of claim 2, further comprising:
receiving a designation of a second meta-data tree from a user; and in response to receiving the designation, performing monitoring instructions for the enterprise application as specified by the second meta-data tree. 4. The method of claim 1, further comprising:
receiving a command from a user to modify the item of meta-data; in response to the command, modifying the item of meta-data; and performing the monitoring instruction for the corresponding enterprise component from the modified item of meta-data without restarting a system comprising the corresponding enterprise component. 5. The method of claim 1, wherein the monitoring instruction specifies a monitoring system to manage the corresponding enterprise component. 6. The method of claim 1, wherein the monitoring instruction specifies a group membership of the corresponding enterprise component. 7. The method of claim 6, wherein the group membership specifies an enterprise application comprising the enterprise component. 8. The method of claim 1, wherein the monitoring instruction specifies central or local monitoring of the corresponding enterprise component. 9. The method of claim 1, wherein the monitoring instruction instructs a monitoring system to stop managing the corresponding enterprise component. 10. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for providing automatic discovery and monitoring of enterprise components, the method comprising:
scanning an enterprise environment for an item of meta-data; analyzing the item of meta-data to determine a monitoring instruction for a corresponding enterprise component; and performing the monitoring instruction for the corresponding enterprise component. 11. The computer-readable storage medium of claim 10, wherein the method further comprises saving the item of meta-data to a meta-data tree, wherein the meta-data tree comprises multiple items of meta-data corresponding to multiple enterprise components that comprise an enterprise application. 12. The computer-readable storage medium of claim 11, wherein the method further comprises:
receiving a designation of a second meta-data tree from a user; and in response to receiving the designation, performing monitoring instructions for the enterprise application as specified by the second meta-data tree. 13. The computer-readable storage medium of claim 10, wherein the method further comprises:
receiving a command from a user to modify the item of meta-data; in response to the command, modifying the item of meta-data; and performing the monitoring instruction for the corresponding enterprise component from the modified item of meta-data without restarting a system comprising the corresponding enterprise component. 14. The computer-readable storage medium of claim 10, wherein the monitoring instruction specifies a monitoring system to manage the corresponding enterprise component. 15. The computer-readable storage medium of claim 10, wherein the monitoring instruction specifies a group membership of the corresponding enterprise component. 16. The computer-readable storage medium of claim 15, wherein the group membership specifies an enterprise application comprising the enterprise component. 17. The computer-readable storage medium of claim 10, wherein the monitoring instruction specifies central or local monitoring of the corresponding enterprise component. 18. The computer-readable storage medium of claim 10, wherein the monitoring instruction instructs a monitoring system to stop managing the corresponding enterprise component. 19. An apparatus configured to provide automatic discovery and monitoring of enterprise components, comprising:
a scanning mechanism configured to scan an enterprise environment for an item of meta-data; an analysis mechanism configured to analyze the item of meta-data to determine a monitoring instruction for a corresponding enterprise component; and an execution mechanism configured to perform the monitoring instruction for the corresponding enterprise component. 20. The apparatus of claim 19, further comprising a storage mechanism configured to save the item of meta-data to a meta-data tree, wherein the meta-data tree comprises multiple items of meta-data corresponding to multiple enterprise components that comprise an enterprise application. | 2,400 |
7,689 | 7,689 | 13,686,275 | 2,451 | Processing a media file includes receiving a request for a media file from a client system and determining, using a processor, a non-chronological ordering of a plurality of segments of the media file for buffering according to historical playback data for each of the plurality of segments of the media file. A first segment of the media file is sent for buffering to the client system as specified by the non-chronological ordering of the plurality of segments. The non-chronological ordering is determined prior to sending any segment of the media file to the client system. | 1-12. (canceled) 13. A system comprising:
a processor programmed to initiate executable operations comprising: receiving a request for a media file from a client system; determining a non-chronological ordering of a plurality of segments of the media file for buffering according to historical playback data for each of the plurality of segments of the media file; and sending a first segment of the media file, as specified by the non-chronological ordering of the plurality of segments, for buffering to the client system; wherein the non-chronological ordering is determined prior to sending any segment of the media file to the client system. 14. The system of claim 13, wherein the first segment sent to the client system is not a first chronological segment of the media file. 15. The system of claim 13, wherein the processor is further programmed to initiate executable operations comprising:
determining user-specific data from the request; wherein determining a non-chronological ordering of the plurality of segments of the media file is further performed according to the user-specific data from the request. 16. The system of claim 15, wherein the attribute is an identifier of a user of the client system, wherein only historical playback data of the plurality of segments of the media file from other users belonging to a social network of the user of the client system is used to determine the non-chronological ordering. 17. The system of claim 13, wherein the sending of at least the first segment of the media file is performed without initiation of playback of the media file within the client system. 18. The system of claim 13, wherein the processor is further programmed to initiate executable operations comprising:
providing a visualization of the plurality of segments of the media file to the client system, wherein the visualization indicates the determined non-chronological ordering of the segments to be buffered. 19. A system comprising:
a processor programmed to initiate executable operations comprising: including a reference to a media file within a Web page, wherein the media file comprises a plurality of segments; and including within the reference, a parameter indicating that segments of the media file are to be buffered in a non-chronological order. 20. The system of claim 19, wherein the processor is further programmed to initiate an executable operation comprising:
determining values for the parameter, wherein the values indicate individual segments of the media file, and wherein an order of the values specifies the non-chronological order of segments of the media file for buffering. 21. A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
receiving, using the processor, a request for a media file from a client system; determining, using the processor, a non-chronological ordering of a plurality of segments of the media file for buffering according to historical playback data for each of the plurality of segments of the media file; and sending, using the processor, a first segment of the media file, as specified by the non-chronological ordering of the plurality of segments, for buffering to the client system wherein the non-chronological ordering is determined prior to sending any segment of the media file to the client system. 22. The computer program product of claim 21, wherein the first segment sent to the client system is not a first chronological segment of the media file. 23. The computer program product of claim 21, wherein the method further comprises:
determining user-specific data from the request; wherein determining a non-chronological ordering of the plurality of segments of the media file is further performed according to the user-specific data from the request; and wherein the attribute is an identifier of a user of the client system, wherein only historical playback data of the plurality of segments of the media file from other users belonging to a social network of the user of the client system is used to determine the non-chronological ordering. 24. The computer program product of claim 21, wherein the sending of at least the first segment of the media file is performed without initiation of playback of the media file within the client system. 25. The computer program product of claim 21, wherein the method further comprises:
providing a visualization of the plurality of segments of the media file to the client system, wherein the visualization indicates the determined non-chronological ordering of the segments to be buffered. 26. A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
including, using the processor, a reference to a media file within a Web page, wherein the media file comprises a plurality of segments; and including, using the processor and within the reference, a parameter indicating that segments of the media file are to be buffered in a non-chronological order. 27. The computer program product of claim 26, wherein the method further comprises:
determining values for the parameter, wherein the values indicate individual segments of the media file, and wherein an order of the values specifies the non-chronological order of segments of the media file for buffering. 28. The computer program product of claim 27, wherein a client system determines the values for the parameter. | Processing a media file includes receiving a request for a media file from a client system and determining, using a processor, a non-chronological ordering of a plurality of segments of the media file for buffering according to historical playback data for each of the plurality of segments of the media file. A first segment of the media file is sent for buffering to the client system as specified by the non-chronological ordering of the plurality of segments. The non-chronological ordering is determined prior to sending any segment of the media file to the client system.1-12. (canceled) 13. A system comprising:
a processor programmed to initiate executable operations comprising: receiving a request for a media file from a client system; determining a non-chronological ordering of a plurality of segments of the media file for buffering according to historical playback data for each of the plurality of segments of the media file; and sending a first segment of the media file, as specified by the non-chronological ordering of the plurality of segments, for buffering to the client system; wherein the non-chronological ordering is determined prior to sending any segment of the media file to the client system. 14. The system of claim 13, wherein the first segment sent to the client system is not a first chronological segment of the media file. 15. The system of claim 13, wherein the processor is further programmed to initiate executable operations comprising:
determining user-specific data from the request; wherein determining a non-chronological ordering of the plurality of segments of the media file is further performed according to the user-specific data from the request. 16. The system of claim 15, wherein the attribute is an identifier of a user of the client system, wherein only historical playback data of the plurality of segments of the media file from other users belonging to a social network of the user of the client system is used to determine the non-chronological ordering. 17. The system of claim 13, wherein the sending of at least the first segment of the media file is performed without initiation of playback of the media file within the client system. 18. The system of claim 13, wherein the processor is further programmed to initiate executable operations comprising:
providing a visualization of the plurality of segments of the media file to the client system, wherein the visualization indicates the determined non-chronological ordering of the segments to be buffered. 19. A system comprising:
a processor programmed to initiate executable operations comprising: including a reference to a media file within a Web page, wherein the media file comprises a plurality of segments; and including within the reference, a parameter indicating that segments of the media file are to be buffered in a non-chronological order. 20. The system of claim 19, wherein the processor is further programmed to initiate an executable operation comprising:
determining values for the parameter, wherein the values indicate individual segments of the media file, and wherein an order of the values specifies the non-chronological order of segments of the media file for buffering. 21. A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
receiving, using the processor, a request for a media file from a client system; determining, using the processor, a non-chronological ordering of a plurality of segments of the media file for buffering according to historical playback data for each of the plurality of segments of the media file; and sending, using the processor, a first segment of the media file, as specified by the non-chronological ordering of the plurality of segments, for buffering to the client system wherein the non-chronological ordering is determined prior to sending any segment of the media file to the client system. 22. The computer program product of claim 21, wherein the first segment sent to the client system is not a first chronological segment of the media file. 23. The computer program product of claim 21, wherein the method further comprises:
determining user-specific data from the request; wherein determining a non-chronological ordering of the plurality of segments of the media file is further performed according to the user-specific data from the request; and wherein the attribute is an identifier of a user of the client system, wherein only historical playback data of the plurality of segments of the media file from other users belonging to a social network of the user of the client system is used to determine the non-chronological ordering. 24. The computer program product of claim 21, wherein the sending of at least the first segment of the media file is performed without initiation of playback of the media file within the client system. 25. The computer program product of claim 21, wherein the method further comprises:
providing a visualization of the plurality of segments of the media file to the client system, wherein the visualization indicates the determined non-chronological ordering of the segments to be buffered. 26. A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
including, using the processor, a reference to a media file within a Web page, wherein the media file comprises a plurality of segments; and including, using the processor and within the reference, a parameter indicating that segments of the media file are to be buffered in a non-chronological order. 27. The computer program product of claim 26, wherein the method further comprises:
determining values for the parameter, wherein the values indicate individual segments of the media file, and wherein an order of the values specifies the non-chronological order of segments of the media file for buffering. 28. The computer program product of claim 27, wherein a client system determines the values for the parameter. | 2,400 |
7,690 | 7,690 | 14,882,783 | 2,452 | A communication session is established between a first communication device and a second communication device. The communication session comprises a first dialog between an application server and the first communication device. The first communication device uses a first network address in the first dialog. In response to an event, such as a first network interface failing, a SIP INVITE with replaces header message is received by the application server with a second address of the first communication device. In response to receiving the SIP INVITE with replaces header message from the first communication device with a second address of the first communication device, the first dialog between the application server and the first device is reestablished using the second network address. | 1. A method comprising:
establishing, by a processor, a communication session between a first communication device and a second communication device, wherein the communication session comprises a first dialog between an application server and the first communication device and wherein the first communication device uses a first network address in the first dialog; receiving, by the processor, a SIP INVITE with replaces header message from the first communication device with a second network address of the first communication device; and in response to receiving the SIP INVITE with replaces header message from the first communication device with a second network address of the first communication device, reestablishing, by the processor, the first dialog between the application server and the first device using the second network address. 2. The method of claim 1, wherein the SIP INVITE with replaces header message further comprises a takeover tag that identifies to the application server that the SIP INVITE with replaces header message is to be handled differently than normal. 3. The method of claim 2, wherein the communication session also comprises a second dialog between the second communication device and the application server and wherein the application server does not reestablish the second dialog in response to receiving the SIP INVITE with replaces header message with the takeover tag. 4. The method of claim 1, wherein the communication session also comprises a second dialog between the second communication device and the application server and further comprising:
determining if the SIP INVITE with replaces header message comprises a takeover tag; determining if there is a media server involved in the communication session; in response to determining that there is not a media server involved in the communication session and the SIP INVITE with replaces header message comprises the takeover tag, sending, to the second communication device, a SIP RE-INVITE message that comprises the second network address in place of the SIP INVITE with replaces header message to reestablish the second dialog. 5. The method of claim 1, wherein the SIP INVITE with replaces header message is received in response to a change in signal strength from a first network that uses the first network address to a second network that uses the second network address. 6. The method of claim 1, wherein the first communication device has a plurality of different network interfaces, wherein the SIP INVITE with replaces header message is received in response to one of the plurality of different network interfaces failing and/or the one of the plurality of different network interfaces being unable to communicate with the application server. 7. The method of claim 1, wherein the first communication device has a plurality of different network interfaces and wherein the SIP INVITE with replaces header message is received based on a user input to move the communication session from a first one of the plurality of different network interfaces to a second one of the plurality of different network interfaces. 8. The method of claim 1, wherein the first network address is a first Internet Protocol (IP) address on a first subnet and the second network address is a second IP address on a second subnet. 9. A system comprising:
a communication processor that establishes a communication session between a first communication device and a second communication device, wherein the communication session comprises a first dialog between an application server and the first communication device and wherein the first communication device uses a first network address in the first dialog, and reestablishes the first dialog between the application server and the first communication device using a second network address in response to receiving a SIP INVITE with replaces header message from the first communication device with the second network address of the first communication device; and an application server that receives the SIP INVITE with replaces header message from the first communication device with the second network address. 10. The system of claim 9, wherein the SIP INVITE with replaces header message further comprises a takeover tag that identifies to the application server that the SIP INVITE with replaces header message is to be handled differently than normal. 11. The system of claim 10, wherein the communication session also comprises a second dialog between the second communication device and the application server and wherein the application server does not reestablish the second dialog in response to receiving the SIP INVITE with replaces header message with the takeover tag. 12. The system of claim 9, wherein the communication session also comprises a second dialog between the second communication device and the application server and wherein:
the application server determines if the SIP INVITE with replaces header message comprises a takeover tag; determines if there is a media server involved in the communication session; and sends, to the second communication device, a SIP Re-INVITE message that comprises the second address in place of the SIP INVITE with replaces header message to reestablish the second dialog in response to determining that there is not a media server involved in the communication session and the SIP INVITE with replaces header message comprises the takeover tag. 13. The system of claim 9, wherein the SIP INVITE with replaces header message is received in response to a change in signal strength from a first network that uses the first network address to a second network that uses the second network address. 14. The system of claim 9, wherein the first communication device has a plurality of different network interfaces, wherein the SIP INVITE with replaces header message is received in response to one of the plurality of different network interfaces failing and/or the one of the plurality of different network interfaces being unable to communicate with the application server. 15. The system of claim 9, wherein the first communication device has a plurality of different network interfaces and wherein the SIP INVITE with replaces header message is received based on a user input to move the communication session from a first one of the plurality of different network interfaces to a second one of the plurality of different network interfaces. 16. The system of claim 9, wherein the first network address is a first Internet Protocol (IP) address on a first subnet and the second network address is a second IP address on a second subnet. 17. A first communication device comprising:
a processor that executes a communication module that establishes a communication session with a second communication device, wherein the first communication device uses a first network address to establish the communication session and sends a SIP INVITE with replaces header message with a second network address of the first communication device in response to the first communication device needing to use a different network address. 18. The first communication device of claim 17, wherein the SIP INVITE with replaces header message is sent in response to a change in signal strength from a first network that uses the first network address to a second network that uses the second network address. 19. The first communication device of claim 17, wherein the first communication device has a plurality of different network interfaces, wherein SIP INVITE with replaces header message is sent in response to one of the plurality of different network interfaces failing and/or the one of the plurality of different network interfaces being unable to communicate. 20. The first communication device of claim 17, wherein the SIP INVITE with replaces header message further comprises a takeover tag that identifies to an application server that the SIP INVITE with replaces header message is to be handled differently than normal. | A communication session is established between a first communication device and a second communication device. The communication session comprises a first dialog between an application server and the first communication device. The first communication device uses a first network address in the first dialog. In response to an event, such as a first network interface failing, a SIP INVITE with replaces header message is received by the application server with a second address of the first communication device. In response to receiving the SIP INVITE with replaces header message from the first communication device with a second address of the first communication device, the first dialog between the application server and the first device is reestablished using the second network address.1. A method comprising:
establishing, by a processor, a communication session between a first communication device and a second communication device, wherein the communication session comprises a first dialog between an application server and the first communication device and wherein the first communication device uses a first network address in the first dialog; receiving, by the processor, a SIP INVITE with replaces header message from the first communication device with a second network address of the first communication device; and in response to receiving the SIP INVITE with replaces header message from the first communication device with a second network address of the first communication device, reestablishing, by the processor, the first dialog between the application server and the first device using the second network address. 2. The method of claim 1, wherein the SIP INVITE with replaces header message further comprises a takeover tag that identifies to the application server that the SIP INVITE with replaces header message is to be handled differently than normal. 3. The method of claim 2, wherein the communication session also comprises a second dialog between the second communication device and the application server and wherein the application server does not reestablish the second dialog in response to receiving the SIP INVITE with replaces header message with the takeover tag. 4. The method of claim 1, wherein the communication session also comprises a second dialog between the second communication device and the application server and further comprising:
determining if the SIP INVITE with replaces header message comprises a takeover tag; determining if there is a media server involved in the communication session; in response to determining that there is not a media server involved in the communication session and the SIP INVITE with replaces header message comprises the takeover tag, sending, to the second communication device, a SIP RE-INVITE message that comprises the second network address in place of the SIP INVITE with replaces header message to reestablish the second dialog. 5. The method of claim 1, wherein the SIP INVITE with replaces header message is received in response to a change in signal strength from a first network that uses the first network address to a second network that uses the second network address. 6. The method of claim 1, wherein the first communication device has a plurality of different network interfaces, wherein the SIP INVITE with replaces header message is received in response to one of the plurality of different network interfaces failing and/or the one of the plurality of different network interfaces being unable to communicate with the application server. 7. The method of claim 1, wherein the first communication device has a plurality of different network interfaces and wherein the SIP INVITE with replaces header message is received based on a user input to move the communication session from a first one of the plurality of different network interfaces to a second one of the plurality of different network interfaces. 8. The method of claim 1, wherein the first network address is a first Internet Protocol (IP) address on a first subnet and the second network address is a second IP address on a second subnet. 9. A system comprising:
a communication processor that establishes a communication session between a first communication device and a second communication device, wherein the communication session comprises a first dialog between an application server and the first communication device and wherein the first communication device uses a first network address in the first dialog, and reestablishes the first dialog between the application server and the first communication device using a second network address in response to receiving a SIP INVITE with replaces header message from the first communication device with the second network address of the first communication device; and an application server that receives the SIP INVITE with replaces header message from the first communication device with the second network address. 10. The system of claim 9, wherein the SIP INVITE with replaces header message further comprises a takeover tag that identifies to the application server that the SIP INVITE with replaces header message is to be handled differently than normal. 11. The system of claim 10, wherein the communication session also comprises a second dialog between the second communication device and the application server and wherein the application server does not reestablish the second dialog in response to receiving the SIP INVITE with replaces header message with the takeover tag. 12. The system of claim 9, wherein the communication session also comprises a second dialog between the second communication device and the application server and wherein:
the application server determines if the SIP INVITE with replaces header message comprises a takeover tag; determines if there is a media server involved in the communication session; and sends, to the second communication device, a SIP Re-INVITE message that comprises the second address in place of the SIP INVITE with replaces header message to reestablish the second dialog in response to determining that there is not a media server involved in the communication session and the SIP INVITE with replaces header message comprises the takeover tag. 13. The system of claim 9, wherein the SIP INVITE with replaces header message is received in response to a change in signal strength from a first network that uses the first network address to a second network that uses the second network address. 14. The system of claim 9, wherein the first communication device has a plurality of different network interfaces, wherein the SIP INVITE with replaces header message is received in response to one of the plurality of different network interfaces failing and/or the one of the plurality of different network interfaces being unable to communicate with the application server. 15. The system of claim 9, wherein the first communication device has a plurality of different network interfaces and wherein the SIP INVITE with replaces header message is received based on a user input to move the communication session from a first one of the plurality of different network interfaces to a second one of the plurality of different network interfaces. 16. The system of claim 9, wherein the first network address is a first Internet Protocol (IP) address on a first subnet and the second network address is a second IP address on a second subnet. 17. A first communication device comprising:
a processor that executes a communication module that establishes a communication session with a second communication device, wherein the first communication device uses a first network address to establish the communication session and sends a SIP INVITE with replaces header message with a second network address of the first communication device in response to the first communication device needing to use a different network address. 18. The first communication device of claim 17, wherein the SIP INVITE with replaces header message is sent in response to a change in signal strength from a first network that uses the first network address to a second network that uses the second network address. 19. The first communication device of claim 17, wherein the first communication device has a plurality of different network interfaces, wherein SIP INVITE with replaces header message is sent in response to one of the plurality of different network interfaces failing and/or the one of the plurality of different network interfaces being unable to communicate. 20. The first communication device of claim 17, wherein the SIP INVITE with replaces header message further comprises a takeover tag that identifies to an application server that the SIP INVITE with replaces header message is to be handled differently than normal. | 2,400 |
7,691 | 7,691 | 11,922,362 | 2,426 | Appliance and method for processing a plurality of high resolution multimedial operative programs and functions, wherein the appliance is integrated with a television receiver screen, and is adapted to permit to set and display such operative programs and functions on to the television screen. Appliance comprising main electronic control means, video signal processing means, audio signal processing means, input selector means for analog and digital video and audio signals of any kind, and first, second and third electronic control means for data for personal computers and television receivers, wherein the main electronic control means are adapted to control and manage the data exchange among them and the control means of the appliance and the external electronic appliances and/or systems, for displaying the images and reproducing the sounds. Furthermore, there are described a remote control system and a remote control device and a method for setting and displaying such multimedial operative programs and functions on to the screen of such an appliance. | 1: Appliance for processing a plurality of high resolution multimedial operative programs and functions, adapted to permit to set and display such operative programs and functions on to at least a television screen of any type (LCD, LED, plasma etc.), included mainly into the same appliance or into separate external appliances, characterized by main electronic control means (9) for controlling and managing informatics digital and analog data in general and data of operative programs and functions for personal computers and television receivers of various kind, by video signals processing means (14), by audio signals processing means (16), by input selector means (18) for analog and digital video and audio signals of various kind, which are transmitted via radio, cable, wires, optic fibers and the like, and by first, second and third electronic control means (6, 7,8) for informatics inputted and outputted data in general and data of operative programs and functions for personal computers and television receivers with respect to the appliance and external peripheral appliances, connected operatively to the same appliance, said first electronic control means (6) being shaped like remote control means and able to receive and transmit informatics data via radio, cable, wire, optic fibers and the like, said second electronic control means (7) being adapted to receive and transmit audio data via radio, cable, wire and the like, and said third electronic control means (8) being adapted to receive and transmit informatics data in general and analog and digital video and audio data via radio, cable, wires, optic fibers and the like, said main electronic control means (9) being adapted to control and manage the data exchange among them and said input selector means (18), and said first, second and third electronic control means (6, 7, 8) and among them and corresponding control means of external electronic appliances and/or systems, which are connected operatively permanently or temporarily to the present appliance, said main electronic control means (9) being set to input some informatics data in general and analog and digital data of operative programs and functions which have been set through said first, second and third electronic control means (6, 7, 8) and the corresponding control means of said external electronic appliances and/or systems, for managing and processing the same data and transmitting corresponding response output data adapted to control the carrying out of the set operative programs and functions and said video signals processing means (14) and audio signals processing means (16), of the present appliance and external electronic appliances and/or systems, by displaying the corresponding images into said television screen (15) and by reproducing the corresponding sounds into the sound transducer means (47, 48) of the present appliance, and into the corresponding television screens and sound transducers of the external electronic appliances and/or systems, and adapted to control and check also the right operation and the carrying out of the operative programs and functions of the present appliance and the external electronic appliances and/or systems, for signalling and in case correcting automatically any not correct operation, or for signalling also any possible operative failure or defect of the present appliance and the external electronic appliances and/or systems. 2: Processing appliance according to claim 1, characterized in that said main electronic control means comprise at least a master or main microprocessor (9) of conventional type, powered through power supply means (12) and connected through a BUS control line (10) to said video signals processing means (14), said audio signals processing means (16), said input selector means (18) and said first, second and third control means (6, 7, 8), said master microprocessor (9) being also connected at its outputs (31, 32) respectively to at least a mass storage unit (hard disk 33) and writing/reading optical means (34), which in turn are connected to said BUS control line (10). 3: Processing appliance according to claim 2, characterized in that said video signals processing means comprise at least a video processor (14) provided with a set of inputs and a set of outputs, a first input (17) of which is connected to said input selector means (18), to receive and introduce video and audio signals received from said input selector means (18) and to decode only the video signals therefrom and convert them into signals compatible with the operation of the present appliance; a second input (19) of which is connected to said main electronic control means (9) through said BUS control line (10), and a third input (21) of which is connected to possible external shooting means (22), said video processor (14) being connected with its output (23) to a first input (24) of a graphic module (25) for video signals processing, the second input (26) of which is connected to said main electronic control means (9) through said BUS control line (10), and the output (27) of which is connected to a first input (28) of a possible driver adapter (29), the second input (30) of which is connected to said main electronic control means (9) through said BUS control line (10), and the output (31) of which is connected to said television screen (15), so as to drive the same with a high resolution and a single or double channel. 4: Processing appliance according to claim 3, characterized in that said power supply means (12) are connected to control and management means (13) for supplying partially of fully the different appliance electronic circuits. 5: Processing appliance according to claim 2, characterized in that said audio signals processing means comprise at least an audio processor (16) connected with its input (20) to said main electronic control means (9), through said BUS control line (10), and with its output (45) through sound amplifier means (46) to said sound transducer means (47, 48). 6: Processing appliance according to claim 4, characterized in that said input selector means comprise at least a selector (18) of video and audio signals of various kind, such as for example CVBS standard video signals, SNI-IS signals, Y Pb Pr signals, RGB colour video signals, DVI signals, HDMI signals, VGA signals, USB signals, IEE 1394 signals and the like, adapted to control and drive said television screen (15) and said sound transducer means (47, 48). 7: Processing appliance according to claim 6, characterized in that said video and audio signals are received by tuner means (35) for analog and digital television, connected to analog demodulator means (38) and to digital demodulator means (40), respectively adapted to generate a type of video signal and a video signal of digital type and a corresponding audio signal, and also connected respectively to said television screen (15), through video signals processing means (14), and to said sound transducer means (47, 48) through said audio signals processing means (16). 8: Processing appliance according to claim 7, characterized in that said analog demodulator means (38) and digital demodulator means (40) are connected to at least a decoder/encoder (49) to provide for flows of video and audio data independent from each other, which are transmitted to the respective said video signals processing means (14) and audio signals processing means (16). 9: Processing appliance according to claim 2, characterized in that said first electronic control means comprise at least a remote control circuit (6), preferably of the infrared type, comprising a receiver/detector (50) situated near the present appliance and provided for effecting an inputted and outputted data exchange with respect to the same appliance and the external peripheral appliances, which data are introduced through a plurality of inputs (51) which can be connected to peripheral appliances of various kind such as remote controls (53), keyboards and mouses (54) for personal computers, appliances (55) connected to the internet network, manual instruments (56) of various kind, digital cameras (57), printers (58), portable computers (59) for setting data of various kind, portable phones (60) or the like, said receiver/detector (50) being connected with its outputs (52) to said main electronic control means (9), through switch means (11) and said BUS control line (10). 10: Processing appliance according to claim 2, characterized in that said second electronic control means (7) comprise switch means (61) adapted to re-distribute the inputted and outputted audio data, which are received and transmitted through inputs/outputs (62) of said switch means (61) and to convey them toward said audio signals processing means (16), or to receive them from the same, through outputs/inputs (63) of said switch means (61) connected through said BUS control line (10) to said main electronic control means (9), said inputs/outputs (62) being adapted to be connected to some audio appliances of various kind, such as digital inputs/outputs (64) for television systems, microphones (65), sound reproducing apparatuses (66), central-subwoofer loudspeakers (67), audio systems 5.1 and 7.1(68), SPDIF interfaces (69) and the like. 11: Processing appliance according to claim 2, characterized in that said third electronic control means (8) comprise at least an access gateway (70) provided with a set of inputs/outputs (71) for connecting a plurality of peripheral appliances of various kind, and adapted to receive and transmit through said peripheral appliances the inputted and outputted informatics data, and provided with at least an output (72) connected through said BUS control line (10) to said main electronic control means (9), said peripheral appliances being constituted for example by telephonic lines (73), by data lines (74), by internet appliances (75), by manual instruments (76), by movable phones (77), by optic fibers (78), by telephonic pairs (79), by receiving-transmitting means (80) via radio, or cable, or wire or optic fibers, by phone or infrared radiations, adapted to receive and transmit informatics data with respect to the outer uses, for displaying the images and reproducing the received sounds, through said television screen (15) and said sound transducers (47, 48) of the present appliance, or for displaying the images and reproducing the transmitted sounds through the corresponding television screens and the sound transducers of said outer uses. 12: Processing appliance according to claim 2, characterized in that said main electronic control means (9) are also set for performing additional programs and functions of various kind, by the connection for example with electronic readers (81) of cards containing data of any kind (bancomat, various documents, administrative matters etc.), identifying systems (82) of any object, wireless receiving˜transmitting g systems, or systems without cables and optic fibers and the like, for effecting an electronic data exchange among said main electronic control means (9) and these peripheral appliances or circuits, and displaying the images and reproduce the sounds contained into such peripheral appliances in the present appliance. 13: Appliance according to claim 1, characterized in that all the video and audio data of the various programs and the various functions are received and transmitted with a large band and a high speed ranging preferably from 10 megabit/sec. and over, and high resolution images and sounds. 14: Method for processing multimedial operative programs and functions on a processing appliance according to claim 1, characterized in that some informatics data in general and analog and digital data of multimedial operative programs and functions are introduced via radio, cable, wire and optic fibers into said main electronic control means (9), which data are set and selected directly into the processing appliance, through said first, second and third electronic control means (6, 7, 8), together with said input selector means (18) for receiving video and audio signals of various kind, and into corresponding control means for external electronic appliances and/or systems, connected operatively to said main electronic control means (9), and that said main electronic control means (9) are set for managing and processing the same data and for transmitting corresponding response output data adapted to control the carrying out of the operative programs and functions which have been set, and said video signal processing means (14) and said audio signal processing means (16) of this appliance and the external electronic appliances and/or systems, by displaying the corresponding images and reproducing the corresponding sounds into the relative television screens (15) and sound transducers (47, 48) of the present appliance and the external electronic appliances and/or systems. 15: Processing method according to claim 14, characterized in that said main electronic control means (9) are also set for controlling and verifying the correct operation and carrying out of the operative programs and functions in the present appliance and the external electronic appliances and/or systems, for signalling and in case correcting automatically any possible not correct operation, or for signalling also any operative failure or defect of the present appliance and the external electronic appliances and/or systems. 16: Processing method according to claim 15, characterized in that said main electronic control means (9) are also arranged for setting and selecting, through said first, second and third control means (6, 7, 8), together with said input selector means (18), and into corresponding control means for external electronic appliances and/or systems, connected operatively to said main electronic control means (9), some informatics data of a plurality of operative programs and functions which are typical for personal computers and television receivers, the images of which are displayed and the sounds of which are reproduced, and of controls for household appliances, domotics controls, videogame controls, in order to interact with controls, games, services and other functions available from the internet network, for example video and/or audio services on request, services for hotels, cruise vessels, teleuniversities, state boards, managing and processing multimedial services for communities etc., programs for appliances like portable phones, printers, portable computers, electronic and/or informatics appliances of various kind, on-line reading of newspapers, magazines etc., with possibility to file, register, reproduce and create contemporaneously some informatics data of any kind. 17: Remote control system for a plurality of multimedial operative programs and functions for an appliance for processing high resolution operative functions and programs, integrated with a television receiver screen, according to claim 1, the system being characterized by electronic control means (microprocessor 102) associated with said appliance and connected operatively to said main electronic control means (101), to said electric power supply means (105) of the appliance and the same system, to said audio signal processing means (audio amplifier 107 and loudspeakers), to said television screen (108) and to other possible peripheral appliances and to infrared radiation receiver means (ill), which can be controlled by remote control means (113), wherein the operative programs and functions may be selected and displayed, said electronic control means (102) being set in a way to decode and recognize the inputted data which have been selected through said remote control means (113) and transmitted through said infrared radiation receiver means (111), and to control and manage, in response to the received data, said audio signal processing means (107), said television screen (108) and any possible peripheral appliance and said external peripheral appliances, and said electric power supply means (105), and to do also an informative data exchange among them and said main electronic control means (101), for performing the control and management of said possible peripheral appliances and said external peripheral appliances, and for controlling the operative states of said main electronic control means (101) and receiving the informations relating to these operative states and the operative states of the different peripheral appliances. 18: Remote control system according to claim 17, characterized in that said electronic control means (102) permit to control the operation of the loudspeakers connected to said audio signal processing means (107), for performing “muting” operations namely lowering or annulment of the sound volume and “sleep” operations namely consumption reduction. 19: Remote control system according to claim 17, characterized in that said electronic control means (102) permit to switch on and off said audio signal processing means (107), and to generate a train of “power on” and “power off” periodic signals for switching on and off said television screen (108), so as to ensure a correct operation thereof. 20: Remote control system according to claim 17, characterized in that said electronic control means (102) permit to permit to control and adjust the brilliance of the luminous spots of said television screen (108) and therefore also the brilliance of the same screen. 21: Remote control system according to claim 17, characterized in that said electronic control means (102) control said electric power supply means (105), in a way to manage an appliance operation with low energy consumption, even when said main electronic control means (101) are switched off or on the standby state, and anyway inactive. 22: Remote control system according to claim 17, characterized in that said electronic control means (102) are set for controlling the operative states of said main electronic control means (101) and for producing corresponding response signals to said remote control means (113), adapted to signal such operative states to the user. 23: Remote control system according to claim 17, characterized in that said electronic control means (102) are set for storing a plurality of additional programs and functions of various kind to be carried out in the present appliance or the peripheral appliances, and in the internet network or other external appliances connected to the present appliance, which data may be controlled and managed by said main electronic control means (101) or by said electronic control means (102). 24: Remote control device for setting and carrying out a plurality of high resolution multimedial operative programs and functions in a processing appliance for a plurality of high resolution multimedial operative programs and functions, according to claim 1, characterized in that into it there are introduced in advance, in a coded manner with specific analog and digital data, all the data of the operative programs and functions being memorized and coded in an identical manner into said mass storage means (133), which operative programs and functions identify some operative programs such as for example the Windows, Windows Media Center programs and any other kind of informatics operative program already existing in commerce or which might be developed in the future, as well as they may be software of any kind for personal computers and television receivers and for the more disparate applications, such for example for controlling the operations of household appliances, medical appliances, photographic appliances, etc. and any application involving the use of electronic circuits with traditional or particular software, said remote control device (119) being adapted to set each desired operative program and function, which are selected and displayed respectively through selector keys and displaying means included into the same remote control device, and being adapted to generate electric pulses coded in a corresponding manner, which are transmitted to said main control means (115) through said remote control means (117) and additional electronic control means (controller 134) connected to said main control means (115) and said screen (124), for driving the electric values thereof, through driving means (inverter 135) included or separated with respect to the same screen, thereby memorizing said main control means (115) with the same operative programs and functions which have been selected, which are then started through said remote control device (119), under the condition in which it generates corresponding electric pulses which control, through said additional electronic control means (134), the switching on of said power supply unit (131), said main control means (115) and all the remaining electronic circuits of the appliance and/or the external electronic appliances and/or systems, and in which said additional electronic control means (134) receive from said main control means (115) some response electric pulses, which are transmitted to said remote control device (119), by indicating into the relative displaying means the switched on and the operative state of the relative electronic appliance and/or system. 25: Remote control device according to claim 24, characterized in that said mass storage means (133) may be memorized also with additional operative programs and functions of may kind, to be carried out into the appliance referred to and/or the external electronic appliances and/or systems. 26: Remote control device according to claim 24, characterized in that said mass storage means (133) may be de-memorized for erasing and/or replacing the operative programs and functions introduced therein. 27: Remote control device according to claim 24, characterized in that said additional electronic control means (134) are connected also to at least a video signal card (136), adapted to check the flow of data being processed from said main control means (115) and transmitted to said additional electronic control means (134) and, depending on the sensed or not sensed data, adapted to warn said additional electronic control means (134) of this operative state. 28: Method for setting and carrying out a high resolution multimedial operative programs and functions for an appliance and with a remote control device according to claim 24, characterized in that said mass storage means (133) are memorized in advance with a plurality of operative programs and functions of various kind, to be carried out into the appliance referred to and/or the external electronic appliances and/or systems, which programs may be for example the Windows, Windows Media Center programs and any other operative program already existing on the market or also operative programs which might be developed in the future, as well as they may be software of any kind for personal computers and television receivers and for the most disparate applications, for example for controlling the operation of household appliances, medical appliances, photographic appliances etc., and for any application involving the use of electronic circuits with traditional or particular software, and characterized in that into the remote control device (119) there are introduced in advance, in a coded manner with specific analog and digital data, all the data of the operative programs and functions which are memorized and coded in a manner identical into said mass storage means (133), and that each desired operative program and function is selected and displayed respectively through selector keys and display means included into said remote control device (119), by generating electric pulses coded in a corresponding manner, which are transmitted to said main control means (115), through said remote control means (117) and said additional electronic control means (134), thereby memorizing said main control means (115) with the same operative programs and functions which have been selected, which are then started through said remote control device (119), under the condition in which it generates corresponding electric pulses which control, through said additional electronic control means (134), the switching on of said power supply unit (131), said main control means (115) and all the remaining electronic circuits of the appliance and/or the external electronic appliances and/or systems, and in which said additional control means (134) receive from said main control means (115) some response electric pulses, which are transmitted to said remote control device (119), by indicating into the relative displaying means the switched on and the operative state of the relative electronic appliance and/or system. 29: Method according to claim 28, characterized in that additional operative programs and functions of any kind, to be carried out into the appliance referred to and/or the external electronic appliances and/or systems, may be memorized into said mass storage means (133). 30: Method according to claim 28, characterized in that the operative programs and functions being introduced into said mass storage means (133) may be dc-memorized for erasing and/or replacing the same. | Appliance and method for processing a plurality of high resolution multimedial operative programs and functions, wherein the appliance is integrated with a television receiver screen, and is adapted to permit to set and display such operative programs and functions on to the television screen. Appliance comprising main electronic control means, video signal processing means, audio signal processing means, input selector means for analog and digital video and audio signals of any kind, and first, second and third electronic control means for data for personal computers and television receivers, wherein the main electronic control means are adapted to control and manage the data exchange among them and the control means of the appliance and the external electronic appliances and/or systems, for displaying the images and reproducing the sounds. Furthermore, there are described a remote control system and a remote control device and a method for setting and displaying such multimedial operative programs and functions on to the screen of such an appliance.1: Appliance for processing a plurality of high resolution multimedial operative programs and functions, adapted to permit to set and display such operative programs and functions on to at least a television screen of any type (LCD, LED, plasma etc.), included mainly into the same appliance or into separate external appliances, characterized by main electronic control means (9) for controlling and managing informatics digital and analog data in general and data of operative programs and functions for personal computers and television receivers of various kind, by video signals processing means (14), by audio signals processing means (16), by input selector means (18) for analog and digital video and audio signals of various kind, which are transmitted via radio, cable, wires, optic fibers and the like, and by first, second and third electronic control means (6, 7,8) for informatics inputted and outputted data in general and data of operative programs and functions for personal computers and television receivers with respect to the appliance and external peripheral appliances, connected operatively to the same appliance, said first electronic control means (6) being shaped like remote control means and able to receive and transmit informatics data via radio, cable, wire, optic fibers and the like, said second electronic control means (7) being adapted to receive and transmit audio data via radio, cable, wire and the like, and said third electronic control means (8) being adapted to receive and transmit informatics data in general and analog and digital video and audio data via radio, cable, wires, optic fibers and the like, said main electronic control means (9) being adapted to control and manage the data exchange among them and said input selector means (18), and said first, second and third electronic control means (6, 7, 8) and among them and corresponding control means of external electronic appliances and/or systems, which are connected operatively permanently or temporarily to the present appliance, said main electronic control means (9) being set to input some informatics data in general and analog and digital data of operative programs and functions which have been set through said first, second and third electronic control means (6, 7, 8) and the corresponding control means of said external electronic appliances and/or systems, for managing and processing the same data and transmitting corresponding response output data adapted to control the carrying out of the set operative programs and functions and said video signals processing means (14) and audio signals processing means (16), of the present appliance and external electronic appliances and/or systems, by displaying the corresponding images into said television screen (15) and by reproducing the corresponding sounds into the sound transducer means (47, 48) of the present appliance, and into the corresponding television screens and sound transducers of the external electronic appliances and/or systems, and adapted to control and check also the right operation and the carrying out of the operative programs and functions of the present appliance and the external electronic appliances and/or systems, for signalling and in case correcting automatically any not correct operation, or for signalling also any possible operative failure or defect of the present appliance and the external electronic appliances and/or systems. 2: Processing appliance according to claim 1, characterized in that said main electronic control means comprise at least a master or main microprocessor (9) of conventional type, powered through power supply means (12) and connected through a BUS control line (10) to said video signals processing means (14), said audio signals processing means (16), said input selector means (18) and said first, second and third control means (6, 7, 8), said master microprocessor (9) being also connected at its outputs (31, 32) respectively to at least a mass storage unit (hard disk 33) and writing/reading optical means (34), which in turn are connected to said BUS control line (10). 3: Processing appliance according to claim 2, characterized in that said video signals processing means comprise at least a video processor (14) provided with a set of inputs and a set of outputs, a first input (17) of which is connected to said input selector means (18), to receive and introduce video and audio signals received from said input selector means (18) and to decode only the video signals therefrom and convert them into signals compatible with the operation of the present appliance; a second input (19) of which is connected to said main electronic control means (9) through said BUS control line (10), and a third input (21) of which is connected to possible external shooting means (22), said video processor (14) being connected with its output (23) to a first input (24) of a graphic module (25) for video signals processing, the second input (26) of which is connected to said main electronic control means (9) through said BUS control line (10), and the output (27) of which is connected to a first input (28) of a possible driver adapter (29), the second input (30) of which is connected to said main electronic control means (9) through said BUS control line (10), and the output (31) of which is connected to said television screen (15), so as to drive the same with a high resolution and a single or double channel. 4: Processing appliance according to claim 3, characterized in that said power supply means (12) are connected to control and management means (13) for supplying partially of fully the different appliance electronic circuits. 5: Processing appliance according to claim 2, characterized in that said audio signals processing means comprise at least an audio processor (16) connected with its input (20) to said main electronic control means (9), through said BUS control line (10), and with its output (45) through sound amplifier means (46) to said sound transducer means (47, 48). 6: Processing appliance according to claim 4, characterized in that said input selector means comprise at least a selector (18) of video and audio signals of various kind, such as for example CVBS standard video signals, SNI-IS signals, Y Pb Pr signals, RGB colour video signals, DVI signals, HDMI signals, VGA signals, USB signals, IEE 1394 signals and the like, adapted to control and drive said television screen (15) and said sound transducer means (47, 48). 7: Processing appliance according to claim 6, characterized in that said video and audio signals are received by tuner means (35) for analog and digital television, connected to analog demodulator means (38) and to digital demodulator means (40), respectively adapted to generate a type of video signal and a video signal of digital type and a corresponding audio signal, and also connected respectively to said television screen (15), through video signals processing means (14), and to said sound transducer means (47, 48) through said audio signals processing means (16). 8: Processing appliance according to claim 7, characterized in that said analog demodulator means (38) and digital demodulator means (40) are connected to at least a decoder/encoder (49) to provide for flows of video and audio data independent from each other, which are transmitted to the respective said video signals processing means (14) and audio signals processing means (16). 9: Processing appliance according to claim 2, characterized in that said first electronic control means comprise at least a remote control circuit (6), preferably of the infrared type, comprising a receiver/detector (50) situated near the present appliance and provided for effecting an inputted and outputted data exchange with respect to the same appliance and the external peripheral appliances, which data are introduced through a plurality of inputs (51) which can be connected to peripheral appliances of various kind such as remote controls (53), keyboards and mouses (54) for personal computers, appliances (55) connected to the internet network, manual instruments (56) of various kind, digital cameras (57), printers (58), portable computers (59) for setting data of various kind, portable phones (60) or the like, said receiver/detector (50) being connected with its outputs (52) to said main electronic control means (9), through switch means (11) and said BUS control line (10). 10: Processing appliance according to claim 2, characterized in that said second electronic control means (7) comprise switch means (61) adapted to re-distribute the inputted and outputted audio data, which are received and transmitted through inputs/outputs (62) of said switch means (61) and to convey them toward said audio signals processing means (16), or to receive them from the same, through outputs/inputs (63) of said switch means (61) connected through said BUS control line (10) to said main electronic control means (9), said inputs/outputs (62) being adapted to be connected to some audio appliances of various kind, such as digital inputs/outputs (64) for television systems, microphones (65), sound reproducing apparatuses (66), central-subwoofer loudspeakers (67), audio systems 5.1 and 7.1(68), SPDIF interfaces (69) and the like. 11: Processing appliance according to claim 2, characterized in that said third electronic control means (8) comprise at least an access gateway (70) provided with a set of inputs/outputs (71) for connecting a plurality of peripheral appliances of various kind, and adapted to receive and transmit through said peripheral appliances the inputted and outputted informatics data, and provided with at least an output (72) connected through said BUS control line (10) to said main electronic control means (9), said peripheral appliances being constituted for example by telephonic lines (73), by data lines (74), by internet appliances (75), by manual instruments (76), by movable phones (77), by optic fibers (78), by telephonic pairs (79), by receiving-transmitting means (80) via radio, or cable, or wire or optic fibers, by phone or infrared radiations, adapted to receive and transmit informatics data with respect to the outer uses, for displaying the images and reproducing the received sounds, through said television screen (15) and said sound transducers (47, 48) of the present appliance, or for displaying the images and reproducing the transmitted sounds through the corresponding television screens and the sound transducers of said outer uses. 12: Processing appliance according to claim 2, characterized in that said main electronic control means (9) are also set for performing additional programs and functions of various kind, by the connection for example with electronic readers (81) of cards containing data of any kind (bancomat, various documents, administrative matters etc.), identifying systems (82) of any object, wireless receiving˜transmitting g systems, or systems without cables and optic fibers and the like, for effecting an electronic data exchange among said main electronic control means (9) and these peripheral appliances or circuits, and displaying the images and reproduce the sounds contained into such peripheral appliances in the present appliance. 13: Appliance according to claim 1, characterized in that all the video and audio data of the various programs and the various functions are received and transmitted with a large band and a high speed ranging preferably from 10 megabit/sec. and over, and high resolution images and sounds. 14: Method for processing multimedial operative programs and functions on a processing appliance according to claim 1, characterized in that some informatics data in general and analog and digital data of multimedial operative programs and functions are introduced via radio, cable, wire and optic fibers into said main electronic control means (9), which data are set and selected directly into the processing appliance, through said first, second and third electronic control means (6, 7, 8), together with said input selector means (18) for receiving video and audio signals of various kind, and into corresponding control means for external electronic appliances and/or systems, connected operatively to said main electronic control means (9), and that said main electronic control means (9) are set for managing and processing the same data and for transmitting corresponding response output data adapted to control the carrying out of the operative programs and functions which have been set, and said video signal processing means (14) and said audio signal processing means (16) of this appliance and the external electronic appliances and/or systems, by displaying the corresponding images and reproducing the corresponding sounds into the relative television screens (15) and sound transducers (47, 48) of the present appliance and the external electronic appliances and/or systems. 15: Processing method according to claim 14, characterized in that said main electronic control means (9) are also set for controlling and verifying the correct operation and carrying out of the operative programs and functions in the present appliance and the external electronic appliances and/or systems, for signalling and in case correcting automatically any possible not correct operation, or for signalling also any operative failure or defect of the present appliance and the external electronic appliances and/or systems. 16: Processing method according to claim 15, characterized in that said main electronic control means (9) are also arranged for setting and selecting, through said first, second and third control means (6, 7, 8), together with said input selector means (18), and into corresponding control means for external electronic appliances and/or systems, connected operatively to said main electronic control means (9), some informatics data of a plurality of operative programs and functions which are typical for personal computers and television receivers, the images of which are displayed and the sounds of which are reproduced, and of controls for household appliances, domotics controls, videogame controls, in order to interact with controls, games, services and other functions available from the internet network, for example video and/or audio services on request, services for hotels, cruise vessels, teleuniversities, state boards, managing and processing multimedial services for communities etc., programs for appliances like portable phones, printers, portable computers, electronic and/or informatics appliances of various kind, on-line reading of newspapers, magazines etc., with possibility to file, register, reproduce and create contemporaneously some informatics data of any kind. 17: Remote control system for a plurality of multimedial operative programs and functions for an appliance for processing high resolution operative functions and programs, integrated with a television receiver screen, according to claim 1, the system being characterized by electronic control means (microprocessor 102) associated with said appliance and connected operatively to said main electronic control means (101), to said electric power supply means (105) of the appliance and the same system, to said audio signal processing means (audio amplifier 107 and loudspeakers), to said television screen (108) and to other possible peripheral appliances and to infrared radiation receiver means (ill), which can be controlled by remote control means (113), wherein the operative programs and functions may be selected and displayed, said electronic control means (102) being set in a way to decode and recognize the inputted data which have been selected through said remote control means (113) and transmitted through said infrared radiation receiver means (111), and to control and manage, in response to the received data, said audio signal processing means (107), said television screen (108) and any possible peripheral appliance and said external peripheral appliances, and said electric power supply means (105), and to do also an informative data exchange among them and said main electronic control means (101), for performing the control and management of said possible peripheral appliances and said external peripheral appliances, and for controlling the operative states of said main electronic control means (101) and receiving the informations relating to these operative states and the operative states of the different peripheral appliances. 18: Remote control system according to claim 17, characterized in that said electronic control means (102) permit to control the operation of the loudspeakers connected to said audio signal processing means (107), for performing “muting” operations namely lowering or annulment of the sound volume and “sleep” operations namely consumption reduction. 19: Remote control system according to claim 17, characterized in that said electronic control means (102) permit to switch on and off said audio signal processing means (107), and to generate a train of “power on” and “power off” periodic signals for switching on and off said television screen (108), so as to ensure a correct operation thereof. 20: Remote control system according to claim 17, characterized in that said electronic control means (102) permit to permit to control and adjust the brilliance of the luminous spots of said television screen (108) and therefore also the brilliance of the same screen. 21: Remote control system according to claim 17, characterized in that said electronic control means (102) control said electric power supply means (105), in a way to manage an appliance operation with low energy consumption, even when said main electronic control means (101) are switched off or on the standby state, and anyway inactive. 22: Remote control system according to claim 17, characterized in that said electronic control means (102) are set for controlling the operative states of said main electronic control means (101) and for producing corresponding response signals to said remote control means (113), adapted to signal such operative states to the user. 23: Remote control system according to claim 17, characterized in that said electronic control means (102) are set for storing a plurality of additional programs and functions of various kind to be carried out in the present appliance or the peripheral appliances, and in the internet network or other external appliances connected to the present appliance, which data may be controlled and managed by said main electronic control means (101) or by said electronic control means (102). 24: Remote control device for setting and carrying out a plurality of high resolution multimedial operative programs and functions in a processing appliance for a plurality of high resolution multimedial operative programs and functions, according to claim 1, characterized in that into it there are introduced in advance, in a coded manner with specific analog and digital data, all the data of the operative programs and functions being memorized and coded in an identical manner into said mass storage means (133), which operative programs and functions identify some operative programs such as for example the Windows, Windows Media Center programs and any other kind of informatics operative program already existing in commerce or which might be developed in the future, as well as they may be software of any kind for personal computers and television receivers and for the more disparate applications, such for example for controlling the operations of household appliances, medical appliances, photographic appliances, etc. and any application involving the use of electronic circuits with traditional or particular software, said remote control device (119) being adapted to set each desired operative program and function, which are selected and displayed respectively through selector keys and displaying means included into the same remote control device, and being adapted to generate electric pulses coded in a corresponding manner, which are transmitted to said main control means (115) through said remote control means (117) and additional electronic control means (controller 134) connected to said main control means (115) and said screen (124), for driving the electric values thereof, through driving means (inverter 135) included or separated with respect to the same screen, thereby memorizing said main control means (115) with the same operative programs and functions which have been selected, which are then started through said remote control device (119), under the condition in which it generates corresponding electric pulses which control, through said additional electronic control means (134), the switching on of said power supply unit (131), said main control means (115) and all the remaining electronic circuits of the appliance and/or the external electronic appliances and/or systems, and in which said additional electronic control means (134) receive from said main control means (115) some response electric pulses, which are transmitted to said remote control device (119), by indicating into the relative displaying means the switched on and the operative state of the relative electronic appliance and/or system. 25: Remote control device according to claim 24, characterized in that said mass storage means (133) may be memorized also with additional operative programs and functions of may kind, to be carried out into the appliance referred to and/or the external electronic appliances and/or systems. 26: Remote control device according to claim 24, characterized in that said mass storage means (133) may be de-memorized for erasing and/or replacing the operative programs and functions introduced therein. 27: Remote control device according to claim 24, characterized in that said additional electronic control means (134) are connected also to at least a video signal card (136), adapted to check the flow of data being processed from said main control means (115) and transmitted to said additional electronic control means (134) and, depending on the sensed or not sensed data, adapted to warn said additional electronic control means (134) of this operative state. 28: Method for setting and carrying out a high resolution multimedial operative programs and functions for an appliance and with a remote control device according to claim 24, characterized in that said mass storage means (133) are memorized in advance with a plurality of operative programs and functions of various kind, to be carried out into the appliance referred to and/or the external electronic appliances and/or systems, which programs may be for example the Windows, Windows Media Center programs and any other operative program already existing on the market or also operative programs which might be developed in the future, as well as they may be software of any kind for personal computers and television receivers and for the most disparate applications, for example for controlling the operation of household appliances, medical appliances, photographic appliances etc., and for any application involving the use of electronic circuits with traditional or particular software, and characterized in that into the remote control device (119) there are introduced in advance, in a coded manner with specific analog and digital data, all the data of the operative programs and functions which are memorized and coded in a manner identical into said mass storage means (133), and that each desired operative program and function is selected and displayed respectively through selector keys and display means included into said remote control device (119), by generating electric pulses coded in a corresponding manner, which are transmitted to said main control means (115), through said remote control means (117) and said additional electronic control means (134), thereby memorizing said main control means (115) with the same operative programs and functions which have been selected, which are then started through said remote control device (119), under the condition in which it generates corresponding electric pulses which control, through said additional electronic control means (134), the switching on of said power supply unit (131), said main control means (115) and all the remaining electronic circuits of the appliance and/or the external electronic appliances and/or systems, and in which said additional control means (134) receive from said main control means (115) some response electric pulses, which are transmitted to said remote control device (119), by indicating into the relative displaying means the switched on and the operative state of the relative electronic appliance and/or system. 29: Method according to claim 28, characterized in that additional operative programs and functions of any kind, to be carried out into the appliance referred to and/or the external electronic appliances and/or systems, may be memorized into said mass storage means (133). 30: Method according to claim 28, characterized in that the operative programs and functions being introduced into said mass storage means (133) may be dc-memorized for erasing and/or replacing the same. | 2,400 |
7,692 | 7,692 | 15,050,478 | 2,438 | Example methods are provided for a firewall controller to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host. The method may comprise retrieving a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host; and based on the first firewall rule, generating a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance. The method may further comprise instructing the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. | 1. A method for a firewall controller to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host, the method comprising:
retrieving a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host; based on the first firewall rule, generating a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance; and instructing the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. 2. The method of claim 1, wherein the destination host implements a firewall engine configurable by the firewall controller, and prior to the retrieving the first firewall rule, the method further comprises:
receiving, from the firewall engine of the destination host, a report message reporting the destination host applying the first firewall rule to block ingress packets from a source network address; and based on the source network address, selecting the source host to be instructed to apply the second firewall rule. 3. The method of claim 1, wherein, prior to the retrieving the first firewall rule, the method further comprises:
selecting the destination virtualized computing instance; and selecting multiple source virtualized computing instances supported by at least one source host to be instructed to apply the second firewall rule. 4. The method of claim 1, wherein the generating the second firewall rule comprises:
reversing the first firewall rule to generate the second firewall rule, wherein the first firewall rule specifies a pass action to allow the ingress packet having a set of required packet fields to pass through and the second firewall rule specifies a drop action to drop the egress packet not having the set of required packet fields. 5. The method of claim 1, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a virtual network interface controller (VNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 6. The method of claim 1, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a physical network interface controller (PNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 7. The method of claim 1, wherein the source host implements a firewall engine configurable by the firewall controller and the instructing the source host comprises:
sending, to the firewall engine, a control message to configure the firewall engine to apply the second firewall rule to the egress packet at the source host. 8. A non-transitory computer-readable storage medium that includes a set of instructions which, in response to execution by a processor of a computing device capable of acting as a firewall controller, cause the processor to perform a method to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host, the method comprising:
retrieving a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host; based on the first firewall rule, generating a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance; and instructing the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. 9. The non-transitory computer-readable storage medium of claim 8, wherein the destination host implements a firewall engine configurable by the firewall controller, and prior to the retrieving the first firewall rule, the method further comprises:
receiving, from the firewall engine of the destination host, a report message reporting the destination host applying the first firewall rule to block ingress packets from a source network address; and based on the source network address, selecting the source host to be instructed to apply the second firewall rule. 10. The non-transitory computer-readable storage medium of claim 8, wherein, prior to the retrieving the first firewall rule, the method further comprises:
selecting the destination virtualized computing instance; and selecting multiple source virtualized computing instances supported by at least one source host to be instructed to apply the second firewall rule. 11. The non-transitory computer-readable storage medium of claim 8, wherein the generating the second firewall rule comprises:
reversing the first firewall rule to generate the second firewall rule, wherein the first firewall rule specifies a pass action to allow the ingress packet having a set of required packet fields to pass through and the second firewall rule specifies a drop action to drop the egress packet not having the set of required packet fields. 12. The non-transitory computer-readable storage medium of claim 8, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a virtual network interface controller (VNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 13. The non-transitory computer-readable storage medium of claim 8, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a physical network interface controller (PNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 14. The non-transitory computer-readable storage medium of claim 8, wherein the source host implements a firewall engine configurable by the firewall controller and the instructing the source host comprises:
sending, to the firewall engine, a control message to configure the firewall engine to apply the second firewall rule to the egress packet at the source host. 15. A computing device configured to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host, the computing device being capable of acting as a firewall controller, comprising:
a processor; and a non-transitory computer-readable medium having stored thereon instructions that, when executed by the processor, cause the processor to:
retrieve a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host;
based on the first firewall rule, generate a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance; and
instruct the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. 16. The computing device of claim 15, wherein the destination host implements a firewall engine configurable by the firewall controller, and prior to the retrieving the first firewall rule, the instructions further cause the processor to:
receive, from the firewall engine of the destination host, a report message reporting the destination host applying the first firewall rule to block ingress packets from a source network address; and based on the source network address, select the source host to be instructed to apply the second firewall rule. 17. The computing device of claim 15, wherein, prior to the retrieving the first firewall rule, the instructions further cause the processor to:
select the destination virtualized computing instance; and select multiple source virtualized computing instances supported by at least one source host to be instructed to apply the second firewall rule. 18. The computing device of claim 15, wherein the instructions for generating the second firewall rule further cause the processor to:
reverse the first firewall rule to generate the second firewall rule, wherein the first firewall rule specifies a pass action to allow the ingress packet having a set of required packet fields to pass through and the second firewall rule specifies a drop action to drop the egress packet not having the set of required packet fields. 19. The computing device of claim 15, wherein the instructions for generating the second firewall rule further cause the processor to:
generate the second firewall rule to be applicable at a virtual network interface controller (VNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 20. The computing device of claim 15, wherein the instructions for generating the second firewall rule further cause the processor to:
generate the second firewall rule to be applicable at a physical network interface controller (PNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 21. The computing device of claim 15, wherein the source host implements a firewall engine configurable by the firewall controller and the instructions for instructing the source host cause the processor to:
send, to the firewall engine, a control message to configure the firewall engine to apply the second firewall rule to the egress packet at the source host. | Example methods are provided for a firewall controller to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host. The method may comprise retrieving a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host; and based on the first firewall rule, generating a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance. The method may further comprise instructing the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host.1. A method for a firewall controller to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host, the method comprising:
retrieving a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host; based on the first firewall rule, generating a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance; and instructing the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. 2. The method of claim 1, wherein the destination host implements a firewall engine configurable by the firewall controller, and prior to the retrieving the first firewall rule, the method further comprises:
receiving, from the firewall engine of the destination host, a report message reporting the destination host applying the first firewall rule to block ingress packets from a source network address; and based on the source network address, selecting the source host to be instructed to apply the second firewall rule. 3. The method of claim 1, wherein, prior to the retrieving the first firewall rule, the method further comprises:
selecting the destination virtualized computing instance; and selecting multiple source virtualized computing instances supported by at least one source host to be instructed to apply the second firewall rule. 4. The method of claim 1, wherein the generating the second firewall rule comprises:
reversing the first firewall rule to generate the second firewall rule, wherein the first firewall rule specifies a pass action to allow the ingress packet having a set of required packet fields to pass through and the second firewall rule specifies a drop action to drop the egress packet not having the set of required packet fields. 5. The method of claim 1, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a virtual network interface controller (VNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 6. The method of claim 1, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a physical network interface controller (PNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 7. The method of claim 1, wherein the source host implements a firewall engine configurable by the firewall controller and the instructing the source host comprises:
sending, to the firewall engine, a control message to configure the firewall engine to apply the second firewall rule to the egress packet at the source host. 8. A non-transitory computer-readable storage medium that includes a set of instructions which, in response to execution by a processor of a computing device capable of acting as a firewall controller, cause the processor to perform a method to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host, the method comprising:
retrieving a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host; based on the first firewall rule, generating a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance; and instructing the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. 9. The non-transitory computer-readable storage medium of claim 8, wherein the destination host implements a firewall engine configurable by the firewall controller, and prior to the retrieving the first firewall rule, the method further comprises:
receiving, from the firewall engine of the destination host, a report message reporting the destination host applying the first firewall rule to block ingress packets from a source network address; and based on the source network address, selecting the source host to be instructed to apply the second firewall rule. 10. The non-transitory computer-readable storage medium of claim 8, wherein, prior to the retrieving the first firewall rule, the method further comprises:
selecting the destination virtualized computing instance; and selecting multiple source virtualized computing instances supported by at least one source host to be instructed to apply the second firewall rule. 11. The non-transitory computer-readable storage medium of claim 8, wherein the generating the second firewall rule comprises:
reversing the first firewall rule to generate the second firewall rule, wherein the first firewall rule specifies a pass action to allow the ingress packet having a set of required packet fields to pass through and the second firewall rule specifies a drop action to drop the egress packet not having the set of required packet fields. 12. The non-transitory computer-readable storage medium of claim 8, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a virtual network interface controller (VNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 13. The non-transitory computer-readable storage medium of claim 8, wherein the generating the second firewall rule comprises:
generating the second firewall rule to be applicable at a physical network interface controller (PNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 14. The non-transitory computer-readable storage medium of claim 8, wherein the source host implements a firewall engine configurable by the firewall controller and the instructing the source host comprises:
sending, to the firewall engine, a control message to configure the firewall engine to apply the second firewall rule to the egress packet at the source host. 15. A computing device configured to implement a distributed firewall in a virtualized computing environment that includes a source host and a destination host, the computing device being capable of acting as a firewall controller, comprising:
a processor; and a non-transitory computer-readable medium having stored thereon instructions that, when executed by the processor, cause the processor to:
retrieve a first firewall rule that is applicable at the destination host to an ingress packet destined for a destination virtualized computing instance supported by the destination host;
based on the first firewall rule, generate a second firewall rule that is applicable at the source host to an egress packet destined for the destination virtualized computing instance; and
instruct the source host to apply the second firewall rule to, in response to determination that the egress packet is blocked by the second firewall rule, drop the egress packet such that the egress packet is not sent from the source host to the destination host. 16. The computing device of claim 15, wherein the destination host implements a firewall engine configurable by the firewall controller, and prior to the retrieving the first firewall rule, the instructions further cause the processor to:
receive, from the firewall engine of the destination host, a report message reporting the destination host applying the first firewall rule to block ingress packets from a source network address; and based on the source network address, select the source host to be instructed to apply the second firewall rule. 17. The computing device of claim 15, wherein, prior to the retrieving the first firewall rule, the instructions further cause the processor to:
select the destination virtualized computing instance; and select multiple source virtualized computing instances supported by at least one source host to be instructed to apply the second firewall rule. 18. The computing device of claim 15, wherein the instructions for generating the second firewall rule further cause the processor to:
reverse the first firewall rule to generate the second firewall rule, wherein the first firewall rule specifies a pass action to allow the ingress packet having a set of required packet fields to pass through and the second firewall rule specifies a drop action to drop the egress packet not having the set of required packet fields. 19. The computing device of claim 15, wherein the instructions for generating the second firewall rule further cause the processor to:
generate the second firewall rule to be applicable at a virtual network interface controller (VNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 20. The computing device of claim 15, wherein the instructions for generating the second firewall rule further cause the processor to:
generate the second firewall rule to be applicable at a physical network interface controller (PNIC) via which egress packets from a source virtualized computing instance supported by the source host are sent. 21. The computing device of claim 15, wherein the source host implements a firewall engine configurable by the firewall controller and the instructions for instructing the source host cause the processor to:
send, to the firewall engine, a control message to configure the firewall engine to apply the second firewall rule to the egress packet at the source host. | 2,400 |
7,693 | 7,693 | 15,097,562 | 2,487 | System and method for improving the shaving experience by providing improved visibility of the skin shaving area. A digital camera is integrated with the electric shaver for close image capturing of shaving area, and displaying it on a display unit. The display unit can be integral part of the electric shaver casing, or housed in a separated device which receives the image via a communication channel. The communication channel can be wireless (using radio, audio or light) or wired, such as dedicated cabling or using powerline communication. A light source is used to better illuminate the shaving area. Video compression and digital image processing techniques are used for providing for improved shaving results. The wired communication medium can simultaneously be used also for carrying power from the electric shaver assembly to the display unit, or from the display unit to the electric shaver. | 1. A handheld device for capturing and displaying images and for identifying an element in the images, the device comprising:
a first digital camera for capturing a first image, the first digital camera comprising a first optical lens for focusing the received light and a first output for outputting a first digital signal carrying a representation of the first captured image; a second digital camera for capturing a second image distinct from the first image, the second digital camera comprising a second optical lens for focusing the received light and a second output for outputting a second digital signal carrying a representation of the second captured image; a multiplexer coupled to the first and second outputs for producing multiplexing the first and second digital signals to produce a multiplexed signal; a port for coupling to a communication medium; a transmitter coupled between the port and the multiplexer for transmitting the multiplexed signal to the communication medium; a digital image processor coupled to the digital cameras for receiving the digital signals for receiving and processing the captured images; a rechargeable battery coupled to power the digital cameras, the digital image processor, and the multiplexer; and a single portable and handheld casing housing the digital cameras, the digital image processor, and the multiplexer, wherein the casing comprises two opposed first and second exterior surfaces, the first optical lens is attached to the first surface and the second optical lens is attached to the second surface, and wherein the digital image processor is operative to identify the element in the captured images using pattern recognition. 2. The device according to claim 1 wherein the multiplexer is an FDM (Frequency Domain/Division Multiplexer) multiplexer, whereby the first and second digital signals are respectively carried over distinct first and second frequency bands, and wherein the FDM multiplexer further comprising a first filter for substantially passing only the first frequency band and a second filter for substantially passing only the second frequency band. 3. The device according to claim 1 wherein the multiplexer is a TDM (Time Domain/Division Multiplexer) multiplexer. 4. The device according to claim 1 further operative to compress the captured image representation, the device further comprising a video compressor coupled between the first digital camera and the transmitter for compressing the first captured image representation. 5. The device according to claim 4, wherein the compression is based on intraframe or interframe compression, and wherein the compression is lossy or non-lossy. 6. The device according to claim 4, wherein the compression is according to, or based on, a standard compression algorithm which is one out of JPEG (Joint Photographic Experts Group) and MPEG (Moving Picture Experts Group), ITU-T H.261, ITU-T H.263, ITU-T H.264, and ITU-T CCIR 601. 7. The device according to claim 1 further operative for free air propagation of the captured image representations using over-the-air electromagnetic radio-frequency waves wireless communication, wherein the port is an antenna for transmitting a wireless signal over the air, and the transmitter is a wireless transmitter coupled between the antenna and the digital camera for transmitting the wireless signal. 8. The device according to claim 7, wherein the wireless communication and the wireless signal are according to, or based on, standard (W)PAN (Wireless Personal Area Network), the antenna is a WPAN antenna and the wireless transmitter is a WPAN transmitter. 9. The device according to claim 8, wherein the wireless communication and the wireless signal substantially conform to, or based on, ZigBee according to IEEE 802.15.4 standard, Bluetooth according to IEEE 802.15.1 standard, or UWB (Ultra-WideBand) according to IEEE 802.15.3 standard. 10. The device according to claim 7, wherein the wireless communication is using an unlicensed frequency band. 11. The device according to claim 10, wherein the wireless communication and the wireless signal are according to, or based on, standard WLAN (Wireless Local Area Network), the antenna is a WLAN antenna and the wireless transmitter is a WLAN transmitter. 12. The device according to claim 10, wherein the wireless communication and the wireless signal substantially conforms to, or based on, IEEE 802.11 standard, and is using an Industrial, Scientific and Medical (ISM) frequency spectrum band. 13. The device according to claim 7, wherein the wireless communication and the wireless signal are according to, or based on, cellular communication, the antenna is a cellular antenna and the wireless transmitter is a cellular transmitter, and the wireless communication is using a licensed frequency band. 14. The device according to claim 13, wherein the wireless communication and the wireless signal substantially conforms to, or based on, 2.5G or 3G, and wherein the device is part of a cellular telephone handset. 15. The device according to claim 13, wherein the wireless communication and the wireless signal substantially conforms to, or based on, GSM (Global System for Mobile Communications), 3GSM, GPRS (General Packet Radio Service), CDMA (Code Division Multiple Access), EDGE (Enhanced Data Rates for GSM Evolution), Digital AMPS according to IS-136/TDMA, iDEN (Integrated Digital Enhanced Network), EVDO (Evolution Data Only), UMTS, DCS, or PCS. 16. The device according to claim 7, wherein the wireless communication and the wireless signal are according to, or based on, WMAN, WAN, BWA, LMDS, MMDS, WiMAX, HIPERMAN, or IEEE 802.16. 17. The device according to claim 7, wherein the wireless communication is based on a continuous 7 GHz bandwidth around a 60 GHz radio frequency. 18. The device according to claim 17, wherein the wireless communication and the wireless signal are according to, or based on, WirelessHD™ standard. 19. The device according to claim 1 wherein the communication medium is a cable and the port is a connector for connecting to the cable, and the transmitter is a wired transmitter coupled between the connector and the digital cameras for serial digital data transmission to the cable. 20. The device according to claim 19 wherein the communication over a cable is according to, or based on, a LAN (Local area Network) standard. 21. The device according to claim 20 wherein the cable is a LAN cable according to, or based on, EIA/TIA-568 or EIA/TIA-570 and comprising UTP or STP twisted-pairs, wherein the connector is RJ-45 type, wherein the communication over the cable conforms to, or is based on, IEEE802.3 Ethernet 10BaseT, 100BaseTX, or 1000BaseT, and wherein the wired transmitter is a LAN transceiver. 22. The device according to claim 19 wherein the communication over the cable, the wired transmitter, and the connector conform to, or are based on, IEEE1394, EIA/TIA-232, or USB (Universal Serial Bus) standards. 23. The device according to claim 19 wherein the cable further concurrently carries a power signal, and wherein the device is at least in part powered from the power signal or wherein the device is operative to supply at least part of the power signal. 24. The device according to claim 23 further comprising a battery charger connected to charge the rechargeable battery, and wherein the battery charger is coupled to the connector for being powered from the power signal. 25. The device according to claim 23 wherein the rechargeable battery is coupled to the connector for the cable to further concurrently carry a DC (Direct Current) power signal. 26. The device according to claim 23 wherein the cable comprises multiple insulated wires, and wherein the power signal is carried over dedicated wires distinct from the wires carrying the captured image representation. 27. The device according to claim 26 wherein the power signal is a DC power signal, the connector is a USB (Universal Serial Bus) connector, and the communication is according to, or based on, the USB standard. 28. The device according to claim 23 wherein the cable comprises multiple insulated wires, and wherein the same wires are used to simultaneously carry the power signal and the captured image representation. 29. The device according to claim 28 wherein the power signal is a DC power signal carried over a phantom channel over the wires. 30. The device according to claim 28 wherein the cable is a LAN cable and the power signal is a DC power signal, and wherein the power signal is carried over the LAN cable according to, or based on, IEEE802.3af or IEEE802.3at standards. 31. The device according to claim 28 wherein the power and digital data signals are carried over the same wires using Frequency Division Multiplexing (FDM), whereby the power signal is carried over a power frequency, and wherein the communication signal is carried over a communication frequency band distinct and above the power frequency, and wherein the device further comprising a low pass filter coupled to the connector for substantially passing only the power frequency, and an high pass filter coupled between the connector and the wired transmitter for substantially passing only the communication frequency band. 32. The device according to claim 28 wherein the cable is AC power wiring and the power signal is AC power signal, wherein the connector is AC power plug and the wired transmitter is part of a powerline modem. 33. The device according to claim 32 wherein the powerline modem and the communication over the AC power wiring conform to, or are based on, HomePlug or UPB standards. 34. The device according to claim 1, wherein the first digital camera is operative for capturing an image in a non-visible spectrum. 35. The device according to claim 34, wherein the non-visible spectrum is in an infrared or ultraviolet spectrum. 36. The device according to claim 1 further operative for body care of a human body part. 37. The device according to claim 36 wherein the body part is a human skin and the body care consists of hair removal, and the device further comprising in the casing a shaver for removing hair from the human skin. 38. The device according to claim 37 wherein the shaver is an electrically operated shaver comprising an electric motor and a cutter driven by the electric motor. 39. The device according to claim 36 wherein the body part is a human mouth and the body care consists of oral hygiene, and the device further comprising in the casing a toothbrush for brushing teeth or gums. 40. The device according to claim 39 wherein the toothbrush is an electrically operated toothbrush comprising an electric motor. 41. The device according to claim 1 wherein the digital image processor is operative to identify plurality of elements in the captured images. 42. The device according to claim 41 wherein the plurality of elements have a same characteristic. 43. The device according to claim 42 wherein the plurality of elements are of the same type. 44. The device according to claim 1 wherein the captured images include a part of a human body. 45. The device according to claim 44 wherein the captured image includes part of a human skin. 46. The device according to claim 45 wherein the digital image processor is operative to identify individual hairs or a hairy area in the captured images. 47. The device according to claim 1 wherein the digital image processor is operative to identify one or more elements in the captured image, and wherein the device is further operative to generate a digital data representation of the captured images wherein all the identified elements are marked. 48. The device according to claim 1 further comprising a display having a flat screen for visually displaying the captured images, wherein the display is housed in the single handheld casing or attached thereto. 49. The device according to claim 48, wherein the display is foldable. 50. The device according to claim 1 for use with a display external to the housing, wherein the display is couplable to the digital image processor for displaying marked identified elements. 51. The device according to claim 1 wherein the digital image processor comprises software and a processor for executing the software. 52. The device according to claim 51 wherein the digital image processor further operative for at least one out of: adjusting color balance, gamma or luminance; filtering pattern noise; filtering noise using Wiener filter; zooming; changing zoom factors; recropping; applying enhancement filters; applying smoothing filters; applying subject-dependent filters; applying coordinate transformations; and applying mathematical algorithms to generate greater pixel density, adjusting color balance, contrast and/or luminance. 53. The device according to claim 1 further comprising a light source in the casing for providing an illumination. 54. The device according to claim 53 wherein the each of the first and second digital cameras comprises a photosensitive image sensor array disposed approximately at an image focal point plane of the optical lenses. 55. The device according to claim 1 wherein each of the digital cameras is a digital video camera further comprising a processor for generating a digital data video signal carrying digital video data comprising the captured image according to a digital video format. 56. The device according to claim 55 wherein the digital video format is according to, or based on, one out of: TIFF (Tagged Image File Format), RAW format, AVI, DV, MOV, WMV, MP4, DCF (Design Rule for Camera Format), ITU-T H.261, ITU-T H.263, ITU-T H.264, ITU-T CCIR 601, ASF, Exif (Exchangeable Image File Format), and DP*OF (Digital Print Order Format) standards. 57. The device according to claim 1 further comprising a digital data connector connectable to an external digital display, the digital data connector is coupled to the digital cameras for displaying a visual image based on the captured images on the external digital display. 58. The device according to claim 57 wherein the digital data connector and the communication with the external digital display is substantially according to, or based on, one or more out of USB (Universal Serial Bus), SDI (Serial Digital Interface), FireWire, HDMI (High-Definition Multimedia Interface), DVI (Digital Visual Interface), UDI (Unified Display Interface), DisplayPort, Digital Component Video, and DVB standards. | System and method for improving the shaving experience by providing improved visibility of the skin shaving area. A digital camera is integrated with the electric shaver for close image capturing of shaving area, and displaying it on a display unit. The display unit can be integral part of the electric shaver casing, or housed in a separated device which receives the image via a communication channel. The communication channel can be wireless (using radio, audio or light) or wired, such as dedicated cabling or using powerline communication. A light source is used to better illuminate the shaving area. Video compression and digital image processing techniques are used for providing for improved shaving results. The wired communication medium can simultaneously be used also for carrying power from the electric shaver assembly to the display unit, or from the display unit to the electric shaver.1. A handheld device for capturing and displaying images and for identifying an element in the images, the device comprising:
a first digital camera for capturing a first image, the first digital camera comprising a first optical lens for focusing the received light and a first output for outputting a first digital signal carrying a representation of the first captured image; a second digital camera for capturing a second image distinct from the first image, the second digital camera comprising a second optical lens for focusing the received light and a second output for outputting a second digital signal carrying a representation of the second captured image; a multiplexer coupled to the first and second outputs for producing multiplexing the first and second digital signals to produce a multiplexed signal; a port for coupling to a communication medium; a transmitter coupled between the port and the multiplexer for transmitting the multiplexed signal to the communication medium; a digital image processor coupled to the digital cameras for receiving the digital signals for receiving and processing the captured images; a rechargeable battery coupled to power the digital cameras, the digital image processor, and the multiplexer; and a single portable and handheld casing housing the digital cameras, the digital image processor, and the multiplexer, wherein the casing comprises two opposed first and second exterior surfaces, the first optical lens is attached to the first surface and the second optical lens is attached to the second surface, and wherein the digital image processor is operative to identify the element in the captured images using pattern recognition. 2. The device according to claim 1 wherein the multiplexer is an FDM (Frequency Domain/Division Multiplexer) multiplexer, whereby the first and second digital signals are respectively carried over distinct first and second frequency bands, and wherein the FDM multiplexer further comprising a first filter for substantially passing only the first frequency band and a second filter for substantially passing only the second frequency band. 3. The device according to claim 1 wherein the multiplexer is a TDM (Time Domain/Division Multiplexer) multiplexer. 4. The device according to claim 1 further operative to compress the captured image representation, the device further comprising a video compressor coupled between the first digital camera and the transmitter for compressing the first captured image representation. 5. The device according to claim 4, wherein the compression is based on intraframe or interframe compression, and wherein the compression is lossy or non-lossy. 6. The device according to claim 4, wherein the compression is according to, or based on, a standard compression algorithm which is one out of JPEG (Joint Photographic Experts Group) and MPEG (Moving Picture Experts Group), ITU-T H.261, ITU-T H.263, ITU-T H.264, and ITU-T CCIR 601. 7. The device according to claim 1 further operative for free air propagation of the captured image representations using over-the-air electromagnetic radio-frequency waves wireless communication, wherein the port is an antenna for transmitting a wireless signal over the air, and the transmitter is a wireless transmitter coupled between the antenna and the digital camera for transmitting the wireless signal. 8. The device according to claim 7, wherein the wireless communication and the wireless signal are according to, or based on, standard (W)PAN (Wireless Personal Area Network), the antenna is a WPAN antenna and the wireless transmitter is a WPAN transmitter. 9. The device according to claim 8, wherein the wireless communication and the wireless signal substantially conform to, or based on, ZigBee according to IEEE 802.15.4 standard, Bluetooth according to IEEE 802.15.1 standard, or UWB (Ultra-WideBand) according to IEEE 802.15.3 standard. 10. The device according to claim 7, wherein the wireless communication is using an unlicensed frequency band. 11. The device according to claim 10, wherein the wireless communication and the wireless signal are according to, or based on, standard WLAN (Wireless Local Area Network), the antenna is a WLAN antenna and the wireless transmitter is a WLAN transmitter. 12. The device according to claim 10, wherein the wireless communication and the wireless signal substantially conforms to, or based on, IEEE 802.11 standard, and is using an Industrial, Scientific and Medical (ISM) frequency spectrum band. 13. The device according to claim 7, wherein the wireless communication and the wireless signal are according to, or based on, cellular communication, the antenna is a cellular antenna and the wireless transmitter is a cellular transmitter, and the wireless communication is using a licensed frequency band. 14. The device according to claim 13, wherein the wireless communication and the wireless signal substantially conforms to, or based on, 2.5G or 3G, and wherein the device is part of a cellular telephone handset. 15. The device according to claim 13, wherein the wireless communication and the wireless signal substantially conforms to, or based on, GSM (Global System for Mobile Communications), 3GSM, GPRS (General Packet Radio Service), CDMA (Code Division Multiple Access), EDGE (Enhanced Data Rates for GSM Evolution), Digital AMPS according to IS-136/TDMA, iDEN (Integrated Digital Enhanced Network), EVDO (Evolution Data Only), UMTS, DCS, or PCS. 16. The device according to claim 7, wherein the wireless communication and the wireless signal are according to, or based on, WMAN, WAN, BWA, LMDS, MMDS, WiMAX, HIPERMAN, or IEEE 802.16. 17. The device according to claim 7, wherein the wireless communication is based on a continuous 7 GHz bandwidth around a 60 GHz radio frequency. 18. The device according to claim 17, wherein the wireless communication and the wireless signal are according to, or based on, WirelessHD™ standard. 19. The device according to claim 1 wherein the communication medium is a cable and the port is a connector for connecting to the cable, and the transmitter is a wired transmitter coupled between the connector and the digital cameras for serial digital data transmission to the cable. 20. The device according to claim 19 wherein the communication over a cable is according to, or based on, a LAN (Local area Network) standard. 21. The device according to claim 20 wherein the cable is a LAN cable according to, or based on, EIA/TIA-568 or EIA/TIA-570 and comprising UTP or STP twisted-pairs, wherein the connector is RJ-45 type, wherein the communication over the cable conforms to, or is based on, IEEE802.3 Ethernet 10BaseT, 100BaseTX, or 1000BaseT, and wherein the wired transmitter is a LAN transceiver. 22. The device according to claim 19 wherein the communication over the cable, the wired transmitter, and the connector conform to, or are based on, IEEE1394, EIA/TIA-232, or USB (Universal Serial Bus) standards. 23. The device according to claim 19 wherein the cable further concurrently carries a power signal, and wherein the device is at least in part powered from the power signal or wherein the device is operative to supply at least part of the power signal. 24. The device according to claim 23 further comprising a battery charger connected to charge the rechargeable battery, and wherein the battery charger is coupled to the connector for being powered from the power signal. 25. The device according to claim 23 wherein the rechargeable battery is coupled to the connector for the cable to further concurrently carry a DC (Direct Current) power signal. 26. The device according to claim 23 wherein the cable comprises multiple insulated wires, and wherein the power signal is carried over dedicated wires distinct from the wires carrying the captured image representation. 27. The device according to claim 26 wherein the power signal is a DC power signal, the connector is a USB (Universal Serial Bus) connector, and the communication is according to, or based on, the USB standard. 28. The device according to claim 23 wherein the cable comprises multiple insulated wires, and wherein the same wires are used to simultaneously carry the power signal and the captured image representation. 29. The device according to claim 28 wherein the power signal is a DC power signal carried over a phantom channel over the wires. 30. The device according to claim 28 wherein the cable is a LAN cable and the power signal is a DC power signal, and wherein the power signal is carried over the LAN cable according to, or based on, IEEE802.3af or IEEE802.3at standards. 31. The device according to claim 28 wherein the power and digital data signals are carried over the same wires using Frequency Division Multiplexing (FDM), whereby the power signal is carried over a power frequency, and wherein the communication signal is carried over a communication frequency band distinct and above the power frequency, and wherein the device further comprising a low pass filter coupled to the connector for substantially passing only the power frequency, and an high pass filter coupled between the connector and the wired transmitter for substantially passing only the communication frequency band. 32. The device according to claim 28 wherein the cable is AC power wiring and the power signal is AC power signal, wherein the connector is AC power plug and the wired transmitter is part of a powerline modem. 33. The device according to claim 32 wherein the powerline modem and the communication over the AC power wiring conform to, or are based on, HomePlug or UPB standards. 34. The device according to claim 1, wherein the first digital camera is operative for capturing an image in a non-visible spectrum. 35. The device according to claim 34, wherein the non-visible spectrum is in an infrared or ultraviolet spectrum. 36. The device according to claim 1 further operative for body care of a human body part. 37. The device according to claim 36 wherein the body part is a human skin and the body care consists of hair removal, and the device further comprising in the casing a shaver for removing hair from the human skin. 38. The device according to claim 37 wherein the shaver is an electrically operated shaver comprising an electric motor and a cutter driven by the electric motor. 39. The device according to claim 36 wherein the body part is a human mouth and the body care consists of oral hygiene, and the device further comprising in the casing a toothbrush for brushing teeth or gums. 40. The device according to claim 39 wherein the toothbrush is an electrically operated toothbrush comprising an electric motor. 41. The device according to claim 1 wherein the digital image processor is operative to identify plurality of elements in the captured images. 42. The device according to claim 41 wherein the plurality of elements have a same characteristic. 43. The device according to claim 42 wherein the plurality of elements are of the same type. 44. The device according to claim 1 wherein the captured images include a part of a human body. 45. The device according to claim 44 wherein the captured image includes part of a human skin. 46. The device according to claim 45 wherein the digital image processor is operative to identify individual hairs or a hairy area in the captured images. 47. The device according to claim 1 wherein the digital image processor is operative to identify one or more elements in the captured image, and wherein the device is further operative to generate a digital data representation of the captured images wherein all the identified elements are marked. 48. The device according to claim 1 further comprising a display having a flat screen for visually displaying the captured images, wherein the display is housed in the single handheld casing or attached thereto. 49. The device according to claim 48, wherein the display is foldable. 50. The device according to claim 1 for use with a display external to the housing, wherein the display is couplable to the digital image processor for displaying marked identified elements. 51. The device according to claim 1 wherein the digital image processor comprises software and a processor for executing the software. 52. The device according to claim 51 wherein the digital image processor further operative for at least one out of: adjusting color balance, gamma or luminance; filtering pattern noise; filtering noise using Wiener filter; zooming; changing zoom factors; recropping; applying enhancement filters; applying smoothing filters; applying subject-dependent filters; applying coordinate transformations; and applying mathematical algorithms to generate greater pixel density, adjusting color balance, contrast and/or luminance. 53. The device according to claim 1 further comprising a light source in the casing for providing an illumination. 54. The device according to claim 53 wherein the each of the first and second digital cameras comprises a photosensitive image sensor array disposed approximately at an image focal point plane of the optical lenses. 55. The device according to claim 1 wherein each of the digital cameras is a digital video camera further comprising a processor for generating a digital data video signal carrying digital video data comprising the captured image according to a digital video format. 56. The device according to claim 55 wherein the digital video format is according to, or based on, one out of: TIFF (Tagged Image File Format), RAW format, AVI, DV, MOV, WMV, MP4, DCF (Design Rule for Camera Format), ITU-T H.261, ITU-T H.263, ITU-T H.264, ITU-T CCIR 601, ASF, Exif (Exchangeable Image File Format), and DP*OF (Digital Print Order Format) standards. 57. The device according to claim 1 further comprising a digital data connector connectable to an external digital display, the digital data connector is coupled to the digital cameras for displaying a visual image based on the captured images on the external digital display. 58. The device according to claim 57 wherein the digital data connector and the communication with the external digital display is substantially according to, or based on, one or more out of USB (Universal Serial Bus), SDI (Serial Digital Interface), FireWire, HDMI (High-Definition Multimedia Interface), DVI (Digital Visual Interface), UDI (Unified Display Interface), DisplayPort, Digital Component Video, and DVB standards. | 2,400 |
7,694 | 7,694 | 13,291,142 | 2,465 | Certain aspects of the present disclosure propose a method to transmit information in unused fields of a physical layer header to improve performance of the system. The proposed method transmits, during single user transmission, a portion of the basic service set identifier (BSSID) of an access point in a field of a header that is usually used to indicate number of space time streams (Nsts). | 1. An apparatus for wireless communications, comprising:
circuit configured to generate a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and a transmitter configured to transmit the first message. 2. The apparatus of claim 1, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 3. The apparatus of claim 1, further comprising:
a receiver configured to receive a second message comprising a field, wherein the field comprises a portion of an association identifier (AID) if the second message is transmitted utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if the second message is transmitted utilizing a multi-user transmission scheme. 4. The apparatus of claim 3, further comprising:
circuit configured to compare the received AID with an AID associated with the apparatus; and circuit configured to discard the second message if the received AID is different from the AID associated with the apparatus. 5. A method for wireless communications, comprising:
generating a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and transmitting the first message. 6. The method of claim 5, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 7. The method of claim 5, further comprising:
receiving a second message comprising a field, wherein the field comprises a portion of an association identifier (AID) if the second message is transmitted utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if the second message is transmitted utilizing a multi-user transmission scheme. 8. The method of claim 7, further comprising:
comparing the received AID with an AID associated with an apparatus; and discarding the second message if the received AID is different from the AID associated with the apparatus. 9. An apparatus for wireless communications, comprising:
means for generating a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and means for transmitting the first message. 10. The apparatus of claim 9, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 11. The apparatus of claim 9, further comprising:
means for receiving a second message comprising a field, wherein the field comprises a portion of an association identifier (AID) if the second message is transmitted utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if the second message is transmitted utilizing a multi-user transmission scheme. 12. The apparatus of claim 11, further comprising:
means for comparing the received AID with an AID associated with the apparatus; and means for discarding the second message if the received AID is different from the AID associated with the apparatus. 13. A computer-program product for wireless communications, comprising a computer-readable medium comprising instructions executable to:
generate a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and transmit the first message. 14. An access terminal, comprising:
at least one antenna; circuit configured to generate a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and a transmitter configured to transmit, via the at least one antenna, the first message. 15. An apparatus for wireless communications, comprising:
circuit configured to assign one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of the apparatus; and circuit configured to notify the one or more apparatuses of the assigned AIDs. 16. The apparatus of claim 15, further comprising:
a transmitter configured to transmit a first message comprising a field, wherein the field comprises a portion of an AID if utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if utilizing a multi-user transmission scheme. 17. The apparatus of claim 15, further comprising:
a receiver configured to receive a second message comprising a field, wherein the field comprises the portion of the BSSID if the second message is transmitted utilizing a single-user transmission scheme, or an indication of a number of space time streams (Nsts) if the first message is transmitted utilizing a multi-user transmission scheme. 18. The apparatus of claim 15, wherein the one or more AIDs are different from one or more BSSIDs of neighboring apparatuses. 19. The apparatus of claim 15, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 20. A method for wireless communications, comprising:
assigning one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of an apparatus; and notifying the one or more apparatuses of the assigned AIDs. 21. The method of claim 20, further comprising:
transmitting a first message comprising a field, wherein the field comprises a portion of an AID if utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if utilizing a multi-user transmission scheme. 22. The method of claim 20, further comprising:
receiving a second message comprising a field, wherein the field comprises the portion of the BSSID if the second message is transmitted utilizing a single-user transmission scheme, or an indication of a number of space time streams (Nsts) if the first message is transmitted utilizing a multi-user transmission scheme. 23. The method of claim 20, wherein the one or more AIDs are different from one or more BSSIDs of neighboring apparatuses. 24. The method of claim 20, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 25. An apparatus for wireless communications, comprising:
means for assigning one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of an apparatus; and means for notifying the one or more apparatuses of the assigned AIDs. 26. The apparatus of claim 25, further comprising:
means for transmitting a first message comprising a field, wherein the field comprises a portion of an AID if utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if utilizing a multi-user transmission scheme. 27. The apparatus of claim 25, further comprising:
means for receiving a second message comprising a field, wherein the field comprises the portion of the BSSID if the second message is transmitted utilizing a single-user transmission scheme, or an indication of a number of space time streams (Nsts) if the first message is transmitted utilizing a multi-user transmission scheme. 28. The apparatus of claim 25, wherein the one or more AIDs are different from one or more BSSIDs of neighboring apparatuses. 29. The apparatus of claim 25, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 30. A computer-program product for wireless communications, comprising a computer-readable medium comprising instructions executable to:
assign one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of the apparatus; and notify the one or more apparatuses of the assigned AIDs. 31. An access point, comprising:
A plurality of antennas; circuit configured to assign one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of the apparatus; and circuit configured to notify, via the plurality of antennas, the one or more apparatuses of the assigned AIDs. | Certain aspects of the present disclosure propose a method to transmit information in unused fields of a physical layer header to improve performance of the system. The proposed method transmits, during single user transmission, a portion of the basic service set identifier (BSSID) of an access point in a field of a header that is usually used to indicate number of space time streams (Nsts).1. An apparatus for wireless communications, comprising:
circuit configured to generate a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and a transmitter configured to transmit the first message. 2. The apparatus of claim 1, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 3. The apparatus of claim 1, further comprising:
a receiver configured to receive a second message comprising a field, wherein the field comprises a portion of an association identifier (AID) if the second message is transmitted utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if the second message is transmitted utilizing a multi-user transmission scheme. 4. The apparatus of claim 3, further comprising:
circuit configured to compare the received AID with an AID associated with the apparatus; and circuit configured to discard the second message if the received AID is different from the AID associated with the apparatus. 5. A method for wireless communications, comprising:
generating a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and transmitting the first message. 6. The method of claim 5, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 7. The method of claim 5, further comprising:
receiving a second message comprising a field, wherein the field comprises a portion of an association identifier (AID) if the second message is transmitted utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if the second message is transmitted utilizing a multi-user transmission scheme. 8. The method of claim 7, further comprising:
comparing the received AID with an AID associated with an apparatus; and discarding the second message if the received AID is different from the AID associated with the apparatus. 9. An apparatus for wireless communications, comprising:
means for generating a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and means for transmitting the first message. 10. The apparatus of claim 9, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 11. The apparatus of claim 9, further comprising:
means for receiving a second message comprising a field, wherein the field comprises a portion of an association identifier (AID) if the second message is transmitted utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if the second message is transmitted utilizing a multi-user transmission scheme. 12. The apparatus of claim 11, further comprising:
means for comparing the received AID with an AID associated with the apparatus; and means for discarding the second message if the received AID is different from the AID associated with the apparatus. 13. A computer-program product for wireless communications, comprising a computer-readable medium comprising instructions executable to:
generate a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and transmit the first message. 14. An access terminal, comprising:
at least one antenna; circuit configured to generate a first message comprising a field, wherein the field comprises a portion of a basic service set identifier (BSSID) if used in a single-user transmission scheme, or an indication of a number of space time streams if used in a multi-user transmission scheme; and a transmitter configured to transmit, via the at least one antenna, the first message. 15. An apparatus for wireless communications, comprising:
circuit configured to assign one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of the apparatus; and circuit configured to notify the one or more apparatuses of the assigned AIDs. 16. The apparatus of claim 15, further comprising:
a transmitter configured to transmit a first message comprising a field, wherein the field comprises a portion of an AID if utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if utilizing a multi-user transmission scheme. 17. The apparatus of claim 15, further comprising:
a receiver configured to receive a second message comprising a field, wherein the field comprises the portion of the BSSID if the second message is transmitted utilizing a single-user transmission scheme, or an indication of a number of space time streams (Nsts) if the first message is transmitted utilizing a multi-user transmission scheme. 18. The apparatus of claim 15, wherein the one or more AIDs are different from one or more BSSIDs of neighboring apparatuses. 19. The apparatus of claim 15, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 20. A method for wireless communications, comprising:
assigning one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of an apparatus; and notifying the one or more apparatuses of the assigned AIDs. 21. The method of claim 20, further comprising:
transmitting a first message comprising a field, wherein the field comprises a portion of an AID if utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if utilizing a multi-user transmission scheme. 22. The method of claim 20, further comprising:
receiving a second message comprising a field, wherein the field comprises the portion of the BSSID if the second message is transmitted utilizing a single-user transmission scheme, or an indication of a number of space time streams (Nsts) if the first message is transmitted utilizing a multi-user transmission scheme. 23. The method of claim 20, wherein the one or more AIDs are different from one or more BSSIDs of neighboring apparatuses. 24. The method of claim 20, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 25. An apparatus for wireless communications, comprising:
means for assigning one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of an apparatus; and means for notifying the one or more apparatuses of the assigned AIDs. 26. The apparatus of claim 25, further comprising:
means for transmitting a first message comprising a field, wherein the field comprises a portion of an AID if utilizing a single-user transmission scheme, or an indication of number of space time streams (Nsts) if utilizing a multi-user transmission scheme. 27. The apparatus of claim 25, further comprising:
means for receiving a second message comprising a field, wherein the field comprises the portion of the BSSID if the second message is transmitted utilizing a single-user transmission scheme, or an indication of a number of space time streams (Nsts) if the first message is transmitted utilizing a multi-user transmission scheme. 28. The apparatus of claim 25, wherein the one or more AIDs are different from one or more BSSIDs of neighboring apparatuses. 29. The apparatus of claim 25, wherein the portion of the BSSID comprises a plurality of least significant bits of the BSSID. 30. A computer-program product for wireless communications, comprising a computer-readable medium comprising instructions executable to:
assign one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of the apparatus; and notify the one or more apparatuses of the assigned AIDs. 31. An access point, comprising:
A plurality of antennas; circuit configured to assign one or more association identifiers (AIDs) to one or more apparatuses, wherein the one or more AIDs are different from a portion of the basic service set identifier (BSSID) of the apparatus; and circuit configured to notify, via the plurality of antennas, the one or more apparatuses of the assigned AIDs. | 2,400 |
7,695 | 7,695 | 14,501,941 | 2,484 | Systems and methods for enabling playback control functions of a media player are disclosed. For example, a user of a client device receiving streaming playback of a video stream may perform rewind and fast forward control functions. The client device may implement these playback control functions by retrieving an enhanced playback segment. Using the enhanced playback segment, the media player may display selected frames at a predetermined interval while maintaining a visual cadence that is pleasing to a viewer. In the described embodiments, a client device may render a video stream, receive a command to control a fast forward or rewind playback mode for the video stream, and retrieve, from a distribution server or associated edge cache, one or more enhanced playback segments adapted to implement the user command. | 1. A method of rendering a media asset at a media player, comprising:
during a normal playback mode, retrieving from a media source a plurality of transmission segments that contain coded video data of the media asset, the coded video data representing frames of asset content at a first temporal spacing; during an enhanced playback mode, retrieving from the media source at least one transmission segment that contains coded video data of the media asset, the coded video data representing frames of asset content at a second temporal spacing larger than the first, wherein all frames of the transmission segment are coded by intra-coding; decoding the coded video data of the retrieved segments; and rendering the decoded video data on a display of the media player. 2. (canceled) 3. (canceled) 4. The method of claim 1, wherein the first transmission segment downloaded during the enhanced playback mode is identified based on a portion of the media asset that was being rendered in normal playback mode when the enhanced playback mode was engaged. 5. The method of claim 1, further comprising
toggling between the normal playback mode and the enhanced playback mode in response to operator commands, wherein, on each toggling between playback modes, a next transmission segment to be retrieved is identified based on a portion of the media asset that was being rendered when the toggling occurred. 6. The method of claim 1, wherein the second temporal spacing is at least double the first temporal spacing. 7. (canceled) 8. (canceled) 9. The method of claim 1, wherein all frames of the transmission segment are selected from the plurality of transmission segments. 10. The method of claim 1, wherein the transmission segment is generated by re-encoding the plurality of transmission segments using only intra-coding at a reduced frame rate. 11. A non-transitory computer readable medium storing a media streaming application having playback control functions, the media streaming application executable by at least one processing system, the media streaming application comprising instructions for:
during a normal playback mode, retrieving from a media source a plurality of transmission segments that contain coded video data of the media asset, the coded video data representing frames of asset content at a first temporal spacing; during an enhanced playback mode, retrieving from the media source at least one transmission segment that contains coded video data of the media asset, the coded video data representing frames of asset content at a second temporal spacing larger than the first, wherein all frames of the transmission segment are coded by intra-coding; decoding the coded video data of the retrieved segments; and rendering the decoded video data on a display of the media player. 12. The non-transitory computer readable medium of claim 11, wherein the enhanced playback mode is initiated in response to a user command to enter a fast forward playback mode. 13. The non-transitory computer readable medium of claim 11, wherein the enhanced playback mode is initiated in response to a user command to enter a rewind playback mode. 14. The non-transitory computer readable medium of claim 11, wherein the first transmission segment downloaded during the enhanced playback mode is identified based on a portion of the media asset that was being rendered in normal playback mode when the enhanced playback mode was engaged. 15. The non-transitory computer readable medium of claim 11, further comprising
toggling between the normal playback mode and the enhanced playback mode in response to operator commands, wherein, on each toggling between playback modes, a next transmission segment to be retrieved is identified based on a portion of the media asset that was being rendered when the toggling occurred. 16. (canceled) 17. (canceled) 18. (canceled) 19. The non-transitory computer readable medium of claim 11, wherein all frames of the transmission segment are selected from the plurality of transmission segments. 20. The non-transitory computer readable medium of claim 11, wherein the transmission segment is generated by re-encoding the plurality of transmission segments using only intra-coding at a reduced frame rate. 21. A electronic device comprising:
a processing system; memory storing one or more programs for execution by the processing system, the one or more programs including instructions for: during a normal playback mode, retrieving from a media source a plurality of transmission segments that contain coded video data of the media asset, the coded video data representing frames of asset content at a first temporal spacing; during an enhanced playback mode, retrieving from the media source at least one transmission segment that contains coded video data of the media asset, the coded video data representing frames of asset content at a second temporal spacing larger than the first, wherein all frames of the transmission segment are coded by intra-coding; decoding the coded video data of the retrieved segments; and rendering the decoded video data on a display of the media player. 22. (canceled) 23. (canceled) 24. The electronic device of claim 21, wherein the first transmission segment downloaded during the enhanced playback mode is identified based on a portion of the media asset that was being rendered in normal playback mode when the enhanced playback mode was engaged. 25. The electronic device of claim 21, further comprising
toggling between the normal playback mode and the enhanced playback mode in response to operator commands, wherein, on each toggling between playback modes, a next transmission segment to be retrieved is identified based on a portion of the media asset that was being rendered when the toggling occurred. 26. (canceled) 27. The electronic device of claim 21, wherein the second temporal spacing is at least four times the first temporal spacing. 28. The electronic device of claim 21, wherein the second temporal spacing is at least eight times the first temporal spacing. 29. The electronic device of claim 21, wherein all frames of the transmission segment are selected from the plurality of transmission segments. 30. The electronic device of claim 21, wherein the transmission segment is generated by re-encoding the plurality of transmission segments using only intra-coding at a reduced frame rate. 31. (canceled) | Systems and methods for enabling playback control functions of a media player are disclosed. For example, a user of a client device receiving streaming playback of a video stream may perform rewind and fast forward control functions. The client device may implement these playback control functions by retrieving an enhanced playback segment. Using the enhanced playback segment, the media player may display selected frames at a predetermined interval while maintaining a visual cadence that is pleasing to a viewer. In the described embodiments, a client device may render a video stream, receive a command to control a fast forward or rewind playback mode for the video stream, and retrieve, from a distribution server or associated edge cache, one or more enhanced playback segments adapted to implement the user command.1. A method of rendering a media asset at a media player, comprising:
during a normal playback mode, retrieving from a media source a plurality of transmission segments that contain coded video data of the media asset, the coded video data representing frames of asset content at a first temporal spacing; during an enhanced playback mode, retrieving from the media source at least one transmission segment that contains coded video data of the media asset, the coded video data representing frames of asset content at a second temporal spacing larger than the first, wherein all frames of the transmission segment are coded by intra-coding; decoding the coded video data of the retrieved segments; and rendering the decoded video data on a display of the media player. 2. (canceled) 3. (canceled) 4. The method of claim 1, wherein the first transmission segment downloaded during the enhanced playback mode is identified based on a portion of the media asset that was being rendered in normal playback mode when the enhanced playback mode was engaged. 5. The method of claim 1, further comprising
toggling between the normal playback mode and the enhanced playback mode in response to operator commands, wherein, on each toggling between playback modes, a next transmission segment to be retrieved is identified based on a portion of the media asset that was being rendered when the toggling occurred. 6. The method of claim 1, wherein the second temporal spacing is at least double the first temporal spacing. 7. (canceled) 8. (canceled) 9. The method of claim 1, wherein all frames of the transmission segment are selected from the plurality of transmission segments. 10. The method of claim 1, wherein the transmission segment is generated by re-encoding the plurality of transmission segments using only intra-coding at a reduced frame rate. 11. A non-transitory computer readable medium storing a media streaming application having playback control functions, the media streaming application executable by at least one processing system, the media streaming application comprising instructions for:
during a normal playback mode, retrieving from a media source a plurality of transmission segments that contain coded video data of the media asset, the coded video data representing frames of asset content at a first temporal spacing; during an enhanced playback mode, retrieving from the media source at least one transmission segment that contains coded video data of the media asset, the coded video data representing frames of asset content at a second temporal spacing larger than the first, wherein all frames of the transmission segment are coded by intra-coding; decoding the coded video data of the retrieved segments; and rendering the decoded video data on a display of the media player. 12. The non-transitory computer readable medium of claim 11, wherein the enhanced playback mode is initiated in response to a user command to enter a fast forward playback mode. 13. The non-transitory computer readable medium of claim 11, wherein the enhanced playback mode is initiated in response to a user command to enter a rewind playback mode. 14. The non-transitory computer readable medium of claim 11, wherein the first transmission segment downloaded during the enhanced playback mode is identified based on a portion of the media asset that was being rendered in normal playback mode when the enhanced playback mode was engaged. 15. The non-transitory computer readable medium of claim 11, further comprising
toggling between the normal playback mode and the enhanced playback mode in response to operator commands, wherein, on each toggling between playback modes, a next transmission segment to be retrieved is identified based on a portion of the media asset that was being rendered when the toggling occurred. 16. (canceled) 17. (canceled) 18. (canceled) 19. The non-transitory computer readable medium of claim 11, wherein all frames of the transmission segment are selected from the plurality of transmission segments. 20. The non-transitory computer readable medium of claim 11, wherein the transmission segment is generated by re-encoding the plurality of transmission segments using only intra-coding at a reduced frame rate. 21. A electronic device comprising:
a processing system; memory storing one or more programs for execution by the processing system, the one or more programs including instructions for: during a normal playback mode, retrieving from a media source a plurality of transmission segments that contain coded video data of the media asset, the coded video data representing frames of asset content at a first temporal spacing; during an enhanced playback mode, retrieving from the media source at least one transmission segment that contains coded video data of the media asset, the coded video data representing frames of asset content at a second temporal spacing larger than the first, wherein all frames of the transmission segment are coded by intra-coding; decoding the coded video data of the retrieved segments; and rendering the decoded video data on a display of the media player. 22. (canceled) 23. (canceled) 24. The electronic device of claim 21, wherein the first transmission segment downloaded during the enhanced playback mode is identified based on a portion of the media asset that was being rendered in normal playback mode when the enhanced playback mode was engaged. 25. The electronic device of claim 21, further comprising
toggling between the normal playback mode and the enhanced playback mode in response to operator commands, wherein, on each toggling between playback modes, a next transmission segment to be retrieved is identified based on a portion of the media asset that was being rendered when the toggling occurred. 26. (canceled) 27. The electronic device of claim 21, wherein the second temporal spacing is at least four times the first temporal spacing. 28. The electronic device of claim 21, wherein the second temporal spacing is at least eight times the first temporal spacing. 29. The electronic device of claim 21, wherein all frames of the transmission segment are selected from the plurality of transmission segments. 30. The electronic device of claim 21, wherein the transmission segment is generated by re-encoding the plurality of transmission segments using only intra-coding at a reduced frame rate. 31. (canceled) | 2,400 |
7,696 | 7,696 | 15,254,091 | 2,439 | In one aspect, a device includes a processor and storage accessible to the processor. The storage bears instructions executable by the processor to identify at least a first mode of authentication associated with a first predetermined weight, identify at least a second mode of authentication associated with a second predetermined weight, identify a threshold, and permit access at least in part based on the weights meeting the threshold. | 1. A device, comprising:
a processor; and storage accessible to the processor and bearing instructions executable by the processor to: identify one or more forms of authentication each associated with a respective predetermined weight, the identification of the one or more forms of authentication being based at least in part on the sum of the respective predetermined weights at least meeting a predetermined weight sum; and based on the identification, permit an attempt at authentication using the one or more forms of authentication. 2. The device of claim 1, wherein the one or more forms of authentication are identified based at least in part on user input to use the one or more forms of authentication, the user input directed to a user interface (UI) presented on a display accessible to the processor. 3. The device of claim 1, wherein the one or more forms of authentication are identified by the device. 4. The device of claim 3, wherein the one or more forms of authentication are identified by the device randomly. 5. The device of claim 1, wherein the instructions are executable by the processor to:
identify at least a first form of authentication associated with a first predetermined weight and a second form of authentication associated with a second predetermined weight, the identification of at least the first and second forms of authentication being based at least in part on the sum of the first and second predetermined weights at least meeting the predetermined weight sum; and based on the identification, permit the attempt at authentication using at least the first and second forms of authentication. 6. The device of claim 1, wherein the instructions are executable by the processor to:
responsive to the attempt at authentication being successful, permit a first level of access to a system; and responsive to the attempt at authentication failing, deny the first level of access to the system. 7. The device of claim 1, wherein the predetermined weight sum is a first predetermined weight sum, wherein the attempt at authentication is a first attempt at authentication, and wherein the instructions are executable by the processor to:
based on the first attempt at authentication failing, use a second predetermined weight sum to permit a second attempt at authentication, the second attempt at authentication being permitted using one or more forms of authentication each associated with a respective predetermined weight that together at least meet the second predetermined weight sum, the second predetermined weight sum being higher than the first predetermined weight sum. 8. The device of claim 7, wherein at least one form of authentication used for the second attempt at authentication is different from the one or more forms authentication used for the first attempt at authentication. 9. The device of claim 8, wherein the instructions are executable by the processor to:
based on the second attempt at authentication failing, determine whether one or more forms of authentication remain that are each associated with a respective predetermined weight that together at least meet a third predetermined weight sum to permit a third attempt at authentication using the remaining forms of authentication, the remaining forms of authentication not having been used in the first and second attempts at authentication. 10. The device of claim 9, wherein the instructions are executable by the processor to:
responsive to a determination that one or more forms of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third predetermined weight sum, initiate a reset of one or more forms of authentication. 11. The device of claim 9, wherein the instructions are executable by the processor to:
responsive to a determination that one or more forms of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third predetermined weight sum, deny access to a system for at least a threshold amount of time. 12. The device of claim 9, wherein the instructions are executable by the processor to:
responsive to a determination that one or more forms of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third predetermined weight sum, transmit a notification regarding the attempts at authentication. 13. A method, comprising:
identifying at least a first mode of authentication associated with a first predetermined weight; identifying at least a second mode of authentication associated with a second predetermined weight; identifying a threshold; and permitting access at least in part based on the weights meeting the threshold. 14. The method of claim 13, wherein the threshold is a first threshold, and wherein the method comprises:
responsive to not permitting access at least in part based on the weights meeting the first threshold, identifying at least a third mode of authentication associated with a third predetermined weight, identifying at least a fourth mode of authentication associated with a fourth predetermined weight, and identifying a second threshold; and permitting access at least in part based on the weights meeting the second threshold. 15. The method of claim 14, comprising:
responsive to not permitting access at least in part based on the weights meeting the second threshold, determining whether one or more modes of authentication remain that are each associated with a respective predetermined weight that together at least meet a third threshold to permit access using the remaining modes of authentication; and permitting, responsive to determining that one or more modes of authentication remain that are each associated with a respective predetermined weight that together at least meet the third threshold, access at least in part based on the weights meeting the third threshold. 16. The method of claim 15, comprising:
using, based on permitting access at least in part based on the weights meeting the third threshold, one of the first threshold and the second threshold to subsequently permit access. 17. The method of claim 15, comprising:
preventing, responsive to determining that one or more modes of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third threshold, access and taking another predefined action. 18. The method of claim 15, comprising:
using the third threshold for at least a predetermined number of subsequent access attempts. 19. A computer readable storage medium that is not a transitory signal, the computer readable storage medium comprising instructions executable by a processor to:
identify at least a first mode of authentication associated with a first strength level; identify at least a second mode of authentication associated with a second strength level; identify a strength bar; and permit an attempt at authentication at least in part based on the first and second strength levels together meeting the strength bar. 20. The computer readable storage medium of claim 19, wherein the instructions are executable by the processor to:
responsive to the attempt at authentication failing, raise the strength bar. | In one aspect, a device includes a processor and storage accessible to the processor. The storage bears instructions executable by the processor to identify at least a first mode of authentication associated with a first predetermined weight, identify at least a second mode of authentication associated with a second predetermined weight, identify a threshold, and permit access at least in part based on the weights meeting the threshold.1. A device, comprising:
a processor; and storage accessible to the processor and bearing instructions executable by the processor to: identify one or more forms of authentication each associated with a respective predetermined weight, the identification of the one or more forms of authentication being based at least in part on the sum of the respective predetermined weights at least meeting a predetermined weight sum; and based on the identification, permit an attempt at authentication using the one or more forms of authentication. 2. The device of claim 1, wherein the one or more forms of authentication are identified based at least in part on user input to use the one or more forms of authentication, the user input directed to a user interface (UI) presented on a display accessible to the processor. 3. The device of claim 1, wherein the one or more forms of authentication are identified by the device. 4. The device of claim 3, wherein the one or more forms of authentication are identified by the device randomly. 5. The device of claim 1, wherein the instructions are executable by the processor to:
identify at least a first form of authentication associated with a first predetermined weight and a second form of authentication associated with a second predetermined weight, the identification of at least the first and second forms of authentication being based at least in part on the sum of the first and second predetermined weights at least meeting the predetermined weight sum; and based on the identification, permit the attempt at authentication using at least the first and second forms of authentication. 6. The device of claim 1, wherein the instructions are executable by the processor to:
responsive to the attempt at authentication being successful, permit a first level of access to a system; and responsive to the attempt at authentication failing, deny the first level of access to the system. 7. The device of claim 1, wherein the predetermined weight sum is a first predetermined weight sum, wherein the attempt at authentication is a first attempt at authentication, and wherein the instructions are executable by the processor to:
based on the first attempt at authentication failing, use a second predetermined weight sum to permit a second attempt at authentication, the second attempt at authentication being permitted using one or more forms of authentication each associated with a respective predetermined weight that together at least meet the second predetermined weight sum, the second predetermined weight sum being higher than the first predetermined weight sum. 8. The device of claim 7, wherein at least one form of authentication used for the second attempt at authentication is different from the one or more forms authentication used for the first attempt at authentication. 9. The device of claim 8, wherein the instructions are executable by the processor to:
based on the second attempt at authentication failing, determine whether one or more forms of authentication remain that are each associated with a respective predetermined weight that together at least meet a third predetermined weight sum to permit a third attempt at authentication using the remaining forms of authentication, the remaining forms of authentication not having been used in the first and second attempts at authentication. 10. The device of claim 9, wherein the instructions are executable by the processor to:
responsive to a determination that one or more forms of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third predetermined weight sum, initiate a reset of one or more forms of authentication. 11. The device of claim 9, wherein the instructions are executable by the processor to:
responsive to a determination that one or more forms of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third predetermined weight sum, deny access to a system for at least a threshold amount of time. 12. The device of claim 9, wherein the instructions are executable by the processor to:
responsive to a determination that one or more forms of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third predetermined weight sum, transmit a notification regarding the attempts at authentication. 13. A method, comprising:
identifying at least a first mode of authentication associated with a first predetermined weight; identifying at least a second mode of authentication associated with a second predetermined weight; identifying a threshold; and permitting access at least in part based on the weights meeting the threshold. 14. The method of claim 13, wherein the threshold is a first threshold, and wherein the method comprises:
responsive to not permitting access at least in part based on the weights meeting the first threshold, identifying at least a third mode of authentication associated with a third predetermined weight, identifying at least a fourth mode of authentication associated with a fourth predetermined weight, and identifying a second threshold; and permitting access at least in part based on the weights meeting the second threshold. 15. The method of claim 14, comprising:
responsive to not permitting access at least in part based on the weights meeting the second threshold, determining whether one or more modes of authentication remain that are each associated with a respective predetermined weight that together at least meet a third threshold to permit access using the remaining modes of authentication; and permitting, responsive to determining that one or more modes of authentication remain that are each associated with a respective predetermined weight that together at least meet the third threshold, access at least in part based on the weights meeting the third threshold. 16. The method of claim 15, comprising:
using, based on permitting access at least in part based on the weights meeting the third threshold, one of the first threshold and the second threshold to subsequently permit access. 17. The method of claim 15, comprising:
preventing, responsive to determining that one or more modes of authentication do not remain that are each associated with a respective predetermined weight that together at least meet the third threshold, access and taking another predefined action. 18. The method of claim 15, comprising:
using the third threshold for at least a predetermined number of subsequent access attempts. 19. A computer readable storage medium that is not a transitory signal, the computer readable storage medium comprising instructions executable by a processor to:
identify at least a first mode of authentication associated with a first strength level; identify at least a second mode of authentication associated with a second strength level; identify a strength bar; and permit an attempt at authentication at least in part based on the first and second strength levels together meeting the strength bar. 20. The computer readable storage medium of claim 19, wherein the instructions are executable by the processor to:
responsive to the attempt at authentication failing, raise the strength bar. | 2,400 |
7,697 | 7,697 | 13,149,040 | 2,454 | Described herein are methods, systems, apparatuses and products providing an audio stream generated on a central information handling device from mixing a collection of audio streams captured at external audio capturing devices. An aspect provides for running a host audio aggregation application on an information handling device, the host audio aggregation application being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; generating at least one central audio stream via the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; wherein the host aggregation application is configured to send the at least one central audio stream to one or more audio receivers. | 1. A system comprising:
a host audio aggregation application running on an information handling device and being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; and at least one central audio stream generated by the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; wherein the host aggregation application is configured to send the at least one central audio stream to at least one audio receiver. 2. The system according to claim 1, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a personal area network (PAN). 3. The system according to claim 1, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a wireless local area network (WLAN). 4. The system according to claim 1, wherein the information handling device comprises a notebook computer. 5. The system according to claim 1, wherein the at least one secondary audio device comprises a phone. 6. The system according to claim 1, wherein the at least one audio receiver comprises a remote conference application. 7. The system according to claim 1, wherein the host audio aggregation application is configured to detect at least one secondary audio device. 8. The system according to claim 7, wherein the host audio aggregation application is configured to authenticate each detected at least one secondary audio device. 9. The system according to claim 8, wherein authentication comprises the host audio aggregation application receiving an authentication code from each detected at least one secondary audio device. 10. The system according to claim 1, wherein the at least one secondary audio device is in proximity to the information handling device. 11. A method comprising:
running a host audio aggregation application on an information handling device, the host audio aggregation application being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; generating at least one central audio stream via the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; wherein the host aggregation application is configured to send the at least one central audio stream to one or more audio receivers. 12. The method according to claim 11, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a personal area network (PAN). 13. The method according to claim 11, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a wireless local area network (WLAN). 14. The method according to claim 11, wherein the information handling device comprises a notebook computer. 15. The method according to claim 11, wherein the at least one secondary audio device comprises a phone. 16. The method according to claim 11, wherein the at least one audio receiver comprises a remote conference application. 17. The method according to claim 11, wherein the host audio aggregation application is configured to detect at least one secondary audio device. 18. The method according to claim 17, wherein the host audio aggregation application is configured to authenticate each detected at least one secondary audio device. 19. The method according to claim 18, wherein the at least one secondary audio device is in proximity to the information handling device. 20. A computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to run a host audio aggregation application on an information handling device, the host audio aggregation application being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; computer readable program code configured to generating at least one central audio stream via the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; and computer readable program code configured to send the at least one central audio stream to one or more audio receivers via the host audio aggregation application. | Described herein are methods, systems, apparatuses and products providing an audio stream generated on a central information handling device from mixing a collection of audio streams captured at external audio capturing devices. An aspect provides for running a host audio aggregation application on an information handling device, the host audio aggregation application being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; generating at least one central audio stream via the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; wherein the host aggregation application is configured to send the at least one central audio stream to one or more audio receivers.1. A system comprising:
a host audio aggregation application running on an information handling device and being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; and at least one central audio stream generated by the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; wherein the host aggregation application is configured to send the at least one central audio stream to at least one audio receiver. 2. The system according to claim 1, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a personal area network (PAN). 3. The system according to claim 1, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a wireless local area network (WLAN). 4. The system according to claim 1, wherein the information handling device comprises a notebook computer. 5. The system according to claim 1, wherein the at least one secondary audio device comprises a phone. 6. The system according to claim 1, wherein the at least one audio receiver comprises a remote conference application. 7. The system according to claim 1, wherein the host audio aggregation application is configured to detect at least one secondary audio device. 8. The system according to claim 7, wherein the host audio aggregation application is configured to authenticate each detected at least one secondary audio device. 9. The system according to claim 8, wherein authentication comprises the host audio aggregation application receiving an authentication code from each detected at least one secondary audio device. 10. The system according to claim 1, wherein the at least one secondary audio device is in proximity to the information handling device. 11. A method comprising:
running a host audio aggregation application on an information handling device, the host audio aggregation application being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; generating at least one central audio stream via the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; wherein the host aggregation application is configured to send the at least one central audio stream to one or more audio receivers. 12. The method according to claim 11, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a personal area network (PAN). 13. The method according to claim 11, wherein the audio obtained from the at least one secondary audio device by the information handling device is obtained via a wireless local area network (WLAN). 14. The method according to claim 11, wherein the information handling device comprises a notebook computer. 15. The method according to claim 11, wherein the at least one secondary audio device comprises a phone. 16. The method according to claim 11, wherein the at least one audio receiver comprises a remote conference application. 17. The method according to claim 11, wherein the host audio aggregation application is configured to detect at least one secondary audio device. 18. The method according to claim 17, wherein the host audio aggregation application is configured to authenticate each detected at least one secondary audio device. 19. The method according to claim 18, wherein the at least one secondary audio device is in proximity to the information handling device. 20. A computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to run a host audio aggregation application on an information handling device, the host audio aggregation application being configured to obtain audio transmitted by at least one secondary audio device external to the information handling device; computer readable program code configured to generating at least one central audio stream via the host aggregation application by mixing the audio transmitted by the at least one secondary audio device and obtained by the host audio aggregation application; and computer readable program code configured to send the at least one central audio stream to one or more audio receivers via the host audio aggregation application. | 2,400 |
7,698 | 7,698 | 13,777,413 | 2,487 | Systems, methods, and devices are disclosed that code a supplemental enhancement information (SEI) message. In some examples, the SEI message may contain an identifier of an active video parameter set (VPS). In some examples, the identifier may be fixed-length coded. | 1. A method of coding video data, the method comprising:
coding a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier of the active VPS is fixed-length coded. 2. The method of claim 1, wherein the SEI message contains only the identifier of the active VPS. 3. The method of claim 1, wherein a payload of the SEI message consists of the identifier of the active VPS. 4. The method of claim 1, wherein a payload of the SEI message consists essentially of the identifier of the active VPS. 5. The method of claim 1, wherein the identifier of the active VPS is coded in an early position before any entropy-coded syntax element in the SEI message. 6. The method of claim 5, wherein the identifier of the active VPS is coded as the first syntax element in the SEI message. 7. The method of claim 6, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 8. The method of claim 7, wherein no other SEI messages are included in the SEI NAL unit. 9. The method of claim 8, further comprising coding each random access point (RAP) access unit of the video data to include the SEI NAL unit. 10. The method of claim 1, wherein coding the SEI message comprises encoding the SEI message that contains the identifier of the active VPS. 11. The method of claim 1, wherein coding the SEI message comprises decoding the SEI message that contains the identifier of the active VPS and decoding video data using the VPS identified by the identifier of the active VPS. 12. The method of claim 1, wherein the identifier of the active VPS comprises a vps_id. 13. A device for coding video data comprising:
a processor configured to:
code a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier of the active VPS is fixed-length coded. 14. The device of claim 13, further comprising a memory coupled to the processor and configured to store data of the VPS. 15. The device of claim 13, wherein the SEI message contains only the identifier of the active VPS. 16. The device of claim 13, wherein a payload of the SEI message consists of the identifier of the active VPS. 17. The device of claim 13, wherein a payload of the SEI message consists essentially of the identifier of the active VPS. 18. The device of claim 13, wherein the identifier of the active VPS is coded in an early position before any entropy-coded syntax element in the SEI message. 19. The device of claim 18, wherein the identifier of the active VPS is coded as the first syntax element in the SEI message. 20. The device of claim 19, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 21. The device of claim 20, wherein no other SEI messages are included in the SEI NAL unit. 22. The device of claim 21, further comprising coding each random access point (RAP) access unit of video data to include the SEI NAL unit. 23. The device of claim 13, wherein the device comprises a video encoder and the one or more processors are configured to encode a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier is fixed-length coded. 24. The device of claim 13, wherein the device comprises a video decoder and the one or more processors are configured to decode the supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS). 25. The device of claim 13, wherein the identifier of the active VPS comprises a vps_id. 26. A computer-readable storage medium comprising instructions that, when executed, cause a processor to:
code a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier of the active VPS is fixed-length coded. 27. The computer-readable storage medium of claim 26, wherein the SEI message contains only the identifier of the active VPS. 28. The computer-readable storage medium of claim 26, wherein a payload of the SEI message consists of the identifier of the active VPS. 29. The computer-readable storage medium of claim 26, wherein a payload of the SEI message consists essentially of the identifier of the VPS. 30. The computer-readable storage medium of claim 29, wherein the identifier of the active VPS is coded in an early position before any entropy-coded syntax element in the SEI message. 31. The computer-readable storage medium of claim 30, wherein the identifier of the active VPS is coded as the first syntax element in the SEI message. 32. The computer-readable storage medium of claim 31, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 33. The computer-readable storage medium of claim 32, wherein no other SEI messages are included in the SEI NAL unit. 34. The computer-readable storage medium of claim 26, further comprising coding each random access point (RAP) access units of video data to include the SEI NAL unit. 35. A device for coding video data comprising:
means for storing data associated with an active video parameter set (VPS); and means for coding a supplemental enhancement information (SEI) message, including an indication of an active video parameter set (VPS) in the SEI message, wherein the indication of the active VPS is fixed-length coded and contained in the SEI message. 36. The device of claim 35, wherein the SEI message contains only the identifier of the active VPS. 37. The device of claim 35, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 38. The device of claim 37, wherein no other SEI messages are included in the SEI NAL unit. 39. The device of claim 38, further comprising coding each random access point (RAP) access unit of video data to include the SEI NAL unit. | Systems, methods, and devices are disclosed that code a supplemental enhancement information (SEI) message. In some examples, the SEI message may contain an identifier of an active video parameter set (VPS). In some examples, the identifier may be fixed-length coded.1. A method of coding video data, the method comprising:
coding a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier of the active VPS is fixed-length coded. 2. The method of claim 1, wherein the SEI message contains only the identifier of the active VPS. 3. The method of claim 1, wherein a payload of the SEI message consists of the identifier of the active VPS. 4. The method of claim 1, wherein a payload of the SEI message consists essentially of the identifier of the active VPS. 5. The method of claim 1, wherein the identifier of the active VPS is coded in an early position before any entropy-coded syntax element in the SEI message. 6. The method of claim 5, wherein the identifier of the active VPS is coded as the first syntax element in the SEI message. 7. The method of claim 6, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 8. The method of claim 7, wherein no other SEI messages are included in the SEI NAL unit. 9. The method of claim 8, further comprising coding each random access point (RAP) access unit of the video data to include the SEI NAL unit. 10. The method of claim 1, wherein coding the SEI message comprises encoding the SEI message that contains the identifier of the active VPS. 11. The method of claim 1, wherein coding the SEI message comprises decoding the SEI message that contains the identifier of the active VPS and decoding video data using the VPS identified by the identifier of the active VPS. 12. The method of claim 1, wherein the identifier of the active VPS comprises a vps_id. 13. A device for coding video data comprising:
a processor configured to:
code a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier of the active VPS is fixed-length coded. 14. The device of claim 13, further comprising a memory coupled to the processor and configured to store data of the VPS. 15. The device of claim 13, wherein the SEI message contains only the identifier of the active VPS. 16. The device of claim 13, wherein a payload of the SEI message consists of the identifier of the active VPS. 17. The device of claim 13, wherein a payload of the SEI message consists essentially of the identifier of the active VPS. 18. The device of claim 13, wherein the identifier of the active VPS is coded in an early position before any entropy-coded syntax element in the SEI message. 19. The device of claim 18, wherein the identifier of the active VPS is coded as the first syntax element in the SEI message. 20. The device of claim 19, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 21. The device of claim 20, wherein no other SEI messages are included in the SEI NAL unit. 22. The device of claim 21, further comprising coding each random access point (RAP) access unit of video data to include the SEI NAL unit. 23. The device of claim 13, wherein the device comprises a video encoder and the one or more processors are configured to encode a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier is fixed-length coded. 24. The device of claim 13, wherein the device comprises a video decoder and the one or more processors are configured to decode the supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS). 25. The device of claim 13, wherein the identifier of the active VPS comprises a vps_id. 26. A computer-readable storage medium comprising instructions that, when executed, cause a processor to:
code a supplemental enhancement information (SEI) message that contains an identifier of an active video parameter set (VPS), wherein the identifier of the active VPS is fixed-length coded. 27. The computer-readable storage medium of claim 26, wherein the SEI message contains only the identifier of the active VPS. 28. The computer-readable storage medium of claim 26, wherein a payload of the SEI message consists of the identifier of the active VPS. 29. The computer-readable storage medium of claim 26, wherein a payload of the SEI message consists essentially of the identifier of the VPS. 30. The computer-readable storage medium of claim 29, wherein the identifier of the active VPS is coded in an early position before any entropy-coded syntax element in the SEI message. 31. The computer-readable storage medium of claim 30, wherein the identifier of the active VPS is coded as the first syntax element in the SEI message. 32. The computer-readable storage medium of claim 31, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 33. The computer-readable storage medium of claim 32, wherein no other SEI messages are included in the SEI NAL unit. 34. The computer-readable storage medium of claim 26, further comprising coding each random access point (RAP) access units of video data to include the SEI NAL unit. 35. A device for coding video data comprising:
means for storing data associated with an active video parameter set (VPS); and means for coding a supplemental enhancement information (SEI) message, including an indication of an active video parameter set (VPS) in the SEI message, wherein the indication of the active VPS is fixed-length coded and contained in the SEI message. 36. The device of claim 35, wherein the SEI message contains only the identifier of the active VPS. 37. The device of claim 35, further comprising an SEI network abstraction layer (NAL) unit that includes the SEI message. 38. The device of claim 37, wherein no other SEI messages are included in the SEI NAL unit. 39. The device of claim 38, further comprising coding each random access point (RAP) access unit of video data to include the SEI NAL unit. | 2,400 |
7,699 | 7,699 | 14,497,017 | 2,462 | Methods and apparatus, including computer program products, are provided for dual connectivity. In one aspect there is provided a method. The method may include applying, at a user equipment having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the user equipment is active in a first cell served by the first wireless access point; and applying, at the user equipment having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the user equipment is not active in the first cell. Related apparatus, systems, methods, and articles are also described. | 1. A method comprising:
applying, at a user equipment having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the user equipment is active in a first cell served by the first wireless access point; and applying, at the user equipment having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the user equipment is not active in the first cell. 2. The method of claim 1, wherein the first wireless access point comprises at least one of a small cell base station and a wireless local area network access point. 3. The method of claim 1, wherein the first cell comprises at least one of a small cell and a secondary cell. 4. The method of claim 1, wherein the second wireless access point comprises at least one of an evolved node B base station and a macro cell base station. 5. The method of claim 1, wherein the second cell comprises at least one of a macro cell and a primary cell. 6. The method of claim 1, wherein the first discontinuous receive cycle pattern is shorter than the second discontinuous receive cycle pattern. 7. The method of claim 6, wherein the first discontinuous receive cycle pattern comprises about a 40 millisecond cycle, and the second discontinuous receive cycle pattern comprises about a 160 millisecond cycle. 8. The method of claim 1, wherein the active user equipment comprises at least one of making measurements, receiving data, and transmitting data. 9. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, the at least one memory circuitry and the computer program code configured to, with the at least one processor circuitry, cause the apparatus to at least: apply, by the apparatus having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the apparatus is active in a first cell served by the first wireless access point; and apply, by the apparatus having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the apparatus is not active in the first cell. 10. The apparatus of claim 9, wherein the first wireless access point comprises at least one of a small cell base station and a wireless local area network access point. 11. The apparatus of claim 9, wherein the first cell comprises at least one of a small cell and a secondary cell. 12. The apparatus of claim 9, wherein the second wireless access point comprises at least one of an evolved node B base station and a macro cell base station. 13. The apparatus of claim 9, wherein the second cell comprises at least one of a macro cell and a primary cell. 14. The apparatus of claim 9, wherein the first discontinuous receive cycle pattern is shorter than the second discontinuous receive cycle pattern. 15. The apparatus of claim 14, wherein the first discontinuous receive cycle pattern comprises about a 40 millisecond cycle, and the second discontinuous receive cycle pattern comprises about a 160 millisecond cycle. 16. The apparatus of claim 9, wherein the active apparatus comprises at least one of making measurements, receiving data, and transmitting data. 17. A non-transitory computer readable medium including computer program code, which when executed by at least one processor causes operations comprising:
applying, at a user equipment having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the user equipment is active in a first cell served by the first wireless access point; and applying, at the user equipment having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the user equipment is not active in the first cell. 18. The computer readable medium of claim 17, wherein the first wireless access point comprises at least one of a small cell base station and a wireless local area network access point. 19. The computer readable medium of claim 17, wherein the second wireless access point comprises at least one of an evolved node B base station and a macro cell base station. 20. The computer readable medium of claim 17, wherein the first discontinuous receive cycle pattern is shorter than the second discontinuous receive cycle pattern. | Methods and apparatus, including computer program products, are provided for dual connectivity. In one aspect there is provided a method. The method may include applying, at a user equipment having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the user equipment is active in a first cell served by the first wireless access point; and applying, at the user equipment having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the user equipment is not active in the first cell. Related apparatus, systems, methods, and articles are also described.1. A method comprising:
applying, at a user equipment having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the user equipment is active in a first cell served by the first wireless access point; and applying, at the user equipment having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the user equipment is not active in the first cell. 2. The method of claim 1, wherein the first wireless access point comprises at least one of a small cell base station and a wireless local area network access point. 3. The method of claim 1, wherein the first cell comprises at least one of a small cell and a secondary cell. 4. The method of claim 1, wherein the second wireless access point comprises at least one of an evolved node B base station and a macro cell base station. 5. The method of claim 1, wherein the second cell comprises at least one of a macro cell and a primary cell. 6. The method of claim 1, wherein the first discontinuous receive cycle pattern is shorter than the second discontinuous receive cycle pattern. 7. The method of claim 6, wherein the first discontinuous receive cycle pattern comprises about a 40 millisecond cycle, and the second discontinuous receive cycle pattern comprises about a 160 millisecond cycle. 8. The method of claim 1, wherein the active user equipment comprises at least one of making measurements, receiving data, and transmitting data. 9. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, the at least one memory circuitry and the computer program code configured to, with the at least one processor circuitry, cause the apparatus to at least: apply, by the apparatus having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the apparatus is active in a first cell served by the first wireless access point; and apply, by the apparatus having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the apparatus is not active in the first cell. 10. The apparatus of claim 9, wherein the first wireless access point comprises at least one of a small cell base station and a wireless local area network access point. 11. The apparatus of claim 9, wherein the first cell comprises at least one of a small cell and a secondary cell. 12. The apparatus of claim 9, wherein the second wireless access point comprises at least one of an evolved node B base station and a macro cell base station. 13. The apparatus of claim 9, wherein the second cell comprises at least one of a macro cell and a primary cell. 14. The apparatus of claim 9, wherein the first discontinuous receive cycle pattern is shorter than the second discontinuous receive cycle pattern. 15. The apparatus of claim 14, wherein the first discontinuous receive cycle pattern comprises about a 40 millisecond cycle, and the second discontinuous receive cycle pattern comprises about a 160 millisecond cycle. 16. The apparatus of claim 9, wherein the active apparatus comprises at least one of making measurements, receiving data, and transmitting data. 17. A non-transitory computer readable medium including computer program code, which when executed by at least one processor causes operations comprising:
applying, at a user equipment having dual connectivity to a first wireless access point and a second wireless access point, a first discontinuous receive cycle pattern in a second cell served by the second wireless access point, when the user equipment is active in a first cell served by the first wireless access point; and applying, at the user equipment having dual connectivity to the first wireless access point and the second wireless access point, a second discontinuous receive cycle pattern in the second cell, when the user equipment is not active in the first cell. 18. The computer readable medium of claim 17, wherein the first wireless access point comprises at least one of a small cell base station and a wireless local area network access point. 19. The computer readable medium of claim 17, wherein the second wireless access point comprises at least one of an evolved node B base station and a macro cell base station. 20. The computer readable medium of claim 17, wherein the first discontinuous receive cycle pattern is shorter than the second discontinuous receive cycle pattern. | 2,400 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.