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 |
|---|---|---|---|---|---|---|---|
9,400 | 9,400 | 16,042,301 | 2,486 | Provided are a doorbell system and a method of operating the same. The doorbell system includes a doorbell which includes: a camera configured to obtain at least one of an image of a first object in a first region and an image of a second object in a second region closer to the doorbell than the first region; an image processor configured to detect the first object from the image of the first object, and identify the second object from the image of the second object; and an alert generator configured to select and transmit to a user terminal an alert sound or alert sound information corresponding to the identified second object. | 1. A doorbell system comprising a doorbell which comprises:
a camera configured to obtain at least one of an image of a first object in a first region and an image of a second object in a second region closer to the doorbell than the first region; an image processor configured to detect the first object from the image of the first object, and identify the second object from the image of the second object; and an alert generator configured to select and transmit to a user terminal an alert sound or alert sound information corresponding to the identified second object. 2. The doorbell system of claim 1, wherein the image processor is further configured to:
detect the first object by applying a first image analysis algorithm to the image of the first object; and identify the second object by applying a second image analysis algorithm, different from the first image analysis algorithm, to the image of the second object. 3. The doorbell system of claim 1, further comprising a storage configured to store at least one of the image of the first object from which the first object is detected and the image of the second object from which the second object is identified. 4. The doorbell system of claim 1, further comprising:
a microphone; and a sound processor configured to detect a sound event from a sound received by the microphone, wherein the alert generator is further configured to select and transmit the user terminal an alert sound or alert sound information corresponding to the detected sound event. 5. The doorbell system of claim 4, further comprising a storage configured to store an event image obtained by the camera at a time when the sound event occurs,
wherein the alert generator is further configured to transmit the obtained event image to the user terminal. 6. The doorbell system of claim 1, wherein the first object and the second object are the same. 7. The doorbell system of claim 1, wherein the alert generator is further configured to select the alert sound set to the identified second object or an alert sound set to a third object related to the second object. 8. The doorbell system of claim 1, further comprising a server configured to receive, from the doorbell, event information according to detection of the first object and identification of the second object, and determine whether a behavior is an abnormal behavior by analyzing behavior patterns of the first object and the second object,
wherein the event information comprises at least one of the image of the first object and a sound related to the first object captured when the first object is detected and/or at least one of the image of the second object and a sound related to the second object when the second object is identified. 9. The doorbell system of claim 8, wherein the server is further configured to generate situation information based on the event information and transmit the situation information to the user terminal, and transmit the event information corresponding to the situation information to the user terminal in response to a request by the user terminal, and
wherein the situation information comprises a result of analyzing a behavior of at least one of the first object and the second object. 10. The doorbell system of claim 1, wherein the alert generator is further configured to transmit to the user terminal object information about the identified second object and the alert sound information corresponding to the identified second object. 11. A doorbell system comprising at least one processor configured to:
determine an identify of an object in a predetermined region; and transmit, to a user terminal connected to the doorbell system, an alert sound assigned to the identify-determined object from among a plurality of alert sounds, or alert sound information indicating characteristics of the alert sound on a real-time basis, when the identity of the object is determined in the predetermined region. 12. The doorbell system of claim 11, wherein the processor transmits, to the user terminal, the alert sound information indicating the characteristics of the alert sound, and
wherein the characteristics of the alert sound comprises at least one of a name, an identifier, and an index of the alert sound previously known between the doorbell and the user terminal. 13. The doorbell system of claim 11, wherein the processor is further configured to detect a first object in a first region by determining whether there is a movement of the first object in the first region, and determine an identify of a second object in a second region by determining whether the second object is a registered object,
wherein the processor is configured not to transmit, to the user terminal, a first alert sound assigned to the first object from among the plurality of alert sounds, or alert sound information indicating characteristics of the first alert sound, when the first object is detected only in the first region among the first region and the second region, and wherein the processor is configured to transmit, to the user terminal, a second alert sound assigned to the second object from among the plurality of alert sounds, or alert sound information indicating characteristics of the second alert sound, when the identity of the second object in the second region is determined. 14. The doorbell system of claim 11, wherein the processor is further configured to transmit object information about the second object when the identity of the second object in the second region is determined, and
wherein the processor is further configured to transmit object information about the first object when the first object is detected only in the first region among the first region and the second region. 15. A security method of a doorbell system comprising a doorbell, the security method comprising:
detecting a first object entering a first region, from an image obtained by capturing the first object; identifying a second object entering a second region closer to the doorbell than the first region, from an image obtained by capturing the second object; and outputting an alert sound or alert sound information corresponding to the identified second object. 16. The security method of claim 15, wherein the detecting the first object and the identifying the second object comprises:
detecting the first object by applying a first image analysis algorithm to the image of the first object; and identifying the second object by applying a second image analysis algorithm, different from the first image analysis algorithm, to the image of the second object. 17. The security method of claim 15, further comprising transmitting, to a user terminal, object information about the identified second object and the alert sound or the alert sound information corresponding to the identified second object. 18. The security method of claim 17, wherein the alert sound information corresponding to the identified second object is transmitted to the user terminal, and
wherein the alert sound information indicates characteristics of the alert sound. 19. The security method of claim 18, wherein the characteristics of the alert sound comprises at least one of a name, an identifier, and an index of the alert sound previously known between the doorbell and the user terminal. 20. The security method of claim 15, wherein the detecting the first object comprises determining whether there is a movement of the first object in the first region, and the identifying the second object comprises determining whether the second object is a registered object, and
wherein the security method further comprises:
not transmitting, to a user terminal, a first alert sound assigned to the first object from among a plurality of alert sounds, or alert sound information indicating characteristics of the first alert sound, when the first object is detected only in the first region among the first region and the second region, and
transmitting, to the user terminal, a second alert sound assigned to the second object from among the plurality of alert sounds, or alert sound information indicating characteristics of the second alert sound, when the second object is identified in the second region. | Provided are a doorbell system and a method of operating the same. The doorbell system includes a doorbell which includes: a camera configured to obtain at least one of an image of a first object in a first region and an image of a second object in a second region closer to the doorbell than the first region; an image processor configured to detect the first object from the image of the first object, and identify the second object from the image of the second object; and an alert generator configured to select and transmit to a user terminal an alert sound or alert sound information corresponding to the identified second object.1. A doorbell system comprising a doorbell which comprises:
a camera configured to obtain at least one of an image of a first object in a first region and an image of a second object in a second region closer to the doorbell than the first region; an image processor configured to detect the first object from the image of the first object, and identify the second object from the image of the second object; and an alert generator configured to select and transmit to a user terminal an alert sound or alert sound information corresponding to the identified second object. 2. The doorbell system of claim 1, wherein the image processor is further configured to:
detect the first object by applying a first image analysis algorithm to the image of the first object; and identify the second object by applying a second image analysis algorithm, different from the first image analysis algorithm, to the image of the second object. 3. The doorbell system of claim 1, further comprising a storage configured to store at least one of the image of the first object from which the first object is detected and the image of the second object from which the second object is identified. 4. The doorbell system of claim 1, further comprising:
a microphone; and a sound processor configured to detect a sound event from a sound received by the microphone, wherein the alert generator is further configured to select and transmit the user terminal an alert sound or alert sound information corresponding to the detected sound event. 5. The doorbell system of claim 4, further comprising a storage configured to store an event image obtained by the camera at a time when the sound event occurs,
wherein the alert generator is further configured to transmit the obtained event image to the user terminal. 6. The doorbell system of claim 1, wherein the first object and the second object are the same. 7. The doorbell system of claim 1, wherein the alert generator is further configured to select the alert sound set to the identified second object or an alert sound set to a third object related to the second object. 8. The doorbell system of claim 1, further comprising a server configured to receive, from the doorbell, event information according to detection of the first object and identification of the second object, and determine whether a behavior is an abnormal behavior by analyzing behavior patterns of the first object and the second object,
wherein the event information comprises at least one of the image of the first object and a sound related to the first object captured when the first object is detected and/or at least one of the image of the second object and a sound related to the second object when the second object is identified. 9. The doorbell system of claim 8, wherein the server is further configured to generate situation information based on the event information and transmit the situation information to the user terminal, and transmit the event information corresponding to the situation information to the user terminal in response to a request by the user terminal, and
wherein the situation information comprises a result of analyzing a behavior of at least one of the first object and the second object. 10. The doorbell system of claim 1, wherein the alert generator is further configured to transmit to the user terminal object information about the identified second object and the alert sound information corresponding to the identified second object. 11. A doorbell system comprising at least one processor configured to:
determine an identify of an object in a predetermined region; and transmit, to a user terminal connected to the doorbell system, an alert sound assigned to the identify-determined object from among a plurality of alert sounds, or alert sound information indicating characteristics of the alert sound on a real-time basis, when the identity of the object is determined in the predetermined region. 12. The doorbell system of claim 11, wherein the processor transmits, to the user terminal, the alert sound information indicating the characteristics of the alert sound, and
wherein the characteristics of the alert sound comprises at least one of a name, an identifier, and an index of the alert sound previously known between the doorbell and the user terminal. 13. The doorbell system of claim 11, wherein the processor is further configured to detect a first object in a first region by determining whether there is a movement of the first object in the first region, and determine an identify of a second object in a second region by determining whether the second object is a registered object,
wherein the processor is configured not to transmit, to the user terminal, a first alert sound assigned to the first object from among the plurality of alert sounds, or alert sound information indicating characteristics of the first alert sound, when the first object is detected only in the first region among the first region and the second region, and wherein the processor is configured to transmit, to the user terminal, a second alert sound assigned to the second object from among the plurality of alert sounds, or alert sound information indicating characteristics of the second alert sound, when the identity of the second object in the second region is determined. 14. The doorbell system of claim 11, wherein the processor is further configured to transmit object information about the second object when the identity of the second object in the second region is determined, and
wherein the processor is further configured to transmit object information about the first object when the first object is detected only in the first region among the first region and the second region. 15. A security method of a doorbell system comprising a doorbell, the security method comprising:
detecting a first object entering a first region, from an image obtained by capturing the first object; identifying a second object entering a second region closer to the doorbell than the first region, from an image obtained by capturing the second object; and outputting an alert sound or alert sound information corresponding to the identified second object. 16. The security method of claim 15, wherein the detecting the first object and the identifying the second object comprises:
detecting the first object by applying a first image analysis algorithm to the image of the first object; and identifying the second object by applying a second image analysis algorithm, different from the first image analysis algorithm, to the image of the second object. 17. The security method of claim 15, further comprising transmitting, to a user terminal, object information about the identified second object and the alert sound or the alert sound information corresponding to the identified second object. 18. The security method of claim 17, wherein the alert sound information corresponding to the identified second object is transmitted to the user terminal, and
wherein the alert sound information indicates characteristics of the alert sound. 19. The security method of claim 18, wherein the characteristics of the alert sound comprises at least one of a name, an identifier, and an index of the alert sound previously known between the doorbell and the user terminal. 20. The security method of claim 15, wherein the detecting the first object comprises determining whether there is a movement of the first object in the first region, and the identifying the second object comprises determining whether the second object is a registered object, and
wherein the security method further comprises:
not transmitting, to a user terminal, a first alert sound assigned to the first object from among a plurality of alert sounds, or alert sound information indicating characteristics of the first alert sound, when the first object is detected only in the first region among the first region and the second region, and
transmitting, to the user terminal, a second alert sound assigned to the second object from among the plurality of alert sounds, or alert sound information indicating characteristics of the second alert sound, when the second object is identified in the second region. | 2,400 |
9,401 | 9,401 | 13,943,177 | 2,466 | Systems and methods for managing a network are disclosed. One method can comprise receiving data having information identifying a first path to a destination, wherein the information facilitates transmission of the data to a next-hop of the first path. A congestion state of the first path can be determined. If the first path has a congested state, a second path to the destination can be determined, wherein the second path has a non-congested state. The information of the data can be updated to identify the second path to the destination, wherein the updated information facilitates transmission of the data to a next-hop of the second path. | 1. A method comprising:
receiving information identifying a first path to a destination, wherein the information facilitates transmission of data to a next-hop of the first path; determining a congestion state of at least a portion of the first path; if the first path has a congested state, determining a second path to the destination, wherein the second path has a non-congested state; and updating the information to identify the second path to the destination, wherein the updated information facilitates transmission of the data to a next-hop of the second path. 2. The method of claim 1, wherein the information comprises a header comprising an identification of the first path. 3. The method of claim 1, wherein one or more of the first path and the second path comprises one or more links. 4. The method of claim 1, wherein determining a congestion state of the first path comprises comparing a parameter associated with the first path to a threshold value. 5. The method of claim 4, wherein the threshold value comprises one or more of an absolute value and a relative value associated with the parameter. 6. The method of claim 1, wherein determining a second path comprises comparing a parameter associated with the second path to a threshold value. 7. The method of claim 1, wherein determining a second path comprises selecting the second path from a group of prioritized alternative paths, wherein each of the prioritized alternative paths is configured to facilitate transmission of the data along the respective prioritized alternative path. 8. The method of claim 1, wherein determining a second path comprises querying a detour element for an alternative non-congested path. 9. The method of claim 1, wherein determining a second path comprises retrieving information relating to the second path from one or more of a node cache and a centralized database. 10. A method comprising:
receiving first data at a first node, the first data comprising a first identifier associated with the first node and a second identifier associated with a first path; detecting a congested state of at least a portion of the first path using the second identifier; determining a second path having a non-congested state, wherein the second path is associated with a third identifier and the third identifier is associated with an interface; updating the first data to comprise the third identifier; storing the third identifier in a storage medium associated with the first node; and transmitting the updated first data to a second node, wherein the second path comprises the second node. 11. The method of claim 10, wherein the first data comprises a header storing one or more of the first identifier, the second identifier, and the third identifier. 12. The method of claim 10, wherein one or more of the first path and the second path comprises one or more links. 13. The method of claim 10, wherein detecting a congestion state of the first path comprises comparing a parameter associated with the first path to a threshold value. 14. The method of claim 10, wherein determining a second path comprises selecting the second path from a group of prioritized alternative paths, wherein each of the prioritized alternative paths is configured to facilitate transmission of the data along the respective prioritized alternative path. 15. The method of claim 10, further comprising:
receiving second data at the first node, the second data comprising a fourth identifier associated with the first node and a fifth identifier associated with the first path; removing the fourth identifier from the second data; detecting a congested state of the first path using the fifth identifier; updating the second data to comprise the third identifier, wherein the third identifier is received from the storage medium; and transmitting the updated second data to the second node. 16. A method comprising:
receiving information identifying a first path to a destination, wherein the information facilitates transmission of data to a next-hop of the first path; removing a portion of the information; determining a congestion state of at least a portion of the first path; if the first path has a congested state, determining a second path to the destination, wherein the second path has a non-congested state; and updating the information to identify the second path to the destination, wherein the updated information facilitates transmission of the data to a next-hop of the second path. 17. The method of claim 16, wherein the information comprises a header comprising an identification of the first path. 18. The method of claim 16, wherein determining a second path comprises selecting the second path from a group of prioritized alternative paths, wherein each of the prioritized alternative paths is configured to facilitate transmission of the data along the respective prioritized alternative path. 19. The method of claim 16, wherein determining a second path comprises querying a detour element for an alternative non-congested path. 20. The method of claim 16, wherein the updated information facilitates elastic routing via one or more loopback interfaces. | Systems and methods for managing a network are disclosed. One method can comprise receiving data having information identifying a first path to a destination, wherein the information facilitates transmission of the data to a next-hop of the first path. A congestion state of the first path can be determined. If the first path has a congested state, a second path to the destination can be determined, wherein the second path has a non-congested state. The information of the data can be updated to identify the second path to the destination, wherein the updated information facilitates transmission of the data to a next-hop of the second path.1. A method comprising:
receiving information identifying a first path to a destination, wherein the information facilitates transmission of data to a next-hop of the first path; determining a congestion state of at least a portion of the first path; if the first path has a congested state, determining a second path to the destination, wherein the second path has a non-congested state; and updating the information to identify the second path to the destination, wherein the updated information facilitates transmission of the data to a next-hop of the second path. 2. The method of claim 1, wherein the information comprises a header comprising an identification of the first path. 3. The method of claim 1, wherein one or more of the first path and the second path comprises one or more links. 4. The method of claim 1, wherein determining a congestion state of the first path comprises comparing a parameter associated with the first path to a threshold value. 5. The method of claim 4, wherein the threshold value comprises one or more of an absolute value and a relative value associated with the parameter. 6. The method of claim 1, wherein determining a second path comprises comparing a parameter associated with the second path to a threshold value. 7. The method of claim 1, wherein determining a second path comprises selecting the second path from a group of prioritized alternative paths, wherein each of the prioritized alternative paths is configured to facilitate transmission of the data along the respective prioritized alternative path. 8. The method of claim 1, wherein determining a second path comprises querying a detour element for an alternative non-congested path. 9. The method of claim 1, wherein determining a second path comprises retrieving information relating to the second path from one or more of a node cache and a centralized database. 10. A method comprising:
receiving first data at a first node, the first data comprising a first identifier associated with the first node and a second identifier associated with a first path; detecting a congested state of at least a portion of the first path using the second identifier; determining a second path having a non-congested state, wherein the second path is associated with a third identifier and the third identifier is associated with an interface; updating the first data to comprise the third identifier; storing the third identifier in a storage medium associated with the first node; and transmitting the updated first data to a second node, wherein the second path comprises the second node. 11. The method of claim 10, wherein the first data comprises a header storing one or more of the first identifier, the second identifier, and the third identifier. 12. The method of claim 10, wherein one or more of the first path and the second path comprises one or more links. 13. The method of claim 10, wherein detecting a congestion state of the first path comprises comparing a parameter associated with the first path to a threshold value. 14. The method of claim 10, wherein determining a second path comprises selecting the second path from a group of prioritized alternative paths, wherein each of the prioritized alternative paths is configured to facilitate transmission of the data along the respective prioritized alternative path. 15. The method of claim 10, further comprising:
receiving second data at the first node, the second data comprising a fourth identifier associated with the first node and a fifth identifier associated with the first path; removing the fourth identifier from the second data; detecting a congested state of the first path using the fifth identifier; updating the second data to comprise the third identifier, wherein the third identifier is received from the storage medium; and transmitting the updated second data to the second node. 16. A method comprising:
receiving information identifying a first path to a destination, wherein the information facilitates transmission of data to a next-hop of the first path; removing a portion of the information; determining a congestion state of at least a portion of the first path; if the first path has a congested state, determining a second path to the destination, wherein the second path has a non-congested state; and updating the information to identify the second path to the destination, wherein the updated information facilitates transmission of the data to a next-hop of the second path. 17. The method of claim 16, wherein the information comprises a header comprising an identification of the first path. 18. The method of claim 16, wherein determining a second path comprises selecting the second path from a group of prioritized alternative paths, wherein each of the prioritized alternative paths is configured to facilitate transmission of the data along the respective prioritized alternative path. 19. The method of claim 16, wherein determining a second path comprises querying a detour element for an alternative non-congested path. 20. The method of claim 16, wherein the updated information facilitates elastic routing via one or more loopback interfaces. | 2,400 |
9,402 | 9,402 | 15,641,261 | 2,453 | A system is described for downloading server-based content to peers in a P2P network. The server-based content can be partitioned and different peers can be given priority for downloading the different parts. A client on each peer can view what content is available on each of the other peers as well as what content is available on a virtual peer, which represents content on the server and only makes content that exists on the server and not on any peers available for download. Consequently, a client on a peer requesting to download the content can download the content from the peers and the virtual peer based on a file sharing protocol, such as BitTorrent. | 1. A method for downloading content located on a central server to a target peer in a peer-to-peer network, the method comprising:
identifying peers in the peer-to-peer network containing portions of the content; establishing a virtual peer to represent remaining portions of the content that are located on the central server and that are not available on the identified peers; downloading to the target peer the portions of the content from the identified peers; determining the remaining portions of the content that are not available on any of the identified peers; and downloading to the target peer the determined remaining portions of the content from the server by using the virtual peer. 2. The method of claim 1, further comprising:
determining a plurality of portions of the content and assigning priority for downloading different portions of the plurality of portions to different peers in the peer-to-peer network. 3. The method of claim 2, wherein the plurality of portions is determined by sequentially dividing the content into portions of a number of consecutive chunks. 4. The method of claim 2, wherein the plurality of portions is determined by randomly selecting portions of a number of consecutive chunks from the content. 5. The method of claim 1, further comprising:
determining that additional portions of the content have become available on the peers in the peer-to-peer network; and marking the virtual peer to indicate that the additional portions of content are missing on the virtual peer, such that the virtual peer continues to identify only the portions of the content that are available on the central server and not available on any other peer in the peer-to-peer network. 6. The method of claim 5, further comprising:
implementing a peer-to-peer file sharing protocol to download the content to the target peer from peers in the peer-to-peer network and from the virtual peer. 7. The method of claim 1, further comprising:
determining whether the content is smaller than a predetermined threshold; and in response to determining that the content is smaller than the predetermined threshold, requesting to download the entire content to the target peer instead of portions of the content. 8. A computing device for downloading content located on a server to a target peer in a peer-to-peer network, comprising:
at least one processor; and memory including instructions that, when executed by the at least one processor, cause the computing device to perform the steps of:
identifying peers in the peer-to-peer network containing portions of the content;
establishing a virtual peer to represent remaining portions of the content that are located on the central server and that are not available on the identified peers;
downloading to the target peer the portions of the content from the identified peers;
determining the remaining portions of the content that are not available on any of the identified peers; and
downloading to the target peer the determined remaining portions of the content from the server by using the virtual peer. 9. The computing device of claim 8, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
determining a plurality of portions of the content and assigning priority for downloading different portions of the plurality of portions to different peers in the peer-to-peer network. 10. The computing device of claim 9, wherein the plurality of portions is determined by sequentially dividing the content into portions of a number of consecutive chunks. 11. The computing device of claim 9, wherein the plurality of portions is determined by randomly selecting portions of a number of consecutive chunks from the content. 12. The computing device of claim 8, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
determining that additional portions of the content have become available on the peers in the peer-to-peer network; and marking the virtual peer to indicate that the additional portions of content are missing on the virtual peer, such that the virtual peer continues to identify only the portions of the content that are available on the central server and not available on any other peer in the peer-to-peer network. 13. The computing device of claim 12, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
implementing a peer-to-peer file sharing protocol to download the content to the target peer from peers in the peer-to-peer network and from the virtual peer. 14. The computing device of claim 8, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
determining whether the content is smaller than a predetermined threshold; and in response to determining that the content is smaller than the predetermined threshold, requesting to download the entire content to the target peer instead of portions of the content. 15. A non-transitory computer readable storage medium for downloading content located on a server to a target peer in a peer-to-peer network comprising one or more sequences of instructions, the instructions when executed by one or more processors causing the one or more processors to execute the operations of:
identifying peers in the peer-to-peer network containing portions of the content; establishing a virtual peer to represent remaining portions of the content that are located on the central server and that are not available on the identified peers; downloading to the target peer the portions of the content from the identified peers; determining the remaining portions of the content that are not available on any of the identified peers; and downloading to the target peer the determined remaining portions of the content from the server by using the virtual peer. 16. The non-transitory computer readable storage medium of claim 15, further comprising instructions that when executed by the one or more processors cause the one or more processors to execute the operations of:
determining a plurality of portions of the content and assigning priority for downloading different portions of the plurality of portions to different peers in the peer-to-peer network. 17. The non-transitory computer readable storage medium of claim 16, wherein the plurality of portions is determined by sequentially dividing the content into portions of a number of consecutive chunks. 18. The non-transitory computer readable storage medium of claim 16, wherein the plurality of portions is determined by randomly selecting portions of a number of consecutive chunks from the content. 19. The non-transitory computer readable storage medium of claim 15, further comprising instructions that when executed by the one or more processors cause the one or more processors to execute the operations of:
determining that additional portions of the content have become available on the peers in the peer-to-peer network; and marking the virtual peer to indicate that the additional portions of content are missing on the virtual peer, such that the virtual peer continues to identify only the portions of the content that are available on the central server and not available on any other peer in the peer-to-peer network. 20. The non-transitory computer readable storage medium of claim 19, further comprising instructions that when executed by the one or more processors cause the one or more processors to execute the operations of:
implementing a peer-to-peer file sharing protocol to download the content to the target peer from peers in the peer-to-peer network and from the virtual peer. | A system is described for downloading server-based content to peers in a P2P network. The server-based content can be partitioned and different peers can be given priority for downloading the different parts. A client on each peer can view what content is available on each of the other peers as well as what content is available on a virtual peer, which represents content on the server and only makes content that exists on the server and not on any peers available for download. Consequently, a client on a peer requesting to download the content can download the content from the peers and the virtual peer based on a file sharing protocol, such as BitTorrent.1. A method for downloading content located on a central server to a target peer in a peer-to-peer network, the method comprising:
identifying peers in the peer-to-peer network containing portions of the content; establishing a virtual peer to represent remaining portions of the content that are located on the central server and that are not available on the identified peers; downloading to the target peer the portions of the content from the identified peers; determining the remaining portions of the content that are not available on any of the identified peers; and downloading to the target peer the determined remaining portions of the content from the server by using the virtual peer. 2. The method of claim 1, further comprising:
determining a plurality of portions of the content and assigning priority for downloading different portions of the plurality of portions to different peers in the peer-to-peer network. 3. The method of claim 2, wherein the plurality of portions is determined by sequentially dividing the content into portions of a number of consecutive chunks. 4. The method of claim 2, wherein the plurality of portions is determined by randomly selecting portions of a number of consecutive chunks from the content. 5. The method of claim 1, further comprising:
determining that additional portions of the content have become available on the peers in the peer-to-peer network; and marking the virtual peer to indicate that the additional portions of content are missing on the virtual peer, such that the virtual peer continues to identify only the portions of the content that are available on the central server and not available on any other peer in the peer-to-peer network. 6. The method of claim 5, further comprising:
implementing a peer-to-peer file sharing protocol to download the content to the target peer from peers in the peer-to-peer network and from the virtual peer. 7. The method of claim 1, further comprising:
determining whether the content is smaller than a predetermined threshold; and in response to determining that the content is smaller than the predetermined threshold, requesting to download the entire content to the target peer instead of portions of the content. 8. A computing device for downloading content located on a server to a target peer in a peer-to-peer network, comprising:
at least one processor; and memory including instructions that, when executed by the at least one processor, cause the computing device to perform the steps of:
identifying peers in the peer-to-peer network containing portions of the content;
establishing a virtual peer to represent remaining portions of the content that are located on the central server and that are not available on the identified peers;
downloading to the target peer the portions of the content from the identified peers;
determining the remaining portions of the content that are not available on any of the identified peers; and
downloading to the target peer the determined remaining portions of the content from the server by using the virtual peer. 9. The computing device of claim 8, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
determining a plurality of portions of the content and assigning priority for downloading different portions of the plurality of portions to different peers in the peer-to-peer network. 10. The computing device of claim 9, wherein the plurality of portions is determined by sequentially dividing the content into portions of a number of consecutive chunks. 11. The computing device of claim 9, wherein the plurality of portions is determined by randomly selecting portions of a number of consecutive chunks from the content. 12. The computing device of claim 8, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
determining that additional portions of the content have become available on the peers in the peer-to-peer network; and marking the virtual peer to indicate that the additional portions of content are missing on the virtual peer, such that the virtual peer continues to identify only the portions of the content that are available on the central server and not available on any other peer in the peer-to-peer network. 13. The computing device of claim 12, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
implementing a peer-to-peer file sharing protocol to download the content to the target peer from peers in the peer-to-peer network and from the virtual peer. 14. The computing device of claim 8, wherein the memory further includes instructions that when executed by the at least one processor, cause the computing device to perform the steps of:
determining whether the content is smaller than a predetermined threshold; and in response to determining that the content is smaller than the predetermined threshold, requesting to download the entire content to the target peer instead of portions of the content. 15. A non-transitory computer readable storage medium for downloading content located on a server to a target peer in a peer-to-peer network comprising one or more sequences of instructions, the instructions when executed by one or more processors causing the one or more processors to execute the operations of:
identifying peers in the peer-to-peer network containing portions of the content; establishing a virtual peer to represent remaining portions of the content that are located on the central server and that are not available on the identified peers; downloading to the target peer the portions of the content from the identified peers; determining the remaining portions of the content that are not available on any of the identified peers; and downloading to the target peer the determined remaining portions of the content from the server by using the virtual peer. 16. The non-transitory computer readable storage medium of claim 15, further comprising instructions that when executed by the one or more processors cause the one or more processors to execute the operations of:
determining a plurality of portions of the content and assigning priority for downloading different portions of the plurality of portions to different peers in the peer-to-peer network. 17. The non-transitory computer readable storage medium of claim 16, wherein the plurality of portions is determined by sequentially dividing the content into portions of a number of consecutive chunks. 18. The non-transitory computer readable storage medium of claim 16, wherein the plurality of portions is determined by randomly selecting portions of a number of consecutive chunks from the content. 19. The non-transitory computer readable storage medium of claim 15, further comprising instructions that when executed by the one or more processors cause the one or more processors to execute the operations of:
determining that additional portions of the content have become available on the peers in the peer-to-peer network; and marking the virtual peer to indicate that the additional portions of content are missing on the virtual peer, such that the virtual peer continues to identify only the portions of the content that are available on the central server and not available on any other peer in the peer-to-peer network. 20. The non-transitory computer readable storage medium of claim 19, further comprising instructions that when executed by the one or more processors cause the one or more processors to execute the operations of:
implementing a peer-to-peer file sharing protocol to download the content to the target peer from peers in the peer-to-peer network and from the virtual peer. | 2,400 |
9,403 | 9,403 | 15,178,304 | 2,485 | Video coding techniques are disclosed that can accommodate low bandwidth events and preserve visual quality, at least in areas of an image that have high significance to a viewer. Region(s) of interest may be identified from content of input frame that will be coded. Two representations of the input frame may be generated at different resolutions. A low resolution representation of the input frame may be coded according to predictive coding techniques in which a portion outside the region of interest is coded at higher quality than a portion inside the region of interest. A high resolution representation of the input frame may be coded according to predictive coding techniques in which a portion inside the region of interest is coded at higher quality than a portion outside the region of interest. Doing so preserves visual quality, at least in areas of the input image that correspond to the region of interest. | 1. A video coding method, comprising:
generating at least two representations of an input frame at a high and a low resolution, respectively; identifying a region of interest (ROI) from within the input frame; coding the low resolution representation of the input frame according to predictive coding techniques in which a region of the low resolution representation that is outside the ROI is coded at higher quality than a region of the low resolution representation that is inside the ROI; and coding the high resolution representation of the input frame according to predictive coding techniques in which a region of the high resolution representation that is inside the ROI is coded at higher quality than a region of the high resolution representation that is outside the ROI. 2. The method of claim 1, wherein the low resolution representation is coded by base layer coding and the high resolution representation is coded by enhancement layer coding. 3. The method of claim 1, further comprising repeating the generating and the two coding steps for a plurality of input images, wherein:
the low resolution representation and the high resolution representation of the input frames are coded by a single-layer coder, and prediction references among the coded low resolution representations are confined to other low resolution representations of the input image. 4. The method of claim 1, wherein the coding of the low resolution representation of non-ROI regions is performed at higher quality in an area adjacent to the ROI than for an area that is not adjacent to the ROI. 5. The method of claim 1, further comprising repeating the generating and the two coding steps for a plurality of input images, wherein the coding of the high resolution representation includes:
selecting a portion of the non-ROI region according to a refresh selection pattern, and coding the selected portion of the non-ROI region at higher coding quality than coding of the non-selected portion of the non-ROI region. 6. The method of claim 1, wherein one of the coding steps comprises:
transforming pixel data of the respective representation to an array of transform coefficients representing frequency content of the pixel data; identifying high-energy transform coefficients in the array; altering other, lower-energy transform coefficients; and coding the array of transform coefficients, including the altered coefficients. 7. The method of claim 1, wherein:
the coding of the low resolution representation includes transforming pixel data to first transform coefficients representing content of the low resolution representation at a first range of frequencies; and the coding of the high resolution representation includes:
transforming pixel data to second transform coefficients representing content of the high resolution representation at a second range of frequencies larger than the first range;
discarding second transform coefficients that correspond to frequencies at the first range; and
coding a remainder of the second transform coefficients. 8. The method of claim 1, wherein:
the coding of the low resolution representation includes transforming pixel data to first transform coefficients representing content of the low resolution representation at a first range of frequencies; and the coding of the high resolution representation includes:
transforming pixel data to second transform coefficients representing content of the high resolution representation at a second range of frequencies larger than the first range;
combining second transform coefficients that correspond to frequencies at the first range with first transform coefficients at those corresponding frequencies; and
coding a remainder of the second transform coefficients. 9. A video coding method, comprising:
generating base layer and enhancement layer representations of an input frame, the enhancement layer representation having higher resolution than the base layer representation, identifying a region of interest (ROI) from within the input frame; base layer coding the base layer representation of the input frame in which a region of the base layer representation that is outside the ROI is coded at higher quality than a region of the base layer representation that is inside the ROI; and enhancement layer coding the enhancement layer representation of the input frame in which a region of the enhancement layer representation that is inside the ROI is coded at higher quality than a region of the enhancement layer representation that is outside the ROI. 10. The method of claim 9, wherein:
the base layer coding and enhancement layer coding are predictive coding operations, and prediction references of the enhancement layer coding are derived from prediction references of the base layer coding. 11. The method of 9, further comprising repeating the generating, base layer coding and enhancement layer coding for a plurality of input images, wherein the generating varies resolutions of different enhancement layer representations of the input images. 12. The method of claim 9, wherein, when the identifying identifies multiple ROIs within the input frame:
the enhancement layer coding comprises coding a first ROI by a first enhancement layer coding and coding a second ROI by a second enhancement layer coding, wherein each enhancement layer coding codes a region inside the respective ROI at higher quality than a region outside the respective ROI. The method of 9, wherein the base layer coding of non-ROI regions is performed at higher quality in an area adjacent to the ROI than for an area that is not adjacent to the ROI. 13. The method of 9, wherein the enhancement layer coding includes:
selecting a portion of the non-ROI region according to a refresh selection pattern, and coding the selected portion of the non-ROI region at higher coding quality than coding of the non-selection portion of the non-ROI region. 14. The method of 9, wherein:
the base layer coding includes transforming pixel data to first transform coefficients representing content of the base layer representation at a first range of frequencies; the enhancement layer coding includes:
transforming pixel data to second transform coefficients representing content of the enhancement layer representation at a second range of frequencies larger than the first range;
discarding second transform coefficients that correspond to frequencies at the first range; and
coding a remainder of the second transform coefficients. 15. The method of 9, wherein:
the base layer coding includes transforming pixel data to first transform coefficients representing content of the base layer representation at a first range of frequencies; the enhancement layer coding includes:
transforming pixel data to second transform coefficients representing content of the enhancement layer representation at a second range of frequencies larger than the first range;
combining second transform coefficients that correspond to frequencies at the first range with first transform coefficients at those corresponding frequencies; and
coding a remainder of the second transform coefficients. 16. The method of 9, wherein one of the base layer and enhancement layer coding comprises:
transforming pixel data of the respective layer to an array of transform coefficients representing frequency content of the pixel data; identifying a direction of energy in the array of the transform coefficients; altering transform coefficients along a direction orthogonal to the identified direction; and coding the array of transform coefficients, including the altered coefficients. 17. A video coder, comprising:
a first resampler having an input for an input image and an output for resampled image data at a first resolution, a base layer coder having an input coupled to the output of the first resampler; a second resampler having an input for the input image and an output for resampled image data at a second resolution, greater than the first resolution; an enhancement layer coder having an input coupled to the output of the second resampler; a region of interest detector having an input for the input image; a controller, to provide coding parameters to the base layer coder and the enhancement layer coder, causing the base layer coder to code first resolution image data outside a region of interest (ROI) at higher quality than first resolution image data inside the ROI and causing the enhancement layer coder to code first resolution image data inside the ROI at higher quality than first resolution image data outside the ROI. 18. The video coder of claim 17, wherein:
the base layer coder and enhancement layer coder are predictive coders, and the enhancement layer coder has an input for prediction references developed by the base layer coder. 19. The video coder of claim 17, wherein one of the resampler varies resolution of its output during a coding session. 20. The video coder of claim 17, wherein the base layer coder codes non-ROI regions at higher quality in an area adjacent to the ROI than for an area that is not adjacent to the ROI. 21. The video coder of claim 17, wherein the enhancement layer coder:
selects a portion of the non-ROI region according to a refresh selection pattern, and codes the selected portion of the non-ROI region at higher coding quality than coding of the non-selection portion of the non-ROI region. 22. The video coder of claim 17, wherein:
the base layer coder includes a transform unit that generates transform coefficients representing content of the first resolution input frame at a first range of frequencies; the enhancement layer coder includes
a transform unit that generates second transform coefficients representing content of the second resolution input frame at a second range of frequencies larger than the first range; and
a controller that discards second transform coefficients that correspond to frequencies at the first range. 23. A video decoding method, comprising:
decoding video data coded as base layer data, the decoded base layer data representing a source image at a first resolution and having higher quality coding in a first region than for a second region; decoding video data coded as enhancement layer data, the decoded enhancement layer data representing the source image at a second resolution higher than the first resolution and having higher quality in the second region than for the first region; resampling at least one of the decoded base layer data and the decoded enhancement layer data to a common resolution; and merging the resampled base layer data and enhancement layer data into a common image. 24. A computer readable medium storing program instructions that, when executed by a processing device, cause the processing device to:
generate two representations of an input frame at different resolutions; identify a region of interest (ROI) from within the input frame; code a low resolution representation of the input frame according to predictive coding techniques in which a region outside the ROI is coded at higher quality than a region inside the ROI; and code a high resolution representation of the input frame according to predictive coding techniques in which a region inside the ROI is coded at higher quality than a region outside the ROI. 25. The medium of claim 24, wherein the low resolution representation is coded by base layer coding and the high resolution representation is coded by enhancement layer coding. 26. The medium of claim 24, wherein the device repeats the generating and the two coding steps for a plurality of input images, wherein:
the low resolution representation and the high resolution representations of the input frames are coded by single-layer coding, and prediction references among the coded low resolution representations are confined to other low resolution representations of the input image. | Video coding techniques are disclosed that can accommodate low bandwidth events and preserve visual quality, at least in areas of an image that have high significance to a viewer. Region(s) of interest may be identified from content of input frame that will be coded. Two representations of the input frame may be generated at different resolutions. A low resolution representation of the input frame may be coded according to predictive coding techniques in which a portion outside the region of interest is coded at higher quality than a portion inside the region of interest. A high resolution representation of the input frame may be coded according to predictive coding techniques in which a portion inside the region of interest is coded at higher quality than a portion outside the region of interest. Doing so preserves visual quality, at least in areas of the input image that correspond to the region of interest.1. A video coding method, comprising:
generating at least two representations of an input frame at a high and a low resolution, respectively; identifying a region of interest (ROI) from within the input frame; coding the low resolution representation of the input frame according to predictive coding techniques in which a region of the low resolution representation that is outside the ROI is coded at higher quality than a region of the low resolution representation that is inside the ROI; and coding the high resolution representation of the input frame according to predictive coding techniques in which a region of the high resolution representation that is inside the ROI is coded at higher quality than a region of the high resolution representation that is outside the ROI. 2. The method of claim 1, wherein the low resolution representation is coded by base layer coding and the high resolution representation is coded by enhancement layer coding. 3. The method of claim 1, further comprising repeating the generating and the two coding steps for a plurality of input images, wherein:
the low resolution representation and the high resolution representation of the input frames are coded by a single-layer coder, and prediction references among the coded low resolution representations are confined to other low resolution representations of the input image. 4. The method of claim 1, wherein the coding of the low resolution representation of non-ROI regions is performed at higher quality in an area adjacent to the ROI than for an area that is not adjacent to the ROI. 5. The method of claim 1, further comprising repeating the generating and the two coding steps for a plurality of input images, wherein the coding of the high resolution representation includes:
selecting a portion of the non-ROI region according to a refresh selection pattern, and coding the selected portion of the non-ROI region at higher coding quality than coding of the non-selected portion of the non-ROI region. 6. The method of claim 1, wherein one of the coding steps comprises:
transforming pixel data of the respective representation to an array of transform coefficients representing frequency content of the pixel data; identifying high-energy transform coefficients in the array; altering other, lower-energy transform coefficients; and coding the array of transform coefficients, including the altered coefficients. 7. The method of claim 1, wherein:
the coding of the low resolution representation includes transforming pixel data to first transform coefficients representing content of the low resolution representation at a first range of frequencies; and the coding of the high resolution representation includes:
transforming pixel data to second transform coefficients representing content of the high resolution representation at a second range of frequencies larger than the first range;
discarding second transform coefficients that correspond to frequencies at the first range; and
coding a remainder of the second transform coefficients. 8. The method of claim 1, wherein:
the coding of the low resolution representation includes transforming pixel data to first transform coefficients representing content of the low resolution representation at a first range of frequencies; and the coding of the high resolution representation includes:
transforming pixel data to second transform coefficients representing content of the high resolution representation at a second range of frequencies larger than the first range;
combining second transform coefficients that correspond to frequencies at the first range with first transform coefficients at those corresponding frequencies; and
coding a remainder of the second transform coefficients. 9. A video coding method, comprising:
generating base layer and enhancement layer representations of an input frame, the enhancement layer representation having higher resolution than the base layer representation, identifying a region of interest (ROI) from within the input frame; base layer coding the base layer representation of the input frame in which a region of the base layer representation that is outside the ROI is coded at higher quality than a region of the base layer representation that is inside the ROI; and enhancement layer coding the enhancement layer representation of the input frame in which a region of the enhancement layer representation that is inside the ROI is coded at higher quality than a region of the enhancement layer representation that is outside the ROI. 10. The method of claim 9, wherein:
the base layer coding and enhancement layer coding are predictive coding operations, and prediction references of the enhancement layer coding are derived from prediction references of the base layer coding. 11. The method of 9, further comprising repeating the generating, base layer coding and enhancement layer coding for a plurality of input images, wherein the generating varies resolutions of different enhancement layer representations of the input images. 12. The method of claim 9, wherein, when the identifying identifies multiple ROIs within the input frame:
the enhancement layer coding comprises coding a first ROI by a first enhancement layer coding and coding a second ROI by a second enhancement layer coding, wherein each enhancement layer coding codes a region inside the respective ROI at higher quality than a region outside the respective ROI. The method of 9, wherein the base layer coding of non-ROI regions is performed at higher quality in an area adjacent to the ROI than for an area that is not adjacent to the ROI. 13. The method of 9, wherein the enhancement layer coding includes:
selecting a portion of the non-ROI region according to a refresh selection pattern, and coding the selected portion of the non-ROI region at higher coding quality than coding of the non-selection portion of the non-ROI region. 14. The method of 9, wherein:
the base layer coding includes transforming pixel data to first transform coefficients representing content of the base layer representation at a first range of frequencies; the enhancement layer coding includes:
transforming pixel data to second transform coefficients representing content of the enhancement layer representation at a second range of frequencies larger than the first range;
discarding second transform coefficients that correspond to frequencies at the first range; and
coding a remainder of the second transform coefficients. 15. The method of 9, wherein:
the base layer coding includes transforming pixel data to first transform coefficients representing content of the base layer representation at a first range of frequencies; the enhancement layer coding includes:
transforming pixel data to second transform coefficients representing content of the enhancement layer representation at a second range of frequencies larger than the first range;
combining second transform coefficients that correspond to frequencies at the first range with first transform coefficients at those corresponding frequencies; and
coding a remainder of the second transform coefficients. 16. The method of 9, wherein one of the base layer and enhancement layer coding comprises:
transforming pixel data of the respective layer to an array of transform coefficients representing frequency content of the pixel data; identifying a direction of energy in the array of the transform coefficients; altering transform coefficients along a direction orthogonal to the identified direction; and coding the array of transform coefficients, including the altered coefficients. 17. A video coder, comprising:
a first resampler having an input for an input image and an output for resampled image data at a first resolution, a base layer coder having an input coupled to the output of the first resampler; a second resampler having an input for the input image and an output for resampled image data at a second resolution, greater than the first resolution; an enhancement layer coder having an input coupled to the output of the second resampler; a region of interest detector having an input for the input image; a controller, to provide coding parameters to the base layer coder and the enhancement layer coder, causing the base layer coder to code first resolution image data outside a region of interest (ROI) at higher quality than first resolution image data inside the ROI and causing the enhancement layer coder to code first resolution image data inside the ROI at higher quality than first resolution image data outside the ROI. 18. The video coder of claim 17, wherein:
the base layer coder and enhancement layer coder are predictive coders, and the enhancement layer coder has an input for prediction references developed by the base layer coder. 19. The video coder of claim 17, wherein one of the resampler varies resolution of its output during a coding session. 20. The video coder of claim 17, wherein the base layer coder codes non-ROI regions at higher quality in an area adjacent to the ROI than for an area that is not adjacent to the ROI. 21. The video coder of claim 17, wherein the enhancement layer coder:
selects a portion of the non-ROI region according to a refresh selection pattern, and codes the selected portion of the non-ROI region at higher coding quality than coding of the non-selection portion of the non-ROI region. 22. The video coder of claim 17, wherein:
the base layer coder includes a transform unit that generates transform coefficients representing content of the first resolution input frame at a first range of frequencies; the enhancement layer coder includes
a transform unit that generates second transform coefficients representing content of the second resolution input frame at a second range of frequencies larger than the first range; and
a controller that discards second transform coefficients that correspond to frequencies at the first range. 23. A video decoding method, comprising:
decoding video data coded as base layer data, the decoded base layer data representing a source image at a first resolution and having higher quality coding in a first region than for a second region; decoding video data coded as enhancement layer data, the decoded enhancement layer data representing the source image at a second resolution higher than the first resolution and having higher quality in the second region than for the first region; resampling at least one of the decoded base layer data and the decoded enhancement layer data to a common resolution; and merging the resampled base layer data and enhancement layer data into a common image. 24. A computer readable medium storing program instructions that, when executed by a processing device, cause the processing device to:
generate two representations of an input frame at different resolutions; identify a region of interest (ROI) from within the input frame; code a low resolution representation of the input frame according to predictive coding techniques in which a region outside the ROI is coded at higher quality than a region inside the ROI; and code a high resolution representation of the input frame according to predictive coding techniques in which a region inside the ROI is coded at higher quality than a region outside the ROI. 25. The medium of claim 24, wherein the low resolution representation is coded by base layer coding and the high resolution representation is coded by enhancement layer coding. 26. The medium of claim 24, wherein the device repeats the generating and the two coding steps for a plurality of input images, wherein:
the low resolution representation and the high resolution representations of the input frames are coded by single-layer coding, and prediction references among the coded low resolution representations are confined to other low resolution representations of the input image. | 2,400 |
9,404 | 9,404 | 14,334,735 | 2,424 | Systems and methods are presented that, in some aspects, associate items of content and/or sources of content with companion content and/or sources of companion content. In some aspects, while accessing (e.g., viewing, recording, etc.), a primary item of content, associated companion content may be recorded. The recorded companion content may be later presented in response to, for example, a request to present the recorded item of primary content. | 1. A method, comprising:
establishing an association between a first item of content and a second item of content; receiving a first version of the second item of content; and responsive to a user request for the first item of content, causing, by at least one computing device, both the first item of content and the first version of the second item of content to be presented. 2. The method of claim 1, wherein the second item of content is web site content. 3. The method of claim 2, wherein the first item of content is video content. 4. The method of claim 1, wherein the causing comprises causing the first item of content to be presented by a first device and the first version of the second item of content to be presented by a different second device. 5. The method of claim 4, wherein the at least one computing device comprises one of the first device or the second device. 6. The method of claim 1, wherein the causing comprises causing both the first item of content and the first version of the second item of content to be displayed. 7. The method of claim 1, further comprising:
establishing an association between a third item of content and the second item of content; receiving a second version of the second item of content different from the first version of the second item of content; and responsive to a user request for the third item of content, causing both the third item of content and the second version of the second item of content to be presented. 8. The method of claim 7, wherein the first item of content is a first episode of a video program series and the third item of content is a second episode of the video program series. 9. The method of claim 1, further comprising recording the first item of content, wherein the receiving comprises receiving and storing the first version of the second item of content as it exists during the recording of the first item of content, and wherein the causing the first item of content to be presented comprises causing the first item of content as recorded to be presented. 10. A method, comprising:
recording a first item of video content; determining that an association exists between the first item of video content and a content source; obtaining first companion content from the content source while the first item of video content is being recorded; and responsive to a user request for the first item of video content, causing, by at least one computing device, both the first item of video content and the first companion content to be presented. 11. The method of claim 10, further comprising:
recording a second item of video content; determining that an association exists between the second item of video content and the content source; obtaining second companion content from the content source, different from the first companion content, while the second item of video content is being recorded; and responsive to a user request for the second item of video content, causing, by at least one computing device, both the second item of video content and the second companion content to be presented. 12. The method of claim 10, wherein the causing comprises causing the first item of video content to be presented by a first device and the first companion content to be presented by a different second device. 13. The method of claim 12, wherein the at least one computing device comprises one of the first device or the second device. 14. The method of claim 10, wherein the causing comprises causing both the first item of video content and the first companion content to be displayed. 15. The method of claim 10, wherein the causing comprises causing the first item of video content to be displayed on a first portion of a display while the first companion content is displayed on a second portion of the display. 16. A method, comprising:
responsive to receiving user input identifying video content to be associated with a network address, generating profile information associating the network address and the video content; and responsive to accessing the network address:
using, by at least one computing device, the profile information to obtain the video content, and
causing the video content that was obtained to be presented. 17. The method of claim 16, wherein the causing comprises causing the video content to be presented by a first device and content obtained from the network address to be presented by a different second device. 18. The method of claim 17, wherein the at least one computing device comprises one of the first device or the second device. 19. The method of claim 16, wherein the causing comprises causing content obtained from the network address to be displayed on a first portion of a display while the video content is displayed on a second portion of the display. 20. The method of claim 16, wherein the network address comprises a network address of a web site, wherein the user input is received while the user is browsing the web site, and wherein the using is performed responsive to subsequently browsing the web site. | Systems and methods are presented that, in some aspects, associate items of content and/or sources of content with companion content and/or sources of companion content. In some aspects, while accessing (e.g., viewing, recording, etc.), a primary item of content, associated companion content may be recorded. The recorded companion content may be later presented in response to, for example, a request to present the recorded item of primary content.1. A method, comprising:
establishing an association between a first item of content and a second item of content; receiving a first version of the second item of content; and responsive to a user request for the first item of content, causing, by at least one computing device, both the first item of content and the first version of the second item of content to be presented. 2. The method of claim 1, wherein the second item of content is web site content. 3. The method of claim 2, wherein the first item of content is video content. 4. The method of claim 1, wherein the causing comprises causing the first item of content to be presented by a first device and the first version of the second item of content to be presented by a different second device. 5. The method of claim 4, wherein the at least one computing device comprises one of the first device or the second device. 6. The method of claim 1, wherein the causing comprises causing both the first item of content and the first version of the second item of content to be displayed. 7. The method of claim 1, further comprising:
establishing an association between a third item of content and the second item of content; receiving a second version of the second item of content different from the first version of the second item of content; and responsive to a user request for the third item of content, causing both the third item of content and the second version of the second item of content to be presented. 8. The method of claim 7, wherein the first item of content is a first episode of a video program series and the third item of content is a second episode of the video program series. 9. The method of claim 1, further comprising recording the first item of content, wherein the receiving comprises receiving and storing the first version of the second item of content as it exists during the recording of the first item of content, and wherein the causing the first item of content to be presented comprises causing the first item of content as recorded to be presented. 10. A method, comprising:
recording a first item of video content; determining that an association exists between the first item of video content and a content source; obtaining first companion content from the content source while the first item of video content is being recorded; and responsive to a user request for the first item of video content, causing, by at least one computing device, both the first item of video content and the first companion content to be presented. 11. The method of claim 10, further comprising:
recording a second item of video content; determining that an association exists between the second item of video content and the content source; obtaining second companion content from the content source, different from the first companion content, while the second item of video content is being recorded; and responsive to a user request for the second item of video content, causing, by at least one computing device, both the second item of video content and the second companion content to be presented. 12. The method of claim 10, wherein the causing comprises causing the first item of video content to be presented by a first device and the first companion content to be presented by a different second device. 13. The method of claim 12, wherein the at least one computing device comprises one of the first device or the second device. 14. The method of claim 10, wherein the causing comprises causing both the first item of video content and the first companion content to be displayed. 15. The method of claim 10, wherein the causing comprises causing the first item of video content to be displayed on a first portion of a display while the first companion content is displayed on a second portion of the display. 16. A method, comprising:
responsive to receiving user input identifying video content to be associated with a network address, generating profile information associating the network address and the video content; and responsive to accessing the network address:
using, by at least one computing device, the profile information to obtain the video content, and
causing the video content that was obtained to be presented. 17. The method of claim 16, wherein the causing comprises causing the video content to be presented by a first device and content obtained from the network address to be presented by a different second device. 18. The method of claim 17, wherein the at least one computing device comprises one of the first device or the second device. 19. The method of claim 16, wherein the causing comprises causing content obtained from the network address to be displayed on a first portion of a display while the video content is displayed on a second portion of the display. 20. The method of claim 16, wherein the network address comprises a network address of a web site, wherein the user input is received while the user is browsing the web site, and wherein the using is performed responsive to subsequently browsing the web site. | 2,400 |
9,405 | 9,405 | 15,765,516 | 2,414 | There is provided a method for a mobile communication system comprising receiving at a communication device cell configuration information from a network node, and the configuration information being related to cells in a network area comprising a first cell and one or more second cells. Further, the method further comprises receiving at the communication device environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells, and causing transmission of measurement results obtained in the first cell for use in radio resource management of the communication device in the one or more second cells. | 1.-46. (cancelled) 47. 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 to perform at least the following: receive at a communication device in a cellular mobile network configuration information related to cells in an area of the network comprising first configuration information for a first cell and one or more second cells, wherein the first configuration information comprises an indication of the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells; receive environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells; and cause transmission of measurement results obtained in the first cell for use in radio resource management of the communication device in the one or more second cells. 48. The apparatus according to claim 47, wherein the configuration of the first cell and the one or more second cells requires presence of a third cell for providing the communication device with at least one of:
non-access stratum mobility information, or security input at radio resource control connection establishment or resource control connection reestablishment or handover. 49. The apparatus according to claim 47, wherein the environment information is at least indicative of:
location information of one or more transmission points of the first cell, or location information of one or more transmission points of each of the one or more second cells. 50. The apparatus according to claim 49, wherein the location information for at least one transmission point of the first cell is identical with the location information of at least one of the transmission points of each of the one or more second cells. 51. The apparatus according to claim 47, wherein the environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells comprises an indication of association between the first cell and the one or more second cells. 52. The apparatus according to claim 51, wherein the indication of association comprises information on an arrangement of the first cell and the one or more second cells in a measurement reporting group. 53. The apparatus according to claim 52, wherein the information on the arrangement comprises selection information for use of the first cell as a reference cell in the measurement reporting group, wherein measurement reporting is only performed for the reference cell in the measurement reporting group. 54. The apparatus according to claim 47, wherein the coverage areas of the first cell and the one or more second cells are of about the same size and the coverage area of the first cell overlaps with the coverage areas of each of the one or more second cells. 55. The apparatus according to claim 47, wherein the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells are in a frequency band of a predetermined bandwidth. 56. The apparatus according to claim 47, wherein the communication device is configured to communicate in a fourth cell,
wherein the downlink radio carrier frequency of the fourth cell is in a frequency range which allows for measurement of signals in the first cell without causing measurement gaps in the communication between the communication device and the access node of the fourth cell. 57. The apparatus according to claim 56, wherein fourth cell is identical with the third cell. 58. The apparatus according to claim 47, wherein the first cell is activated for the communication device for monitoring a downlink control channel carrying scheduling or resource allocation information in the first cell and the one or more second cells are not activated for the communication device for monitoring a downlink control channel carrying scheduling or resource allocation information in any of the one or more second cells. 59. The apparatus according to claim 47, wherein the at least one memory and the computer program code configured, with the at least one processor, to cause the apparatus to further perform at least the following:
activate or deactivate one of the one or more second cells for the communication device for monitoring a downlink control channel carrying scheduling or resource allocation information in the one of the one or more second cells; and cause transmission of measurement results obtained in the one of the one or more second cells for use in radio resource management of the communication device in the one of the one or more second cells. 60. The apparatus according to claim 59, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to perform at least the following:
receive a measurement control message related to measurements of the one of the one or more second cells comprising a suspend indication; and suspend transmission of measurement results obtained in the one of the one or more second cells for use in radio resource management of the communication device in the one of the one or more second cells based on the suspend indication. 61. The apparatus according to claim 47, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to perform at least the following:
cause transmission of validity information indicative of a degree of validity of the received environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells. 62. The apparatus according to claim 47, wherein the downlink control channel is a physical downlink control channel or an enhanced physical downlink control channel in an evolved universal terrestrial radio access network. 63. 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 to perform at least the following: cause transmission of configuration information related to cells in an area of a cellular mobile network comprising first configuration information for a first cell and one or more second cells, wherein the first configuration information comprises an indication of the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells; cause transmission of environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells; receive measurement results obtained in the first cell; and use the measurement results in radio resource management of a communication device in the one or more second cells. 64. The apparatus according to claim 63, wherein configuration of the first cell and the one or more second cells requires the presence of a third cell for providing the communication device with at least one of:
non-access stratum mobility information, security input at radio resource control connection establishment or resource control connection reestablishment or handover. 65. An apparatus according to claim 63, wherein the environment information is at least indicative of:
location information of one or more transmission points of the first cell, or location information of one or more transmission points of each of the one or more second cells. 66. A method, comprising:
receiving at a communication device in a cellular mobile network configuration information related to cells in an area of the network comprising first configuration information for a first cell and one or more second cells, wherein the first configuration information comprises an indication of the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells; receiving environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells; and causing transmission of measurement results obtained in the first cell for use in radio resource management of the communication device in the one or more second cells. | There is provided a method for a mobile communication system comprising receiving at a communication device cell configuration information from a network node, and the configuration information being related to cells in a network area comprising a first cell and one or more second cells. Further, the method further comprises receiving at the communication device environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells, and causing transmission of measurement results obtained in the first cell for use in radio resource management of the communication device in the one or more second cells.1.-46. (cancelled) 47. 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 to perform at least the following: receive at a communication device in a cellular mobile network configuration information related to cells in an area of the network comprising first configuration information for a first cell and one or more second cells, wherein the first configuration information comprises an indication of the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells; receive environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells; and cause transmission of measurement results obtained in the first cell for use in radio resource management of the communication device in the one or more second cells. 48. The apparatus according to claim 47, wherein the configuration of the first cell and the one or more second cells requires presence of a third cell for providing the communication device with at least one of:
non-access stratum mobility information, or security input at radio resource control connection establishment or resource control connection reestablishment or handover. 49. The apparatus according to claim 47, wherein the environment information is at least indicative of:
location information of one or more transmission points of the first cell, or location information of one or more transmission points of each of the one or more second cells. 50. The apparatus according to claim 49, wherein the location information for at least one transmission point of the first cell is identical with the location information of at least one of the transmission points of each of the one or more second cells. 51. The apparatus according to claim 47, wherein the environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells comprises an indication of association between the first cell and the one or more second cells. 52. The apparatus according to claim 51, wherein the indication of association comprises information on an arrangement of the first cell and the one or more second cells in a measurement reporting group. 53. The apparatus according to claim 52, wherein the information on the arrangement comprises selection information for use of the first cell as a reference cell in the measurement reporting group, wherein measurement reporting is only performed for the reference cell in the measurement reporting group. 54. The apparatus according to claim 47, wherein the coverage areas of the first cell and the one or more second cells are of about the same size and the coverage area of the first cell overlaps with the coverage areas of each of the one or more second cells. 55. The apparatus according to claim 47, wherein the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells are in a frequency band of a predetermined bandwidth. 56. The apparatus according to claim 47, wherein the communication device is configured to communicate in a fourth cell,
wherein the downlink radio carrier frequency of the fourth cell is in a frequency range which allows for measurement of signals in the first cell without causing measurement gaps in the communication between the communication device and the access node of the fourth cell. 57. The apparatus according to claim 56, wherein fourth cell is identical with the third cell. 58. The apparatus according to claim 47, wherein the first cell is activated for the communication device for monitoring a downlink control channel carrying scheduling or resource allocation information in the first cell and the one or more second cells are not activated for the communication device for monitoring a downlink control channel carrying scheduling or resource allocation information in any of the one or more second cells. 59. The apparatus according to claim 47, wherein the at least one memory and the computer program code configured, with the at least one processor, to cause the apparatus to further perform at least the following:
activate or deactivate one of the one or more second cells for the communication device for monitoring a downlink control channel carrying scheduling or resource allocation information in the one of the one or more second cells; and cause transmission of measurement results obtained in the one of the one or more second cells for use in radio resource management of the communication device in the one of the one or more second cells. 60. The apparatus according to claim 59, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to perform at least the following:
receive a measurement control message related to measurements of the one of the one or more second cells comprising a suspend indication; and suspend transmission of measurement results obtained in the one of the one or more second cells for use in radio resource management of the communication device in the one of the one or more second cells based on the suspend indication. 61. The apparatus according to claim 47, wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to perform at least the following:
cause transmission of validity information indicative of a degree of validity of the received environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells. 62. The apparatus according to claim 47, wherein the downlink control channel is a physical downlink control channel or an enhanced physical downlink control channel in an evolved universal terrestrial radio access network. 63. 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 to perform at least the following: cause transmission of configuration information related to cells in an area of a cellular mobile network comprising first configuration information for a first cell and one or more second cells, wherein the first configuration information comprises an indication of the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells; cause transmission of environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells; receive measurement results obtained in the first cell; and use the measurement results in radio resource management of a communication device in the one or more second cells. 64. The apparatus according to claim 63, wherein configuration of the first cell and the one or more second cells requires the presence of a third cell for providing the communication device with at least one of:
non-access stratum mobility information, security input at radio resource control connection establishment or resource control connection reestablishment or handover. 65. An apparatus according to claim 63, wherein the environment information is at least indicative of:
location information of one or more transmission points of the first cell, or location information of one or more transmission points of each of the one or more second cells. 66. A method, comprising:
receiving at a communication device in a cellular mobile network configuration information related to cells in an area of the network comprising first configuration information for a first cell and one or more second cells, wherein the first configuration information comprises an indication of the downlink radio carrier frequency of the first cell and the downlink radio carrier frequencies of each of the one or more second cells; receiving environment information indicative of overlaps between coverage areas of the first cell and the one or more second cells; and causing transmission of measurement results obtained in the first cell for use in radio resource management of the communication device in the one or more second cells. | 2,400 |
9,406 | 9,406 | 15,894,569 | 2,481 | A backup camera system for monitoring an area around a vehicle. In one aspect, the system comprises a camera assembly, a display device and a stand for supporting the display device; the camera assembly comprising: (i) a camera adapted to produce an image signal corresponding to a perceived image, (ii) means for supplying power; (iii) a base having first and second holes that are configured and spaced from one another so as to facilitate attachment to the vehicle using the vehicle's license plate mounting bolts, (iv) a transmitter operably coupled to the camera for wirelessly transmitting the image signal; and the display device comprising: (i) a receiver for receiving the wirelessly transmitted image signal, (ii) means for supplying power, (iii) an image processing unit operably coupled to the receiver for converting the received image signal into a display image that is displayed on the display device, the display image corresponding to the perceived image. The backup camera system can form a retrofit kit. | 1. A system for monitoring an area around a vehicle comprising:
a camera assembly configured for attachment to a license plate on the vehicle, said camera assembly comprising: (i) a camera adapted to produce an image signal corresponding to a perceived image, (ii) a power source for powering the camera, and; (iii) a transmitter operably coupled to the camera for wirelessly transmitting the image signal; and; a display device comprising: (i) a receiver for receiving the wirelessly transmitted image signal, (ii) means for supplying power, (iii) an image processing unit operably coupled to the receiver for converting the received image signal into a display image that is displayed on the display device, the display image corresponding to the perceived image; and a support structure adapted to support the display device; wherein the camera assembly is configured to enable adjustment of a viewing angle of the camera; and wherein the display device is configured to enable rotation and/or inversion of the display image. 2.-27. (canceled) 28. A system according to claim 1 wherein the camera assembly is attachable to a rear license plate of the vehicle such that the camera views an area behind the vehicle. 29. A system according to claim 1 wherein the camera assembly further comprises an internal power supply. 30. A system according to claim 29 wherein the camera assembly internal power supply comprises a battery. 31. A system according to claim 1 wherein the rotation and/or inversion of the display image is controllable from a location within a passenger compartment of the vehicle. 32. A system according to claim 1 wherein the viewing angle of the camera is adjustable from a location within a passenger compartment of the vehicle. 33. A retrofit kit comprising a system according to claim 1 in combination with components useable for installation of the system on a vehicle. | A backup camera system for monitoring an area around a vehicle. In one aspect, the system comprises a camera assembly, a display device and a stand for supporting the display device; the camera assembly comprising: (i) a camera adapted to produce an image signal corresponding to a perceived image, (ii) means for supplying power; (iii) a base having first and second holes that are configured and spaced from one another so as to facilitate attachment to the vehicle using the vehicle's license plate mounting bolts, (iv) a transmitter operably coupled to the camera for wirelessly transmitting the image signal; and the display device comprising: (i) a receiver for receiving the wirelessly transmitted image signal, (ii) means for supplying power, (iii) an image processing unit operably coupled to the receiver for converting the received image signal into a display image that is displayed on the display device, the display image corresponding to the perceived image. The backup camera system can form a retrofit kit.1. A system for monitoring an area around a vehicle comprising:
a camera assembly configured for attachment to a license plate on the vehicle, said camera assembly comprising: (i) a camera adapted to produce an image signal corresponding to a perceived image, (ii) a power source for powering the camera, and; (iii) a transmitter operably coupled to the camera for wirelessly transmitting the image signal; and; a display device comprising: (i) a receiver for receiving the wirelessly transmitted image signal, (ii) means for supplying power, (iii) an image processing unit operably coupled to the receiver for converting the received image signal into a display image that is displayed on the display device, the display image corresponding to the perceived image; and a support structure adapted to support the display device; wherein the camera assembly is configured to enable adjustment of a viewing angle of the camera; and wherein the display device is configured to enable rotation and/or inversion of the display image. 2.-27. (canceled) 28. A system according to claim 1 wherein the camera assembly is attachable to a rear license plate of the vehicle such that the camera views an area behind the vehicle. 29. A system according to claim 1 wherein the camera assembly further comprises an internal power supply. 30. A system according to claim 29 wherein the camera assembly internal power supply comprises a battery. 31. A system according to claim 1 wherein the rotation and/or inversion of the display image is controllable from a location within a passenger compartment of the vehicle. 32. A system according to claim 1 wherein the viewing angle of the camera is adjustable from a location within a passenger compartment of the vehicle. 33. A retrofit kit comprising a system according to claim 1 in combination with components useable for installation of the system on a vehicle. | 2,400 |
9,407 | 9,407 | 15,771,348 | 2,433 | A computer system includes an independent compute core; and an isolated secure data storage device to store data accessible only to the independent compute core. The independent compute core is to open an Application Program Interface (API) during runtime of the computer system in response to receiving a verified message containing secure data to be written to the secure data storage device. | 1. A computer system comprising:
an independent compute core; and an isolated secure data storage device to store data accessible only to the independent compute core; the independent compute core to open an Application Program Interface (API) during runtime of the computer system in response to receiving a verified message containing secure data to be written to the secure data storage device. 2. The computer system of claim 1, further comprising a flag of the API, the independent compute core to selectively set the flag to an open or closed state, wherein writing secure data to the secure data storage device can only occur when the flag is an open state. 3. The computer system of claim 1, further comprising multiple APIs operable by the independent compute core, each API providing exclusive access to a different location of the secure data storage device. 4. The computer system of claim 1, the independent compute core further to verify a received message containing data to be written to the secure data storage device using all of a shared secret, a message identification value and a keyed-hash message authentication code (HMAC). 5. The computer system of claim 1, the independent compute core further to write data from the verified message to the secure data storage device through the API during runtime of the computer system. 6. A method comprising:
during runtime of a computer system, opening an Application Program Interface (API) with an independent compute core in response to receiving a verified message containing secure data to be written to a secure data storage device; and writing the secure data to the secure data storage device through the API. 7. The method of claim 6, further comprising verifying a received message prior to opening the API and writing data. 8. The method of claim 7, wherein verifying the received message prior to opening the API comprises checking whether a message length of the received message exceeds an allowed maximum. 9. The method of claim 7, wherein verifying the received message prior to opening the API comprises:
preparing a keyed-hash message authentication code (HMAC) of data in the received message using an identified hash algorithm and a shared secret; and comparing the HMAC to an HMAC containing in the received message. 10. The method of claim 9, wherein preparing the HMAC comprises hashing all of a message identification value, data location value, hash algorithm identification, message length value and contents of the message field from the received message. 11. The method of claim 6, further comprising incrementing a message identification value in response to writing of the secure data from a verified message to the secure data storage device. 12. The method of claim 9, further comprising establishing the shared secret by:
transmitting to a Basic Input Output System (BIOS) of a host computer system a current message identification value; and, in response, receiving a random number to use as the shared secret. 13. The method of claim 12, further comprising:
storing the shared secret in a designated location of the secure data storage device; and closing an Application Programing Interface (API) exclusively providing write access to that designated location. 14. A non-transitory computer-readable medium comprising instructions that, when executed by an independent compute core of a computer system, cause the independent compute core to:
upon receipt of a message, verify the message; in response to verification of the message, during runtime of the computer system, open an Application Program Interface (API); and write secure data from the message, after verification, through the API to a secure data storage device that is logically accessible only to the independent compute core. 15. The non-transitory computer-readable medium of claim 14, further comprising instruction to verify the message by:
preparing a keyed-hash message authentication code (HMAC) of data in the message using an identified hash algorithm and a shared secret; and comparing the HMAC to an HMAC containing in the message. | A computer system includes an independent compute core; and an isolated secure data storage device to store data accessible only to the independent compute core. The independent compute core is to open an Application Program Interface (API) during runtime of the computer system in response to receiving a verified message containing secure data to be written to the secure data storage device.1. A computer system comprising:
an independent compute core; and an isolated secure data storage device to store data accessible only to the independent compute core; the independent compute core to open an Application Program Interface (API) during runtime of the computer system in response to receiving a verified message containing secure data to be written to the secure data storage device. 2. The computer system of claim 1, further comprising a flag of the API, the independent compute core to selectively set the flag to an open or closed state, wherein writing secure data to the secure data storage device can only occur when the flag is an open state. 3. The computer system of claim 1, further comprising multiple APIs operable by the independent compute core, each API providing exclusive access to a different location of the secure data storage device. 4. The computer system of claim 1, the independent compute core further to verify a received message containing data to be written to the secure data storage device using all of a shared secret, a message identification value and a keyed-hash message authentication code (HMAC). 5. The computer system of claim 1, the independent compute core further to write data from the verified message to the secure data storage device through the API during runtime of the computer system. 6. A method comprising:
during runtime of a computer system, opening an Application Program Interface (API) with an independent compute core in response to receiving a verified message containing secure data to be written to a secure data storage device; and writing the secure data to the secure data storage device through the API. 7. The method of claim 6, further comprising verifying a received message prior to opening the API and writing data. 8. The method of claim 7, wherein verifying the received message prior to opening the API comprises checking whether a message length of the received message exceeds an allowed maximum. 9. The method of claim 7, wherein verifying the received message prior to opening the API comprises:
preparing a keyed-hash message authentication code (HMAC) of data in the received message using an identified hash algorithm and a shared secret; and comparing the HMAC to an HMAC containing in the received message. 10. The method of claim 9, wherein preparing the HMAC comprises hashing all of a message identification value, data location value, hash algorithm identification, message length value and contents of the message field from the received message. 11. The method of claim 6, further comprising incrementing a message identification value in response to writing of the secure data from a verified message to the secure data storage device. 12. The method of claim 9, further comprising establishing the shared secret by:
transmitting to a Basic Input Output System (BIOS) of a host computer system a current message identification value; and, in response, receiving a random number to use as the shared secret. 13. The method of claim 12, further comprising:
storing the shared secret in a designated location of the secure data storage device; and closing an Application Programing Interface (API) exclusively providing write access to that designated location. 14. A non-transitory computer-readable medium comprising instructions that, when executed by an independent compute core of a computer system, cause the independent compute core to:
upon receipt of a message, verify the message; in response to verification of the message, during runtime of the computer system, open an Application Program Interface (API); and write secure data from the message, after verification, through the API to a secure data storage device that is logically accessible only to the independent compute core. 15. The non-transitory computer-readable medium of claim 14, further comprising instruction to verify the message by:
preparing a keyed-hash message authentication code (HMAC) of data in the message using an identified hash algorithm and a shared secret; and comparing the HMAC to an HMAC containing in the message. | 2,400 |
9,408 | 9,408 | 14,796,698 | 2,413 | Disclosed are techniques to minimize the electricity consumption of battery powered devices during network communications and performance of other functions. Example techniques include efficiently discovering other mains powered and battery powered devices within communication range of the battery powered device. In another example, techniques enable a battery powered device to serve as a relay for one or more other battery powered devices. In another example, techniques ensure that transmissions to and/or from battery powered devices are delivered efficiently and with low latency. In yet another example, techniques determine whether and under what conditions a battery powered device should migrate from one network to another. In the event of migration, example techniques minimize battery consumption associated with the migration. | 1. A method implemented at least in part by a battery powered device, the method comprising:
determining that one or more migration conditions have been met for the battery powered device to migrate from a current area network (AN) to another AN; caching network credentials of the battery powered device for the current AN in memory of the battery powered device; and migrating the battery powered device from the current AN to the other AN. 2. The method of claim 1, wherein the network credentials cached in the memory comprise an internet protocol (IP) address of the battery powered device on the current AN. 3. The method of claim 2, wherein the network credentials cached in the memory further comprise an encryption key of the battery powered device on the current AN. 4. The method of claim 1, wherein the one or more migration conditions comprise:
a connection with a mains powered parent of the battery powered device is lost; the battery powered device has not discovered another mains powered device in the current AN; and the battery powered device has discovered another mains powered device in the other AN that is capable of acting as its parent. 5. The method of claim 1, wherein the one or more migration conditions comprise:
the battery powered device receives a disassociation command from its mains powered parent; the battery powered device has not discovered another mains powered device in the current AN; and the battery powered device has discovered another mains powered device in the other AN that is capable of acting as its parent. 6. The method of claim 1, wherein the one or more migration conditions comprise:
the battery powered device currently has a battery powered relay as its parent; and the battery powered device has discovered a mains powered device in the other AN that is capable of acting as its parent. 7. The method of claim 1, wherein the one or more migration conditions comprise:
the battery powered device currently has a battery powered relay as its parent; a connection with the parent of the battery powered device is lost, or the battery powered device receives a disassociation request from the parent of the battery powered device; the battery powered device has not discovered a mains powered device or another battery powered relay in the current AN; and the battery powered device has discovered another battery powered relay in the other AN that is capable of acting as its parent. 8. The method of claim 1, wherein the migrating from the current AN to the other AN comprises:
associating with a new parent device in the other AN; and registering with a network layer of the other AN to obtain network credentials for the other AN. 9. The method of claim 1, further comprising:
migrating back to the current AN from the other AN responsive to one or more migration conditions, wherein the migrating back is performed using the cached network credentials and without the battery powered device going through network layer registration to obtain new network credentials for the current AN. 10. A battery powered device comprising a battery, one or more processors electrically coupled to the battery, and memory storing instructions that when executed by the one or more processors cause the one or more processors to perform the method of claim 1. 11. A battery powered device comprising:
a battery; one or more processors electrically coupled to the battery; memory storing instructions executable by the one or more processors to perform operations comprising:
receiving an indication that a parent of the battery powered device is migrating from a current area network (AN) to another AN;
independently determining whether or not to migrate from the current AN to the other AN based at least in part on:
availability of other parent devices in the current AN to act as a parent for the battery powered device; and
transmission cost to the battery powered device to communicate with other parent devices in the current AN as compared to transmission cost to the battery powered device to communicate with potential parent devices in the other AN. 12. The battery powered device of claim 11, wherein the independently determining comprises determining to migrate to the other AN responsive to determining that at least one of the following migration conditions is met:
the battery powered device has not discovered another device in the current AN that is able to serve as a new parent for the battery powered device; or transmission cost of all other devices in the current AN that are able to serve as a new parent for the battery powered device is higher than at least one potential parent device in the other AN. 13. The battery powered device of claim 11, wherein the independently determining comprises determining to remain in the current AN responsive to determining that:
one or more other devices exist in the current AN that are capable of serving as a new parent of the battery powered device; and transmission cost of communicating with the one or more other devices in the current AN that are capable of serving as the new parent of the battery powered device is less than or equal to transmission cost of communicating with potential parent devices in the other AN. 14. The battery powered device of claim 11, wherein:
the independently determining comprises determining to migrate; and the operations further comprise:
caching network credentials of the battery powered device for the current AN in the memory prior to migration; and
migrating the battery powered device from the current AN to the other AN. 15. The battery powered device of claim 14, wherein the network credentials cached in the memory comprise an internet protocol (IP) address of the battery powered device on the current AN and an encryption key of the battery powered device on the current AN. 16. The battery powered device of claim 14, wherein the migrating the battery powered device from the current AN to the other AN comprises:
associating with a parent device in the other AN; and registering with a network layer of the other AN to obtain network credentials for the other AN. 17. The battery powered device of claim 14, the operations further comprising:
caching network credentials of the battery powered device for the other AN; and migrating back to the current AN from the other AN responsive to one or more migration conditions, wherein the migrating back is performed using the cached network credentials of the of the battery powered device for the current AN and without the battery powered device going through network layer registration to obtain new network credentials for the current AN. 18. One or more computer-readable media storing:
migration conditions under which a battery powered device is to migrate from a current area network (AN) to another AN, the migration conditions comprising: a connection with a mains powered parent of the battery powered device is lost, the battery powered device has not discovered another mains powered device in the current AN, and the battery powered device has discovered another mains powered parent the other AN; the battery powered device receives a disassociation command from a mains powered parent, the battery powered device has not discovered another mains powered device in the current AN, and the battery powered device has discovered another mains powered parent in the other AN; the battery powered device currently has a battery powered relay as its parent, and the battery powered device has discovered a mains powered device in the other AN that is capable of acting as its parent; and the battery powered device currently has a battery powered relay as its parent, a connection with the parent of the battery powered device is lost or the battery powered device receives a disassociation request from the parent of the battery powered device, the battery powered device has not discovered another mains powered device or another battery powered relay in the current AN, the battery powered device has discovered another battery powered relay in the other AN; and the one or more computer readable media further storing instructions that, when executed by one or more processors of the battery powered device, configure the one or more processors to perform operations comprising: determining whether or not to migrate from the current AN to the other AN based at least in part on the migration conditions. 19. The one or more computer-readable media of claim 18, wherein:
the determining whether or not to migrate comprises determining to migrate; and the operations further comprise:
caching network credentials of the battery powered device for the current AN in the memory prior to migration; and
migrating the battery powered device from the current AN to the other AN. 20. The one or more computer-readable media of claim 18, wherein the network credentials cached in the memory comprise an internet protocol (IP) address of the battery powered device on the current AN and an encryption key of the battery powered device on the current AN. | Disclosed are techniques to minimize the electricity consumption of battery powered devices during network communications and performance of other functions. Example techniques include efficiently discovering other mains powered and battery powered devices within communication range of the battery powered device. In another example, techniques enable a battery powered device to serve as a relay for one or more other battery powered devices. In another example, techniques ensure that transmissions to and/or from battery powered devices are delivered efficiently and with low latency. In yet another example, techniques determine whether and under what conditions a battery powered device should migrate from one network to another. In the event of migration, example techniques minimize battery consumption associated with the migration.1. A method implemented at least in part by a battery powered device, the method comprising:
determining that one or more migration conditions have been met for the battery powered device to migrate from a current area network (AN) to another AN; caching network credentials of the battery powered device for the current AN in memory of the battery powered device; and migrating the battery powered device from the current AN to the other AN. 2. The method of claim 1, wherein the network credentials cached in the memory comprise an internet protocol (IP) address of the battery powered device on the current AN. 3. The method of claim 2, wherein the network credentials cached in the memory further comprise an encryption key of the battery powered device on the current AN. 4. The method of claim 1, wherein the one or more migration conditions comprise:
a connection with a mains powered parent of the battery powered device is lost; the battery powered device has not discovered another mains powered device in the current AN; and the battery powered device has discovered another mains powered device in the other AN that is capable of acting as its parent. 5. The method of claim 1, wherein the one or more migration conditions comprise:
the battery powered device receives a disassociation command from its mains powered parent; the battery powered device has not discovered another mains powered device in the current AN; and the battery powered device has discovered another mains powered device in the other AN that is capable of acting as its parent. 6. The method of claim 1, wherein the one or more migration conditions comprise:
the battery powered device currently has a battery powered relay as its parent; and the battery powered device has discovered a mains powered device in the other AN that is capable of acting as its parent. 7. The method of claim 1, wherein the one or more migration conditions comprise:
the battery powered device currently has a battery powered relay as its parent; a connection with the parent of the battery powered device is lost, or the battery powered device receives a disassociation request from the parent of the battery powered device; the battery powered device has not discovered a mains powered device or another battery powered relay in the current AN; and the battery powered device has discovered another battery powered relay in the other AN that is capable of acting as its parent. 8. The method of claim 1, wherein the migrating from the current AN to the other AN comprises:
associating with a new parent device in the other AN; and registering with a network layer of the other AN to obtain network credentials for the other AN. 9. The method of claim 1, further comprising:
migrating back to the current AN from the other AN responsive to one or more migration conditions, wherein the migrating back is performed using the cached network credentials and without the battery powered device going through network layer registration to obtain new network credentials for the current AN. 10. A battery powered device comprising a battery, one or more processors electrically coupled to the battery, and memory storing instructions that when executed by the one or more processors cause the one or more processors to perform the method of claim 1. 11. A battery powered device comprising:
a battery; one or more processors electrically coupled to the battery; memory storing instructions executable by the one or more processors to perform operations comprising:
receiving an indication that a parent of the battery powered device is migrating from a current area network (AN) to another AN;
independently determining whether or not to migrate from the current AN to the other AN based at least in part on:
availability of other parent devices in the current AN to act as a parent for the battery powered device; and
transmission cost to the battery powered device to communicate with other parent devices in the current AN as compared to transmission cost to the battery powered device to communicate with potential parent devices in the other AN. 12. The battery powered device of claim 11, wherein the independently determining comprises determining to migrate to the other AN responsive to determining that at least one of the following migration conditions is met:
the battery powered device has not discovered another device in the current AN that is able to serve as a new parent for the battery powered device; or transmission cost of all other devices in the current AN that are able to serve as a new parent for the battery powered device is higher than at least one potential parent device in the other AN. 13. The battery powered device of claim 11, wherein the independently determining comprises determining to remain in the current AN responsive to determining that:
one or more other devices exist in the current AN that are capable of serving as a new parent of the battery powered device; and transmission cost of communicating with the one or more other devices in the current AN that are capable of serving as the new parent of the battery powered device is less than or equal to transmission cost of communicating with potential parent devices in the other AN. 14. The battery powered device of claim 11, wherein:
the independently determining comprises determining to migrate; and the operations further comprise:
caching network credentials of the battery powered device for the current AN in the memory prior to migration; and
migrating the battery powered device from the current AN to the other AN. 15. The battery powered device of claim 14, wherein the network credentials cached in the memory comprise an internet protocol (IP) address of the battery powered device on the current AN and an encryption key of the battery powered device on the current AN. 16. The battery powered device of claim 14, wherein the migrating the battery powered device from the current AN to the other AN comprises:
associating with a parent device in the other AN; and registering with a network layer of the other AN to obtain network credentials for the other AN. 17. The battery powered device of claim 14, the operations further comprising:
caching network credentials of the battery powered device for the other AN; and migrating back to the current AN from the other AN responsive to one or more migration conditions, wherein the migrating back is performed using the cached network credentials of the of the battery powered device for the current AN and without the battery powered device going through network layer registration to obtain new network credentials for the current AN. 18. One or more computer-readable media storing:
migration conditions under which a battery powered device is to migrate from a current area network (AN) to another AN, the migration conditions comprising: a connection with a mains powered parent of the battery powered device is lost, the battery powered device has not discovered another mains powered device in the current AN, and the battery powered device has discovered another mains powered parent the other AN; the battery powered device receives a disassociation command from a mains powered parent, the battery powered device has not discovered another mains powered device in the current AN, and the battery powered device has discovered another mains powered parent in the other AN; the battery powered device currently has a battery powered relay as its parent, and the battery powered device has discovered a mains powered device in the other AN that is capable of acting as its parent; and the battery powered device currently has a battery powered relay as its parent, a connection with the parent of the battery powered device is lost or the battery powered device receives a disassociation request from the parent of the battery powered device, the battery powered device has not discovered another mains powered device or another battery powered relay in the current AN, the battery powered device has discovered another battery powered relay in the other AN; and the one or more computer readable media further storing instructions that, when executed by one or more processors of the battery powered device, configure the one or more processors to perform operations comprising: determining whether or not to migrate from the current AN to the other AN based at least in part on the migration conditions. 19. The one or more computer-readable media of claim 18, wherein:
the determining whether or not to migrate comprises determining to migrate; and the operations further comprise:
caching network credentials of the battery powered device for the current AN in the memory prior to migration; and
migrating the battery powered device from the current AN to the other AN. 20. The one or more computer-readable media of claim 18, wherein the network credentials cached in the memory comprise an internet protocol (IP) address of the battery powered device on the current AN and an encryption key of the battery powered device on the current AN. | 2,400 |
9,409 | 9,409 | 15,831,153 | 2,422 | A receiving device performs an action that results in a corrective measure being taken to address a picture quality issue detected in real time in the frames currently being displayed on a television or other device. The receiving device or a remote system compares indications of video frames currently being displayed to stored video frames for that program to detect macroblocking or a frozen video frame. The macroblocking or a frozen video frame may also or instead be detected by image analysis of the frames currently being displayed. If macroblocking or a frozen video frame is detected in the frames currently being displayed, the set-top box may switch to an alternative video source, change to a standard definition channel broadcasting the same video program or perform other corrective actions. | 1. An electronic picture quality monitoring system, comprising:
at least one processor; and a memory coupled to the at least one processor, wherein the at least one processor is configured to: output video to a presentation device for display on the presentation device, wherein the outputted video includes a plurality of video frames; while outputting the video to the presentation device, determine whether there exists a picture quality issue in video frames that are currently being displayed on the presentation device based on the video being output; and based on a determined picture quality issue in video frames that are currently being displayed on the presentation device, perform an action in response to the determination that results in a corrective measure being taken to address the picture quality. 2. The system of claim 1 wherein the picture quality issue is regarding macroblocking in the video frames that are currently being displayed on the presentation device. 3. The system of claim 2 wherein the at least one processor is configured to perform the image analysis by being configured to use edge and corner detection techniques to detect potential macroblocks in video frames that are currently being displayed on the presentation device. 4. The system of claim 2 wherein the at least one processor is configured to perform the image analysis by being configured to search in video frames that are currently being displayed on the presentation device for images with multiple square objects. 5. The system of claim 4 wherein the at least one processor is configured to perform the search in video frames that are currently being displayed on the presentation device for images with multiple square objects by being configured to search for perpendicular edges of equal length. 6. The system of claim 2 wherein the at least one processor is configured to perform the search in video frames that are currently being displayed on the presentation device by being configured to search for images with square objects with the same color values. 7. A method comprising:
outputting, by a computer processor, video to a presentation device for display on the presentation device, wherein the outputted video includes a plurality of video frames; while outputting the video to the presentation device, determining, by a computer processor, whether there exists a picture quality issue in video frames that are currently being displayed on the presentation device based on the video being output; and based on a determined picture quality issue in video frames that are currently being displayed on the presentation device, performing, by a computer processor, an action in response to the determination that results in a corrective measure being taken to address the picture quality. 8. The method of claim 7 wherein the picture quality issue is regarding macroblocking in the video frames that are currently being displayed on the presentation device. 9. The method of claim 8 wherein the performing the image analysis includes using edge and corner detection techniques to detect potential macroblocks in video frames that are currently being displayed on the presentation device. 10. The method of claim 8 wherein the wherein the performing the image analysis includes searching in video frames that are currently being displayed on the presentation device for images with multiple square objects. 11. The method of claim 10 wherein the searching in video frames that are currently being displayed on the presentation device for images with multiple square objects includes searching for perpendicular edges of equal length. 12. The method of claim 8 wherein the performing the search in video frames that are currently being displayed on the presentation device includes searching for images with square objects with the same color values. 13. A non-transitory computer-readable storage medium having computer executable instructions thereon, that when executed by a computer processor, cause the following method to be performed:
outputting, by a computer processor, video to a presentation device for display on the presentation device, wherein the outputted video includes a plurality of video frames; while outputting the video to the presentation device, determining, by a computer processor, whether there exists a picture quality issue in video frames that are currently being displayed on the presentation device based on the video being output; and based on a determined picture quality issue in video frames that are currently being displayed on the presentation device, performing, by a computer processor, an action in response to the determination that results in a corrective measure being taken to address the picture quality. | A receiving device performs an action that results in a corrective measure being taken to address a picture quality issue detected in real time in the frames currently being displayed on a television or other device. The receiving device or a remote system compares indications of video frames currently being displayed to stored video frames for that program to detect macroblocking or a frozen video frame. The macroblocking or a frozen video frame may also or instead be detected by image analysis of the frames currently being displayed. If macroblocking or a frozen video frame is detected in the frames currently being displayed, the set-top box may switch to an alternative video source, change to a standard definition channel broadcasting the same video program or perform other corrective actions.1. An electronic picture quality monitoring system, comprising:
at least one processor; and a memory coupled to the at least one processor, wherein the at least one processor is configured to: output video to a presentation device for display on the presentation device, wherein the outputted video includes a plurality of video frames; while outputting the video to the presentation device, determine whether there exists a picture quality issue in video frames that are currently being displayed on the presentation device based on the video being output; and based on a determined picture quality issue in video frames that are currently being displayed on the presentation device, perform an action in response to the determination that results in a corrective measure being taken to address the picture quality. 2. The system of claim 1 wherein the picture quality issue is regarding macroblocking in the video frames that are currently being displayed on the presentation device. 3. The system of claim 2 wherein the at least one processor is configured to perform the image analysis by being configured to use edge and corner detection techniques to detect potential macroblocks in video frames that are currently being displayed on the presentation device. 4. The system of claim 2 wherein the at least one processor is configured to perform the image analysis by being configured to search in video frames that are currently being displayed on the presentation device for images with multiple square objects. 5. The system of claim 4 wherein the at least one processor is configured to perform the search in video frames that are currently being displayed on the presentation device for images with multiple square objects by being configured to search for perpendicular edges of equal length. 6. The system of claim 2 wherein the at least one processor is configured to perform the search in video frames that are currently being displayed on the presentation device by being configured to search for images with square objects with the same color values. 7. A method comprising:
outputting, by a computer processor, video to a presentation device for display on the presentation device, wherein the outputted video includes a plurality of video frames; while outputting the video to the presentation device, determining, by a computer processor, whether there exists a picture quality issue in video frames that are currently being displayed on the presentation device based on the video being output; and based on a determined picture quality issue in video frames that are currently being displayed on the presentation device, performing, by a computer processor, an action in response to the determination that results in a corrective measure being taken to address the picture quality. 8. The method of claim 7 wherein the picture quality issue is regarding macroblocking in the video frames that are currently being displayed on the presentation device. 9. The method of claim 8 wherein the performing the image analysis includes using edge and corner detection techniques to detect potential macroblocks in video frames that are currently being displayed on the presentation device. 10. The method of claim 8 wherein the wherein the performing the image analysis includes searching in video frames that are currently being displayed on the presentation device for images with multiple square objects. 11. The method of claim 10 wherein the searching in video frames that are currently being displayed on the presentation device for images with multiple square objects includes searching for perpendicular edges of equal length. 12. The method of claim 8 wherein the performing the search in video frames that are currently being displayed on the presentation device includes searching for images with square objects with the same color values. 13. A non-transitory computer-readable storage medium having computer executable instructions thereon, that when executed by a computer processor, cause the following method to be performed:
outputting, by a computer processor, video to a presentation device for display on the presentation device, wherein the outputted video includes a plurality of video frames; while outputting the video to the presentation device, determining, by a computer processor, whether there exists a picture quality issue in video frames that are currently being displayed on the presentation device based on the video being output; and based on a determined picture quality issue in video frames that are currently being displayed on the presentation device, performing, by a computer processor, an action in response to the determination that results in a corrective measure being taken to address the picture quality. | 2,400 |
9,410 | 9,410 | 16,296,482 | 2,412 | Various example embodiments for supporting multicast are presented. Various example embodiments for supporting multicast are configured to support multicast, on a multicast tree for a multicast group, based on use of penultimate hop popping (PHP) on the multicast tree. Various example embodiments for supporting multicast are configured to support multicast, on a multicast tree for a multicast group, based on use of PHP on the multicast tree where the multicast tree is Point-to-Multipoint (P2MP) Multiprotocol Label Switching (MPLS) tree that is formed based on a TREE-SID multicast solution (although it will be appreciated that PHP may be applied on other types of multicast trees (e.g., other than P2MP MPLS multicast trees), on multicast trees formed based on other multicast solutions (e.g., other than TREE-SID), or the like, as well as various combinations thereof). | 1-22. (canceled) 23. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine a multicast tree for a multicast group, wherein the multicast tree includes a root router, a set of transit routers, and a set of leaf routers; and
establish the multicast tree based on an indication that penultimate hop popping (PHP) is to be used on the multicast tree. 24. The apparatus of claim 23, wherein, to determine the multicast tree, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
receive network topology information from the communication network; receive multicast tree root and leaf information identifying the root router and the set of leaf routers; and calculate the multicast tree from the root router to the set of leaf routers based on the network topology information and the multicast tree root and leaf information. 25. The apparatus of claim 24, wherein the multicast tree root and leaf information is received from the root router. 26. The apparatus of claim 23, wherein, to establish the multicast tree based on an indication that PHP is to be used on the multicast tree, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine multicast tree configuration information for the root router and the transit routers; and send the multicast tree configuration information toward the root router and the transit routers. 27. The apparatus of claim 23, wherein, to establish the multicast tree based on an indication that PHP is to be used on the multicast tree, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
identify, from the set of transit routers, one or more penultimate hop (PH) routers of the multicast tree; and send, toward each of the one or more PH routers of the multicast tree, respective multicast tree configuration information indicative that the respective PH router is to remove a tree label of the multicast tree from multicast packets on the multicast tree before forwarding the multicast packets via the multicast tree. 28. The apparatus of claim 27, wherein, for at least one of the PH routers of the multicast tree, the multicast tree configuration information includes a rule indicative that the tree label of the multicast tree is to be swapped with an implicit null label. 29. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine, by a root router of a multicast tree, that penultimate hop popping (PHP) is to be used on the multicast tree; and
send, by the root router toward a controller, an indication that PHP is to be used on the multicast tree. 30. The apparatus of claim 29, wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine, by the root router of the multicast tree, that it is to operate as the root router of the multicast tree; and send, by the root router toward the controller, an indication that it is to operate as the root router of the multicast tree. 31. The apparatus of claim 29, wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
discover, by the root router, one or more leaf routers of the multicast tree; and send, by the root router toward the controller, an indication of the one or more leaf routers of the multicast tree. 32. The apparatus of claim 31, wherein the one or more leaf routers of the multicast tree are discovered based on use of Multi-protocol BGP (MP-BGP) in conjunction with Multicast Virtual Private Network (MVPN) procedures. 33. The apparatus of claim 31, wherein the one or more leaf routers of the multicast tree are discovered based on MP-BGP LEAF auto-discovery (AD) routes arriving at the root router from the one or more leaf routers. 34. The apparatus of claim 29, wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
advertise, by the root router to one or more leaf routers, a label identifying a virtual routing and forwarding (VRF) instance of the multicast tree. 35. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
receive, by a penultimate hop (PH) router of a multicast tree, a multicast packet including a tree label identifying the multicast tree, an upstream assigned label, and a multicast payload;
remove, by the PH router, the tree label from the multicast packet to form a modified multicast packet; and
send, by the PH router toward one or more leaf routers of the multicast tree via the multicast tree, the modified multicast packet. 36. The apparatus of claim 35, wherein the tree label is removed from the multicast packet by popping the tree label from the multicast packet. 37. The apparatus of claim 36, wherein the tree label is popped from the multicast packet based on a rule indicative that the tree label is to be swapped with an implicit null label. 38. The apparatus of claim 37, wherein the rule indicative that the tree label is to be swapped with the implicit null label is received from a controller. 39. The apparatus of claim 35, wherein the upstream assigned label maps to a virtual routing and forwarding (VRF) instance of the multicast tree. 40. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
receive, by a leaf router of a multicast tree from a penultimate hop router of the multicast tree, a multicast packet including a multicast payload and having an upstream assigned label as an outer label; and
determine, by the leaf router based on the upstream assigned label and the multicast payload, forwarding of the multicast payload from the leaf router. 41. The apparatus of claim 40, wherein the multicast packet is received without a tree label identifying the multicast tree. 42. The apparatus of claim 40, wherein, to determine forwarding of the multicast payload from the leaf router, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
identify, based on the upstream assigned label, a virtual routing and forwarding (VRF) instance of the multicast tree; and identify, based on the VFR instance for the multicast tree and a header of the multicast payload, one or more outgoing interfaces of the leaf router via which the multicast payload is to be forwarded. 43. The apparatus of claim 42, wherein the one or more outgoing interface of the leaf router are identified based on an Internet Protocol (IP) header of the multicast payload. 44. The apparatus of claim 42, wherein a mapping of the upstream assigned label to the VRF instance of the multicast tree is received from a root router of the multicast tree. | Various example embodiments for supporting multicast are presented. Various example embodiments for supporting multicast are configured to support multicast, on a multicast tree for a multicast group, based on use of penultimate hop popping (PHP) on the multicast tree. Various example embodiments for supporting multicast are configured to support multicast, on a multicast tree for a multicast group, based on use of PHP on the multicast tree where the multicast tree is Point-to-Multipoint (P2MP) Multiprotocol Label Switching (MPLS) tree that is formed based on a TREE-SID multicast solution (although it will be appreciated that PHP may be applied on other types of multicast trees (e.g., other than P2MP MPLS multicast trees), on multicast trees formed based on other multicast solutions (e.g., other than TREE-SID), or the like, as well as various combinations thereof).1-22. (canceled) 23. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine a multicast tree for a multicast group, wherein the multicast tree includes a root router, a set of transit routers, and a set of leaf routers; and
establish the multicast tree based on an indication that penultimate hop popping (PHP) is to be used on the multicast tree. 24. The apparatus of claim 23, wherein, to determine the multicast tree, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
receive network topology information from the communication network; receive multicast tree root and leaf information identifying the root router and the set of leaf routers; and calculate the multicast tree from the root router to the set of leaf routers based on the network topology information and the multicast tree root and leaf information. 25. The apparatus of claim 24, wherein the multicast tree root and leaf information is received from the root router. 26. The apparatus of claim 23, wherein, to establish the multicast tree based on an indication that PHP is to be used on the multicast tree, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine multicast tree configuration information for the root router and the transit routers; and send the multicast tree configuration information toward the root router and the transit routers. 27. The apparatus of claim 23, wherein, to establish the multicast tree based on an indication that PHP is to be used on the multicast tree, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
identify, from the set of transit routers, one or more penultimate hop (PH) routers of the multicast tree; and send, toward each of the one or more PH routers of the multicast tree, respective multicast tree configuration information indicative that the respective PH router is to remove a tree label of the multicast tree from multicast packets on the multicast tree before forwarding the multicast packets via the multicast tree. 28. The apparatus of claim 27, wherein, for at least one of the PH routers of the multicast tree, the multicast tree configuration information includes a rule indicative that the tree label of the multicast tree is to be swapped with an implicit null label. 29. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine, by a root router of a multicast tree, that penultimate hop popping (PHP) is to be used on the multicast tree; and
send, by the root router toward a controller, an indication that PHP is to be used on the multicast tree. 30. The apparatus of claim 29, wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
determine, by the root router of the multicast tree, that it is to operate as the root router of the multicast tree; and send, by the root router toward the controller, an indication that it is to operate as the root router of the multicast tree. 31. The apparatus of claim 29, wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
discover, by the root router, one or more leaf routers of the multicast tree; and send, by the root router toward the controller, an indication of the one or more leaf routers of the multicast tree. 32. The apparatus of claim 31, wherein the one or more leaf routers of the multicast tree are discovered based on use of Multi-protocol BGP (MP-BGP) in conjunction with Multicast Virtual Private Network (MVPN) procedures. 33. The apparatus of claim 31, wherein the one or more leaf routers of the multicast tree are discovered based on MP-BGP LEAF auto-discovery (AD) routes arriving at the root router from the one or more leaf routers. 34. The apparatus of claim 29, wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
advertise, by the root router to one or more leaf routers, a label identifying a virtual routing and forwarding (VRF) instance of the multicast tree. 35. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
receive, by a penultimate hop (PH) router of a multicast tree, a multicast packet including a tree label identifying the multicast tree, an upstream assigned label, and a multicast payload;
remove, by the PH router, the tree label from the multicast packet to form a modified multicast packet; and
send, by the PH router toward one or more leaf routers of the multicast tree via the multicast tree, the modified multicast packet. 36. The apparatus of claim 35, wherein the tree label is removed from the multicast packet by popping the tree label from the multicast packet. 37. The apparatus of claim 36, wherein the tree label is popped from the multicast packet based on a rule indicative that the tree label is to be swapped with an implicit null label. 38. The apparatus of claim 37, wherein the rule indicative that the tree label is to be swapped with the implicit null label is received from a controller. 39. The apparatus of claim 35, wherein the upstream assigned label maps to a virtual routing and forwarding (VRF) instance of the multicast tree. 40. An apparatus, comprising:
at least one processor; and at least one memory including program code; wherein the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
receive, by a leaf router of a multicast tree from a penultimate hop router of the multicast tree, a multicast packet including a multicast payload and having an upstream assigned label as an outer label; and
determine, by the leaf router based on the upstream assigned label and the multicast payload, forwarding of the multicast payload from the leaf router. 41. The apparatus of claim 40, wherein the multicast packet is received without a tree label identifying the multicast tree. 42. The apparatus of claim 40, wherein, to determine forwarding of the multicast payload from the leaf router, the at least one memory and the program code are configured to, with the at least one processor, cause the apparatus to at least:
identify, based on the upstream assigned label, a virtual routing and forwarding (VRF) instance of the multicast tree; and identify, based on the VFR instance for the multicast tree and a header of the multicast payload, one or more outgoing interfaces of the leaf router via which the multicast payload is to be forwarded. 43. The apparatus of claim 42, wherein the one or more outgoing interface of the leaf router are identified based on an Internet Protocol (IP) header of the multicast payload. 44. The apparatus of claim 42, wherein a mapping of the upstream assigned label to the VRF instance of the multicast tree is received from a root router of the multicast tree. | 2,400 |
9,411 | 9,411 | 14,541,477 | 2,468 | In order to enable dynamic scaling of network services at the edge, novel systems and methods are provided to enable addition of add new nodes or removal of existing nodes while retaining the affinity of the flows through the stateful services. The methods provide a cluster of network nodes that can be dynamically resized to handle and process network traffic that utilizes stateful network services. The existing traffic flows through the edge continue to function during and after the changes to membership of the cluster. All nodes in the cluster operate in active-active mode, i.e., they are receiving and processing traffic flows, thereby maximizing the utilization of the available processing power. | 1. A method comprising:
distributing a plurality of packets belonging to a plurality of flows to a plurality of nodes in an edge cluster providing edge services to a network, wherein each flow is assigned to one node in the cluster and each node is assigned to perform stateful processing for at least one flow; and performing the stateful processing for the plurality of packets at the cluster of nodes according to said assignment of flows. 2. The method of claim 1, wherein distributing a packet to a node in the cluster comprises identifying the flow of the packet, wherein said identification is based on a set of flow identifiers in the packet. 3. The method of claim 2, wherein the distributing of the packet to the node in the cluster further comprises computing a hash value based on the set of flow identifiers, wherein the hash value is used to identify the node that is assigned to perform stateful processing for the flow of the packet. 4. The method of claim 3, wherein every possible hash value is mapped to a node in the cluster. 5. The method of claim 1, wherein the stateful processing comprises network address translation (NAT). 6. The method of claim 1, wherein the stateful processing comprises firewall processing for a stateful firewall. 7. The method of claim 1, wherein a node assigned to a flow maintains the state of the flow. 8. The method of claim 1, wherein each of the nodes in the cluster is a virtual machine provided by a virtualization software running in a host machine. 9. A method comprising:
receiving a packet at a first node in a cluster comprising a plurality of nodes, wherein the first node is selected from the plurality of nodes according to an equal cost multiple path (ECMP) algorithm; identifying a flow of the packet and an owner node of the flow; perform stateful processing for the packet at the first node when the first node is the owner node; and forwarding the packet to a second node that is different than the first node when the second node is the owner node. 10. The method of claim 9, wherein identifying the owner node of the flow comprises performing a hashing function on a set of flow identifiers in the packet. 11. The method of claim 10, wherein the flow identifiers comprise parameters in L3 and L4 headers of the packet. 12. The method of claim 9, wherein the cluster is an edge cluster providing edge services to a network. 13. The method of claim 9, wherein each of the nodes in the cluster is a virtual machine provided by a virtualization software running in a host machine. 14. The method of claim 9, wherein a newly added node does not receive packets from ECMP until a learning mode for the newly added node is complete. 15. A method comprising:
providing stateful services at a cluster of nodes, wherein a first service is provided by a first set of nodes in the cluster and a second service is provided by a second set of nodes in the cluster; distributing a first set of flows requiring the first service to the first set of nodes according to a first consistent hash function; and distributing a second set of flows requiring the second service to the second set of nodes according to a second consistent hash function. 16. The method of claim 15, wherein distributing the first set of flows to the first set of nodes comprises (i) identifying incoming packets belonging to the first set of flows and (ii) applying the first consistent hash function to flow identifiers in packets identified as belonging to the first set of flows. 17. The method of claim 16, wherein the first consistent hash of a flow produces a hash value that identifies a first node in the first set of nodes that is assigned to the flow, wherein the second consistent hash of a flow produces a hash value that identifies a second node in the second set of nodes that is assigned to the flow, wherein a node assigned to a flow maintains the state of the flow. 18. The method of claim 15, wherein every possible hash value of the first consistent hash is mapped to a node in the first set of nodes, wherein every possible hash value of the second consistent hash is mapped to a node in the second set of nodes. 19. The method of claim 15, wherein the first service is network address translation (NAT) and the second service is a firewall. 20. The method of claim 15, wherein the cluster is an edge cluster providing edge services to a network. | In order to enable dynamic scaling of network services at the edge, novel systems and methods are provided to enable addition of add new nodes or removal of existing nodes while retaining the affinity of the flows through the stateful services. The methods provide a cluster of network nodes that can be dynamically resized to handle and process network traffic that utilizes stateful network services. The existing traffic flows through the edge continue to function during and after the changes to membership of the cluster. All nodes in the cluster operate in active-active mode, i.e., they are receiving and processing traffic flows, thereby maximizing the utilization of the available processing power.1. A method comprising:
distributing a plurality of packets belonging to a plurality of flows to a plurality of nodes in an edge cluster providing edge services to a network, wherein each flow is assigned to one node in the cluster and each node is assigned to perform stateful processing for at least one flow; and performing the stateful processing for the plurality of packets at the cluster of nodes according to said assignment of flows. 2. The method of claim 1, wherein distributing a packet to a node in the cluster comprises identifying the flow of the packet, wherein said identification is based on a set of flow identifiers in the packet. 3. The method of claim 2, wherein the distributing of the packet to the node in the cluster further comprises computing a hash value based on the set of flow identifiers, wherein the hash value is used to identify the node that is assigned to perform stateful processing for the flow of the packet. 4. The method of claim 3, wherein every possible hash value is mapped to a node in the cluster. 5. The method of claim 1, wherein the stateful processing comprises network address translation (NAT). 6. The method of claim 1, wherein the stateful processing comprises firewall processing for a stateful firewall. 7. The method of claim 1, wherein a node assigned to a flow maintains the state of the flow. 8. The method of claim 1, wherein each of the nodes in the cluster is a virtual machine provided by a virtualization software running in a host machine. 9. A method comprising:
receiving a packet at a first node in a cluster comprising a plurality of nodes, wherein the first node is selected from the plurality of nodes according to an equal cost multiple path (ECMP) algorithm; identifying a flow of the packet and an owner node of the flow; perform stateful processing for the packet at the first node when the first node is the owner node; and forwarding the packet to a second node that is different than the first node when the second node is the owner node. 10. The method of claim 9, wherein identifying the owner node of the flow comprises performing a hashing function on a set of flow identifiers in the packet. 11. The method of claim 10, wherein the flow identifiers comprise parameters in L3 and L4 headers of the packet. 12. The method of claim 9, wherein the cluster is an edge cluster providing edge services to a network. 13. The method of claim 9, wherein each of the nodes in the cluster is a virtual machine provided by a virtualization software running in a host machine. 14. The method of claim 9, wherein a newly added node does not receive packets from ECMP until a learning mode for the newly added node is complete. 15. A method comprising:
providing stateful services at a cluster of nodes, wherein a first service is provided by a first set of nodes in the cluster and a second service is provided by a second set of nodes in the cluster; distributing a first set of flows requiring the first service to the first set of nodes according to a first consistent hash function; and distributing a second set of flows requiring the second service to the second set of nodes according to a second consistent hash function. 16. The method of claim 15, wherein distributing the first set of flows to the first set of nodes comprises (i) identifying incoming packets belonging to the first set of flows and (ii) applying the first consistent hash function to flow identifiers in packets identified as belonging to the first set of flows. 17. The method of claim 16, wherein the first consistent hash of a flow produces a hash value that identifies a first node in the first set of nodes that is assigned to the flow, wherein the second consistent hash of a flow produces a hash value that identifies a second node in the second set of nodes that is assigned to the flow, wherein a node assigned to a flow maintains the state of the flow. 18. The method of claim 15, wherein every possible hash value of the first consistent hash is mapped to a node in the first set of nodes, wherein every possible hash value of the second consistent hash is mapped to a node in the second set of nodes. 19. The method of claim 15, wherein the first service is network address translation (NAT) and the second service is a firewall. 20. The method of claim 15, wherein the cluster is an edge cluster providing edge services to a network. | 2,400 |
9,412 | 9,412 | 16,538,855 | 2,454 | Example methods and systems for packet handling in a software-defined networking (SDN) environment are disclosed. One example method may comprise detecting an egress application-layer message from a first logical endpoint supported by a first host; and identifying a second logical endpoint supported by the second host for which the egress application-layer message is destined. The method may also comprise generating an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits one or more headers that are addressed from the first logical endpoint to the second logical endpoint. The method may further comprise sending the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. | 1. A method for a first host to perform packet handling in a software-defined networking (SDN) environment that includes the first host and a second host, the method comprising:
detecting an egress application-layer message from a first logical endpoint supported by the first host, wherein the application-layer message is encapsulated with a plurality of headers, including a transport-layer header, that are addressed from the first logical endpoint to a second logical endpoint supported by the second host; identifying the second logical endpoint supported by the second host for which the egress application-layer message is destined, wherein the second logical endpoint is identified based on control information that associates the second logical endpoint with at least one attribute specified by the egress application-layer message; generating an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits at least the transport-layer header of the plurality of headers that are addressed from the first logical endpoint to the second logical endpoint; and sending the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. 2. The method of claim 1, wherein generating the egress packet comprises:
generating the egress packet to include the metadata which uniquely associates, within a routing domain, the second logical endpoint with the at least one attribute specified by the egress application-layer message. 3. The method of claim 1, wherein identifying the second logical endpoint comprises:
obtaining, from a network manager, the control information which associates the at least one attribute specified by the egress application-layer message with a group of logical endpoints that are capable of processing the application-layer message. 4. The method of claim 3, wherein identifying the second logical endpoint comprises:
performing load balancing to select, from the group of logical endpoints, the second logical endpoint to handle the egress application-layer message. 5. The method of claim 1, wherein the plurality of headers, in addition to the transport-layer header, comprises:
an Internet Protocol (IP) header and a media access control (MAC) header. 6. The method of claim 5, wherein generating the egress packet comprises:
generating the egress packet by removing at least one of the IP header and the MAC header from the egress application-layer message, in addition to omission of the transport-layer header. 7. The method of claim 1, wherein detecting the egress application-layer message comprises:
detecting the egress application-layer message via an application programming interface (API) invocation. 8. A non-transitory computer-readable storage medium that includes a set of instructions which, in response to execution by a processor of a computer system, cause the processor to perform a method of packet handling in a software-defined networking (SDN) environment that includes the computer system acting as a first host, and a second host, wherein the method comprises:
detecting an egress application-layer message from a first logical endpoint supported by the computer system, wherein the application-layer message is encapsulated with a plurality of headers, including a transport-layer header, that are addressed from the first logical endpoint to a second logical endpoint supported by the second host; identifying the second logical endpoint supported by the second host for which the egress application-layer message is destined, wherein the second logical endpoint is identified based on control information that associates the second logical endpoint with at least one attribute specified by the egress application-layer message; generating an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits at least the transport-layer header of the plurality of headers that are addressed from the first logical endpoint to the second logical endpoint; and sending the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. 9. The non-transitory computer-readable storage medium of claim 8, wherein generating the egress packet comprises:
generating the egress packet to include the metadata which uniquely associates, within a routing domain, the second logical endpoint with the at least one attribute specified by the egress application-layer message. 10. The non-transitory computer-readable storage medium of claim 8, wherein identifying the second logical endpoint comprises:
obtaining, from network manager, the control information which associates the at least one attribute specified by the egress application-layer message with a group of logical endpoints that are capable of processing the application-layer message. 11. The non-transitory computer-readable storage medium of claim 10, wherein identifying the second logical endpoint comprises:
performing load balancing to select, from the group of logical endpoints, the second logical endpoint to handle the egress application-layer message. 12. The non-transitory computer-readable storage medium of claim 8, wherein the plurality of headers, in addition to the transport-layer header, comprises:
an Internet Protocol (IP) header and a media access control (MAC) header. 13. The non-transitory computer-readable storage medium of claim 12, wherein generating the egress packet comprises:
generating the egress packet by removing at least one of the IP header and the MAC header from the egress application-layer message, in addition to omission of the transport-layer header. 14. The non-transitory computer-readable storage medium of claim 8, wherein detecting the egress application-layer message comprises:
detecting the egress application-layer message via an application programming interface (API) invocation. 15. A computer system configured to perform packet handling in a software-defined networking (SDN) environment that includes the computer system acting as a first host, and a second host, wherein the computer system comprises:
a processor; and a non-transitory computer-readable medium having stored thereon instructions that, in response to execution by the processor, cause the processor to:
detect an egress application-layer message from a first logical endpoint supported by the computer system, wherein the application-layer message is encapsulated with a plurality of headers, including a transport-layer header, that are addressed from the first logical endpoint to a second logical endpoint supported by the second host;
identify the second logical endpoint supported by the second host for which the egress application-layer message is destined, wherein the second logical endpoint is identified based on control information that associates the second logical endpoint with at least one attribute specified by the egress application-layer message;
generate an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits at least the transport-layer header of the plurality of headers that are addressed from the first logical endpoint to the second logical endpoint; and
send the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. 16. The computer system of claim 15, wherein the instructions that cause the processor to generate the egress packet cause the processor to:
generate the egress packet to include the metadata which uniquely associates, within a routing domain, the second logical endpoint with the at least one attribute specified by the egress application-layer message. 17. The computer system of claim 15, wherein the instructions that cause the processor to identify the second logical endpoint cause the processor to:
obtain, from a network manager, the control information which associates the at least one attribute specified by the egress application-layer message with a group of logical endpoints that are capable of processing the application-layer message. 18. The computer system of claim 17, wherein the instructions that cause the processor to identify the second logical endpoint cause the processor to:
perform load balancing to select, from the group of logical endpoints, the second logical endpoint to handle the egress application-layer message. 19. The computer system of claim 15, wherein the plurality of headers, in addition to the transport-layer header, comprises:
Internet Protocol (IP) header and a media access control (MAC) header. 20. The computer system of claim 19, wherein the instructions that cause the processor to generate the egress packet cause the processor to:
generate the egress packet by removing at least one of the IP header and the MAC header from the egress packet application-layer message, in addition to omission of the transport-layer header. 21. The computer system of claim 15, wherein the instructions that cause the processor to detect the egress application-layer message cause the processor to:
detect the egress application-layer message via an application programming interface (API) invocation. | Example methods and systems for packet handling in a software-defined networking (SDN) environment are disclosed. One example method may comprise detecting an egress application-layer message from a first logical endpoint supported by a first host; and identifying a second logical endpoint supported by the second host for which the egress application-layer message is destined. The method may also comprise generating an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits one or more headers that are addressed from the first logical endpoint to the second logical endpoint. The method may further comprise sending the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint.1. A method for a first host to perform packet handling in a software-defined networking (SDN) environment that includes the first host and a second host, the method comprising:
detecting an egress application-layer message from a first logical endpoint supported by the first host, wherein the application-layer message is encapsulated with a plurality of headers, including a transport-layer header, that are addressed from the first logical endpoint to a second logical endpoint supported by the second host; identifying the second logical endpoint supported by the second host for which the egress application-layer message is destined, wherein the second logical endpoint is identified based on control information that associates the second logical endpoint with at least one attribute specified by the egress application-layer message; generating an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits at least the transport-layer header of the plurality of headers that are addressed from the first logical endpoint to the second logical endpoint; and sending the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. 2. The method of claim 1, wherein generating the egress packet comprises:
generating the egress packet to include the metadata which uniquely associates, within a routing domain, the second logical endpoint with the at least one attribute specified by the egress application-layer message. 3. The method of claim 1, wherein identifying the second logical endpoint comprises:
obtaining, from a network manager, the control information which associates the at least one attribute specified by the egress application-layer message with a group of logical endpoints that are capable of processing the application-layer message. 4. The method of claim 3, wherein identifying the second logical endpoint comprises:
performing load balancing to select, from the group of logical endpoints, the second logical endpoint to handle the egress application-layer message. 5. The method of claim 1, wherein the plurality of headers, in addition to the transport-layer header, comprises:
an Internet Protocol (IP) header and a media access control (MAC) header. 6. The method of claim 5, wherein generating the egress packet comprises:
generating the egress packet by removing at least one of the IP header and the MAC header from the egress application-layer message, in addition to omission of the transport-layer header. 7. The method of claim 1, wherein detecting the egress application-layer message comprises:
detecting the egress application-layer message via an application programming interface (API) invocation. 8. A non-transitory computer-readable storage medium that includes a set of instructions which, in response to execution by a processor of a computer system, cause the processor to perform a method of packet handling in a software-defined networking (SDN) environment that includes the computer system acting as a first host, and a second host, wherein the method comprises:
detecting an egress application-layer message from a first logical endpoint supported by the computer system, wherein the application-layer message is encapsulated with a plurality of headers, including a transport-layer header, that are addressed from the first logical endpoint to a second logical endpoint supported by the second host; identifying the second logical endpoint supported by the second host for which the egress application-layer message is destined, wherein the second logical endpoint is identified based on control information that associates the second logical endpoint with at least one attribute specified by the egress application-layer message; generating an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits at least the transport-layer header of the plurality of headers that are addressed from the first logical endpoint to the second logical endpoint; and sending the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. 9. The non-transitory computer-readable storage medium of claim 8, wherein generating the egress packet comprises:
generating the egress packet to include the metadata which uniquely associates, within a routing domain, the second logical endpoint with the at least one attribute specified by the egress application-layer message. 10. The non-transitory computer-readable storage medium of claim 8, wherein identifying the second logical endpoint comprises:
obtaining, from network manager, the control information which associates the at least one attribute specified by the egress application-layer message with a group of logical endpoints that are capable of processing the application-layer message. 11. The non-transitory computer-readable storage medium of claim 10, wherein identifying the second logical endpoint comprises:
performing load balancing to select, from the group of logical endpoints, the second logical endpoint to handle the egress application-layer message. 12. The non-transitory computer-readable storage medium of claim 8, wherein the plurality of headers, in addition to the transport-layer header, comprises:
an Internet Protocol (IP) header and a media access control (MAC) header. 13. The non-transitory computer-readable storage medium of claim 12, wherein generating the egress packet comprises:
generating the egress packet by removing at least one of the IP header and the MAC header from the egress application-layer message, in addition to omission of the transport-layer header. 14. The non-transitory computer-readable storage medium of claim 8, wherein detecting the egress application-layer message comprises:
detecting the egress application-layer message via an application programming interface (API) invocation. 15. A computer system configured to perform packet handling in a software-defined networking (SDN) environment that includes the computer system acting as a first host, and a second host, wherein the computer system comprises:
a processor; and a non-transitory computer-readable medium having stored thereon instructions that, in response to execution by the processor, cause the processor to:
detect an egress application-layer message from a first logical endpoint supported by the computer system, wherein the application-layer message is encapsulated with a plurality of headers, including a transport-layer header, that are addressed from the first logical endpoint to a second logical endpoint supported by the second host;
identify the second logical endpoint supported by the second host for which the egress application-layer message is destined, wherein the second logical endpoint is identified based on control information that associates the second logical endpoint with at least one attribute specified by the egress application-layer message;
generate an egress packet that includes the egress application-layer message and metadata associated with the second logical endpoint, but omits at least the transport-layer header of the plurality of headers that are addressed from the first logical endpoint to the second logical endpoint; and
send the egress packet to the second host to cause the second host to identify the second logical endpoint based on the metadata, and to send the egress application-layer message to the second logical endpoint. 16. The computer system of claim 15, wherein the instructions that cause the processor to generate the egress packet cause the processor to:
generate the egress packet to include the metadata which uniquely associates, within a routing domain, the second logical endpoint with the at least one attribute specified by the egress application-layer message. 17. The computer system of claim 15, wherein the instructions that cause the processor to identify the second logical endpoint cause the processor to:
obtain, from a network manager, the control information which associates the at least one attribute specified by the egress application-layer message with a group of logical endpoints that are capable of processing the application-layer message. 18. The computer system of claim 17, wherein the instructions that cause the processor to identify the second logical endpoint cause the processor to:
perform load balancing to select, from the group of logical endpoints, the second logical endpoint to handle the egress application-layer message. 19. The computer system of claim 15, wherein the plurality of headers, in addition to the transport-layer header, comprises:
Internet Protocol (IP) header and a media access control (MAC) header. 20. The computer system of claim 19, wherein the instructions that cause the processor to generate the egress packet cause the processor to:
generate the egress packet by removing at least one of the IP header and the MAC header from the egress packet application-layer message, in addition to omission of the transport-layer header. 21. The computer system of claim 15, wherein the instructions that cause the processor to detect the egress application-layer message cause the processor to:
detect the egress application-layer message via an application programming interface (API) invocation. | 2,400 |
9,413 | 9,413 | 15,890,014 | 2,458 | An example system includes a database storing a queue of entries indicating technical issues to be addressed at a walk-up location. The system also includes a queue management software module configured to: receive, from a computing device, a request to insert a first entry into the queue; monitor a travel time between a location of the computing device and the walk-up location; determine a wait time until the first entry reaches a predetermined position within the queue; in response to the travel time meeting or exceeding the wait time, transmit a notification to the computing device instructing to depart for the walk-up location; determine an arrival time at the walk-up location based on updated locations of the computing device following the departure; adjust a position of the first entry within the queue based on the arrival time; and assign the first entry for service at the walk-up location. | 1. A computing system disposed within a computational instance of a remote network management platform that remotely manages a managed network, the computing system comprising:
a database storing a queue of entries for a walk-up location co-located with the managed network, wherein the entries indicate technical issues to be addressed at the walk-up location; and a queue management software module configured to:
receive, from a computing device, a request to insert a first entry into the queue;
insert the first entry into the queue;
monitor a travel time between a location of the computing device and the walk-up location;
determine a wait time until the first entry reaches a predetermined position within the queue;
in response to the travel time meeting or exceeding the wait time, transmit a notification to the computing device, wherein reception of the notification by the computing device causes the computing device to display an instruction to depart for the walk-up location;
determine an arrival time of the computing device at the walk-up location based on updated locations of the computing device following the departure;
adjust a position of the first entry within the queue based on the arrival time; and
based on the computing device arriving at the walk-up location, assign the first entry for service at the walk-up location. 2. The computing system of claim 1, wherein the queue management software module is further configured to receive, from a second computing device associated with the walk-up location, instructions to generate a plurality of tasks, wherein completion of the plurality of tasks is expected to resolve at least part of the technical issue indicated by the first entry, and wherein the system further comprises:
a tasks module configured to generate the plurality of tasks in response to receiving, from the queue management software module, a request to generate the plurality of tasks; and a queue entry association module configured to associate each respective task of the plurality of tasks with (i) the first entry and (ii) at least one technician of the one or more technicians, wherein the at least one technician is assigned to complete the respective task. 3. The computing system of claim 1, wherein the queue management software module is further configured to receive, from a second computing device associated with the walk-up location, instructions to generate a plurality of catalog items to be obtained, wherein obtainment of the plurality of catalog items is expected to resolve at least part of the technical issue indicated by the first entry, and wherein the system further comprises:
a catalog items module configured to:
in response to receiving, from the queue management software module, a request to obtain the plurality of catalog items, determine a first subset of the plurality of catalog items and a second subset of the plurality of catalog items, wherein catalog items of the first subset are to be obtained from inventory associated with the managed network, and wherein catalog items of the second subset are to be obtained from outside of the inventory;
reserve catalog items of the first subset from the inventory; and
generate an order for catalog items of the second subset to be obtained from outside of the inventory; and
a queue entry association module configured to associate each respective catalog item of the plurality of catalog items with the first entry. 4. The computing system of claim 1, wherein the first entry is associated with a plurality of tasks, wherein each task of the plurality of tasks is assigned a technician to complete the task, wherein performance of a first tasks of the plurality of tasks is dependent on completion of a second task of the plurality of tasks, and wherein the queue management software module is further configured to:
in response to completion of the second task, transmit a second notification to a second computing device associated with the technician assigned to complete the first task, wherein reception of the second notification causes the second computing device to display an instruction to initiate performance of the first task. 5. The computing system of claim 1, wherein the first entry is associated with one or more tasks and one or more catalog items, wherein each task of the one or more tasks is assigned a technician to complete the task, wherein performance of a first task of the one or more tasks is dependent on obtainment of a first catalog item of the one or more catalog items, and wherein the queue management software module is further configured to:
in response to obtainment of the first catalog item, transmit a second notification to a second computing device associated with the technician assigned to complete the first task, wherein reception of the second notification causes the second computing device to display an instruction to initiate performance of the first task. 6. The computing system of claim 1, wherein the queue management software module is configured to monitor the travel time between the location of the computing device and the walk-up location by:
receiving, from the computing device, data representing the location of the computing device; determining a distance between the location of the computing device and the walk-up location; and determining the travel time for traversing the distance at a predetermined walking speed. 7. The computing system of claim 1, wherein the queue of entries comprises a first sub-queue of entries awaiting assignment for service at the walk-up location and a second sub-queue of entries assigned for service at the walk-up location, wherein the queue management software module is configured to insert the first entry into the queue by inserting the first entry into the first sub-queue, and wherein the queue management software module is configured to assign the first entry for service at the walk-up location by:
removing the first entry from the first sub-queue; and inserting the first entry into the second sub-queue. 8. The computing system of claim 1, wherein the queue management software module is configured to assign the first entry for service at the walk-up location by:
based on the computing device arriving at the walk-up location, transmitting a second notification to a second computing device associated with the walk-up location, wherein reception of the second notification by the second computing device causes the second computing device to display an indication of the computing device arriving at the walk-up location; receiving, from the second computing device, instructions to assign the computing device to a first technician of one or more technicians at the walk-up location; and assigning the computing device to the first technician. 9. The computing system of claim 1, wherein the queue management software module is configured to adjust the position of the first entry within the queue based on the arrival time by:
determining an updated wait time until the first entry reaches a head of the queue; moving the first entry closer to a tail of the queue when the arrival time exceeds the updated wait time; and moving the first entry closer to a head of the queue when the updated wait time exceeds the arrival time. 10. The computing system of claim 1, wherein the queue management software module is further configured to:
in response to receiving the request to insert the first entry into the queue, identify one or more troubleshooting guides to assist in resolution of the technical issue indicated by the first entry; and transmit the one or more troubleshooting guides to the computing device. 11. The computing system of claim 1, wherein the queue management software module is further configured to:
receive, from a second computing device associated with the walk-up location, an indication of resolution of the technical issue associated with the first entry; and in response to receiving the indication of resolution, removing the first entry from the queue. 12. The computing system of claim 1, wherein the queue management software module is further configured to:
receive a request to view the queue; and in response to receiving the request to view the queue, transmit, to the computing device, (i) first data representing the queue and (ii) second data representing system-wide outages within the managed network, wherein reception of the first and second data causes the computing device to display, by way of a user interface and in respective sections thereof, the queue and an indication of the system-wide outages. 13. The computing system of claim 1, wherein the queue management software module is configured to insert the first entry into the queue by:
determining a position within the queue for the first entry based on at least one of (i) a priority corresponding to the technical issue associated with the first entry and (ii) a priority corresponding to a user identity associated with the computing device; and inserting the first entry into the queue at the determined position. 14. The computing system of claim 1, wherein the queue management software module is further configured to:
after resolution of the technical issue associated with the first entry, transmit a satisfaction survey to the computing device; receive, from the computing device, responses to the satisfaction survey based on resolution of the technical issue associated with the first entry; receive, from the computing device, a subsequent request to insert a second entry into the queue, wherein the second entry is associated with another technical issue; determine a position in the queue for the second entry based on the responses to the satisfaction survey; and insert the second entry into the queue at the determined position. 15. The computing system of claim 1, wherein the queue is a first queue of a plurality of queues, wherein each queue of the plurality of queues corresponds to a respective type of technical issue of a plurality of different types of technical issues, and wherein the queue management software module is configured to insert the first entry into the first queue by:
classifying the technical issue associated with the first entry as a first type of technical issue of the plurality of different types of technical issues; and based on the classification of the technical issue as the first type of technical issue, selecting the first queue from the plurality of queues, wherein the first queue corresponds to the first type of technical issue; and inserting the first entry into the first queue. 16. The computing system of claim 1, wherein the queue management software module is further configured to:
receive, from the computing device, a selection of the predetermined position within the queue. 17. The computing system of claim 1, further comprising:
a notification module configured to transmit notifications by way of one or more notification channels; and a notification manager configured to (i) select one or more of the notification channels provided by the notification module based on pre-set parameters associated with the computing device and (ii) instruct the notification module to transmit the notification to the computing device by way of the one or more selected notification channels, wherein the queue management software module is configured to transmit the notification to the computing device by transmitting, to the notification manager, a content of the notification. 18. A method comprising:
receiving, from a computing device and by a computational instance of a remote network management platform that remotely manages a managed network, a request to insert a first entry into a queue of entries for a walk-up location co-located with the managed network, wherein the entries indicate technical issues to be addressed at the walk-up location; inserting, by the computational instance, the first entry into the queue; monitoring, by the computational instance, a travel time between a location of the computing device and the walk-up location; determining, by the computational instance, a wait time until the first entry reaches a predetermined position within the queue; in response to the travel time meeting or exceeding the wait time, transmitting, by the computational instance, a notification to the computing device, wherein reception of the notification by the computing device causes the computing device to display an instruction to depart for the walk-up location; determining, by the computational instance, an arrival time of the computing device at the walk-up location based on updated locations of the computing device following the departure; adjusting, by the computational instance, a position of the first entry within the queue based on the arrival time; and based on the computing device arriving at the walk-up location, assigning, by the computational instance, the first entry for service at the walk-up location. 19. The method of claim 18, further comprising:
receiving, from a second computing device associated with the walk-up location, instructions to generate a plurality of tasks to be completed by one or more technicians, wherein completion of the plurality of tasks is expected to resolve at least part of the technical issue indicated by the first entry; generating the plurality of tasks in response to receiving the instructions to generate the plurality of tasks; and associating each respective task of the plurality of tasks with (i) the first entry and (ii) at least one technician of the one or more technicians, wherein the at least one technician is assigned to complete the respective task. 20. An article of manufacture including a non-transitory computer-readable medium, having stored thereon program instructions that, upon execution by a computing system, cause the computing system to perform operations comprising:
receiving, from a computing device, a request to insert a first entry into a queue of entries for a walk-up location co-located with a managed network, wherein the entries indicate technical issues to be addressed at the walk-up location; inserting the first entry into the queue; monitoring a travel time between a location of the computing device and the walk-up location; determining a wait time until the first entry reaches a predetermined position within the queue; in response to the travel time meeting or exceeding the wait time, transmitting a notification to the computing device, wherein reception of the notification by the computing device causes the computing device to display an instruction to depart for the walk-up location; determining an arrival time of the computing device at the walk-up location based on updated locations of the computing device following the departure; adjusting a position of the first entry within the queue based on the arrival time; and based on the computing device arriving at the walk-up location, assigning the first entry for service at the walk-up location. | An example system includes a database storing a queue of entries indicating technical issues to be addressed at a walk-up location. The system also includes a queue management software module configured to: receive, from a computing device, a request to insert a first entry into the queue; monitor a travel time between a location of the computing device and the walk-up location; determine a wait time until the first entry reaches a predetermined position within the queue; in response to the travel time meeting or exceeding the wait time, transmit a notification to the computing device instructing to depart for the walk-up location; determine an arrival time at the walk-up location based on updated locations of the computing device following the departure; adjust a position of the first entry within the queue based on the arrival time; and assign the first entry for service at the walk-up location.1. A computing system disposed within a computational instance of a remote network management platform that remotely manages a managed network, the computing system comprising:
a database storing a queue of entries for a walk-up location co-located with the managed network, wherein the entries indicate technical issues to be addressed at the walk-up location; and a queue management software module configured to:
receive, from a computing device, a request to insert a first entry into the queue;
insert the first entry into the queue;
monitor a travel time between a location of the computing device and the walk-up location;
determine a wait time until the first entry reaches a predetermined position within the queue;
in response to the travel time meeting or exceeding the wait time, transmit a notification to the computing device, wherein reception of the notification by the computing device causes the computing device to display an instruction to depart for the walk-up location;
determine an arrival time of the computing device at the walk-up location based on updated locations of the computing device following the departure;
adjust a position of the first entry within the queue based on the arrival time; and
based on the computing device arriving at the walk-up location, assign the first entry for service at the walk-up location. 2. The computing system of claim 1, wherein the queue management software module is further configured to receive, from a second computing device associated with the walk-up location, instructions to generate a plurality of tasks, wherein completion of the plurality of tasks is expected to resolve at least part of the technical issue indicated by the first entry, and wherein the system further comprises:
a tasks module configured to generate the plurality of tasks in response to receiving, from the queue management software module, a request to generate the plurality of tasks; and a queue entry association module configured to associate each respective task of the plurality of tasks with (i) the first entry and (ii) at least one technician of the one or more technicians, wherein the at least one technician is assigned to complete the respective task. 3. The computing system of claim 1, wherein the queue management software module is further configured to receive, from a second computing device associated with the walk-up location, instructions to generate a plurality of catalog items to be obtained, wherein obtainment of the plurality of catalog items is expected to resolve at least part of the technical issue indicated by the first entry, and wherein the system further comprises:
a catalog items module configured to:
in response to receiving, from the queue management software module, a request to obtain the plurality of catalog items, determine a first subset of the plurality of catalog items and a second subset of the plurality of catalog items, wherein catalog items of the first subset are to be obtained from inventory associated with the managed network, and wherein catalog items of the second subset are to be obtained from outside of the inventory;
reserve catalog items of the first subset from the inventory; and
generate an order for catalog items of the second subset to be obtained from outside of the inventory; and
a queue entry association module configured to associate each respective catalog item of the plurality of catalog items with the first entry. 4. The computing system of claim 1, wherein the first entry is associated with a plurality of tasks, wherein each task of the plurality of tasks is assigned a technician to complete the task, wherein performance of a first tasks of the plurality of tasks is dependent on completion of a second task of the plurality of tasks, and wherein the queue management software module is further configured to:
in response to completion of the second task, transmit a second notification to a second computing device associated with the technician assigned to complete the first task, wherein reception of the second notification causes the second computing device to display an instruction to initiate performance of the first task. 5. The computing system of claim 1, wherein the first entry is associated with one or more tasks and one or more catalog items, wherein each task of the one or more tasks is assigned a technician to complete the task, wherein performance of a first task of the one or more tasks is dependent on obtainment of a first catalog item of the one or more catalog items, and wherein the queue management software module is further configured to:
in response to obtainment of the first catalog item, transmit a second notification to a second computing device associated with the technician assigned to complete the first task, wherein reception of the second notification causes the second computing device to display an instruction to initiate performance of the first task. 6. The computing system of claim 1, wherein the queue management software module is configured to monitor the travel time between the location of the computing device and the walk-up location by:
receiving, from the computing device, data representing the location of the computing device; determining a distance between the location of the computing device and the walk-up location; and determining the travel time for traversing the distance at a predetermined walking speed. 7. The computing system of claim 1, wherein the queue of entries comprises a first sub-queue of entries awaiting assignment for service at the walk-up location and a second sub-queue of entries assigned for service at the walk-up location, wherein the queue management software module is configured to insert the first entry into the queue by inserting the first entry into the first sub-queue, and wherein the queue management software module is configured to assign the first entry for service at the walk-up location by:
removing the first entry from the first sub-queue; and inserting the first entry into the second sub-queue. 8. The computing system of claim 1, wherein the queue management software module is configured to assign the first entry for service at the walk-up location by:
based on the computing device arriving at the walk-up location, transmitting a second notification to a second computing device associated with the walk-up location, wherein reception of the second notification by the second computing device causes the second computing device to display an indication of the computing device arriving at the walk-up location; receiving, from the second computing device, instructions to assign the computing device to a first technician of one or more technicians at the walk-up location; and assigning the computing device to the first technician. 9. The computing system of claim 1, wherein the queue management software module is configured to adjust the position of the first entry within the queue based on the arrival time by:
determining an updated wait time until the first entry reaches a head of the queue; moving the first entry closer to a tail of the queue when the arrival time exceeds the updated wait time; and moving the first entry closer to a head of the queue when the updated wait time exceeds the arrival time. 10. The computing system of claim 1, wherein the queue management software module is further configured to:
in response to receiving the request to insert the first entry into the queue, identify one or more troubleshooting guides to assist in resolution of the technical issue indicated by the first entry; and transmit the one or more troubleshooting guides to the computing device. 11. The computing system of claim 1, wherein the queue management software module is further configured to:
receive, from a second computing device associated with the walk-up location, an indication of resolution of the technical issue associated with the first entry; and in response to receiving the indication of resolution, removing the first entry from the queue. 12. The computing system of claim 1, wherein the queue management software module is further configured to:
receive a request to view the queue; and in response to receiving the request to view the queue, transmit, to the computing device, (i) first data representing the queue and (ii) second data representing system-wide outages within the managed network, wherein reception of the first and second data causes the computing device to display, by way of a user interface and in respective sections thereof, the queue and an indication of the system-wide outages. 13. The computing system of claim 1, wherein the queue management software module is configured to insert the first entry into the queue by:
determining a position within the queue for the first entry based on at least one of (i) a priority corresponding to the technical issue associated with the first entry and (ii) a priority corresponding to a user identity associated with the computing device; and inserting the first entry into the queue at the determined position. 14. The computing system of claim 1, wherein the queue management software module is further configured to:
after resolution of the technical issue associated with the first entry, transmit a satisfaction survey to the computing device; receive, from the computing device, responses to the satisfaction survey based on resolution of the technical issue associated with the first entry; receive, from the computing device, a subsequent request to insert a second entry into the queue, wherein the second entry is associated with another technical issue; determine a position in the queue for the second entry based on the responses to the satisfaction survey; and insert the second entry into the queue at the determined position. 15. The computing system of claim 1, wherein the queue is a first queue of a plurality of queues, wherein each queue of the plurality of queues corresponds to a respective type of technical issue of a plurality of different types of technical issues, and wherein the queue management software module is configured to insert the first entry into the first queue by:
classifying the technical issue associated with the first entry as a first type of technical issue of the plurality of different types of technical issues; and based on the classification of the technical issue as the first type of technical issue, selecting the first queue from the plurality of queues, wherein the first queue corresponds to the first type of technical issue; and inserting the first entry into the first queue. 16. The computing system of claim 1, wherein the queue management software module is further configured to:
receive, from the computing device, a selection of the predetermined position within the queue. 17. The computing system of claim 1, further comprising:
a notification module configured to transmit notifications by way of one or more notification channels; and a notification manager configured to (i) select one or more of the notification channels provided by the notification module based on pre-set parameters associated with the computing device and (ii) instruct the notification module to transmit the notification to the computing device by way of the one or more selected notification channels, wherein the queue management software module is configured to transmit the notification to the computing device by transmitting, to the notification manager, a content of the notification. 18. A method comprising:
receiving, from a computing device and by a computational instance of a remote network management platform that remotely manages a managed network, a request to insert a first entry into a queue of entries for a walk-up location co-located with the managed network, wherein the entries indicate technical issues to be addressed at the walk-up location; inserting, by the computational instance, the first entry into the queue; monitoring, by the computational instance, a travel time between a location of the computing device and the walk-up location; determining, by the computational instance, a wait time until the first entry reaches a predetermined position within the queue; in response to the travel time meeting or exceeding the wait time, transmitting, by the computational instance, a notification to the computing device, wherein reception of the notification by the computing device causes the computing device to display an instruction to depart for the walk-up location; determining, by the computational instance, an arrival time of the computing device at the walk-up location based on updated locations of the computing device following the departure; adjusting, by the computational instance, a position of the first entry within the queue based on the arrival time; and based on the computing device arriving at the walk-up location, assigning, by the computational instance, the first entry for service at the walk-up location. 19. The method of claim 18, further comprising:
receiving, from a second computing device associated with the walk-up location, instructions to generate a plurality of tasks to be completed by one or more technicians, wherein completion of the plurality of tasks is expected to resolve at least part of the technical issue indicated by the first entry; generating the plurality of tasks in response to receiving the instructions to generate the plurality of tasks; and associating each respective task of the plurality of tasks with (i) the first entry and (ii) at least one technician of the one or more technicians, wherein the at least one technician is assigned to complete the respective task. 20. An article of manufacture including a non-transitory computer-readable medium, having stored thereon program instructions that, upon execution by a computing system, cause the computing system to perform operations comprising:
receiving, from a computing device, a request to insert a first entry into a queue of entries for a walk-up location co-located with a managed network, wherein the entries indicate technical issues to be addressed at the walk-up location; inserting the first entry into the queue; monitoring a travel time between a location of the computing device and the walk-up location; determining a wait time until the first entry reaches a predetermined position within the queue; in response to the travel time meeting or exceeding the wait time, transmitting a notification to the computing device, wherein reception of the notification by the computing device causes the computing device to display an instruction to depart for the walk-up location; determining an arrival time of the computing device at the walk-up location based on updated locations of the computing device following the departure; adjusting a position of the first entry within the queue based on the arrival time; and based on the computing device arriving at the walk-up location, assigning the first entry for service at the walk-up location. | 2,400 |
9,414 | 9,414 | 15,935,091 | 2,435 | A method, computer system, and computer program product for on-demand risk assessment in on-line transactions comprises: computing, by a machine intelligence application, a risk score for the individual; providing the risk score to a cache; and responsive to receiving new data regarding the individual, calculating a new risk score for the individual and replacing the risk score in the cache with the new score. | 1. A computer-implemented method, the computer-implemented method comprising:
responsive to receiving a message, calculating, by a machine intelligence application running on a processor unit, a risk score for an individual; and providing, by the machine intelligence application running on the processor unit, the risk score to a cache; wherein the message is triggered by an event regarding the individual in an external database or an internal database and is associated with new data regarding the individual enabling improved risk assessment that results in increased security in processing transactions in a computer system. 2. The computer-implemented method of claim 1, wherein the cache is configured to provide rapid access by a risk application in responding to client computers whose functioning adjusts based on risk score levels. 3. The computer-implemented method of claim 1, further comprising:
ingesting and processing, by a data ingestion and processing application running on the processor unit, the new data regarding the individual associated with the message; and responsive to ingesting and processing the new data regarding the individual, sending the new data to the machine intelligence application. 4. The computer-implemented method of claim 3, further comprising:
responsive to receiving the new data regarding the individual, calculating, by the machine intelligence application running on the processor unit, a new risk score for the individual; and replacing, by the machine intelligence application running on the processor unit, the risk score in the cache with the new score. 5. The computer-implemented method of claim 1, further comprising:
receiving, by a data ingestion and orchestration application running on the processor unit, the new data regarding the individual; responsive to receiving the new data regarding the individual, normalizing, by the data ingestion and orchestration application, running on the processor unit, the new data regarding the individual to form a normalized data; and responsive to normalizing the new data regarding the individual to form the normalized data, providing, by the data ingestion and orchestration application running on the processor, the normalized data to the machine intelligence application. 6. The computer-implemented method of claim 5, wherein normalizing the new data comprises one or more of the following:
converting, by a normalizer application running on the processor, a first portion of the new data to converted data; combining, by the normalizer application running on the processor, a second portion of the new data to combined data; reducing, by the normalizer application running on the processor, a third portion of the new data comprising duplicate data elements to form reduced data; identifying, by the normalizer application running on the processor, a fourth portion of the new data comprising irrelevant data elements that are not relevant for the prediction of fraud and risk evaluation to form not relevant data; and identifying by the normalizer application running on the processor, a fifth portion of the new data comprising data elements that are relevant for the prediction of fraud and risk evaluation to form relevant data. 7. The computer-implemented method of claim 1, wherein calculating the risk score, further comprises:
discovering, by a risk assessor application running on the processor, patterns in the new data; detecting, by the risk assessor application running on the processor, the patterns in the new data; and detecting, by the risk assessor application running on the processor, anomalies based on the patterns in the data. 8. The computer implemented method of claim 7, wherein calculating the risk score comprises:
calculating, using probabilistic neural network algorithms running on the processor, a statistically-weighted first numerical value for a number of the patterns; and calculating, using the probabilistic neural network algorithms running on the processor, a second numerical value for a number of anomalies detected in the patterns. 9. The computer implemented method of claim 8, further comprising:
applying machine learning algorithms, running on the processor unit, to adjust first statistical weights used for calculating a first numerical value; and applying the machine learning algorithms to adjust second statistical weights used for calculating a second numerical value for the number of anomalies. 10. The computer-implemented method of claim 3, wherein the internal data comprises audit data logs, employment and human resource lifecycle changes, individual information data changes, role changes, device registration, financial data, changes in account numbers, changes in credit card numbers or data, employment data including employment status and history, authentication data, transactions, screen navigation, screen visitations, system data, and application logs. 11. The computer-implemented method of claim 4, wherein the external data comprises public records used to validate input data provided by other applications, individual information data, credit history information, social network data and activity, fraud detection service provided data known to be associated with fraud including internet protocol addresses, mobile devices numbers, email addresses, and mailing addresses. 12. A computer system for assigning a risk score to an individual, the computer system comprising:
a processor unit; a data ingestion and orchestration application running on the processor unit; internal data sources connected to the data ingestion and orchestration application, the internal data sources configured to send a first message associated with an internal data item, responsive to a first triggering event, to the processor unit; external data sources connected to the data ingestion and orchestration framework, the external sources configured to send a second message associated with an external data item, responsive to a second triggering event, to the processor unit; a normalizer, running on the processor, to form normalized data from the internal data item and the external data item; and a machine intelligence application having an algorithm configured to receive the normalized data and to compute the risk score for an individual using the normalized data. 13. The computer system of claim 12, wherein the data ingestion and orchestration application is optimized for rapid data ingestion on a large scale. 14. The computer system of claim 12, further comprising a cache connected to the machine intelligence application and to a risk assessment application, wherein the cache is configured to provide rapid access by a risk application in responding to client computers whose functioning adjusts based on risk score levels. 15. The computer system of claim 14, wherein the risk assessment application responds to incoming queries from any of an authentication application, a registration application, a financial transaction application, an employee benefit application, and other human resource oriented applications. 16. The computer system of claim 14, wherein the risk assessment application is connected via a pluggable mechanism to an identity intelligence system. 17. The computer system of claim 12, wherein the normalizer converts, combines, or reduces duplicate data elements;
wherein the normalizer identifies irrelevant data elements that are not relevant for the prediction of fraud and risk evaluation; and wherein the normalizer identifies data elements that are relevant for the prediction of fraud and risk evaluation. 18. The computer system of claim 12, wherein the machine intelligence application computes the risk score by discovering and detecting patterns in the data, and detecting anomalies based on the patterns in the data. 19. The computer system of claim 18, wherein the machine intelligence application further computes the risk score by
calculating, using probabilistic neural network algorithms, a first statistically weighted numerical value for a first number of the patterns and a second statistically weighted numerical value for a second number of anomalies; wherein the machine intelligence application adjusts statistical weights used for calculating the first numerical value in the probabilistic neural network algorithms, and adjusts weights used for calculating the second numerical value in the probabilistic neural network algorithms; and wherein the machine intelligence application continually updates the risk score based on new data. 20. A computer program product for real time risk assessment comprising:
computer-readable instructions configured to cause a processor to request a risk score for an individual; computer-readable instructions configured to cause a processor, responsive to receiving a request for a risk score, to access a cache; computer-readable instructions configured to cause a processor, responsive to accessing the cache, identify a risk score for the individual; and computer-readable instructions configured to cause a processor, responsive to identifying the risk score for the individual, determining whether to grant or deny access to the on-line transaction based on the risk score. | A method, computer system, and computer program product for on-demand risk assessment in on-line transactions comprises: computing, by a machine intelligence application, a risk score for the individual; providing the risk score to a cache; and responsive to receiving new data regarding the individual, calculating a new risk score for the individual and replacing the risk score in the cache with the new score.1. A computer-implemented method, the computer-implemented method comprising:
responsive to receiving a message, calculating, by a machine intelligence application running on a processor unit, a risk score for an individual; and providing, by the machine intelligence application running on the processor unit, the risk score to a cache; wherein the message is triggered by an event regarding the individual in an external database or an internal database and is associated with new data regarding the individual enabling improved risk assessment that results in increased security in processing transactions in a computer system. 2. The computer-implemented method of claim 1, wherein the cache is configured to provide rapid access by a risk application in responding to client computers whose functioning adjusts based on risk score levels. 3. The computer-implemented method of claim 1, further comprising:
ingesting and processing, by a data ingestion and processing application running on the processor unit, the new data regarding the individual associated with the message; and responsive to ingesting and processing the new data regarding the individual, sending the new data to the machine intelligence application. 4. The computer-implemented method of claim 3, further comprising:
responsive to receiving the new data regarding the individual, calculating, by the machine intelligence application running on the processor unit, a new risk score for the individual; and replacing, by the machine intelligence application running on the processor unit, the risk score in the cache with the new score. 5. The computer-implemented method of claim 1, further comprising:
receiving, by a data ingestion and orchestration application running on the processor unit, the new data regarding the individual; responsive to receiving the new data regarding the individual, normalizing, by the data ingestion and orchestration application, running on the processor unit, the new data regarding the individual to form a normalized data; and responsive to normalizing the new data regarding the individual to form the normalized data, providing, by the data ingestion and orchestration application running on the processor, the normalized data to the machine intelligence application. 6. The computer-implemented method of claim 5, wherein normalizing the new data comprises one or more of the following:
converting, by a normalizer application running on the processor, a first portion of the new data to converted data; combining, by the normalizer application running on the processor, a second portion of the new data to combined data; reducing, by the normalizer application running on the processor, a third portion of the new data comprising duplicate data elements to form reduced data; identifying, by the normalizer application running on the processor, a fourth portion of the new data comprising irrelevant data elements that are not relevant for the prediction of fraud and risk evaluation to form not relevant data; and identifying by the normalizer application running on the processor, a fifth portion of the new data comprising data elements that are relevant for the prediction of fraud and risk evaluation to form relevant data. 7. The computer-implemented method of claim 1, wherein calculating the risk score, further comprises:
discovering, by a risk assessor application running on the processor, patterns in the new data; detecting, by the risk assessor application running on the processor, the patterns in the new data; and detecting, by the risk assessor application running on the processor, anomalies based on the patterns in the data. 8. The computer implemented method of claim 7, wherein calculating the risk score comprises:
calculating, using probabilistic neural network algorithms running on the processor, a statistically-weighted first numerical value for a number of the patterns; and calculating, using the probabilistic neural network algorithms running on the processor, a second numerical value for a number of anomalies detected in the patterns. 9. The computer implemented method of claim 8, further comprising:
applying machine learning algorithms, running on the processor unit, to adjust first statistical weights used for calculating a first numerical value; and applying the machine learning algorithms to adjust second statistical weights used for calculating a second numerical value for the number of anomalies. 10. The computer-implemented method of claim 3, wherein the internal data comprises audit data logs, employment and human resource lifecycle changes, individual information data changes, role changes, device registration, financial data, changes in account numbers, changes in credit card numbers or data, employment data including employment status and history, authentication data, transactions, screen navigation, screen visitations, system data, and application logs. 11. The computer-implemented method of claim 4, wherein the external data comprises public records used to validate input data provided by other applications, individual information data, credit history information, social network data and activity, fraud detection service provided data known to be associated with fraud including internet protocol addresses, mobile devices numbers, email addresses, and mailing addresses. 12. A computer system for assigning a risk score to an individual, the computer system comprising:
a processor unit; a data ingestion and orchestration application running on the processor unit; internal data sources connected to the data ingestion and orchestration application, the internal data sources configured to send a first message associated with an internal data item, responsive to a first triggering event, to the processor unit; external data sources connected to the data ingestion and orchestration framework, the external sources configured to send a second message associated with an external data item, responsive to a second triggering event, to the processor unit; a normalizer, running on the processor, to form normalized data from the internal data item and the external data item; and a machine intelligence application having an algorithm configured to receive the normalized data and to compute the risk score for an individual using the normalized data. 13. The computer system of claim 12, wherein the data ingestion and orchestration application is optimized for rapid data ingestion on a large scale. 14. The computer system of claim 12, further comprising a cache connected to the machine intelligence application and to a risk assessment application, wherein the cache is configured to provide rapid access by a risk application in responding to client computers whose functioning adjusts based on risk score levels. 15. The computer system of claim 14, wherein the risk assessment application responds to incoming queries from any of an authentication application, a registration application, a financial transaction application, an employee benefit application, and other human resource oriented applications. 16. The computer system of claim 14, wherein the risk assessment application is connected via a pluggable mechanism to an identity intelligence system. 17. The computer system of claim 12, wherein the normalizer converts, combines, or reduces duplicate data elements;
wherein the normalizer identifies irrelevant data elements that are not relevant for the prediction of fraud and risk evaluation; and wherein the normalizer identifies data elements that are relevant for the prediction of fraud and risk evaluation. 18. The computer system of claim 12, wherein the machine intelligence application computes the risk score by discovering and detecting patterns in the data, and detecting anomalies based on the patterns in the data. 19. The computer system of claim 18, wherein the machine intelligence application further computes the risk score by
calculating, using probabilistic neural network algorithms, a first statistically weighted numerical value for a first number of the patterns and a second statistically weighted numerical value for a second number of anomalies; wherein the machine intelligence application adjusts statistical weights used for calculating the first numerical value in the probabilistic neural network algorithms, and adjusts weights used for calculating the second numerical value in the probabilistic neural network algorithms; and wherein the machine intelligence application continually updates the risk score based on new data. 20. A computer program product for real time risk assessment comprising:
computer-readable instructions configured to cause a processor to request a risk score for an individual; computer-readable instructions configured to cause a processor, responsive to receiving a request for a risk score, to access a cache; computer-readable instructions configured to cause a processor, responsive to accessing the cache, identify a risk score for the individual; and computer-readable instructions configured to cause a processor, responsive to identifying the risk score for the individual, determining whether to grant or deny access to the on-line transaction based on the risk score. | 2,400 |
9,415 | 9,415 | 12,783,329 | 2,421 | A video receiver apparatus, for receiving video from a video transmitter apparatus, comprises: a memory portion for memorizing receiver apparatus information of the video receiver apparatus; and a transmitter/receiver portion for receiving a request for obtaining the receiver apparatus information transmitted from the video transmitter apparatus, and also for transmitting the receiver apparatus information memorized in the memory portion responding to the obtaining request, and wherein, further within the memory portion is memorized history information, changing depending on alternation of the receiver apparatus information, and wherein the receiver portion is able to receive the history information, which the video transmitter apparatus holds therein, as well as, the obtaining request from the video transmitter, and when the received history information from the video transmitter apparatus and the history information, which the video transmitter apparatus holds therein, are inconsistent with each other, then the receiver apparatus information memorized in the memory portion is transmitted to the video transmitter apparatus. | 1. A video receiver apparatus, for receiving video from a video transmitter apparatus, comprising:
a memory portion, which is configured to memorize receiver apparatus information of said video receiver apparatus; and a transmitter/receiver portion, which is configured to receive a request for obtaining said receiver apparatus information transmitted from said video transmitter apparatus, and also to transmit the receiver apparatus information memorized in said memory portion responding to said obtaining request, wherein within said memory portion is memorized further history information, changing depending on alternation of said receiver apparatus information, and said receiver portion is able to receive the history information, which said video transmitter apparatus holds therein, as well as, said obtaining request from said video transmitter, and when the received history information from said video transmitter apparatus and the history information, which said video transmitter apparatus holds therein, are inconsistent with each other, said receiver apparatus information memorized in said memory portion is transmitted to said video transmitter apparatus. 2. The video receiver apparatus, as described in the claim 1, wherein a message indicating there is no alternation of said receiver apparatus information is returned to said video transmitter apparatus, without transmitting said receiver apparatus information, when the history information received from said video transmitter apparatus and the history information memorized in said memory portion are consistent with each other. 3. The video receiver apparatus, as described in the claim 1, wherein a predetermined history information is determined not be used in alternation of said revision value, and the history information are always inconsistent with, when said transmitter/receiver portion receives the predetermined history information from said video transmitter apparatus. 4. The video receiver apparatus, as described in the claim 1, wherein said receiver apparatus information is EDID, and said transmitter/receiver portion receives character data of said EDID, in addition to said history information, and returns a signal indicating there is no alternation of EDID to said video transmitter apparatus, when both the history information received and the character data are consistent with the history information and said character data, which are memorized in said memory portion. 5. The video receiver apparatus, as described in the claim 1, wherein it receives video on a radio from said video transmitter apparatus. 6. A video transmitter apparatus, for transmitting video to a video receiver apparatus, comprising:
a transmitter/receiver portion, which is configured to transmit a request for obtaining receiver apparatus information of said video receiver apparatus to said video receiver apparatus, being a destination of video transmission by said video transmitter apparatus, and also to receive the receiver apparatus information of said video receiver apparatus and history information of said receiver apparatus information; and a memory portion, which is configured to memorize said receiver apparatus information and said history information, which are received by said transmitter/receiver portion, wherein said transmitter/receiver portion transmits the request for obtaining said receiver apparatus information, as well as, said history information memorized in said memory portion, to said video receiver apparatus. 7. The video transmitter apparatus, as described in the claim 6, wherein
said transmitter/receiver portion is able to receive a message transmitted from said video receiver apparatus responding to said history information transmitted by said transmitter/receiver portion, when said message indicates that said history information transmitted is consistent with the history information held by said video receiver apparatus, said transmitter/receiver portion produces said video with using the receiver apparatus information memorized in said memory portion, and when said message indicates that said history information transmitted is inconsistent with the history information held by said video receiver apparatus, said transmitter/receiver portion rewrites memory data of said memory portion by new receiver apparatus information and revision value, which are transmitted from said video receiver apparatus, and thereby producing said video with using said new receiver apparatus information rewritten. 8. The video transmitter apparatus, as described in the claim 6, wherein said transmitter/receiver portion transmits a predetermined revision value together with said obtaining request, and receives the message indicating said inconsistence and said receiver apparatus information, when no receiver apparatus information is memorized in said memory portion, and when said video receiver apparatus is connected with, first. 9. The video transmitter apparatus, as described in the claim 6, wherein said receiver apparatus information is EDID, and said transmitter/receiver portion transmits character data of the EDID, in addition to said revision value. 10. The video transmitter apparatus, as described in the claim 7, wherein it transmits video on a radio to said video receiver apparatus. 11. A video receiver apparatus, for receiving either video or audio from a video transmitter apparatus, comprising:
a transmitter/receiver portion, which is configured to receive a request for obtaining receiver apparatus information owned by other video receiver apparatus, which is connected with said video transmitter apparatus, and also to receive the receiver apparatus information owned by said other video receiver apparatus and renewal information thereof; and a memory portion, which is configured to memorize at least a part of the receiver apparatus information owned by said video receiver apparatus and history information thereof, which are received by said transmitter/receiver portion, wherein said transmitter/receiver portion transmits a request for obtaining said receiver apparatus information, and said history information memorized in said memory portion, as well. 12. The video receiver apparatus, as described in the claim 11, wherein
said transmitter/receiver portion is able to receive a message, which is transmitted from said other video receiver apparatus responding to said history information transmitted by said transmitter/receiver portion, the receiver apparatus information memorized in said memory portion is used, when said message indicates that said history information transmitted and the history information held by said video receiver apparatus are consistent with each other, and memory data of said memory portion is re-written by new receiver apparatus information and history information, which are transmitted from said other video receiver apparatus, when said message indicates that said history information transmitted and the history information held by said video receiver apparatus are inconsistent with, whereby using the new receiver apparatus information re-written. 13. The video receiver apparatus, as described in the claim 11, wherein
said transmitter/receiver portion transmits the request for obtaining said video receiver apparatus information and said history information, passing through said video receiver apparatus, and further receives said receiver apparatus information and the history information thereof, and also said message, passing through said video transmitter apparatus. 14. A video transmitting method, within a video transmitter apparatus for transmitting at least either video or audio signal, at least to first and second video receiver apparatuses, comprising the following steps of:
Transmitting a request for obtaining receiver apparatus information owned by said second video receiver apparatus, which is received from said first video receiver apparatus; and Transmitting at least a part of the receiver apparatus information owned by said second video receiver apparatus, which is received from said second video receiver apparatus. | A video receiver apparatus, for receiving video from a video transmitter apparatus, comprises: a memory portion for memorizing receiver apparatus information of the video receiver apparatus; and a transmitter/receiver portion for receiving a request for obtaining the receiver apparatus information transmitted from the video transmitter apparatus, and also for transmitting the receiver apparatus information memorized in the memory portion responding to the obtaining request, and wherein, further within the memory portion is memorized history information, changing depending on alternation of the receiver apparatus information, and wherein the receiver portion is able to receive the history information, which the video transmitter apparatus holds therein, as well as, the obtaining request from the video transmitter, and when the received history information from the video transmitter apparatus and the history information, which the video transmitter apparatus holds therein, are inconsistent with each other, then the receiver apparatus information memorized in the memory portion is transmitted to the video transmitter apparatus.1. A video receiver apparatus, for receiving video from a video transmitter apparatus, comprising:
a memory portion, which is configured to memorize receiver apparatus information of said video receiver apparatus; and a transmitter/receiver portion, which is configured to receive a request for obtaining said receiver apparatus information transmitted from said video transmitter apparatus, and also to transmit the receiver apparatus information memorized in said memory portion responding to said obtaining request, wherein within said memory portion is memorized further history information, changing depending on alternation of said receiver apparatus information, and said receiver portion is able to receive the history information, which said video transmitter apparatus holds therein, as well as, said obtaining request from said video transmitter, and when the received history information from said video transmitter apparatus and the history information, which said video transmitter apparatus holds therein, are inconsistent with each other, said receiver apparatus information memorized in said memory portion is transmitted to said video transmitter apparatus. 2. The video receiver apparatus, as described in the claim 1, wherein a message indicating there is no alternation of said receiver apparatus information is returned to said video transmitter apparatus, without transmitting said receiver apparatus information, when the history information received from said video transmitter apparatus and the history information memorized in said memory portion are consistent with each other. 3. The video receiver apparatus, as described in the claim 1, wherein a predetermined history information is determined not be used in alternation of said revision value, and the history information are always inconsistent with, when said transmitter/receiver portion receives the predetermined history information from said video transmitter apparatus. 4. The video receiver apparatus, as described in the claim 1, wherein said receiver apparatus information is EDID, and said transmitter/receiver portion receives character data of said EDID, in addition to said history information, and returns a signal indicating there is no alternation of EDID to said video transmitter apparatus, when both the history information received and the character data are consistent with the history information and said character data, which are memorized in said memory portion. 5. The video receiver apparatus, as described in the claim 1, wherein it receives video on a radio from said video transmitter apparatus. 6. A video transmitter apparatus, for transmitting video to a video receiver apparatus, comprising:
a transmitter/receiver portion, which is configured to transmit a request for obtaining receiver apparatus information of said video receiver apparatus to said video receiver apparatus, being a destination of video transmission by said video transmitter apparatus, and also to receive the receiver apparatus information of said video receiver apparatus and history information of said receiver apparatus information; and a memory portion, which is configured to memorize said receiver apparatus information and said history information, which are received by said transmitter/receiver portion, wherein said transmitter/receiver portion transmits the request for obtaining said receiver apparatus information, as well as, said history information memorized in said memory portion, to said video receiver apparatus. 7. The video transmitter apparatus, as described in the claim 6, wherein
said transmitter/receiver portion is able to receive a message transmitted from said video receiver apparatus responding to said history information transmitted by said transmitter/receiver portion, when said message indicates that said history information transmitted is consistent with the history information held by said video receiver apparatus, said transmitter/receiver portion produces said video with using the receiver apparatus information memorized in said memory portion, and when said message indicates that said history information transmitted is inconsistent with the history information held by said video receiver apparatus, said transmitter/receiver portion rewrites memory data of said memory portion by new receiver apparatus information and revision value, which are transmitted from said video receiver apparatus, and thereby producing said video with using said new receiver apparatus information rewritten. 8. The video transmitter apparatus, as described in the claim 6, wherein said transmitter/receiver portion transmits a predetermined revision value together with said obtaining request, and receives the message indicating said inconsistence and said receiver apparatus information, when no receiver apparatus information is memorized in said memory portion, and when said video receiver apparatus is connected with, first. 9. The video transmitter apparatus, as described in the claim 6, wherein said receiver apparatus information is EDID, and said transmitter/receiver portion transmits character data of the EDID, in addition to said revision value. 10. The video transmitter apparatus, as described in the claim 7, wherein it transmits video on a radio to said video receiver apparatus. 11. A video receiver apparatus, for receiving either video or audio from a video transmitter apparatus, comprising:
a transmitter/receiver portion, which is configured to receive a request for obtaining receiver apparatus information owned by other video receiver apparatus, which is connected with said video transmitter apparatus, and also to receive the receiver apparatus information owned by said other video receiver apparatus and renewal information thereof; and a memory portion, which is configured to memorize at least a part of the receiver apparatus information owned by said video receiver apparatus and history information thereof, which are received by said transmitter/receiver portion, wherein said transmitter/receiver portion transmits a request for obtaining said receiver apparatus information, and said history information memorized in said memory portion, as well. 12. The video receiver apparatus, as described in the claim 11, wherein
said transmitter/receiver portion is able to receive a message, which is transmitted from said other video receiver apparatus responding to said history information transmitted by said transmitter/receiver portion, the receiver apparatus information memorized in said memory portion is used, when said message indicates that said history information transmitted and the history information held by said video receiver apparatus are consistent with each other, and memory data of said memory portion is re-written by new receiver apparatus information and history information, which are transmitted from said other video receiver apparatus, when said message indicates that said history information transmitted and the history information held by said video receiver apparatus are inconsistent with, whereby using the new receiver apparatus information re-written. 13. The video receiver apparatus, as described in the claim 11, wherein
said transmitter/receiver portion transmits the request for obtaining said video receiver apparatus information and said history information, passing through said video receiver apparatus, and further receives said receiver apparatus information and the history information thereof, and also said message, passing through said video transmitter apparatus. 14. A video transmitting method, within a video transmitter apparatus for transmitting at least either video or audio signal, at least to first and second video receiver apparatuses, comprising the following steps of:
Transmitting a request for obtaining receiver apparatus information owned by said second video receiver apparatus, which is received from said first video receiver apparatus; and Transmitting at least a part of the receiver apparatus information owned by said second video receiver apparatus, which is received from said second video receiver apparatus. | 2,400 |
9,416 | 9,416 | 15,773,957 | 2,468 | The present disclosure provides a method whereby a mobility management entity (MME) in a cellular communication system transmits uplink data, the method comprising: receiving uplink data from a terminal; determining if the received uplink data is an Internet Protocol (IP) packet by examining the uplink data; transmitting the uplink data to a destination node via a packet data network (PDN) if the uplink data is an IP packet; and transmitting the uplink data to the destination node via a service capability exposure function (SCEF) if the uplink data is not an IP packet, wherein the uplink data comprises an indicator for indicating whether the uplink data is an IP packet. | 1. A method for transferring data by a mobility management entity (MME) in a cellular communication system, the method comprising:
receiving uplink data from a user equipment (UE), the uplink data comprising an indicator indicating whether a connection for non-IP data is used for transfer of the uplink data; if the indicator indicates that the connection for non-IP data is used for transfer of the uplink data, transmitting the uplink data to a service capability exposure function (SCEF). 2. The method of claim 1, wherein if the UE is roaming, the uplink data is transmitted through an interworking SCEF (IWK-SCEF). 3-4. (canceled) 5. The method of claim 1, further comprising:
receiving non-IP data from the SCEF; and transmitting the non-IP data to the UE. 6. The method of claim 5, wherein if the UE is roaming, the non-IP data is received through an interworking-SCEF (IWK-SCEF). 7. The method of claim 5, further comprising generating an accounting information for charging. 8. A mobility management entity (MME) in a cellular communication system, comprising:
a transceiver; and a controller configured to: receive, through the transceiver, uplink data from a user equipment (UE), the uplink data comprising an indicator indicating whether a connection for non-IP data is used for transfer of the uplink data; and transmit the uplink data to a service capability exposure function (SCEF) if the indicator indicates that the connection for non-IP data is used for transfer of the uplink data. 9. The MME of claim 8, wherein if the UE is roaming, the uplink data is transmitted through an interworking SCEF (IWK-SCEF). 10-11. (canceled) 12. The MME of claim 8, wherein the controller is further configured to:
receive, through the transceiver, non-IP data from the SCEF; and transmit the non-IP data to at least one UE. 13. The MME of claim 12, wherein if the UE is roaming, the non-IP data is received through an interworking-SCEF (IWK-SCEF). 14. The MME of claim 8, wherein the controller is further configured to generate an accounting information for charging. 15. A method for operating a service capability exposure function (SCEF) in a cellular communication system, the method comprising:
receiving a first request message from a services capability server/application Server (SCS/AS), the first request message comprising at least one of external identifier, mobile station international subscriber directory number (MSISDN), SCS/AS reference ID or SCS/AS ID; storing at least one of the external identifier, the MSISDN or SCS/AS reference ID received from the SCS/AS: determining whether the SCS/AS is authorized to send the first request message; and transmitting a second request message to a home subscriber server (HSS) if the SCS/AS is authorized to send the first request message, the second request message comprising at least one of the external identifier or the MSISDN received from the SCS/AS. 16. The method of claim 15, further comprising:
receiving a first response message from the HSS, the first response message comprising international mobile subscriber identity (IMSI); and transmitting a second response message to the SCS/AS, the second response message comprising the SCS/AS reference ID. 17. The method of claim 16, further comprising:
receiving non-IP data from a MME; and transmitting the non-IP data to the SCS/AS based on the SCS/AS reference ID. 18. The method of claim 17, wherein if a user equipment is roaming, the non-IP data is transmitted through an interworking SCEF(IWK-SCEF). 19. The method of claim 16, further comprising:
receiving non-IP data and the SCS/AS reference ID from the SCS/AS; determining whether the SCS/AS is authorized to send the non-IP data, and that the SCS/AS exceeds a rate of data allowed for the SCS/AS; and transmitting the non-IP data to a user equipment if the SCS/AS is authorized and does not exceed the rate of data. 20. A service capability exposure function (SCEF) in a cellular communication system, comprising:
a transceiver; and a controller configured to:
receive, through the transceiver, a first request message from a services capability server/application Server (SCS/AS), the first request message comprising at least one of external identifier, mobile station international subscriber directory number (MSISDN), SCS/AS reference ID or SCS/AS ID;
store at least one of the external identifier, the MSISDN or SCS/AS reference ID received from the SCS/AS;
determine whether the SCS/AS is authorized to send the first request message; and
transmit a second request message to a home subscriber server (HSS) if the SCS/AS is authorized to send the first request message, the second request message comprising at least one of the external identifier or the MSISDN received from the SCS/AS. 21. The SCEF of claim 20, wherein the controller is further configured to:
receive a first response message from the HSS, the first response message comprising international mobile subscriber identity (IMSI); and transmit a second response message to the SCS/AS, the second response message comprising the SCS/AS reference ID. 22. The SCEF of claim 21, wherein the controller is further configured to:
receive non-IP data from a user equipment (UE); and transmit the non-IP data to the SCS/AS based on the SCS/AS reference ID. 23. The SCEF of claim 22, wherein if the UE is roaming, the non-IP data is transmitted through an interworking SCEF(IWK-SCEF). 24. The SCEF of claim 21, wherein the controller is further configured to:
receive non-IP data and the SCS/AS reference ID from the SCS/AS; determine whether the SCS/AS is authorized to send the non-IP data and that the SCS/AS exceed a rate of data allowed for the SCS/AS; and transmit the non-IP data to a user equipment if the SCS/AS is authorized and does not exceed the rate of data. | The present disclosure provides a method whereby a mobility management entity (MME) in a cellular communication system transmits uplink data, the method comprising: receiving uplink data from a terminal; determining if the received uplink data is an Internet Protocol (IP) packet by examining the uplink data; transmitting the uplink data to a destination node via a packet data network (PDN) if the uplink data is an IP packet; and transmitting the uplink data to the destination node via a service capability exposure function (SCEF) if the uplink data is not an IP packet, wherein the uplink data comprises an indicator for indicating whether the uplink data is an IP packet.1. A method for transferring data by a mobility management entity (MME) in a cellular communication system, the method comprising:
receiving uplink data from a user equipment (UE), the uplink data comprising an indicator indicating whether a connection for non-IP data is used for transfer of the uplink data; if the indicator indicates that the connection for non-IP data is used for transfer of the uplink data, transmitting the uplink data to a service capability exposure function (SCEF). 2. The method of claim 1, wherein if the UE is roaming, the uplink data is transmitted through an interworking SCEF (IWK-SCEF). 3-4. (canceled) 5. The method of claim 1, further comprising:
receiving non-IP data from the SCEF; and transmitting the non-IP data to the UE. 6. The method of claim 5, wherein if the UE is roaming, the non-IP data is received through an interworking-SCEF (IWK-SCEF). 7. The method of claim 5, further comprising generating an accounting information for charging. 8. A mobility management entity (MME) in a cellular communication system, comprising:
a transceiver; and a controller configured to: receive, through the transceiver, uplink data from a user equipment (UE), the uplink data comprising an indicator indicating whether a connection for non-IP data is used for transfer of the uplink data; and transmit the uplink data to a service capability exposure function (SCEF) if the indicator indicates that the connection for non-IP data is used for transfer of the uplink data. 9. The MME of claim 8, wherein if the UE is roaming, the uplink data is transmitted through an interworking SCEF (IWK-SCEF). 10-11. (canceled) 12. The MME of claim 8, wherein the controller is further configured to:
receive, through the transceiver, non-IP data from the SCEF; and transmit the non-IP data to at least one UE. 13. The MME of claim 12, wherein if the UE is roaming, the non-IP data is received through an interworking-SCEF (IWK-SCEF). 14. The MME of claim 8, wherein the controller is further configured to generate an accounting information for charging. 15. A method for operating a service capability exposure function (SCEF) in a cellular communication system, the method comprising:
receiving a first request message from a services capability server/application Server (SCS/AS), the first request message comprising at least one of external identifier, mobile station international subscriber directory number (MSISDN), SCS/AS reference ID or SCS/AS ID; storing at least one of the external identifier, the MSISDN or SCS/AS reference ID received from the SCS/AS: determining whether the SCS/AS is authorized to send the first request message; and transmitting a second request message to a home subscriber server (HSS) if the SCS/AS is authorized to send the first request message, the second request message comprising at least one of the external identifier or the MSISDN received from the SCS/AS. 16. The method of claim 15, further comprising:
receiving a first response message from the HSS, the first response message comprising international mobile subscriber identity (IMSI); and transmitting a second response message to the SCS/AS, the second response message comprising the SCS/AS reference ID. 17. The method of claim 16, further comprising:
receiving non-IP data from a MME; and transmitting the non-IP data to the SCS/AS based on the SCS/AS reference ID. 18. The method of claim 17, wherein if a user equipment is roaming, the non-IP data is transmitted through an interworking SCEF(IWK-SCEF). 19. The method of claim 16, further comprising:
receiving non-IP data and the SCS/AS reference ID from the SCS/AS; determining whether the SCS/AS is authorized to send the non-IP data, and that the SCS/AS exceeds a rate of data allowed for the SCS/AS; and transmitting the non-IP data to a user equipment if the SCS/AS is authorized and does not exceed the rate of data. 20. A service capability exposure function (SCEF) in a cellular communication system, comprising:
a transceiver; and a controller configured to:
receive, through the transceiver, a first request message from a services capability server/application Server (SCS/AS), the first request message comprising at least one of external identifier, mobile station international subscriber directory number (MSISDN), SCS/AS reference ID or SCS/AS ID;
store at least one of the external identifier, the MSISDN or SCS/AS reference ID received from the SCS/AS;
determine whether the SCS/AS is authorized to send the first request message; and
transmit a second request message to a home subscriber server (HSS) if the SCS/AS is authorized to send the first request message, the second request message comprising at least one of the external identifier or the MSISDN received from the SCS/AS. 21. The SCEF of claim 20, wherein the controller is further configured to:
receive a first response message from the HSS, the first response message comprising international mobile subscriber identity (IMSI); and transmit a second response message to the SCS/AS, the second response message comprising the SCS/AS reference ID. 22. The SCEF of claim 21, wherein the controller is further configured to:
receive non-IP data from a user equipment (UE); and transmit the non-IP data to the SCS/AS based on the SCS/AS reference ID. 23. The SCEF of claim 22, wherein if the UE is roaming, the non-IP data is transmitted through an interworking SCEF(IWK-SCEF). 24. The SCEF of claim 21, wherein the controller is further configured to:
receive non-IP data and the SCS/AS reference ID from the SCS/AS; determine whether the SCS/AS is authorized to send the non-IP data and that the SCS/AS exceed a rate of data allowed for the SCS/AS; and transmit the non-IP data to a user equipment if the SCS/AS is authorized and does not exceed the rate of data. | 2,400 |
9,417 | 9,417 | 16,183,178 | 2,491 | A method for filtering data packets at a firewall system is disclosed that includes receiving a data packet having a plurality of fields at a processor. Determining with the processor whether a precondition exists for one or more of the plurality of fields, where an action is associated the precondition. Performing the action associated with the precondition on the data packet with the processor if it is determined that the precondition exists for one or more of the plurality of fields. Processing the data packet using a plurality of rules with the processor if it is determined that the precondition does not exist for the one or more of the plurality of fields. Processing a second data packet by making an incremental change to the plurality of rules. | 1. A method for filtering data packets at a firewall system comprising:
receiving a data packet having a plurality of fields; determining whether a precondition evaluates to true for one or more of the plurality of fields, where an action is associated the precondition; performing the action associated with the precondition on the data packet if it is determined that the precondition exists for one or more of the plurality of fields; processing the data packet using a plurality of rules if it is determined that the precondition does not exist for the one or more of the plurality of fields; receiving a second data packet having a plurality of fields; and processing the second data packet by making an incremental change to the plurality of rules. 2. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises evaluating further conditions associated with the incremental change. 3. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises identifying one or more of the plurality of fields that are associated with a precondition associated with the incremental change. 4. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises generating the precondition by processing a Boolean expression associated with the incremental change. 5. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises applying a simplification algorithm to a feature-rich Boolean expression to generate the precondition associated with the incremental change. 6. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises simplifying a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean expressions that do not contain an OR operation associated with the incremental change. 7. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises simplifying a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean subexpressions that do not contain an OR operation and then evaluating whether one or both of the two Boolean subexpressions is always true or always false for the fields associated with the incremental change. 8. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises:
simplifying a Boolean expression associated with the incremental change that includes at least one OR operation in combination with at least two AND operations into two Boolean subexpressions that do not contain an OR operation;
evaluating whether one of the two Boolean subexpressions is always true or always for all possible values for one or more fields; and
storing the Boolean subexpression as a precondition. 9. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises:
receiving filter parameters from a graphic user interface associated with the incremental change; and
converting the filter parameters into a complex Boolean expression for subsequent processing to identify a precondition. 10. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises:
receiving a feature rich Boolean expression associated with the incremental change;
extracting the precondition from the feature rich Boolean expression; and
storing a remaining condition associated with the precondition. 11. The method of claim 10 further comprising processing the incremental change to provide optimized identification of matching conditions. 12. The method of claim 11 wherein the optimized identification of matching conditions comprises a shortcut to a matching condition based on a predetermined field value. 13. The method of claim 10 further comprising processing the remaining condition to provide optimized identification of matching conditions by:
identifying a path comprising a plurality of comparison nodes; and
identifying a path from a first node to a third node as a shortcut to a matching condition. 14. A firewall system for filtering data packets comprising:
a first processor configured to receive a data packet having a plurality of fields from a network interface; a second processor configured to retrieve a precondition from a data memory device and to use the precondition to determine whether a precondition evaluates to true for one or more of the plurality of fields by comparing the precondition to the one or more of the plurality of fields, where an action is associated the precondition; a third processor configured to perform the action associated with the precondition on the data packet if it is determined by the second processor that the precondition exists for one or more of the plurality of fields; a fourth processor configured to process the data packet using a plurality of rules if it is determined by the second processor that the precondition does not exist for the one or more of the plurality of fields; and a fifth processor configured to process a second data packet by making an incremental change to the plurality of rules. 15. The system of claim 14 wherein the third processor is configured to evaluate further conditions. 16. The system of claim 14 wherein the second processor is configured to identify one or more of the plurality of fields that are associated with a precondition. 17. The system of claim 14 further comprises a sixth processor configured to generate the precondition by processing a Boolean expression. 18. The system of claim 14 wherein the second processor is configured to apply a simplification algorithm to a feature-rich Boolean expression to generate the precondition. 19. The system of claim 14 wherein the second processor is configured to simplify a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean expressions that do not contain an OR operation. 20. The system of claim 14 wherein the second processor is configured to simplify a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean subexpressions that do not contain an OR operation and then evaluating whether one or both of the two Boolean subexpressions is always true or always false for all possible values for one or more fields. | A method for filtering data packets at a firewall system is disclosed that includes receiving a data packet having a plurality of fields at a processor. Determining with the processor whether a precondition exists for one or more of the plurality of fields, where an action is associated the precondition. Performing the action associated with the precondition on the data packet with the processor if it is determined that the precondition exists for one or more of the plurality of fields. Processing the data packet using a plurality of rules with the processor if it is determined that the precondition does not exist for the one or more of the plurality of fields. Processing a second data packet by making an incremental change to the plurality of rules.1. A method for filtering data packets at a firewall system comprising:
receiving a data packet having a plurality of fields; determining whether a precondition evaluates to true for one or more of the plurality of fields, where an action is associated the precondition; performing the action associated with the precondition on the data packet if it is determined that the precondition exists for one or more of the plurality of fields; processing the data packet using a plurality of rules if it is determined that the precondition does not exist for the one or more of the plurality of fields; receiving a second data packet having a plurality of fields; and processing the second data packet by making an incremental change to the plurality of rules. 2. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises evaluating further conditions associated with the incremental change. 3. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises identifying one or more of the plurality of fields that are associated with a precondition associated with the incremental change. 4. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises generating the precondition by processing a Boolean expression associated with the incremental change. 5. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises applying a simplification algorithm to a feature-rich Boolean expression to generate the precondition associated with the incremental change. 6. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises simplifying a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean expressions that do not contain an OR operation associated with the incremental change. 7. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises simplifying a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean subexpressions that do not contain an OR operation and then evaluating whether one or both of the two Boolean subexpressions is always true or always false for the fields associated with the incremental change. 8. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises:
simplifying a Boolean expression associated with the incremental change that includes at least one OR operation in combination with at least two AND operations into two Boolean subexpressions that do not contain an OR operation;
evaluating whether one of the two Boolean subexpressions is always true or always for all possible values for one or more fields; and
storing the Boolean subexpression as a precondition. 9. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises:
receiving filter parameters from a graphic user interface associated with the incremental change; and
converting the filter parameters into a complex Boolean expression for subsequent processing to identify a precondition. 10. The method of claim 1 wherein processing the second data packet by making the incremental change to the plurality of rules comprises:
receiving a feature rich Boolean expression associated with the incremental change;
extracting the precondition from the feature rich Boolean expression; and
storing a remaining condition associated with the precondition. 11. The method of claim 10 further comprising processing the incremental change to provide optimized identification of matching conditions. 12. The method of claim 11 wherein the optimized identification of matching conditions comprises a shortcut to a matching condition based on a predetermined field value. 13. The method of claim 10 further comprising processing the remaining condition to provide optimized identification of matching conditions by:
identifying a path comprising a plurality of comparison nodes; and
identifying a path from a first node to a third node as a shortcut to a matching condition. 14. A firewall system for filtering data packets comprising:
a first processor configured to receive a data packet having a plurality of fields from a network interface; a second processor configured to retrieve a precondition from a data memory device and to use the precondition to determine whether a precondition evaluates to true for one or more of the plurality of fields by comparing the precondition to the one or more of the plurality of fields, where an action is associated the precondition; a third processor configured to perform the action associated with the precondition on the data packet if it is determined by the second processor that the precondition exists for one or more of the plurality of fields; a fourth processor configured to process the data packet using a plurality of rules if it is determined by the second processor that the precondition does not exist for the one or more of the plurality of fields; and a fifth processor configured to process a second data packet by making an incremental change to the plurality of rules. 15. The system of claim 14 wherein the third processor is configured to evaluate further conditions. 16. The system of claim 14 wherein the second processor is configured to identify one or more of the plurality of fields that are associated with a precondition. 17. The system of claim 14 further comprises a sixth processor configured to generate the precondition by processing a Boolean expression. 18. The system of claim 14 wherein the second processor is configured to apply a simplification algorithm to a feature-rich Boolean expression to generate the precondition. 19. The system of claim 14 wherein the second processor is configured to simplify a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean expressions that do not contain an OR operation. 20. The system of claim 14 wherein the second processor is configured to simplify a Boolean expression that includes at least one OR operation in combination with at least two AND operations into two Boolean subexpressions that do not contain an OR operation and then evaluating whether one or both of the two Boolean subexpressions is always true or always false for all possible values for one or more fields. | 2,400 |
9,418 | 9,418 | 15,750,779 | 2,414 | A transmission and/or reception unit configured to transmit a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data to a base station device, and configured to receive a Radio Resource Control (RRC) Connection Release message from the base station device after transmitting the information, and a control unit configured to transit to an idle state, based on reception of the RRC Connection Release message are included. This provides establishment of a PDN connection for performing machine type communication in which a small data packet is transmitted at a low frequency, and a communication control method. | 1. A terminal device comprising:
a transmission and/or reception unit configured to:
transmit a Non-Access Stratum (NAS) message including user data and information used for notification of transmission completion of the user data to a base station device; and
receive a Radio Resource Control (RRC) Connection Release message from the base station device after transmitting the information; and
a control unit configured to transit to an idle state, based on reception of the RRC Connection Release message. 2. The terminal device according to claim 1, wherein
the terminal device supports small data transmission and machine type communication. 3. The terminal device according to claim 1, wherein the terminal device transmits the NAS message in an active state. 4. A base station device comprising:
a transmission and/or reception unit configured to:
receive a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data from a terminal device;
transfer the NAS message to a device having a mobility management function of the terminal device configured in a core network; and
transmit a Radio Resource Control (RRC) Connection Release message to the terminal device after receiving the information,
wherein the RRC Connection Release message is used for transition of the terminal device to an idle state. 5. The base station device according to claim 4, wherein
the terminal device supports small data transmission and machine type communication. 6. The base station device according to claim 4, wherein
the base station device receives the NAS message from the terminal device maintaining an active state. 7. A communication control method for a terminal device, the method comprising the steps of:
transmitting a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data to a base station device; receiving a Radio Resource Control (RRC) Connection Release message from the base station device after transmitting the information; and transiting to an idle state, based on reception of the RRC Connection Release message. 8. The communication control method for the terminal device according to claim 7, wherein
the terminal device supports small data transmission and machine type communication. 9. The communication control method for the terminal device according to claim 7, wherein
the terminal device transmits the NAS message in an active state. 10. A communication control method for a base station device, the method comprising the steps of:
receiving a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data from a terminal device; transferring the NAS message to a device having a mobility management function of the terminal device configured in a core network; and transmitting a Radio Resource Control (RRC) Connection Release message to the terminal device after receiving the information, wherein the RRC Connection Release message is used for transition of the terminal device to an idle state. 11. The communication control method for the base station device according to claim 10, wherein
the terminal device supports small data transmission and machine type communication. 12. The communication control method for the base station device according to claim 10, wherein
the base station device receives the NAS message from the terminal device maintaining an active state. | A transmission and/or reception unit configured to transmit a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data to a base station device, and configured to receive a Radio Resource Control (RRC) Connection Release message from the base station device after transmitting the information, and a control unit configured to transit to an idle state, based on reception of the RRC Connection Release message are included. This provides establishment of a PDN connection for performing machine type communication in which a small data packet is transmitted at a low frequency, and a communication control method.1. A terminal device comprising:
a transmission and/or reception unit configured to:
transmit a Non-Access Stratum (NAS) message including user data and information used for notification of transmission completion of the user data to a base station device; and
receive a Radio Resource Control (RRC) Connection Release message from the base station device after transmitting the information; and
a control unit configured to transit to an idle state, based on reception of the RRC Connection Release message. 2. The terminal device according to claim 1, wherein
the terminal device supports small data transmission and machine type communication. 3. The terminal device according to claim 1, wherein the terminal device transmits the NAS message in an active state. 4. A base station device comprising:
a transmission and/or reception unit configured to:
receive a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data from a terminal device;
transfer the NAS message to a device having a mobility management function of the terminal device configured in a core network; and
transmit a Radio Resource Control (RRC) Connection Release message to the terminal device after receiving the information,
wherein the RRC Connection Release message is used for transition of the terminal device to an idle state. 5. The base station device according to claim 4, wherein
the terminal device supports small data transmission and machine type communication. 6. The base station device according to claim 4, wherein
the base station device receives the NAS message from the terminal device maintaining an active state. 7. A communication control method for a terminal device, the method comprising the steps of:
transmitting a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data to a base station device; receiving a Radio Resource Control (RRC) Connection Release message from the base station device after transmitting the information; and transiting to an idle state, based on reception of the RRC Connection Release message. 8. The communication control method for the terminal device according to claim 7, wherein
the terminal device supports small data transmission and machine type communication. 9. The communication control method for the terminal device according to claim 7, wherein
the terminal device transmits the NAS message in an active state. 10. A communication control method for a base station device, the method comprising the steps of:
receiving a Non-Access Stratum (NAS) message including user data and information used for notifying transmission completion of the user data from a terminal device; transferring the NAS message to a device having a mobility management function of the terminal device configured in a core network; and transmitting a Radio Resource Control (RRC) Connection Release message to the terminal device after receiving the information, wherein the RRC Connection Release message is used for transition of the terminal device to an idle state. 11. The communication control method for the base station device according to claim 10, wherein
the terminal device supports small data transmission and machine type communication. 12. The communication control method for the base station device according to claim 10, wherein
the base station device receives the NAS message from the terminal device maintaining an active state. | 2,400 |
9,419 | 9,419 | 15,916,096 | 2,465 | A cable communications network provides an alternative communications path between a user equipment device and a data network to a cellular path for a communications session with a desired level of Quality of Service. A cable modem termination system, coupled to a wireless core network, e.g., a 5G core network, interacts with the wireless core network to attempt to establish a PDU session for a UE with a desired QoS level. The core sends a QoS service request message to the CMTS including a requested level of QoS, an IP address and port number for the session. The CMTS and cable modem, corresponding to the UE, negotiate and decide if the request desired QoS level can be supported over the cable between the CMTS and the cable mode for the session. | 1. A communications method, the method comprising:
receiving, at a cable mode termination system (CMTS), a QoS (Quality of Service) request requesting a desired level of QoS for a Protocol Data Unit (PDU) session for a user equipment device (UE), said QoS request including an IP address and port number used for communicating with the UE via a cable modem and said CMTS; and sending, from the CMTS, a QoS request result message communicating to a wireless network core a response to the QoS request. 2. The method of claim 1, wherein said PDU session is protocol data unit session over a logical connection between the UE and a data network which traverses the cable modem and the CMTS. 3. The method of claim 1, further comprising:
operating the CMTS to negotiate with the cable modem to determine if the requested QoS can be supported; and wherein the QoS request result message is based on whether the negotiation with the cable modem indicates a requested QoS level will be supported for the PDU session between the cable modem and the CMTS. 4. The method of claim 3, wherein the QoS request result indicates one of: i) request granted or ii) request failed. 5. The method of claim 3, further comprising:
prior to the CMTS receiving the QoS request, operating the CMTS to communicate a PDU session establishment request from the UE to the wireless network core to establish a new PDU session for the UE; and operating the CMTS to communicate PDU session signaling between the UE and wireless network core, said signaling communicating child security association information for the new PDU session along with an IP address and port number to be used for the new PDU session. 6. The method of claim 5, further comprising:
operating the CMTS to communicate a PDU session establishment accept signal sent by the wireless core to the UE via the cable modem as part of establishing the PDU session. 7. The method of claim 6, further comprising:
operating the CMTS to communicate QoS expectation information, sent by the wireless core, to the UE via the cable modem. 8. The method of claim 7 wherein the QoS expectation information is included in a grant result sent to the UE in an NAS (non-access stratum) message from the wireless core to the UE. 9. The method of claim 7, further comprising:
operating the UE to make a decision whether to implement a handoff of an ongoing voice session from a cellular wireless network to said PDU session based on the communicated QoS expectation information. 10. The method of claim 9, further comprising:
operating the CMTS to communicate a handoff signal from the UE to the wireless core, said handoff signal indicating a decision by the UE to handoff to said PDU session. 11. A communications system comprising:
a cable modem termination system (CMTS) including:
a receiver configured to receive, at a cable mode termination system (CMTS), a QoS (Quality of Service) request requesting a desired level of QoS for a Protocol Data Unit (PDU) session for a user equipment device (UE), said QoS request including an IP address and port number used for communicating with the UE via a cable modem and said CMTS; and
a transmitter configured to send, from the CMTS, a QoS request result message communicating to a wireless network core a response to the QoS request. 12. The communications system of claim 11, wherein said PDU session is protocol data unit session over a logical connection between the UE and a data network which traverses the cable modem and the CMTS. 13. The communications system of claim 12, wherein said cable modem termination system further includes:
a first processor configured to operate the CMTS to negotiate with the cable modem to determine if the requested QoS can be supported; and wherein the QoS request result message is based on whether the negotiation with the cable modem indicates a requested QoS level will be supported for the PDU session between the cable modem and the CMTS. 14. The communications system of claim 13, wherein the QoS request result indicates one of: i) request granted or ii) request failed. 15. The communications system of claim 13, wherein said first processor is further configured to:
operate the CMTS to communicate, prior to the CMTS receiving the QoS request, a PDU session establishment request from the UE to the wireless network core to establish a new PDU session for the UE; and operate the CMTS to communicate, prior to the CMTS receiving the QoS request, PDU session signaling between the UE and wireless network core, said signaling communicating child security association information for the new PDU session along with an IP address and port number to be used for the new PDU session. 16. The communications system of claim 15, wherein said first processor is further configured to:
operate the CMTS to communicate a PDU session establishment accept signal sent by the wireless core to the UE via the cable modem as part of establishing the PDU session. 17. The communications system of claim 16, wherein said first processor is further configured to:
operate the CMTS to communicate QoS expectation information, sent by the wireless core, to the UE via the cable modem. 18. The communications system of claim 17, further comprising said UE device; and
wherein said UE device includes a second processor configured to operate the UE to make a decision whether to implement a handoff of an ongoing voice session from a cellular wireless network to said PDU session based on the communicated QoS expectation information. 19. The communications system of claim 17, wherein said first processor is further configured to:
operate the CMTS to communicate a handoff signal from the UE to the wireless core, said handoff signal indicating a decision by the UE to handoff to said PDU session. 20. A non-transitory computer readable medium including computer executable instructions which when executed by one or more processors of a communications system cause the communications system to perform the steps of:
receiving, at a cable mode termination system (CMTS), a QoS (Quality of Service) request requesting a desired level of QoS for a Protocol Data Unit (PDU) session for a user equipment device (UE), said QoS request including an IP address and port number used for communicating with the UE via a cable modem and said CMTS; and sending, from the CMTS, a QoS request result message communicating to a wireless network core a response to the QoS request. | A cable communications network provides an alternative communications path between a user equipment device and a data network to a cellular path for a communications session with a desired level of Quality of Service. A cable modem termination system, coupled to a wireless core network, e.g., a 5G core network, interacts with the wireless core network to attempt to establish a PDU session for a UE with a desired QoS level. The core sends a QoS service request message to the CMTS including a requested level of QoS, an IP address and port number for the session. The CMTS and cable modem, corresponding to the UE, negotiate and decide if the request desired QoS level can be supported over the cable between the CMTS and the cable mode for the session.1. A communications method, the method comprising:
receiving, at a cable mode termination system (CMTS), a QoS (Quality of Service) request requesting a desired level of QoS for a Protocol Data Unit (PDU) session for a user equipment device (UE), said QoS request including an IP address and port number used for communicating with the UE via a cable modem and said CMTS; and sending, from the CMTS, a QoS request result message communicating to a wireless network core a response to the QoS request. 2. The method of claim 1, wherein said PDU session is protocol data unit session over a logical connection between the UE and a data network which traverses the cable modem and the CMTS. 3. The method of claim 1, further comprising:
operating the CMTS to negotiate with the cable modem to determine if the requested QoS can be supported; and wherein the QoS request result message is based on whether the negotiation with the cable modem indicates a requested QoS level will be supported for the PDU session between the cable modem and the CMTS. 4. The method of claim 3, wherein the QoS request result indicates one of: i) request granted or ii) request failed. 5. The method of claim 3, further comprising:
prior to the CMTS receiving the QoS request, operating the CMTS to communicate a PDU session establishment request from the UE to the wireless network core to establish a new PDU session for the UE; and operating the CMTS to communicate PDU session signaling between the UE and wireless network core, said signaling communicating child security association information for the new PDU session along with an IP address and port number to be used for the new PDU session. 6. The method of claim 5, further comprising:
operating the CMTS to communicate a PDU session establishment accept signal sent by the wireless core to the UE via the cable modem as part of establishing the PDU session. 7. The method of claim 6, further comprising:
operating the CMTS to communicate QoS expectation information, sent by the wireless core, to the UE via the cable modem. 8. The method of claim 7 wherein the QoS expectation information is included in a grant result sent to the UE in an NAS (non-access stratum) message from the wireless core to the UE. 9. The method of claim 7, further comprising:
operating the UE to make a decision whether to implement a handoff of an ongoing voice session from a cellular wireless network to said PDU session based on the communicated QoS expectation information. 10. The method of claim 9, further comprising:
operating the CMTS to communicate a handoff signal from the UE to the wireless core, said handoff signal indicating a decision by the UE to handoff to said PDU session. 11. A communications system comprising:
a cable modem termination system (CMTS) including:
a receiver configured to receive, at a cable mode termination system (CMTS), a QoS (Quality of Service) request requesting a desired level of QoS for a Protocol Data Unit (PDU) session for a user equipment device (UE), said QoS request including an IP address and port number used for communicating with the UE via a cable modem and said CMTS; and
a transmitter configured to send, from the CMTS, a QoS request result message communicating to a wireless network core a response to the QoS request. 12. The communications system of claim 11, wherein said PDU session is protocol data unit session over a logical connection between the UE and a data network which traverses the cable modem and the CMTS. 13. The communications system of claim 12, wherein said cable modem termination system further includes:
a first processor configured to operate the CMTS to negotiate with the cable modem to determine if the requested QoS can be supported; and wherein the QoS request result message is based on whether the negotiation with the cable modem indicates a requested QoS level will be supported for the PDU session between the cable modem and the CMTS. 14. The communications system of claim 13, wherein the QoS request result indicates one of: i) request granted or ii) request failed. 15. The communications system of claim 13, wherein said first processor is further configured to:
operate the CMTS to communicate, prior to the CMTS receiving the QoS request, a PDU session establishment request from the UE to the wireless network core to establish a new PDU session for the UE; and operate the CMTS to communicate, prior to the CMTS receiving the QoS request, PDU session signaling between the UE and wireless network core, said signaling communicating child security association information for the new PDU session along with an IP address and port number to be used for the new PDU session. 16. The communications system of claim 15, wherein said first processor is further configured to:
operate the CMTS to communicate a PDU session establishment accept signal sent by the wireless core to the UE via the cable modem as part of establishing the PDU session. 17. The communications system of claim 16, wherein said first processor is further configured to:
operate the CMTS to communicate QoS expectation information, sent by the wireless core, to the UE via the cable modem. 18. The communications system of claim 17, further comprising said UE device; and
wherein said UE device includes a second processor configured to operate the UE to make a decision whether to implement a handoff of an ongoing voice session from a cellular wireless network to said PDU session based on the communicated QoS expectation information. 19. The communications system of claim 17, wherein said first processor is further configured to:
operate the CMTS to communicate a handoff signal from the UE to the wireless core, said handoff signal indicating a decision by the UE to handoff to said PDU session. 20. A non-transitory computer readable medium including computer executable instructions which when executed by one or more processors of a communications system cause the communications system to perform the steps of:
receiving, at a cable mode termination system (CMTS), a QoS (Quality of Service) request requesting a desired level of QoS for a Protocol Data Unit (PDU) session for a user equipment device (UE), said QoS request including an IP address and port number used for communicating with the UE via a cable modem and said CMTS; and sending, from the CMTS, a QoS request result message communicating to a wireless network core a response to the QoS request. | 2,400 |
9,420 | 9,420 | 15,999,154 | 2,433 | Systems and methods are disclosed for accessing protected data. A computing device may have a secured stared storage accessible by two or more applications operating on the mobile device. The computing device may obtain a first token from an authorization service to verify user identity for a first application. The first token may be stored in the shared storage area, and be accessible to one or more applications sharing the storage space. In response to a user attempt to access a web service using a second application, the user identity may be verified using the first token. The authorization service may verify user credentials, and send a second token to the computing device. The second token may be a proxy ticket authorizing access and exchange of protected data between the second application and a web service. The second token may also be stored in the secure storage area. | 1. A system for accessing protected data, the system comprising:
a secure storage shared between two or more applications on a computing device; a processor; and a memory storing a set of instructions that, when executed by the processor, at least cause the system to:
obtain a first token associated with a user identity for accessing a first application;
store the first token in the secure storage;
send, to an authorization service, the first token, an identifier of a second application, and a device identifier;
receive, from the authorization service, a second token authorizing communication between the second application and a web service;
store the second token in the secure storage; and
access, from the web service, protected data associated with the user identity. 2. The system of claim 1, wherein the instructions that cause the system to obtain a token, further comprise instructions to:
receive user credentials for a log in to the first application; send the user credentials to the authorization service; and verify the user credentials at the authorization service. 3. The system of claim 1, wherein the secure storage is a keychain on an operating system of the computing device. 4. The system of claim 1, wherein the secure storage is established in response to downloading an application on the computing device. 5. The system of claim 1, wherein at least one of the tokens are valid for a predetermined period of time. 6. The system of claim 1, wherein the first token is a proxy granting ticket (PGT). 7. The system of claim 1, wherein the second token is a proxy ticket (PT). 8. A method for accessing protected data, comprising:
obtaining a first token associated with a user identity for accessing a first application on a computing device; storing the first token in a secure storage on the computing device, wherein the secure storage is shared between two or more applications on the computing device; sending, to an authorization service, the first token, an identifier of a second application, and a computing device identifier; receiving, from the authorization service, a second token authorizing communication between the second application and a web service; storing the second token in the secure storage; and accessing, from the web service, protected data associated with the user identity. 9. The method of claim 8, further comprising:
determining whether the first token is available in the secure storage; and requesting user credentials if the token is unavailable. 10. The method of claim 8, wherein the first token is a proxy granting ticket and the second token is a proxy ticket. 11. The method of claim 8, further comprising entering a user name and password to obtain the token. 12. The method of claim 8, wherein the secure storage is a keychain on an operating system of the computing device. 13. The method of claim 8, wherein the secure storage is established in response to downloading an application on the computing device. 14. The method of claim 8, wherein authorizing a communication between the second application and the web service comprises establishing a session for a period of time. 15. A non-transitory computer-readable storage medium comprising instructions stored thereon that, when executed by a computing device, cause the computing device to at least:
obtain a first token associated with a user identity for accessing a first application; store the first token in the secure storage; send, to an authorization service, the first token, an identifier of a second application, and a device identifier; receive, from the authorization service, a second token authorizing communication between the second application and a web service; store the second token in the secure storage; and access, from the web service, protected data associated with the user identity. 16. The non-transitory computer-readable storage medium of claim 15, further comprising instructions to:
receive user credentials for a log in to the first application; send the user credentials to the authorization service; and verify the user credentials at the authorization service. 17. The non-transitory computer-readable storage medium of claim 15, wherein the secure storage is a keychain on an operating system of the computing device. 18. The non-transitory computer-readable storage medium of claim 15, wherein the secure storage is established in response to downloading an application on the computing device. 19. The non-transitory computer-readable storage medium of claim 15, wherein at least one of the tokens are valid for a predetermined period of time. 20. The non-transitory computer-readable storage medium of claim 15, wherein the first token is a proxy granting ticket and the second token is a proxy ticket. | Systems and methods are disclosed for accessing protected data. A computing device may have a secured stared storage accessible by two or more applications operating on the mobile device. The computing device may obtain a first token from an authorization service to verify user identity for a first application. The first token may be stored in the shared storage area, and be accessible to one or more applications sharing the storage space. In response to a user attempt to access a web service using a second application, the user identity may be verified using the first token. The authorization service may verify user credentials, and send a second token to the computing device. The second token may be a proxy ticket authorizing access and exchange of protected data between the second application and a web service. The second token may also be stored in the secure storage area.1. A system for accessing protected data, the system comprising:
a secure storage shared between two or more applications on a computing device; a processor; and a memory storing a set of instructions that, when executed by the processor, at least cause the system to:
obtain a first token associated with a user identity for accessing a first application;
store the first token in the secure storage;
send, to an authorization service, the first token, an identifier of a second application, and a device identifier;
receive, from the authorization service, a second token authorizing communication between the second application and a web service;
store the second token in the secure storage; and
access, from the web service, protected data associated with the user identity. 2. The system of claim 1, wherein the instructions that cause the system to obtain a token, further comprise instructions to:
receive user credentials for a log in to the first application; send the user credentials to the authorization service; and verify the user credentials at the authorization service. 3. The system of claim 1, wherein the secure storage is a keychain on an operating system of the computing device. 4. The system of claim 1, wherein the secure storage is established in response to downloading an application on the computing device. 5. The system of claim 1, wherein at least one of the tokens are valid for a predetermined period of time. 6. The system of claim 1, wherein the first token is a proxy granting ticket (PGT). 7. The system of claim 1, wherein the second token is a proxy ticket (PT). 8. A method for accessing protected data, comprising:
obtaining a first token associated with a user identity for accessing a first application on a computing device; storing the first token in a secure storage on the computing device, wherein the secure storage is shared between two or more applications on the computing device; sending, to an authorization service, the first token, an identifier of a second application, and a computing device identifier; receiving, from the authorization service, a second token authorizing communication between the second application and a web service; storing the second token in the secure storage; and accessing, from the web service, protected data associated with the user identity. 9. The method of claim 8, further comprising:
determining whether the first token is available in the secure storage; and requesting user credentials if the token is unavailable. 10. The method of claim 8, wherein the first token is a proxy granting ticket and the second token is a proxy ticket. 11. The method of claim 8, further comprising entering a user name and password to obtain the token. 12. The method of claim 8, wherein the secure storage is a keychain on an operating system of the computing device. 13. The method of claim 8, wherein the secure storage is established in response to downloading an application on the computing device. 14. The method of claim 8, wherein authorizing a communication between the second application and the web service comprises establishing a session for a period of time. 15. A non-transitory computer-readable storage medium comprising instructions stored thereon that, when executed by a computing device, cause the computing device to at least:
obtain a first token associated with a user identity for accessing a first application; store the first token in the secure storage; send, to an authorization service, the first token, an identifier of a second application, and a device identifier; receive, from the authorization service, a second token authorizing communication between the second application and a web service; store the second token in the secure storage; and access, from the web service, protected data associated with the user identity. 16. The non-transitory computer-readable storage medium of claim 15, further comprising instructions to:
receive user credentials for a log in to the first application; send the user credentials to the authorization service; and verify the user credentials at the authorization service. 17. The non-transitory computer-readable storage medium of claim 15, wherein the secure storage is a keychain on an operating system of the computing device. 18. The non-transitory computer-readable storage medium of claim 15, wherein the secure storage is established in response to downloading an application on the computing device. 19. The non-transitory computer-readable storage medium of claim 15, wherein at least one of the tokens are valid for a predetermined period of time. 20. The non-transitory computer-readable storage medium of claim 15, wherein the first token is a proxy granting ticket and the second token is a proxy ticket. | 2,400 |
9,421 | 9,421 | 15,900,239 | 2,462 | Systems and methods for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, implemented in a network element, include monitoring received control frames; determining which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on the received control frames; and forwarding data frames on the determined line port. The systems and methods can further include, subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, determining a change in the topology based on the received control frames; and updating the forwarding of the data frames based on the change. | 1. A method for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, implemented in a network element, the method comprising:
monitoring received control frames; determining which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on detecting transformations of the received control frames; and forwarding data frames on the determined line port. 2. The method of claim 1, further comprising:
subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, determining a change in the topology based on the received control frames; and updating the forwarding of the data frames based on the change. 3. (canceled) 4. The method of claim 1, wherein the transformations comprise adjustments to one or more of Priority Code Point (PCP) and Drop Eligible Indicator (DEI) values in the control frame. 5. The method of claim 1, wherein the transformations comprise detection of a Virtual Local Area Network (VLAN) tag. 6. The method of claim 1, wherein the received control frames are multicast by terminal network elements in the G.8032 ring and prevented from a loop in the G.8032 based on a ring block. 7. The method of claim 1, wherein the network element is configured to not perform Media Access Control (MAC) learning and flooding for forwarding decisions. 8. The method of claim 1, wherein the G.8032 ring provides Ethernet Ring Protection in conjunction with one of an Ethernet Private Line (EPL) service and an Ethernet Private Local Area Network (EPLAN) service. 9. The method of claim 1, wherein the control frames are sent at an interval of 10 ms or less. 10. An apparatus configured for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, implemented in a network element, the apparatus comprising:
circuitry configured to monitor received control frames; circuitry configured to determine which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on detection of transformations of the received control frames; and circuitry configured to forward data frames on the determined line port. 11. The apparatus of claim 10, further comprising:
circuitry configured to determine a change in the topology based on the received control frames subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, wherein the circuitry configured to forward data frames is updated based on the change. 12. (canceled) 13. The apparatus of claim 10, wherein the transformations comprise adjustments to one or more of Priority Code Point (PCP) and Drop Eligible Indicator (DEI) values in the control frame. 14. The apparatus of claim 10, wherein the transformations comprise detection of a Virtual Local Area Network (VLAN) tag. 15. The apparatus of claim 10, wherein the received control frames are multicast by terminal network elements in the G.8032 ring and prevented from a loop in the G.8032 based on a ring block. 16. The apparatus of claim 10, wherein the network element is configured to not perform Media Access Control (MAC) learning and flooding for forwarding decisions. 17. The apparatus of claim 10, wherein the G.8032 ring provides Ethernet Ring Protection in conjunction with one of an Ethernet Private Line (EPL) service and an Ethernet Private Local Area Network (EPLAN) service. 18. The apparatus of claim 10, wherein the control frames are sent at an interval of 10 ms or less. 19. A network element configured for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, the network element comprising:
a plurality of ports and switching circuitry configured to switch frames between the plurality of ports; and a controller communicatively coupled to the plurality of ports and the switching circuitry, wherein the controller is configured to
monitor received control frames,
determine which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on detection of transformations of the received control frames, and
cause the data frames to be forwarded on the determined line port. 20. The network element of claim 19, wherein the controller is further configured to
determine a change in the topology based on the received control frames subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, and cause the data frames to be forwarded based on the change. | Systems and methods for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, implemented in a network element, include monitoring received control frames; determining which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on the received control frames; and forwarding data frames on the determined line port. The systems and methods can further include, subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, determining a change in the topology based on the received control frames; and updating the forwarding of the data frames based on the change.1. A method for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, implemented in a network element, the method comprising:
monitoring received control frames; determining which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on detecting transformations of the received control frames; and forwarding data frames on the determined line port. 2. The method of claim 1, further comprising:
subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, determining a change in the topology based on the received control frames; and updating the forwarding of the data frames based on the change. 3. (canceled) 4. The method of claim 1, wherein the transformations comprise adjustments to one or more of Priority Code Point (PCP) and Drop Eligible Indicator (DEI) values in the control frame. 5. The method of claim 1, wherein the transformations comprise detection of a Virtual Local Area Network (VLAN) tag. 6. The method of claim 1, wherein the received control frames are multicast by terminal network elements in the G.8032 ring and prevented from a loop in the G.8032 based on a ring block. 7. The method of claim 1, wherein the network element is configured to not perform Media Access Control (MAC) learning and flooding for forwarding decisions. 8. The method of claim 1, wherein the G.8032 ring provides Ethernet Ring Protection in conjunction with one of an Ethernet Private Line (EPL) service and an Ethernet Private Local Area Network (EPLAN) service. 9. The method of claim 1, wherein the control frames are sent at an interval of 10 ms or less. 10. An apparatus configured for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, implemented in a network element, the apparatus comprising:
circuitry configured to monitor received control frames; circuitry configured to determine which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on detection of transformations of the received control frames; and circuitry configured to forward data frames on the determined line port. 11. The apparatus of claim 10, further comprising:
circuitry configured to determine a change in the topology based on the received control frames subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, wherein the circuitry configured to forward data frames is updated based on the change. 12. (canceled) 13. The apparatus of claim 10, wherein the transformations comprise adjustments to one or more of Priority Code Point (PCP) and Drop Eligible Indicator (DEI) values in the control frame. 14. The apparatus of claim 10, wherein the transformations comprise detection of a Virtual Local Area Network (VLAN) tag. 15. The apparatus of claim 10, wherein the received control frames are multicast by terminal network elements in the G.8032 ring and prevented from a loop in the G.8032 based on a ring block. 16. The apparatus of claim 10, wherein the network element is configured to not perform Media Access Control (MAC) learning and flooding for forwarding decisions. 17. The apparatus of claim 10, wherein the G.8032 ring provides Ethernet Ring Protection in conjunction with one of an Ethernet Private Line (EPL) service and an Ethernet Private Local Area Network (EPLAN) service. 18. The apparatus of claim 10, wherein the control frames are sent at an interval of 10 ms or less. 19. A network element configured for Ethernet forwarding based on inferring topology in a G.8032 ring via control frames, the network element comprising:
a plurality of ports and switching circuitry configured to switch frames between the plurality of ports; and a controller communicatively coupled to the plurality of ports and the switching circuitry, wherein the controller is configured to
monitor received control frames,
determine which line port on the network element in the G.8032 ring is active based on the received control frames such that the topology of the G.8032 ring is inferred based on detection of transformations of the received control frames, and
cause the data frames to be forwarded on the determined line port. 20. The network element of claim 19, wherein the controller is further configured to
determine a change in the topology based on the received control frames subsequent to a fault and associated G.8032 protection which modifies ring blocks in the G.8032 ring, and cause the data frames to be forwarded based on the change. | 2,400 |
9,422 | 9,422 | 16,030,772 | 2,419 | Some embodiments provide a method that processes network data through a network. The method receives a packet destined for a network host associated with a logical datapath set implemented by a set of managed edge switching elements and a set of managed non-edge switching elements in the network. The method determines whether the packet is a known packet. When the packet is a known packet, the method forwards the packet to a managed switching element in the set of managed edge switching elements for forwarding to the network host. When the packet is not a known packet, the method forwards the packet to a managed switching element in the set of managed non-edge switching elements for further processing. | 1-19. (canceled) 20. For a managed non-edge switching element (MNESE), a method for processing packets for a logical datapath set (LDPS) implemented by the MNESE and a plurality of managed edge switching elements (MESEs), the method comprising:
receiving, at the first MNESE, a packet having a destination address associated with the LDPS from a first MESE coupled to a source machine, wherein each particular MESE that implements the LDPS has at least one machine associated with the LDPS coupled directly to the particular MESE; and forwarding the packet to the destination address through a third MESE of the plurality of other MESEs, wherein the MNESE stores data for forwarding packets to a plurality of destination addresses and does not receive packets directly from the machines associated with the LDPS, wherein the packet is received based on a determination that the destination address is unknown to the first MESE, the first MESE transmitting the packet via a first tunnel to the MNESE and not to any other MESE in the plurality of MESEs, wherein, based on a determination that the destination address is known to the first MESE, the packet is transmitted via a first tunnel to a second MESE in the plurality of other MESEs to which the destination address corresponds. 21. The method of claim 20, wherein the determination that the destination is unknown comprises performing a lookup operation on a forwarding table to determine whether the destination address is known. 22. The method of claim 20, wherein the determination that the destination is known comprises performing a lookup operation on a forwarding table that includes an entry that matches a media access control (MAC) address that is specified in a header of the packet. 23. The method of claim 22, wherein the MAC address is a destination MAC address. 24. The method of claim 21, wherein the destination address is determined to be unknown when the forwarding table does not include an entry that matches a MAC address that is specified in a header of the packet. 25. The method of claim 20, wherein the MESEs comprise a set of managed software switching elements. 26. The method of claim 20, wherein the MESEs comprise a set of managed virtual switching elements. 27. The method of claim 20, wherein the MESEs comprise a set of managed hardware switching elements. 28. The method of claim 20 further comprising, when the MNESE does not know the destination address, flooding a network with a set of packets, each particular packet in the set of packets including a destination MAC address specified in the header of the packet as the particular packet's destination MAC address. 29. The method of claim 20 further comprising identifying the destination address of the packet before transmitting the packet to the third MESE. 30. A non-transitory machine readable medium storing a program which when executed by at least one processing unit of a managed non-edge switching element (MNESE) processes packets for a logical datapath set (LDPS) implemented by the MNESE and a plurality of managed edge switching elements (MESEs), the program comprising sets of instructions for:
receiving, at the first MNESE, a packet having a destination address associated with the LDPS from a first MESE coupled to a source machine, wherein each particular MESE that implements the LDPS has at least one machine associated with the LDPS coupled directly to the particular MESE; and forwarding the packet to the destination address through a third MESE of the plurality of other MESEs, wherein the MNESE stores data for forwarding packets to a plurality of destination addresses and does not receive packets directly from the machines associated with the LDPS, wherein the packet is received based on a determination that the destination address is unknown to the first MESE, the first MESE transmitting the packet via a first tunnel to the MNESE and not to any other MESE in the plurality of MESEs, wherein, based on a determination that the destination address is known to the first MESE, the packet is transmitted via a first tunnel to a second MESE in the plurality of other MESEs to which the destination address corresponds. 31. The non-transitory machine readable medium of claim 30, wherein the determination that the destination is unknown comprises performing a lookup operation on a forwarding table to determine whether the destination address is known. 32. The non-transitory machine readable medium of claim 30, wherein the determination that the destination is known comprises performing a lookup operation on a forwarding table that includes an entry that matches a media access control (MAC) address that is specified in a header of the packet. 33. The non-transitory machine readable medium of claim 32, wherein the MAC address is a destination MAC address. 34. The non-transitory machine readable medium of claim 31, wherein the destination address is determined to be unknown when the forwarding table does not include an entry that matches a MAC address that is specified in a header of the packet. 35. The non-transitory machine readable medium of claim 30, wherein the MESEs comprise a set of managed software switching elements. 36. The non-transitory machine readable medium of claim 30, wherein the MESEs comprise a set of managed virtual switching elements. 37. The non-transitory machine readable medium of claim 30, wherein the MESEs comprise a set of managed hardware switching elements. 38. The non-transitory machine readable medium of claim 30 further comprising asset of instructions for, when the MNESE does not know the destination address, flooding a network with a set of packets, each particular packet in the set of packets including a destination MAC address specified in the header of the packet as the particular packet's destination MAC address. 39. The non-transitory machine readable medium of claim 30 further comprising a set of instruction for identifying the destination address of the packet before transmitting the packet to the third MESE. | Some embodiments provide a method that processes network data through a network. The method receives a packet destined for a network host associated with a logical datapath set implemented by a set of managed edge switching elements and a set of managed non-edge switching elements in the network. The method determines whether the packet is a known packet. When the packet is a known packet, the method forwards the packet to a managed switching element in the set of managed edge switching elements for forwarding to the network host. When the packet is not a known packet, the method forwards the packet to a managed switching element in the set of managed non-edge switching elements for further processing.1-19. (canceled) 20. For a managed non-edge switching element (MNESE), a method for processing packets for a logical datapath set (LDPS) implemented by the MNESE and a plurality of managed edge switching elements (MESEs), the method comprising:
receiving, at the first MNESE, a packet having a destination address associated with the LDPS from a first MESE coupled to a source machine, wherein each particular MESE that implements the LDPS has at least one machine associated with the LDPS coupled directly to the particular MESE; and forwarding the packet to the destination address through a third MESE of the plurality of other MESEs, wherein the MNESE stores data for forwarding packets to a plurality of destination addresses and does not receive packets directly from the machines associated with the LDPS, wherein the packet is received based on a determination that the destination address is unknown to the first MESE, the first MESE transmitting the packet via a first tunnel to the MNESE and not to any other MESE in the plurality of MESEs, wherein, based on a determination that the destination address is known to the first MESE, the packet is transmitted via a first tunnel to a second MESE in the plurality of other MESEs to which the destination address corresponds. 21. The method of claim 20, wherein the determination that the destination is unknown comprises performing a lookup operation on a forwarding table to determine whether the destination address is known. 22. The method of claim 20, wherein the determination that the destination is known comprises performing a lookup operation on a forwarding table that includes an entry that matches a media access control (MAC) address that is specified in a header of the packet. 23. The method of claim 22, wherein the MAC address is a destination MAC address. 24. The method of claim 21, wherein the destination address is determined to be unknown when the forwarding table does not include an entry that matches a MAC address that is specified in a header of the packet. 25. The method of claim 20, wherein the MESEs comprise a set of managed software switching elements. 26. The method of claim 20, wherein the MESEs comprise a set of managed virtual switching elements. 27. The method of claim 20, wherein the MESEs comprise a set of managed hardware switching elements. 28. The method of claim 20 further comprising, when the MNESE does not know the destination address, flooding a network with a set of packets, each particular packet in the set of packets including a destination MAC address specified in the header of the packet as the particular packet's destination MAC address. 29. The method of claim 20 further comprising identifying the destination address of the packet before transmitting the packet to the third MESE. 30. A non-transitory machine readable medium storing a program which when executed by at least one processing unit of a managed non-edge switching element (MNESE) processes packets for a logical datapath set (LDPS) implemented by the MNESE and a plurality of managed edge switching elements (MESEs), the program comprising sets of instructions for:
receiving, at the first MNESE, a packet having a destination address associated with the LDPS from a first MESE coupled to a source machine, wherein each particular MESE that implements the LDPS has at least one machine associated with the LDPS coupled directly to the particular MESE; and forwarding the packet to the destination address through a third MESE of the plurality of other MESEs, wherein the MNESE stores data for forwarding packets to a plurality of destination addresses and does not receive packets directly from the machines associated with the LDPS, wherein the packet is received based on a determination that the destination address is unknown to the first MESE, the first MESE transmitting the packet via a first tunnel to the MNESE and not to any other MESE in the plurality of MESEs, wherein, based on a determination that the destination address is known to the first MESE, the packet is transmitted via a first tunnel to a second MESE in the plurality of other MESEs to which the destination address corresponds. 31. The non-transitory machine readable medium of claim 30, wherein the determination that the destination is unknown comprises performing a lookup operation on a forwarding table to determine whether the destination address is known. 32. The non-transitory machine readable medium of claim 30, wherein the determination that the destination is known comprises performing a lookup operation on a forwarding table that includes an entry that matches a media access control (MAC) address that is specified in a header of the packet. 33. The non-transitory machine readable medium of claim 32, wherein the MAC address is a destination MAC address. 34. The non-transitory machine readable medium of claim 31, wherein the destination address is determined to be unknown when the forwarding table does not include an entry that matches a MAC address that is specified in a header of the packet. 35. The non-transitory machine readable medium of claim 30, wherein the MESEs comprise a set of managed software switching elements. 36. The non-transitory machine readable medium of claim 30, wherein the MESEs comprise a set of managed virtual switching elements. 37. The non-transitory machine readable medium of claim 30, wherein the MESEs comprise a set of managed hardware switching elements. 38. The non-transitory machine readable medium of claim 30 further comprising asset of instructions for, when the MNESE does not know the destination address, flooding a network with a set of packets, each particular packet in the set of packets including a destination MAC address specified in the header of the packet as the particular packet's destination MAC address. 39. The non-transitory machine readable medium of claim 30 further comprising a set of instruction for identifying the destination address of the packet before transmitting the packet to the third MESE. | 2,400 |
9,423 | 9,423 | 15,813,599 | 2,436 | According to one configuration, a wireless access service provider selects and assigns a particular authentication option amongst multiple different authentication options to an entity such as a wireless access point or a sub-network supported by the wireless access point. When a communication device attempts to use the corresponding wireless access point provided by the wireless access service provider, a wireless access gateway receives information from the wireless access point indicating the particular authentication option assigned to authenticate the communication device. The wireless access gateway communicates the notification of the particular authentication option to an authentication manager, which provides the wireless access gateway with network address information indicating a captive portal in which to authenticate the communication device. The wireless access gateway then uses the network address information to redirect the communication device to the captive portal, which is then used to authenticate the communication device. to access the Internet. | 1. A method comprising:
receiving notification of a particular authentication option in which to authenticate a communication device to communicate over a newly established wireless communication link, the particular authentication option being one of multiple available authentication options; communicating the notification of the particular authentication option to an authentication resource; and initiating authentication of the communication device via the particular authentication option. 2. The method as in claim 1 further comprising:
receiving the notification of the particular authentication option along with a request for content generated by the communication device to retrieve the content over the wireless communication link. 3. The method as in claim 2 further comprising:
communicating the notification of the particular authentication option to the authentication resource and initiating authentication of the communication device via the particular authentication option prior to communicating the content as specified by the request to the communication device. 4. The method as in claim 3, wherein the authentication resource is operable to map the notification to a network address of a web page supporting the particular authentication option in which to authenticate the communication device; and
wherein initiating authentication of the communication device via the particular authentication option includes communicating the authentication web page to the communication device to authenticate the communication device. 5. The method as in claim 1, wherein the notification includes first data and second data, the first data indicating which of multiple candidate vendors has been chosen to authenticate the communication device, wherein the second data in the notification indicates which of multiple available authentication options provided by the chosen candidate vendor has been chosen to authenticate the communication device. 6. The method as in claim 5, wherein a wireless service provider controlling authentication of the newly established wireless communication link selects: i) the first data to indicate the chosen vendor, and ii) the second data to indicate the chosen authentication option provided by the chosen vendor. 7. The method as in claim 1 further comprising:
receiving the notification from a wireless access point, the newly established wireless communication link extending between the communication device and the wireless access point. 8. The method as in claim 1, wherein the particular authentication option is assigned to a wireless access point to which the communication device is connected via the newly established wireless communication link. 9. The method as in claim 1, wherein the particular authentication option is assigned to a particular wireless sub-network of a corresponding wireless network supported by a respective wireless access point to which the communication device is connected via the newly established wireless communication link, the corresponding wireless network being one of multiple wireless sub-networks supported by the respective wireless access point. 10. The method as in claim 1, wherein initiating authentication of the communication device via the particular authentication option includes:
via a captive portal as specified by the particular authentication option, delivering a web page to a user of the communication device over the newly established wireless communication link; via input to the web page, receiving authentication credentials from the user to use the newly established wireless communication link; and forwarding the credentials to the authentication resource to authenticate the communication device. 11. A system comprising:
a wireless access point, the wireless access point in communication with a communication device over a wireless communication link; and gateway hardware communicatively coupled to the wireless access point, the gateway hardware operable to:
receive notification specifying a particular authentication option in which to authenticate the communication device to communicate over the wireless communication link, the particular authentication option being one of multiple available authentication options;
communicate the notification of the particular authentication option to an authentication resource; and
initiate authentication of the communication device via the particular authentication option. 12. The system as in claim 11, wherein the gateway hardware is operable to receive the notification of the particular authentication option from the wireless access point. 13. The system as in claim 12, wherein the notification is generated in response to a request for content generated by the communication device to retrieve the content over the wireless communication link. 14. The system as in claim 13, wherein the gateway hardware is operable to communicate the notification of the particular authentication option to the authentication resource and initiate authentication of the communication device via the particular authentication option prior to communicating the content as specified by the request to the communication device. 15. The system as in claim 14, wherein the authentication resource is operable to map the notification to a network address of a captive portal supporting the particular authentication option in which to authenticate the communication device; and
wherein the captive portal is operable to communicate an authentication web page to the communication device to authenticate the communication device. 16. The system as in claim 11, wherein the notification includes first data and second data, the first data indicating which of multiple candidate vendors has been chosen to authenticate the communication device, wherein the second data in the notification indicates which of multiple available authentication options provided by the chosen candidate vendor has been chosen to authenticate the communication device. 17. The system as in claim 11, wherein a wireless service provider providing use of the wireless access point pre-selects the particular authentication option by selecting: i) a vendor, and ii) an authentication option provided by the chosen vendor. 18. The system as in claim 11, wherein the particular authentication option is assigned to the wireless access point to which the communication device is connected via the wireless communication link. 19. The system as in claim 11, wherein the particular authentication option is assigned to a particular wireless network name of a corresponding wireless network supported by the wireless access point to which the communication device is connected via the wireless communication link, the corresponding wireless network being one of multiple wireless networks supported by the respective wireless access point. 20. The system as in claim 11, wherein the gateway hardware is further operable to:
redirect the communication device to communicate with the authentication resource to authenticate the communication device for use of the wireless communication link. 21. Computer-readable storage hardware having instructions stored thereon, the instructions, when executed by computer processor hardware, cause the computer processor hardware to:
receive notification of a particular authentication option in which to authenticate a communication device to communicate over a newly established wireless communication link, the particular authentication option being one of multiple available authentication options; communicate the notification of the particular authentication option to an authentication resource; and initiate authentication of the communication device via the particular authentication option. 22. A system comprising:
a wireless access point, the wireless access point in communication with a communication device over a wireless communication link; and gateway hardware communicatively coupled to the wireless access point, the gateway hardware operable to:
select an authentication option in which to authenticate the communication device to communicate over the wireless communication link, the selected authentication option being one of multiple available authentication options; and
initiate authentication of the communication device using the selected authentication option. | According to one configuration, a wireless access service provider selects and assigns a particular authentication option amongst multiple different authentication options to an entity such as a wireless access point or a sub-network supported by the wireless access point. When a communication device attempts to use the corresponding wireless access point provided by the wireless access service provider, a wireless access gateway receives information from the wireless access point indicating the particular authentication option assigned to authenticate the communication device. The wireless access gateway communicates the notification of the particular authentication option to an authentication manager, which provides the wireless access gateway with network address information indicating a captive portal in which to authenticate the communication device. The wireless access gateway then uses the network address information to redirect the communication device to the captive portal, which is then used to authenticate the communication device. to access the Internet.1. A method comprising:
receiving notification of a particular authentication option in which to authenticate a communication device to communicate over a newly established wireless communication link, the particular authentication option being one of multiple available authentication options; communicating the notification of the particular authentication option to an authentication resource; and initiating authentication of the communication device via the particular authentication option. 2. The method as in claim 1 further comprising:
receiving the notification of the particular authentication option along with a request for content generated by the communication device to retrieve the content over the wireless communication link. 3. The method as in claim 2 further comprising:
communicating the notification of the particular authentication option to the authentication resource and initiating authentication of the communication device via the particular authentication option prior to communicating the content as specified by the request to the communication device. 4. The method as in claim 3, wherein the authentication resource is operable to map the notification to a network address of a web page supporting the particular authentication option in which to authenticate the communication device; and
wherein initiating authentication of the communication device via the particular authentication option includes communicating the authentication web page to the communication device to authenticate the communication device. 5. The method as in claim 1, wherein the notification includes first data and second data, the first data indicating which of multiple candidate vendors has been chosen to authenticate the communication device, wherein the second data in the notification indicates which of multiple available authentication options provided by the chosen candidate vendor has been chosen to authenticate the communication device. 6. The method as in claim 5, wherein a wireless service provider controlling authentication of the newly established wireless communication link selects: i) the first data to indicate the chosen vendor, and ii) the second data to indicate the chosen authentication option provided by the chosen vendor. 7. The method as in claim 1 further comprising:
receiving the notification from a wireless access point, the newly established wireless communication link extending between the communication device and the wireless access point. 8. The method as in claim 1, wherein the particular authentication option is assigned to a wireless access point to which the communication device is connected via the newly established wireless communication link. 9. The method as in claim 1, wherein the particular authentication option is assigned to a particular wireless sub-network of a corresponding wireless network supported by a respective wireless access point to which the communication device is connected via the newly established wireless communication link, the corresponding wireless network being one of multiple wireless sub-networks supported by the respective wireless access point. 10. The method as in claim 1, wherein initiating authentication of the communication device via the particular authentication option includes:
via a captive portal as specified by the particular authentication option, delivering a web page to a user of the communication device over the newly established wireless communication link; via input to the web page, receiving authentication credentials from the user to use the newly established wireless communication link; and forwarding the credentials to the authentication resource to authenticate the communication device. 11. A system comprising:
a wireless access point, the wireless access point in communication with a communication device over a wireless communication link; and gateway hardware communicatively coupled to the wireless access point, the gateway hardware operable to:
receive notification specifying a particular authentication option in which to authenticate the communication device to communicate over the wireless communication link, the particular authentication option being one of multiple available authentication options;
communicate the notification of the particular authentication option to an authentication resource; and
initiate authentication of the communication device via the particular authentication option. 12. The system as in claim 11, wherein the gateway hardware is operable to receive the notification of the particular authentication option from the wireless access point. 13. The system as in claim 12, wherein the notification is generated in response to a request for content generated by the communication device to retrieve the content over the wireless communication link. 14. The system as in claim 13, wherein the gateway hardware is operable to communicate the notification of the particular authentication option to the authentication resource and initiate authentication of the communication device via the particular authentication option prior to communicating the content as specified by the request to the communication device. 15. The system as in claim 14, wherein the authentication resource is operable to map the notification to a network address of a captive portal supporting the particular authentication option in which to authenticate the communication device; and
wherein the captive portal is operable to communicate an authentication web page to the communication device to authenticate the communication device. 16. The system as in claim 11, wherein the notification includes first data and second data, the first data indicating which of multiple candidate vendors has been chosen to authenticate the communication device, wherein the second data in the notification indicates which of multiple available authentication options provided by the chosen candidate vendor has been chosen to authenticate the communication device. 17. The system as in claim 11, wherein a wireless service provider providing use of the wireless access point pre-selects the particular authentication option by selecting: i) a vendor, and ii) an authentication option provided by the chosen vendor. 18. The system as in claim 11, wherein the particular authentication option is assigned to the wireless access point to which the communication device is connected via the wireless communication link. 19. The system as in claim 11, wherein the particular authentication option is assigned to a particular wireless network name of a corresponding wireless network supported by the wireless access point to which the communication device is connected via the wireless communication link, the corresponding wireless network being one of multiple wireless networks supported by the respective wireless access point. 20. The system as in claim 11, wherein the gateway hardware is further operable to:
redirect the communication device to communicate with the authentication resource to authenticate the communication device for use of the wireless communication link. 21. Computer-readable storage hardware having instructions stored thereon, the instructions, when executed by computer processor hardware, cause the computer processor hardware to:
receive notification of a particular authentication option in which to authenticate a communication device to communicate over a newly established wireless communication link, the particular authentication option being one of multiple available authentication options; communicate the notification of the particular authentication option to an authentication resource; and initiate authentication of the communication device via the particular authentication option. 22. A system comprising:
a wireless access point, the wireless access point in communication with a communication device over a wireless communication link; and gateway hardware communicatively coupled to the wireless access point, the gateway hardware operable to:
select an authentication option in which to authenticate the communication device to communicate over the wireless communication link, the selected authentication option being one of multiple available authentication options; and
initiate authentication of the communication device using the selected authentication option. | 2,400 |
9,424 | 9,424 | 15,163,612 | 2,466 | Systems, methods, and computer-readable media are provided for de-duplicating sensed data packets in a network. As data packets of a particular network flow move through the network, the data packets can be sensed and reported by various sensors across the network. An optimal sensor of the network can be determined based upon data packets reported by the various sensors. Data packets sensed and reported by the optimal sensor can be preserved for network analysis. Duplicative data packets of the particular network flow sensed and reported by other sensors of the network can be discarded to save storage capacity and processing power of network-flow analysis tools. Analysis of the particular network flow can be performed based upon the data packets sensed by the optimal sensor and non-duplicative data packets of the particular network-flow sensed by other sensors of the network. | 1. A method comprising:
receiving, from a plurality of sensors in a network, data packets of a particular network flow of the network; analyzing the data packets to determine a specific sensor of the plurality of sensors; preserving data packets sensed and reported from the specific sensor; determining duplicative data packets sensed and reported from other sensor(s) of the plurality of sensors based upon the data packets reported from the specific sensor; discarding the duplicative data packets sensed and reported from the other sensor(s); and analyzing the particular network flow based upon the data packets reported from the specific sensor and non-duplicative data packets reported from the other sensor(s). 2. The method of claim 1, further comprising:
analyzing the data packets from the plurality of sensors to determine a number of data packets sensed by each sensor of the plurality of sensors, wherein the specific sensor has sensed the most number of data packets of the particular network flow among the plurality of sensors. 3. The method of claim 1, wherein the receiving, from the plurality of sensors, the data packets of the particular network flow comprises:
receiving, from the plurality of sensors, data packets of the particular network flow for a predetermined time period, wherein the specific sensor is determined based upon the data packets of the particular network flow sensed during the predetermined time period. 4. The method of claim 1, wherein the receiving, from the plurality of sensors, the data packets of the particular network flow further comprises:
sampling the data packets of the particular network flow received from the plurality of sensors, wherein the specific sensor is determined based upon sampled data packets of the particular network flow. 5. The method of claim 1, further comprising:
reconciling the data packets of the particular network flow received from the plurality of sensors; and determining non-duplicative data packets of the particular network flow, wherein the specific sensor has sensed the most number of the non-duplicative data packets of the particular network flow among the plurality of sensors. 6. The method of claim 1, wherein the data packets of the particular network flow comprise a set of information to uniquely identify the particular network flow, the set of information including a source address, a destination address, a source port, destination port, a protocol, a user identification (ID), and a starting timestamp. 7. The method of claim 6, further comprising:
analyzing the data packets from the plurality of sensors to determine a starting timestamp for each of the data packets, wherein the specific sensor sensed the earliest data packet of the particular network flow. 8. The method of claim 1, wherein the particular network flow is a first user datagram protocol (UDP) network flow, further comprising:
determining that the first UDP network flow being inactive for a predetermined time period; and using a new flow start-time to distinguish a second UDP network flow from the first UDP network flow. 9. The method of claim 1, wherein the particular network flow is a transmission control protocol (TCP) network flow, further comprising:
determining a start of the TCP network flow based upon a three-way hand-shake. 10. The method of claim 8, further comprising:
determining an end of the TCP network flow based upon a four-way hand-shake. 11. A system comprising:
a processor; and a computer-readable storage medium storing instructions which, when executed by the processor, cause the system to perform operations comprising:
receiving, from a plurality of sensors in a network, data packets of a particular network flow of the network;
analyzing the data packets to determine a specific sensor of the plurality of sensors;
preserving data packets sensed and reported from the specific sensor;
determining duplicative data packets sensed and reported from other sensor(s) of the plurality of sensors based upon the data packets reported from the specific sensor;
discarding the duplicative data packets sensed and reported from the other sensor(s); and
analyzing the particular network flow based upon the data packets reported from the specific sensor and non-duplicative data packets reported from the other sensor(s). 12. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a number of data packets sensed by each sensor of the plurality of sensors, wherein the specific sensor has sensed the most number of data packets of the particular network flow among the plurality of sensors. 13. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
receiving, from the plurality of sensors, data packets of the particular network flow for a predetermined time period, wherein the specific sensor is determined based upon the data packets of the particular network flow sensed during the predetermined time period. 14. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
sampling the data packets of the particular network flow received from the plurality of sensors, wherein the specific sensor is determined based upon sampled data packets of the particular network flow. 15. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
reconciling the data packets of the particular network flow received from the plurality of sensors; and determining non-duplicative data packets of the particular network flow, wherein the specific sensor has sensed the most number of the non-duplicative data packets of the particular network flow among the plurality of sensors 16. The system of claim 11, wherein the data packets of the particular network flow comprise a set of information to uniquely identify the particular network flow, the set of information including a source address, a destination address, a source port, destination port, a protocol, a user identification (ID), and a starting timestamp, and wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a starting timestamp for each of the data packets, wherein the specific sensor sensed the earliest data packet of the particular network flow. 17. The system of claim 11, wherein the particular network flow is a transmission control protocol (TCP) network flow, and wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
determining a start of the TCP network flow based upon a three-way hand-shake; and determining an end of the TCP network flow based upon a four-way hand-shake. 18. A non-transitory computer-readable storage medium storing instructions for de-duplicating sensed data packets in a network, that, when executed by at least one processor of a computing system, cause the computing system to perform operations comprising:
receiving, from a plurality of sensors in the network, data packets of a particular network flow of the network; analyzing the data packets to determine a specific sensor of the plurality of sensors; preserving data packets sensed and reported from the specific sensor; determining duplicative data packets sensed and reported from other sensor(s) of the plurality of sensors based upon the data packets reported from the specific sensor; discarding the duplicative data packets sensed and reported from the other sensor(s); and analyzing the particular network flow based upon the data packets reported from the specific sensor and non-duplicative data packets reported from the other sensor(s). 19. The non-transitory computer-readable storage medium of claim 18, wherein the instructions, when executed by the at least one processor, cause the computing system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a number of data packets sensed by each sensor of the plurality of sensors, wherein the specific sensor has sensed the most number of data packets of the particular network flow among the plurality of sensors. 20. The non-transitory computer-readable storage medium of claim 18, wherein the data packets of the particular network flow comprise a set of information to uniquely identify the particular network flow, the set of information including a source address, a destination address, a source port, destination port, a protocol, a user identification (ID), and a starting timestamp, and wherein the instructions, when executed by the at least one processor, cause the computing system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a starting timestamp for each of the data packets, wherein the specific sensor sensed the earliest data packet of the particular network flow. | Systems, methods, and computer-readable media are provided for de-duplicating sensed data packets in a network. As data packets of a particular network flow move through the network, the data packets can be sensed and reported by various sensors across the network. An optimal sensor of the network can be determined based upon data packets reported by the various sensors. Data packets sensed and reported by the optimal sensor can be preserved for network analysis. Duplicative data packets of the particular network flow sensed and reported by other sensors of the network can be discarded to save storage capacity and processing power of network-flow analysis tools. Analysis of the particular network flow can be performed based upon the data packets sensed by the optimal sensor and non-duplicative data packets of the particular network-flow sensed by other sensors of the network.1. A method comprising:
receiving, from a plurality of sensors in a network, data packets of a particular network flow of the network; analyzing the data packets to determine a specific sensor of the plurality of sensors; preserving data packets sensed and reported from the specific sensor; determining duplicative data packets sensed and reported from other sensor(s) of the plurality of sensors based upon the data packets reported from the specific sensor; discarding the duplicative data packets sensed and reported from the other sensor(s); and analyzing the particular network flow based upon the data packets reported from the specific sensor and non-duplicative data packets reported from the other sensor(s). 2. The method of claim 1, further comprising:
analyzing the data packets from the plurality of sensors to determine a number of data packets sensed by each sensor of the plurality of sensors, wherein the specific sensor has sensed the most number of data packets of the particular network flow among the plurality of sensors. 3. The method of claim 1, wherein the receiving, from the plurality of sensors, the data packets of the particular network flow comprises:
receiving, from the plurality of sensors, data packets of the particular network flow for a predetermined time period, wherein the specific sensor is determined based upon the data packets of the particular network flow sensed during the predetermined time period. 4. The method of claim 1, wherein the receiving, from the plurality of sensors, the data packets of the particular network flow further comprises:
sampling the data packets of the particular network flow received from the plurality of sensors, wherein the specific sensor is determined based upon sampled data packets of the particular network flow. 5. The method of claim 1, further comprising:
reconciling the data packets of the particular network flow received from the plurality of sensors; and determining non-duplicative data packets of the particular network flow, wherein the specific sensor has sensed the most number of the non-duplicative data packets of the particular network flow among the plurality of sensors. 6. The method of claim 1, wherein the data packets of the particular network flow comprise a set of information to uniquely identify the particular network flow, the set of information including a source address, a destination address, a source port, destination port, a protocol, a user identification (ID), and a starting timestamp. 7. The method of claim 6, further comprising:
analyzing the data packets from the plurality of sensors to determine a starting timestamp for each of the data packets, wherein the specific sensor sensed the earliest data packet of the particular network flow. 8. The method of claim 1, wherein the particular network flow is a first user datagram protocol (UDP) network flow, further comprising:
determining that the first UDP network flow being inactive for a predetermined time period; and using a new flow start-time to distinguish a second UDP network flow from the first UDP network flow. 9. The method of claim 1, wherein the particular network flow is a transmission control protocol (TCP) network flow, further comprising:
determining a start of the TCP network flow based upon a three-way hand-shake. 10. The method of claim 8, further comprising:
determining an end of the TCP network flow based upon a four-way hand-shake. 11. A system comprising:
a processor; and a computer-readable storage medium storing instructions which, when executed by the processor, cause the system to perform operations comprising:
receiving, from a plurality of sensors in a network, data packets of a particular network flow of the network;
analyzing the data packets to determine a specific sensor of the plurality of sensors;
preserving data packets sensed and reported from the specific sensor;
determining duplicative data packets sensed and reported from other sensor(s) of the plurality of sensors based upon the data packets reported from the specific sensor;
discarding the duplicative data packets sensed and reported from the other sensor(s); and
analyzing the particular network flow based upon the data packets reported from the specific sensor and non-duplicative data packets reported from the other sensor(s). 12. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a number of data packets sensed by each sensor of the plurality of sensors, wherein the specific sensor has sensed the most number of data packets of the particular network flow among the plurality of sensors. 13. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
receiving, from the plurality of sensors, data packets of the particular network flow for a predetermined time period, wherein the specific sensor is determined based upon the data packets of the particular network flow sensed during the predetermined time period. 14. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
sampling the data packets of the particular network flow received from the plurality of sensors, wherein the specific sensor is determined based upon sampled data packets of the particular network flow. 15. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
reconciling the data packets of the particular network flow received from the plurality of sensors; and determining non-duplicative data packets of the particular network flow, wherein the specific sensor has sensed the most number of the non-duplicative data packets of the particular network flow among the plurality of sensors 16. The system of claim 11, wherein the data packets of the particular network flow comprise a set of information to uniquely identify the particular network flow, the set of information including a source address, a destination address, a source port, destination port, a protocol, a user identification (ID), and a starting timestamp, and wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a starting timestamp for each of the data packets, wherein the specific sensor sensed the earliest data packet of the particular network flow. 17. The system of claim 11, wherein the particular network flow is a transmission control protocol (TCP) network flow, and wherein the instructions, when executed by the processor, cause the system to perform operations further comprising:
determining a start of the TCP network flow based upon a three-way hand-shake; and determining an end of the TCP network flow based upon a four-way hand-shake. 18. A non-transitory computer-readable storage medium storing instructions for de-duplicating sensed data packets in a network, that, when executed by at least one processor of a computing system, cause the computing system to perform operations comprising:
receiving, from a plurality of sensors in the network, data packets of a particular network flow of the network; analyzing the data packets to determine a specific sensor of the plurality of sensors; preserving data packets sensed and reported from the specific sensor; determining duplicative data packets sensed and reported from other sensor(s) of the plurality of sensors based upon the data packets reported from the specific sensor; discarding the duplicative data packets sensed and reported from the other sensor(s); and analyzing the particular network flow based upon the data packets reported from the specific sensor and non-duplicative data packets reported from the other sensor(s). 19. The non-transitory computer-readable storage medium of claim 18, wherein the instructions, when executed by the at least one processor, cause the computing system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a number of data packets sensed by each sensor of the plurality of sensors, wherein the specific sensor has sensed the most number of data packets of the particular network flow among the plurality of sensors. 20. The non-transitory computer-readable storage medium of claim 18, wherein the data packets of the particular network flow comprise a set of information to uniquely identify the particular network flow, the set of information including a source address, a destination address, a source port, destination port, a protocol, a user identification (ID), and a starting timestamp, and wherein the instructions, when executed by the at least one processor, cause the computing system to perform operations further comprising:
analyzing the data packets from the plurality of sensors to determine a starting timestamp for each of the data packets, wherein the specific sensor sensed the earliest data packet of the particular network flow. | 2,400 |
9,425 | 9,425 | 15,813,267 | 2,491 | An example operation may include one or more of creating a shared secret via a blockchain node member, storing the shared secret in a memory outside the blockchain, and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. | 1. A method, comprising:
creating a shared secret via a blockchain node member; storing the shared secret in a memory outside a blockchain; and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. 2. The method of claim 1, further comprising:
responsive to occurrence of the setup phase of the execution environment, searching for a variable in the execution environment via a chaincode operation, wherein the variable specifies a local secret. 3. The method of claim 2, further comprising:
responsive to a failure to identify the variable, returning an empty set. 4. The method of claim 1, further comprising:
responsive to occurrence of the setup phase of the execution environment, setting an invoking node bit value via a chaincode operation; and resetting an initial value of the invoking node bit value. 5. The method of claim 2, further comprising:
setting the local secret to a next value argument (n+1), where a value of ‘n’ is a number of arguments in the chaincode. 6. The method of claim 2, further comprising:
removing a last argument from the chaincode; comparing the last argument bit-by-bit to the local secret; and when the value of the last argument and the local secret are the same, setting the invoking node bit value. 7. The method of claim 6, further comprising:
responsive to determining the value of the last argument and the local secret are the same, granting access to a caller and callee to invoke the chaincode. 8. An apparatus, comprising:
a processor configured to:
create a shared secret via a blockchain node member;
store the shared secret in a memory outside a blockchain; and
share the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. 9. The apparatus of claim 8, wherein the processor is further configured to:
responsive to occurrence of the setup phase of the execution environment, search for a variable in the execution environment via a chaincode operation, wherein the variable specifies a local secret. 10. The apparatus of claim 9, wherein the processor is further configured to:
responsive to a failure to identify the variable, return an empty set. 11. The apparatus of claim 8, wherein the processor is further configured to:
responsive to occurrence of the setup phase of the execution environment, set an invoking node bit value via a chaincode operation; and reset an initial value of the node bit value. 12. The apparatus of claim 9, wherein the processor is further configured to:
set the local secret to a next value argument (n+1), where a value of ‘n’ is a number of arguments in the chaincode. 13. The apparatus of claim 9, wherein the processor is further configured to:
remove a last argument from the chaincode; compare the last argument bit-by-bit to the local secret; and when the value of the last argument and the local secret are the same, set the invoking node bit value. 14. The apparatus of claim 13, wherein the processor is further configured to:
responsive to a determination that the value of the last argument and the local secret are the same, grant access to a caller and callee to invoke the chaincode. 15. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform:
creating a shared secret via a blockchain node member; storing the shared secret in a memory outside a blockchain; and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. 16. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
responsive to occurrence of the setup phase of the execution environment, searching for a variable in the execution environment via a chaincode operation, wherein the variable specifies a local secret. 17. The non-transitory computer readable storage medium of claim 16, wherein the processor is further configured to perform:
responsive to a failure to identify the variable, returning an empty set. 18. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
responsive to occurrence of the setup phase of the execution environment, setting an invoking node bit value via a chaincode operation; and resetting an initial value of the invoking node bit. 19. The non-transitory computer readable storage medium of claim 16, wherein the processor is further configured to perform:
setting the local secret to a next value argument (n+1), where a value of ‘n’ is a number of arguments in the chaincode. 20. The non-transitory computer readable storage medium of claim 19, wherein the processor is further configured to perform:
removing a last argument from the chaincode; comparing the last argument bit-by-bit to the local secret; when the value of the last argument and the local secret are the same, setting the invoking node bit value; and responsive to determining the value of the last argument and the local secret are the same, granting access to a caller and callee to invoke the chaincode. | An example operation may include one or more of creating a shared secret via a blockchain node member, storing the shared secret in a memory outside the blockchain, and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode.1. A method, comprising:
creating a shared secret via a blockchain node member; storing the shared secret in a memory outside a blockchain; and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. 2. The method of claim 1, further comprising:
responsive to occurrence of the setup phase of the execution environment, searching for a variable in the execution environment via a chaincode operation, wherein the variable specifies a local secret. 3. The method of claim 2, further comprising:
responsive to a failure to identify the variable, returning an empty set. 4. The method of claim 1, further comprising:
responsive to occurrence of the setup phase of the execution environment, setting an invoking node bit value via a chaincode operation; and resetting an initial value of the invoking node bit value. 5. The method of claim 2, further comprising:
setting the local secret to a next value argument (n+1), where a value of ‘n’ is a number of arguments in the chaincode. 6. The method of claim 2, further comprising:
removing a last argument from the chaincode; comparing the last argument bit-by-bit to the local secret; and when the value of the last argument and the local secret are the same, setting the invoking node bit value. 7. The method of claim 6, further comprising:
responsive to determining the value of the last argument and the local secret are the same, granting access to a caller and callee to invoke the chaincode. 8. An apparatus, comprising:
a processor configured to:
create a shared secret via a blockchain node member;
store the shared secret in a memory outside a blockchain; and
share the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. 9. The apparatus of claim 8, wherein the processor is further configured to:
responsive to occurrence of the setup phase of the execution environment, search for a variable in the execution environment via a chaincode operation, wherein the variable specifies a local secret. 10. The apparatus of claim 9, wherein the processor is further configured to:
responsive to a failure to identify the variable, return an empty set. 11. The apparatus of claim 8, wherein the processor is further configured to:
responsive to occurrence of the setup phase of the execution environment, set an invoking node bit value via a chaincode operation; and reset an initial value of the node bit value. 12. The apparatus of claim 9, wherein the processor is further configured to:
set the local secret to a next value argument (n+1), where a value of ‘n’ is a number of arguments in the chaincode. 13. The apparatus of claim 9, wherein the processor is further configured to:
remove a last argument from the chaincode; compare the last argument bit-by-bit to the local secret; and when the value of the last argument and the local secret are the same, set the invoking node bit value. 14. The apparatus of claim 13, wherein the processor is further configured to:
responsive to a determination that the value of the last argument and the local secret are the same, grant access to a caller and callee to invoke the chaincode. 15. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform:
creating a shared secret via a blockchain node member; storing the shared secret in a memory outside a blockchain; and sharing the shared secret with one or more other blockchain node members during a setup phase of an execution environment associated with a chaincode. 16. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
responsive to occurrence of the setup phase of the execution environment, searching for a variable in the execution environment via a chaincode operation, wherein the variable specifies a local secret. 17. The non-transitory computer readable storage medium of claim 16, wherein the processor is further configured to perform:
responsive to a failure to identify the variable, returning an empty set. 18. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
responsive to occurrence of the setup phase of the execution environment, setting an invoking node bit value via a chaincode operation; and resetting an initial value of the invoking node bit. 19. The non-transitory computer readable storage medium of claim 16, wherein the processor is further configured to perform:
setting the local secret to a next value argument (n+1), where a value of ‘n’ is a number of arguments in the chaincode. 20. The non-transitory computer readable storage medium of claim 19, wherein the processor is further configured to perform:
removing a last argument from the chaincode; comparing the last argument bit-by-bit to the local secret; when the value of the last argument and the local secret are the same, setting the invoking node bit value; and responsive to determining the value of the last argument and the local secret are the same, granting access to a caller and callee to invoke the chaincode. | 2,400 |
9,426 | 9,426 | 15,882,644 | 2,488 | Systems and methods for foreground/background separation and for studio production of a FVV. A method includes projecting, onto objects in a filming area within a studio, a predefined pattern including a large set of features; generating, based on signals reflected off of the objects and captured by a plurality of depth cameras deployed in proximity to the filming area, a local point cloud for each depth camera; separating, based on the local point clouds, between a background and a foreground of the filming area; creating, based on the local point clouds, a unified point cloud; meshing points in the unified point cloud to generate a 3D model of the objects; texturing the 3D model based on the separation and images captured by the depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to at least one viewpoint. | 1. A method for studio production of a free viewpoint video (FVV), comprising:
projecting, onto objects in a filming area within a studio, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; separating, based on the plurality of local point clouds, between a background and a foreground of the filming area of the studio; creating, based on the plurality of local point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on the separation and images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to at least one viewpoint. 2. The method of claim 1, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is textured based on at least one other image. 3. The method of claim 1, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is rendered based on a three-dimensional environment. 4. The method of claim 1, wherein the separation is based further on at least one distance key defining distances to foreground objects and to background objects. 5. The method of claim 1, wherein each depth camera is a stationary camera. 6. The method of claim 1, wherein the textured 3D model is a volumetric video at a first location and teleported to a second location in real-time. 7. The method of claim 1, further comprising:
transmitting a video to a second location, wherein the video transmitted to the second location is created by rendering the textured 3D model based on at least one location parameter and at least one pose parameter. 8. The method of claim 1, further comprising:
uploading the FVV to a cloud-based FVV repository, wherein the FVV is displayed on a user device when the user device downloads the FVV from the FVV repository. 9. The method of claim 7, wherein the user device is at least one of: an augmented reality (AR) headset, a virtual reality (VR) headset, and a smartphone. 10. The method of claim 1, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 11. The method of 1, further comprising:
compressing the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 12. The method of claim 1, further comprising:
automatically selecting the at least one viewpoint based on a trained AI model. 13. The method of claim 1, wherein the at least one viewpoint simulates at least one camera movement. 14. The method of claim 1, wherein the at least one viewpoint is selected in post processing after capturing of the signals by the plurality of depth cameras. 15. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 1. 16. A method for foreground/background video separation, comprising:
projecting, onto objects in a filming area within a studio, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; separating, based on the plurality of local point clouds, between a background and a foreground of the filming area. 17. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 16. 18. A system for studio production of a free viewpoint video (FVV), comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:
project, onto objects in a filming area within a studio, a predefined pattern including a large set of features;
generate, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area;
separate, based on the plurality of local point clouds, between a background and a foreground of the filming area of the studio;
create, based on the plurality of local point clouds, a unified point cloud;
mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects;
texture the 3D model based on the separation and images captured by the plurality of depth cameras; and
render the textured 3D model as a FVV including a series of video frames with respect to at least one viewpoint. 19. The system of claim 18, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is textured based on at least one other image. 20. The system of claim 18, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is rendered based on a three-dimensional environment. 21. The system of claim 18, wherein the separation is based further on at least one distance key defining distances to foreground objects and to background objects. 22. The system of claim 18, wherein each depth camera is a stationary camera. 23. The system of claim 18, wherein the textured 3D model is a volumetric video at a first location and transmitted to a second location in real-time. 24. The system of claim 18, wherein the system is further configured to:
transmit a video to a second location, wherein the video transmitted to the second location is created by rendering the textured 3D model based on at least one location parameter and at least one pose parameter. 25. The system of claim 18, wherein the system is further configured to:
upload the FVV to a cloud-based FVV repository, wherein the FVV is displayed on a user device when the user device downloads the FVV from the FVV repository. 26. The system of claim 25, wherein the user device is at least one of: an augmented reality (AR) headset, a virtual reality (VR) headset, and a smartphone. 27. The system of claim 18, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 28. The system of 18, wherein the system is further configured to:
compress the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 29. The system of claim 18, wherein the system is further configured to:
automatically select the at least one viewpoint based on a trained AI model. 30. The system of claim 18, wherein the at least one viewpoint simulates at least one camera movement. 31. The system of claim 18, wherein the at least one viewpoint is selected in post processing after capturing of the signals by the plurality of depth cameras. 32. A system for foreground/background video separation, comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:
project, onto objects in a filming area within a studio, a predefined pattern including a large set of features;
generate, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area;
separate, based on the plurality of local point clouds, between a background and a foreground of the filming area. | Systems and methods for foreground/background separation and for studio production of a FVV. A method includes projecting, onto objects in a filming area within a studio, a predefined pattern including a large set of features; generating, based on signals reflected off of the objects and captured by a plurality of depth cameras deployed in proximity to the filming area, a local point cloud for each depth camera; separating, based on the local point clouds, between a background and a foreground of the filming area; creating, based on the local point clouds, a unified point cloud; meshing points in the unified point cloud to generate a 3D model of the objects; texturing the 3D model based on the separation and images captured by the depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to at least one viewpoint.1. A method for studio production of a free viewpoint video (FVV), comprising:
projecting, onto objects in a filming area within a studio, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; separating, based on the plurality of local point clouds, between a background and a foreground of the filming area of the studio; creating, based on the plurality of local point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on the separation and images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to at least one viewpoint. 2. The method of claim 1, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is textured based on at least one other image. 3. The method of claim 1, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is rendered based on a three-dimensional environment. 4. The method of claim 1, wherein the separation is based further on at least one distance key defining distances to foreground objects and to background objects. 5. The method of claim 1, wherein each depth camera is a stationary camera. 6. The method of claim 1, wherein the textured 3D model is a volumetric video at a first location and teleported to a second location in real-time. 7. The method of claim 1, further comprising:
transmitting a video to a second location, wherein the video transmitted to the second location is created by rendering the textured 3D model based on at least one location parameter and at least one pose parameter. 8. The method of claim 1, further comprising:
uploading the FVV to a cloud-based FVV repository, wherein the FVV is displayed on a user device when the user device downloads the FVV from the FVV repository. 9. The method of claim 7, wherein the user device is at least one of: an augmented reality (AR) headset, a virtual reality (VR) headset, and a smartphone. 10. The method of claim 1, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 11. The method of 1, further comprising:
compressing the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 12. The method of claim 1, further comprising:
automatically selecting the at least one viewpoint based on a trained AI model. 13. The method of claim 1, wherein the at least one viewpoint simulates at least one camera movement. 14. The method of claim 1, wherein the at least one viewpoint is selected in post processing after capturing of the signals by the plurality of depth cameras. 15. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 1. 16. A method for foreground/background video separation, comprising:
projecting, onto objects in a filming area within a studio, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; separating, based on the plurality of local point clouds, between a background and a foreground of the filming area. 17. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 16. 18. A system for studio production of a free viewpoint video (FVV), comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:
project, onto objects in a filming area within a studio, a predefined pattern including a large set of features;
generate, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area;
separate, based on the plurality of local point clouds, between a background and a foreground of the filming area of the studio;
create, based on the plurality of local point clouds, a unified point cloud;
mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects;
texture the 3D model based on the separation and images captured by the plurality of depth cameras; and
render the textured 3D model as a FVV including a series of video frames with respect to at least one viewpoint. 19. The system of claim 18, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is textured based on at least one other image. 20. The system of claim 18, wherein the foreground is textured based on signals captured by the plurality of depth cameras, wherein the background is rendered based on a three-dimensional environment. 21. The system of claim 18, wherein the separation is based further on at least one distance key defining distances to foreground objects and to background objects. 22. The system of claim 18, wherein each depth camera is a stationary camera. 23. The system of claim 18, wherein the textured 3D model is a volumetric video at a first location and transmitted to a second location in real-time. 24. The system of claim 18, wherein the system is further configured to:
transmit a video to a second location, wherein the video transmitted to the second location is created by rendering the textured 3D model based on at least one location parameter and at least one pose parameter. 25. The system of claim 18, wherein the system is further configured to:
upload the FVV to a cloud-based FVV repository, wherein the FVV is displayed on a user device when the user device downloads the FVV from the FVV repository. 26. The system of claim 25, wherein the user device is at least one of: an augmented reality (AR) headset, a virtual reality (VR) headset, and a smartphone. 27. The system of claim 18, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 28. The system of 18, wherein the system is further configured to:
compress the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 29. The system of claim 18, wherein the system is further configured to:
automatically select the at least one viewpoint based on a trained AI model. 30. The system of claim 18, wherein the at least one viewpoint simulates at least one camera movement. 31. The system of claim 18, wherein the at least one viewpoint is selected in post processing after capturing of the signals by the plurality of depth cameras. 32. A system for foreground/background video separation, comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:
project, onto objects in a filming area within a studio, a predefined pattern including a large set of features;
generate, based on signals captured by each of a plurality of depth cameras, a local point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area;
separate, based on the plurality of local point clouds, between a background and a foreground of the filming area. | 2,400 |
9,427 | 9,427 | 15,644,369 | 2,484 | One embodiment of the present invention provides a cloud-based video monitoring system comprising a camera and a network video recorder (NVR). During operation, the camera stores in a buffer last predetermined temporal segment of a video. The camera also stores a first video file in a local storage corresponding to an event detected by the camera. This first video file is non-overlapping with a second video file corresponding to the event and this second video file is stored in the NVR. The camera generates a third video file by pre-pending last predetermined temporal segment of a video prior to the event to the first video file and sends the third video file to the NVR. | 1. A method for a digital video camera in a cloud-based video monitoring system, comprising:
in response to detecting a triggering event, initiating a local video recording in a local storage device of the digital video camera and streaming a video feed of the digital video camera to a first network video recorder (NVR); detecting, by the digital video camera, a failure event that can prevent the digital video camera from streaming the video feed of the digital video camera to the first NVR; in response to detecting the failure event, initiating a backup operation for the streaming of the video feed. 2. The method of claim 1, wherein the failure event causes the first NVR to be unavailable to the digital video camera;
wherein the initiating the backup operation includes one or more of:
streaming the video feed of the digital video camera to a second NVR; and
streaming the video feed of the digital video camera to a nearby second digital video camera via a wireless link between the first and second digital cameras. 3. The method of claim 2, wherein the second digital video camera is configured to store the video feed of the digital video camera in a storage device of the second digital video camera. 4. The method of claim 2, wherein the first NVR is in a local area network of the digital video camera and the second NVR is a cloud-based NVR. 5. The method of claim 1, wherein a remote site includes a third NVR, and wherein the first and third NVRs duplicate each others' recording;
wherein the failure event causes the first NVR to be unavailable; and wherein the initiating the backup operation includes facilitating the duplicated video feed of the digital video camera from the third NVR. 6. The method of claim 1, wherein the failure event causes the digital video camera to be unavailable;
wherein the initiating the backup operation includes facilitating already recorded video feed of the digital video camera from one or more of: the first NVR and a nearby second digital video camera. 7. The method of claim 1, wherein the failure event causes a wired connection to the digital video camera to be unavailable;
wherein the initiating the backup operation includes one or more of: in response to detecting a failure to a power source of the digital video camera, using a second power source for the digital video camera and operating in a power-saving mode; and streaming the video feed of the digital video camera via respective wireless links to one or more of: a nearby second digital video camera and a second NVR. 8. The method of claim 1, wherein the failure event is a failure to one or more of: the first NVR, a switch and/or links between the first NVR and the digital video camera, a power source of the digital video camera. 9. The method of claim 1, wherein the method further comprises:
identifying a first frame of the video feed recorded by the first NVR from a control message from the first NVR; generating, from the local video recording in the local storage device, a local video segment from an initial frame of the local video recording to a frame immediately before the identified first frame; generating, by the digital video camera, a video file comprising a last temporal segment of the video stream prior to the triggering event and the local video segment; and sending the generated video file to the first NVR. 10. The method of claim 1, further comprising storing the local video recording in the local storage device at a granularity of individual video segments of the local video recording. 11. An apparatus, wherein the apparatus comprises:
a lens segment comprising an image sensor for capturing images; and a PCB comprising:
a processor;
a memory;
a network interface device; and
one or more storage devices, coupled to the processor, storing instructions which when executed by the processor cause the processor to perform a method;
wherein the method comprises:
in response to detecting a triggering event, initiating a local video recording in a local storage device of the digital video camera and streaming a video feed of the digital video camera to a first network video recorder (NVR);
detecting, by the digital video camera, a failure event that can prevent the digital video camera from streaming the video feed of the digital video camera to the first NVR;
in response to detecting the failure event, initiating a backup operation for the streaming of the video feed. 12. The apparatus of claim 11, wherein the failure event causes the first NVR to be unavailable to the digital video camera;
wherein the initiating the backup operation includes one or more of: streaming the video feed of the digital video camera to a second NVR; and streaming the video feed of the digital video camera to a nearby second digital video camera via a wireless link between the first and second digital cameras. 13. The apparatus of claim 12, wherein the second digital video camera is configured to store the video feed of the digital video camera in a storage device of the second digital video camera. 14. The apparatus of claim 12, wherein the first NVR is in a local area network of the digital video camera and the second NVR is a cloud-based NVR. 15. The apparatus of claim 11, wherein a remote site includes a third NVR, and wherein the first and third NVRs duplicate each others' recording;
wherein the failure event causes the first NVR to be unavailable; and wherein the initiating the backup operation includes facilitating the duplicated video feed of the digital video camera from the third NVR. 16. The apparatus of claim 11, wherein the failure event causes the digital video camera to be unavailable;
wherein the initiating the backup operation includes facilitating already recorded video feed of the digital video camera from one or more of: the first NVR and a nearby second digital video camera. 17. The apparatus of claim 11, wherein the failure event causes a wired connection to the digital video camera to be unavailable;
wherein the initiating the backup operation includes one or more of: in response to detecting a failure to a power source of the digital video camera, using a second power source for the digital video camera and operating in a power-saving mode; and streaming the video feed of the digital video camera via respective wireless links to one or more of: a nearby second digital video camera and a second NVR. 18. The apparatus of claim 11, wherein the failure event is a failure to one or more of: the first NVR, a switch and/or links between the first NVR and the digital video camera, a power source of the digital video camera. 19. The apparatus of claim 11, wherein the method further comprises:
identifying a first frame of the video feed recorded by the first NVR from a control message from the first NVR; generating, from the local video recording in the local storage device, a local video segment from an initial frame of the local video recording to a frame immediately before the identified first frame; generating, by the digital video camera, a video file comprising a last temporal segment of the video stream prior to the triggering event and the local video segment; and sending the generated video file to the first NVR. 20. The apparatus of claim 11, wherein the method further comprises storing the local video recording in the local storage device at a granularity of individual video segments of the local video recording. | One embodiment of the present invention provides a cloud-based video monitoring system comprising a camera and a network video recorder (NVR). During operation, the camera stores in a buffer last predetermined temporal segment of a video. The camera also stores a first video file in a local storage corresponding to an event detected by the camera. This first video file is non-overlapping with a second video file corresponding to the event and this second video file is stored in the NVR. The camera generates a third video file by pre-pending last predetermined temporal segment of a video prior to the event to the first video file and sends the third video file to the NVR.1. A method for a digital video camera in a cloud-based video monitoring system, comprising:
in response to detecting a triggering event, initiating a local video recording in a local storage device of the digital video camera and streaming a video feed of the digital video camera to a first network video recorder (NVR); detecting, by the digital video camera, a failure event that can prevent the digital video camera from streaming the video feed of the digital video camera to the first NVR; in response to detecting the failure event, initiating a backup operation for the streaming of the video feed. 2. The method of claim 1, wherein the failure event causes the first NVR to be unavailable to the digital video camera;
wherein the initiating the backup operation includes one or more of:
streaming the video feed of the digital video camera to a second NVR; and
streaming the video feed of the digital video camera to a nearby second digital video camera via a wireless link between the first and second digital cameras. 3. The method of claim 2, wherein the second digital video camera is configured to store the video feed of the digital video camera in a storage device of the second digital video camera. 4. The method of claim 2, wherein the first NVR is in a local area network of the digital video camera and the second NVR is a cloud-based NVR. 5. The method of claim 1, wherein a remote site includes a third NVR, and wherein the first and third NVRs duplicate each others' recording;
wherein the failure event causes the first NVR to be unavailable; and wherein the initiating the backup operation includes facilitating the duplicated video feed of the digital video camera from the third NVR. 6. The method of claim 1, wherein the failure event causes the digital video camera to be unavailable;
wherein the initiating the backup operation includes facilitating already recorded video feed of the digital video camera from one or more of: the first NVR and a nearby second digital video camera. 7. The method of claim 1, wherein the failure event causes a wired connection to the digital video camera to be unavailable;
wherein the initiating the backup operation includes one or more of: in response to detecting a failure to a power source of the digital video camera, using a second power source for the digital video camera and operating in a power-saving mode; and streaming the video feed of the digital video camera via respective wireless links to one or more of: a nearby second digital video camera and a second NVR. 8. The method of claim 1, wherein the failure event is a failure to one or more of: the first NVR, a switch and/or links between the first NVR and the digital video camera, a power source of the digital video camera. 9. The method of claim 1, wherein the method further comprises:
identifying a first frame of the video feed recorded by the first NVR from a control message from the first NVR; generating, from the local video recording in the local storage device, a local video segment from an initial frame of the local video recording to a frame immediately before the identified first frame; generating, by the digital video camera, a video file comprising a last temporal segment of the video stream prior to the triggering event and the local video segment; and sending the generated video file to the first NVR. 10. The method of claim 1, further comprising storing the local video recording in the local storage device at a granularity of individual video segments of the local video recording. 11. An apparatus, wherein the apparatus comprises:
a lens segment comprising an image sensor for capturing images; and a PCB comprising:
a processor;
a memory;
a network interface device; and
one or more storage devices, coupled to the processor, storing instructions which when executed by the processor cause the processor to perform a method;
wherein the method comprises:
in response to detecting a triggering event, initiating a local video recording in a local storage device of the digital video camera and streaming a video feed of the digital video camera to a first network video recorder (NVR);
detecting, by the digital video camera, a failure event that can prevent the digital video camera from streaming the video feed of the digital video camera to the first NVR;
in response to detecting the failure event, initiating a backup operation for the streaming of the video feed. 12. The apparatus of claim 11, wherein the failure event causes the first NVR to be unavailable to the digital video camera;
wherein the initiating the backup operation includes one or more of: streaming the video feed of the digital video camera to a second NVR; and streaming the video feed of the digital video camera to a nearby second digital video camera via a wireless link between the first and second digital cameras. 13. The apparatus of claim 12, wherein the second digital video camera is configured to store the video feed of the digital video camera in a storage device of the second digital video camera. 14. The apparatus of claim 12, wherein the first NVR is in a local area network of the digital video camera and the second NVR is a cloud-based NVR. 15. The apparatus of claim 11, wherein a remote site includes a third NVR, and wherein the first and third NVRs duplicate each others' recording;
wherein the failure event causes the first NVR to be unavailable; and wherein the initiating the backup operation includes facilitating the duplicated video feed of the digital video camera from the third NVR. 16. The apparatus of claim 11, wherein the failure event causes the digital video camera to be unavailable;
wherein the initiating the backup operation includes facilitating already recorded video feed of the digital video camera from one or more of: the first NVR and a nearby second digital video camera. 17. The apparatus of claim 11, wherein the failure event causes a wired connection to the digital video camera to be unavailable;
wherein the initiating the backup operation includes one or more of: in response to detecting a failure to a power source of the digital video camera, using a second power source for the digital video camera and operating in a power-saving mode; and streaming the video feed of the digital video camera via respective wireless links to one or more of: a nearby second digital video camera and a second NVR. 18. The apparatus of claim 11, wherein the failure event is a failure to one or more of: the first NVR, a switch and/or links between the first NVR and the digital video camera, a power source of the digital video camera. 19. The apparatus of claim 11, wherein the method further comprises:
identifying a first frame of the video feed recorded by the first NVR from a control message from the first NVR; generating, from the local video recording in the local storage device, a local video segment from an initial frame of the local video recording to a frame immediately before the identified first frame; generating, by the digital video camera, a video file comprising a last temporal segment of the video stream prior to the triggering event and the local video segment; and sending the generated video file to the first NVR. 20. The apparatus of claim 11, wherein the method further comprises storing the local video recording in the local storage device at a granularity of individual video segments of the local video recording. | 2,400 |
9,428 | 9,428 | 15,564,056 | 2,424 | A reception apparatus is provided that includes circuitry configured to receive a digital data stream. The circuitry is configured to acquire closed caption information included in the digital data stream. The circuitry is configured to acquire control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed. The circuitry is further configured to output the closed caption text included in the closed caption information for display to a user, at a display time according to the specific mode, based on the selection information included in the control information. | 1. A reception apparatus comprising:
circuitry configured to receive a digital data stream; acquire closed caption information included in the digital data stream, acquire control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and output the closed caption text included in the closed caption information for display to a user, at a display time according to the specific mode, based on the selection information included in the control information. 2. The reception apparatus according to claim 1, wherein
the closed caption information is a timed text markup language (TTML) file, the closed caption information includes data in accordance with an MPEG-4 (MP4) file format, the control information is a media presentation description (MPD) file in an extensible markup language (XML) format, and the TTML file and the MPD file are transmitted in a real-time object delivery over unidirectional transport (ROUTE) session. 3. The reception apparatus according to claim 2,
wherein the plurality of modes includes a first mode for display of the closed caption text according to time information specified in the TTML file, and when the specific mode is the first mode, the circuitry is configured to output the closed caption text specified in the TTML file for display according to the time information specified in the TTML file. 4. The reception apparatus according to claim 2,
wherein the plurality of modes includes a second mode for display of the closed caption text according to time information defined in the MP4 file format, and when the specific mode is the second mode, the circuitry is configured to output the closed caption text specified in the TTML file for display according to the time information defined in the MP4 file format. 5. The reception apparatus according to claim 4, wherein the circuitry is configured to
start the output of the closed caption text for display according to a media decode time defined in the MP4 file format and stored in a predetermined box, and only continue the output the closed caption text during a time period according to a sample duration stored in the predetermined box. 6. The reception apparatus according to claim 4, wherein the circuitry is configured to
start the output of the closed caption text for display according to a first media decode time defined in the MP4 file format and stored in a first predetermined box corresponding to a second predetermined box that stores target closed caption data, and continue the output until a time according to a second media decode time stored in a third predetermined box corresponding to a fourth predetermined box that stores next closed caption data. 7. The reception apparatus according to claim 2,
wherein the plurality of modes includes a third mode for display of the closed caption text irrespective of time information defined in the MP4 file format, and when the specific mode is the third mode, the circuitry is configured to output the closed caption text specified in the TTML file for display immediately upon acquiring the TTML file. 8. The reception apparatus according to claim 2,
wherein the selection information is specified based on a scheme attribute of a property element, in adaptation set elements arranged in a period element of an MPD element. 9. A data processing method comprising:
acquiring, by circuitry of a reception apparatus, closed caption information included in a digital data stream; acquiring, by the circuitry of the reception apparatus, control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and controlling, by the circuitry of the reception apparatus, output of the closed caption text included in the closed caption information, at a display time according to the specific mode, based on the selection information included in the control information. 10. A transmission apparatus comprising:
circuitry configured to generate control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and transmit a digital data stream including the control information and closed caption information including the closed caption text. 11. The transmission apparatus according to claim 10, wherein the closed caption information is a timed text markup language (TTML) file,
the closed caption information includes data in accordance with an MPEG-4 (MP4) file format, the control information is a media presentation description (MPD) file in an extensible markup language (XML) format, and the TTML file and the MPD file are transmitted in a real-time object delivery over unidirectional transport (ROUTE) session. 12. The transmission apparatus according to claim 11,
wherein the plurality of modes includes a first mode for display of the closed caption text according to time information specified in the TTML file. 13. The transmission apparatus according to claim 11,
wherein the plurality of modes includes a second mode for display of the closed caption text according to time information defined in the MP4 file format. 14. The transmission apparatus according to claim 13, wherein the second mode causes
display of the closed caption text to start according to a media decode time defined in the MP4 file format and stored in a predetermined box, and the display of the closed caption text only continues during a time period according to a sample duration stored in the predetermined box. 15. The transmission apparatus according to claim 13, wherein the second mode causes
display of the closed caption text to start according to a first media decode time defined in the MP4 file format and stored in a first predetermined box corresponding to a second predetermiend box that stores target closed capation data, and the display of the closed caption text to continue until a time according to a second media decode time stored in a third predetermined box corresponding to a fourth predetermined box that stores next closed caption data. 16. The transmission apparatus according to claim 11,
wherein the plurality of modes includes a third mode for display of the closed caption text irrespective of time information defined in the MP4 file format. 17. The transmission apparatus according to claim 11,
wherein the selection information is specified based on a scheme attribute of a property element, in adaptation elements arranged in a period element of an MPD element. 18. A data processing method comprising
generating, by circuitry of a transmission apparatus, control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and transmitting, by the circuitry of the transmission apparatus, a digital data stream including the control information and closed caption information including the closed caption text. | A reception apparatus is provided that includes circuitry configured to receive a digital data stream. The circuitry is configured to acquire closed caption information included in the digital data stream. The circuitry is configured to acquire control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed. The circuitry is further configured to output the closed caption text included in the closed caption information for display to a user, at a display time according to the specific mode, based on the selection information included in the control information.1. A reception apparatus comprising:
circuitry configured to receive a digital data stream; acquire closed caption information included in the digital data stream, acquire control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and output the closed caption text included in the closed caption information for display to a user, at a display time according to the specific mode, based on the selection information included in the control information. 2. The reception apparatus according to claim 1, wherein
the closed caption information is a timed text markup language (TTML) file, the closed caption information includes data in accordance with an MPEG-4 (MP4) file format, the control information is a media presentation description (MPD) file in an extensible markup language (XML) format, and the TTML file and the MPD file are transmitted in a real-time object delivery over unidirectional transport (ROUTE) session. 3. The reception apparatus according to claim 2,
wherein the plurality of modes includes a first mode for display of the closed caption text according to time information specified in the TTML file, and when the specific mode is the first mode, the circuitry is configured to output the closed caption text specified in the TTML file for display according to the time information specified in the TTML file. 4. The reception apparatus according to claim 2,
wherein the plurality of modes includes a second mode for display of the closed caption text according to time information defined in the MP4 file format, and when the specific mode is the second mode, the circuitry is configured to output the closed caption text specified in the TTML file for display according to the time information defined in the MP4 file format. 5. The reception apparatus according to claim 4, wherein the circuitry is configured to
start the output of the closed caption text for display according to a media decode time defined in the MP4 file format and stored in a predetermined box, and only continue the output the closed caption text during a time period according to a sample duration stored in the predetermined box. 6. The reception apparatus according to claim 4, wherein the circuitry is configured to
start the output of the closed caption text for display according to a first media decode time defined in the MP4 file format and stored in a first predetermined box corresponding to a second predetermined box that stores target closed caption data, and continue the output until a time according to a second media decode time stored in a third predetermined box corresponding to a fourth predetermined box that stores next closed caption data. 7. The reception apparatus according to claim 2,
wherein the plurality of modes includes a third mode for display of the closed caption text irrespective of time information defined in the MP4 file format, and when the specific mode is the third mode, the circuitry is configured to output the closed caption text specified in the TTML file for display immediately upon acquiring the TTML file. 8. The reception apparatus according to claim 2,
wherein the selection information is specified based on a scheme attribute of a property element, in adaptation set elements arranged in a period element of an MPD element. 9. A data processing method comprising:
acquiring, by circuitry of a reception apparatus, closed caption information included in a digital data stream; acquiring, by the circuitry of the reception apparatus, control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and controlling, by the circuitry of the reception apparatus, output of the closed caption text included in the closed caption information, at a display time according to the specific mode, based on the selection information included in the control information. 10. A transmission apparatus comprising:
circuitry configured to generate control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and transmit a digital data stream including the control information and closed caption information including the closed caption text. 11. The transmission apparatus according to claim 10, wherein the closed caption information is a timed text markup language (TTML) file,
the closed caption information includes data in accordance with an MPEG-4 (MP4) file format, the control information is a media presentation description (MPD) file in an extensible markup language (XML) format, and the TTML file and the MPD file are transmitted in a real-time object delivery over unidirectional transport (ROUTE) session. 12. The transmission apparatus according to claim 11,
wherein the plurality of modes includes a first mode for display of the closed caption text according to time information specified in the TTML file. 13. The transmission apparatus according to claim 11,
wherein the plurality of modes includes a second mode for display of the closed caption text according to time information defined in the MP4 file format. 14. The transmission apparatus according to claim 13, wherein the second mode causes
display of the closed caption text to start according to a media decode time defined in the MP4 file format and stored in a predetermined box, and the display of the closed caption text only continues during a time period according to a sample duration stored in the predetermined box. 15. The transmission apparatus according to claim 13, wherein the second mode causes
display of the closed caption text to start according to a first media decode time defined in the MP4 file format and stored in a first predetermined box corresponding to a second predetermiend box that stores target closed capation data, and the display of the closed caption text to continue until a time according to a second media decode time stored in a third predetermined box corresponding to a fourth predetermined box that stores next closed caption data. 16. The transmission apparatus according to claim 11,
wherein the plurality of modes includes a third mode for display of the closed caption text irrespective of time information defined in the MP4 file format. 17. The transmission apparatus according to claim 11,
wherein the selection information is specified based on a scheme attribute of a property element, in adaptation elements arranged in a period element of an MPD element. 18. A data processing method comprising
generating, by circuitry of a transmission apparatus, control information including selection information indicating a selection of a specific mode from a plurality of modes for specifying when closed caption text is to be displayed; and transmitting, by the circuitry of the transmission apparatus, a digital data stream including the control information and closed caption information including the closed caption text. | 2,400 |
9,429 | 9,429 | 16,378,139 | 2,473 | A system, method and apparatus for configuring a node in a sensor network. A sensor service can enable sensor applications to customize the collection and processing of sensor data from a monitoring location. In one embodiment, sensor applications can customize the operation of nodes in the sensor network via a sensor data control system. | 1. A method, comprising:
transmitting, by a sensor data control system, a configuration message for delivery to a wireless node that supports one or more sensors, the configuration message including configuration information that enables the wireless node to change at least one configuration setting; comparing, by the sensor data control system, a first configuration hash value generated based on current configuration settings of the wireless node to a second configuration hash value generated based on the configuration information; and when the comparison indicates that the first configuration hash value is different from the second configuration hash value, retransmitting, by the sensor data control system, the configuration message. 2. The method of claim 1, wherein the at least one configuration setting enables activation of one or more sensors supported by the wireless node from a deactivated state. 3. The method of claim 1, wherein the at least one configuration setting enables a change of a measurement resolution of one or more sensors supported by the wireless node. 4. The method of claim 1, wherein the at least one configuration setting enables a change of a polling frequency of the wireless node. 5. The method of claim 1, wherein the at least one configuration setting enables a change of a sampling frequency by one or more sensors supported by the wireless node. 6. The method of claim 1, wherein the at least one configuration setting enables a change of a device address or register address for a Modbus interface command generated by the wireless node. 7. The method of claim 1, wherein the at least one configuration setting enables a change of a state in an actuator device. 8. A method, comprising:
receiving, by a sensor data control system, a status message associated with a wireless node, the status message including a first configuration hash value based on current configuration settings of the wireless node; comparing, by the sensor data control system, the first configuration hash value to a second configuration hash value produced by the sensor data control system based on a stored set of configuration settings for the wireless node; and initiating a transmission of new configuration setting for delivery to the wireless node when the comparison indicates that the first configuration hash value is different from the second configuration hash value. 9. The method of claim 8, wherein the new configuration setting enables an activation of one or more sensors from a deactivated state. 10. The method of claim 8, wherein the new configuration setting enables a change in measurement resolution of one or more sensors. 11. The method of claim 8, wherein the new configuration setting enables a change in polling frequency by the wireless node. 12. The method of claim 8, wherein the new configuration setting enables a change in sampling frequency by one or more sensors. 13. The method of claim 8, wherein the new configuration setting enables a change in a device address or register address for a Modbus interface command. 14. The method of claim 8, wherein the new configuration setting enables a change in state of an actuator device. 15. A non-transitory computer-readable medium having a configuration update tool stored thereon for use by one or more server devices, the configuration tool including:
a transmission section that when executed, causes the configuration update tool to transmit a configuration message for delivery to a wireless node that supports one or more sensors, the configuration message including configuration information that enables the wireless node to change at least one configuration setting; a comparison section that when executed, causes the configuration update tool to compare a first configuration hash value generated based on current configuration settings of the wireless node to a second configuration hash value generated based on the configuration information; and an update section that when executed, causes the configuration update tool to initiate a configuration update retransmission when the comparison indicates that the first configuration hash value is different from the second configuration hash value, wherein the configuration update retransmission includes the configuration information. 16. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables activation of one or more sensors supported by the wireless node from a deactivated state. 17. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a measurement resolution of one or more sensors supported by the wireless node. 18. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a polling frequency of the wireless node. 19. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a device address or register address for a Modbus interface command generated by the wireless node. 20. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a state in an actuator device. | A system, method and apparatus for configuring a node in a sensor network. A sensor service can enable sensor applications to customize the collection and processing of sensor data from a monitoring location. In one embodiment, sensor applications can customize the operation of nodes in the sensor network via a sensor data control system.1. A method, comprising:
transmitting, by a sensor data control system, a configuration message for delivery to a wireless node that supports one or more sensors, the configuration message including configuration information that enables the wireless node to change at least one configuration setting; comparing, by the sensor data control system, a first configuration hash value generated based on current configuration settings of the wireless node to a second configuration hash value generated based on the configuration information; and when the comparison indicates that the first configuration hash value is different from the second configuration hash value, retransmitting, by the sensor data control system, the configuration message. 2. The method of claim 1, wherein the at least one configuration setting enables activation of one or more sensors supported by the wireless node from a deactivated state. 3. The method of claim 1, wherein the at least one configuration setting enables a change of a measurement resolution of one or more sensors supported by the wireless node. 4. The method of claim 1, wherein the at least one configuration setting enables a change of a polling frequency of the wireless node. 5. The method of claim 1, wherein the at least one configuration setting enables a change of a sampling frequency by one or more sensors supported by the wireless node. 6. The method of claim 1, wherein the at least one configuration setting enables a change of a device address or register address for a Modbus interface command generated by the wireless node. 7. The method of claim 1, wherein the at least one configuration setting enables a change of a state in an actuator device. 8. A method, comprising:
receiving, by a sensor data control system, a status message associated with a wireless node, the status message including a first configuration hash value based on current configuration settings of the wireless node; comparing, by the sensor data control system, the first configuration hash value to a second configuration hash value produced by the sensor data control system based on a stored set of configuration settings for the wireless node; and initiating a transmission of new configuration setting for delivery to the wireless node when the comparison indicates that the first configuration hash value is different from the second configuration hash value. 9. The method of claim 8, wherein the new configuration setting enables an activation of one or more sensors from a deactivated state. 10. The method of claim 8, wherein the new configuration setting enables a change in measurement resolution of one or more sensors. 11. The method of claim 8, wherein the new configuration setting enables a change in polling frequency by the wireless node. 12. The method of claim 8, wherein the new configuration setting enables a change in sampling frequency by one or more sensors. 13. The method of claim 8, wherein the new configuration setting enables a change in a device address or register address for a Modbus interface command. 14. The method of claim 8, wherein the new configuration setting enables a change in state of an actuator device. 15. A non-transitory computer-readable medium having a configuration update tool stored thereon for use by one or more server devices, the configuration tool including:
a transmission section that when executed, causes the configuration update tool to transmit a configuration message for delivery to a wireless node that supports one or more sensors, the configuration message including configuration information that enables the wireless node to change at least one configuration setting; a comparison section that when executed, causes the configuration update tool to compare a first configuration hash value generated based on current configuration settings of the wireless node to a second configuration hash value generated based on the configuration information; and an update section that when executed, causes the configuration update tool to initiate a configuration update retransmission when the comparison indicates that the first configuration hash value is different from the second configuration hash value, wherein the configuration update retransmission includes the configuration information. 16. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables activation of one or more sensors supported by the wireless node from a deactivated state. 17. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a measurement resolution of one or more sensors supported by the wireless node. 18. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a polling frequency of the wireless node. 19. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a device address or register address for a Modbus interface command generated by the wireless node. 20. The non-transitory computer-readable medium of claim 15, wherein the at least one configuration setting enables a change of a state in an actuator device. | 2,400 |
9,430 | 9,430 | 16,435,509 | 2,495 | Computer protection is weak with the methods currently available and there are risks of malicious users getting access to computers, corrupting important data, including system data. We are proposing a method for improving access protection, more particularly, by using a slave device that will enable or disable protection for applications as required. The device supports one or more users, none or more user groups, none or one or more Application Security Environments for each user or user group and one or more states for each Application Security Environment. The state of the hardware is manually controlled by the users. Depending on the configuration, each hardware state corresponding to an Application Security Environment corresponds to a set of privileges the processes running in that Application Security Environment have while that Application Security Environment is in that state. | 1. A method for synchronizing creation of application security environments, wherein one or more processes run in each said application security environment which is created, said method comprising: each apparatus in a plurality of first apparatuses receiving a first command, wherein said application security environments are created after said first commands are received, wherein said application security environments are created because said first commands are received by said plurality of first apparatuses. 2. The method of claim 1, wherein said first commands are for creating said application security environments. 3. The method of claim 2 further comprising: a second apparatus sending said first commands. 4. The method of claim 2 further comprising:
a) each apparatus in said plurality of first apparatuses receiving a second command before said first command is received; and
b) each apparatus in said plurality of first apparatuses either sending an acknowledgement or a negative acknowledgement for said second command received. 5. The method of claim 2 further comprising: each apparatus in said plurality of first apparatuses sending acknowledgement for said first command received after said first command is successful. 6. The method of claim 2, wherein said application security environments are created in computers. 7. A method for synchronizing deletion of application security environments, said method comprising: each apparatus in a plurality of first apparatuses receiving a first command, wherein said application security environments are deleted after said first commands are received, wherein said application security environments are deleted because said first commands are received by said plurality of first apparatuses. 8. The method of claim 7, wherein said first commands are for deleting said application security environments. 9. The method of claim 8 further comprising: a second apparatus sending said first commands. 10. The method of claim 8 further comprising:
a) each apparatus in said plurality of first apparatuses receiving a second command before said first command is received; and
b) each apparatus in said plurality of first apparatuses either sending an acknowledgement or a negative acknowledgement for said second command received. 11. The method of claim 8 further comprising: each apparatus in said plurality of first apparatuses sending acknowledgement for said first command received after said first command is successful. 12. The method of claim 8, wherein said application security environments are deleted in computers. 13. A method for creating a plurality of application security environments, wherein one or more processes run in each said application security environment which is created, said method comprising: each apparatus in a plurality of first apparatuses receiving a first command from a second apparatus to create at least one application security environment in said plurality of application security environments, wherein said application security environments are created in response to said first commands received. 14. The method of claim 13, wherein said first commands are for creating said application security environments. 15. The method of claim 14 further comprising: a second apparatus sending said first commands. 16. The method of claim 14 further comprising:
a) each apparatus in said plurality of first apparatuses receiving a second command before said first command is received; and
b) each apparatus in said plurality of first apparatuses either sending an acknowledgement or a negative acknowledgement for said second command received. 17. The method of claim 14 further comprising: each apparatus in said plurality of first apparatuses sending acknowledgement for said first command received after said first command is successful. 18. The method of claim 14, wherein said application security environments are created in computers. | Computer protection is weak with the methods currently available and there are risks of malicious users getting access to computers, corrupting important data, including system data. We are proposing a method for improving access protection, more particularly, by using a slave device that will enable or disable protection for applications as required. The device supports one or more users, none or more user groups, none or one or more Application Security Environments for each user or user group and one or more states for each Application Security Environment. The state of the hardware is manually controlled by the users. Depending on the configuration, each hardware state corresponding to an Application Security Environment corresponds to a set of privileges the processes running in that Application Security Environment have while that Application Security Environment is in that state.1. A method for synchronizing creation of application security environments, wherein one or more processes run in each said application security environment which is created, said method comprising: each apparatus in a plurality of first apparatuses receiving a first command, wherein said application security environments are created after said first commands are received, wherein said application security environments are created because said first commands are received by said plurality of first apparatuses. 2. The method of claim 1, wherein said first commands are for creating said application security environments. 3. The method of claim 2 further comprising: a second apparatus sending said first commands. 4. The method of claim 2 further comprising:
a) each apparatus in said plurality of first apparatuses receiving a second command before said first command is received; and
b) each apparatus in said plurality of first apparatuses either sending an acknowledgement or a negative acknowledgement for said second command received. 5. The method of claim 2 further comprising: each apparatus in said plurality of first apparatuses sending acknowledgement for said first command received after said first command is successful. 6. The method of claim 2, wherein said application security environments are created in computers. 7. A method for synchronizing deletion of application security environments, said method comprising: each apparatus in a plurality of first apparatuses receiving a first command, wherein said application security environments are deleted after said first commands are received, wherein said application security environments are deleted because said first commands are received by said plurality of first apparatuses. 8. The method of claim 7, wherein said first commands are for deleting said application security environments. 9. The method of claim 8 further comprising: a second apparatus sending said first commands. 10. The method of claim 8 further comprising:
a) each apparatus in said plurality of first apparatuses receiving a second command before said first command is received; and
b) each apparatus in said plurality of first apparatuses either sending an acknowledgement or a negative acknowledgement for said second command received. 11. The method of claim 8 further comprising: each apparatus in said plurality of first apparatuses sending acknowledgement for said first command received after said first command is successful. 12. The method of claim 8, wherein said application security environments are deleted in computers. 13. A method for creating a plurality of application security environments, wherein one or more processes run in each said application security environment which is created, said method comprising: each apparatus in a plurality of first apparatuses receiving a first command from a second apparatus to create at least one application security environment in said plurality of application security environments, wherein said application security environments are created in response to said first commands received. 14. The method of claim 13, wherein said first commands are for creating said application security environments. 15. The method of claim 14 further comprising: a second apparatus sending said first commands. 16. The method of claim 14 further comprising:
a) each apparatus in said plurality of first apparatuses receiving a second command before said first command is received; and
b) each apparatus in said plurality of first apparatuses either sending an acknowledgement or a negative acknowledgement for said second command received. 17. The method of claim 14 further comprising: each apparatus in said plurality of first apparatuses sending acknowledgement for said first command received after said first command is successful. 18. The method of claim 14, wherein said application security environments are created in computers. | 2,400 |
9,431 | 9,431 | 15,922,437 | 2,488 | Provided is a moving image processing apparatus. A moving image processing apparatus includes: a detection unit configured to detect a boundary of blocks; a determination unit configured to determine a strength of the boundary detected by the detection unit; and a deciding unit configured to decide whether or not a filter is to be applied to the boundary based on the strength of the boundary determined by the determination unit. The determination unit is further configured to use a size of a transformation block to determine the strength of the boundary. | 1. A moving image processing apparatus, comprising:
a detection unit configured to detect a boundary of blocks; a determination unit configured to determine a strength of the boundary detected by the detection unit; and a deciding unit configured to decide whether or not a filter is to be applied to the boundary based on the strength of the boundary determined by the determination unit, wherein the determination unit is further configured to use a size of a transformation block to determine the strength of the boundary. 2. The processing apparatus according to claim 1,
wherein the detection unit is further configured to detect a boundary between prediction blocks and a boundary between transformation blocks, and the determination unit is further configured to use sizes of the transformation blocks to determine the strength of the boundary between the transformation blocks. 3. The processing apparatus according to claim 2,
wherein if the size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, the determination unit is further configured to determine that the strength of the boundary is higher compared to a case where the size is less than the first threshold. 4. The processing apparatus according to claim 3,
wherein if the size in the same direction as the boundary of one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to the first threshold and the size in the same direction as the boundary of another transformation block is less than the first threshold, the determination unit is further configured to determine a strength to be used for the deciding unit to decide on a filter to be applied to pixels in the one transformation block and a strength to be used for the deciding unit to decide on a filter to be applied to pixels in the other transformation block. 5. The processing apparatus according to claim 1,
wherein the deciding unit is further configured to decide whether or not a filter is to be applied to the boundary using decision criteria including the strength of the boundary, and in the decision criteria, the strength of the boundary being greater than a predetermined value is one condition for applying a filter to the boundary. 6. The processing apparatus according to claim 5,
wherein if a filter is to be applied to the boundary, the deciding unit is further configured to decide on the filter that is to be applied to the boundary from among a plurality of filters with different strengths, and in the decision criteria, a second threshold for deciding on the filter to be applied to the boundary is decided on based on the strength of the boundary. 7. The processing apparatus according to claim 6,
wherein if a filter is to be applied to the boundary, the deciding unit is further configured to decide on the filter that is to be applied to the boundary from among a filter with a first strength and a filter with a second strength that is stronger than the filter with the first strength, in the decision criteria, the second threshold is set based on a relationship between the strength of the boundary and the second threshold, and an absolute value of a difference between a predetermined pixel of one block at the boundary and a predetermined pixel of another block at the boundary being smaller than the second threshold is one condition for selecting the filter with the second strength, and the relationship between the strength of the boundary and the second threshold value is a relationship in which if the strength of the boundary changes from a first value to a second value that is greater than the first value, the second threshold changes from a third value to a value that is greater than or equal to the third value. 8. A moving image processing apparatus, comprising:
a detection unit configured to detect a boundary of blocks; and a deciding unit configured to decide whether or not a filter is to be applied to the boundary detected by the detection unit, if the boundary is a boundary between transformation blocks and a size in a direction of the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, the deciding unit is further configured to decide that a filter is to be applied to the boundary. 9. The processing apparatus according to claim 8,
wherein if a filter is to be applied to the boundary, the deciding unit is further configured to decide on the filter that is to be applied to the boundary from among a plurality of filters with different strengths, and if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to the first threshold, the deciding unit is further configured to decide that a filter with the highest strength among the plurality of filters with different strengths is to be applied to the boundary. 10. The processing apparatus according to claim 8,
wherein if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, the deciding unit is further configured to increase the distance from the boundary of a pixel region to which the filter to be applied to the boundary is to be applied, compared to a case where the size is less than the first threshold. 11. The processing apparatus according to claim 9,
wherein if the boundary is a boundary between transformation blocks, the size in the same direction as the boundary of one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to the first threshold, and the size in the same direction as the boundary of another transformation block is less than the first threshold, then the deciding unit is further configured to decide on filters such that a filter to be applied to pixels in the one transformation block and a filter to be applied to pixels in the other transformation block are different. 12. A moving image processing method for a processing apparatus, comprising:
detecting a boundary of blocks; determining a strength of the boundary detected in the detecting; and deciding whether or not a filter is to be applied to the boundary based on the strength of the boundary determined in the determining, wherein in the determining, a size of a transformation block is used to determine the strength of the boundary. 13. A moving image processing method for a processing apparatus, comprising:
detecting a boundary of blocks; and deciding whether or not a filter is to be applied to the boundary detected in the detecting, wherein in the deciding, if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, it is decided that a filter is to be applied to the boundary. 14. A non-transitory computer-readable storage medium including a program that, when executed on a processor of a computer, cause the computer to:
detect a boundary of blocks; determine a strength of the boundary; and deciding whether or not a filter is to be applied to the boundary based on the strength of the boundary, wherein a size of a transformation block is used to determine the strength of the boundary. 15. A non-transitory computer-readable storage medium including a program that, when executed on a processor of a computer, cause the computer to:
detect a boundary of blocks; and decide whether or not a filter is to be applied to the boundary, wherein in the deciding, if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, it is decided that a filter is to be applied to the boundary. | Provided is a moving image processing apparatus. A moving image processing apparatus includes: a detection unit configured to detect a boundary of blocks; a determination unit configured to determine a strength of the boundary detected by the detection unit; and a deciding unit configured to decide whether or not a filter is to be applied to the boundary based on the strength of the boundary determined by the determination unit. The determination unit is further configured to use a size of a transformation block to determine the strength of the boundary.1. A moving image processing apparatus, comprising:
a detection unit configured to detect a boundary of blocks; a determination unit configured to determine a strength of the boundary detected by the detection unit; and a deciding unit configured to decide whether or not a filter is to be applied to the boundary based on the strength of the boundary determined by the determination unit, wherein the determination unit is further configured to use a size of a transformation block to determine the strength of the boundary. 2. The processing apparatus according to claim 1,
wherein the detection unit is further configured to detect a boundary between prediction blocks and a boundary between transformation blocks, and the determination unit is further configured to use sizes of the transformation blocks to determine the strength of the boundary between the transformation blocks. 3. The processing apparatus according to claim 2,
wherein if the size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, the determination unit is further configured to determine that the strength of the boundary is higher compared to a case where the size is less than the first threshold. 4. The processing apparatus according to claim 3,
wherein if the size in the same direction as the boundary of one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to the first threshold and the size in the same direction as the boundary of another transformation block is less than the first threshold, the determination unit is further configured to determine a strength to be used for the deciding unit to decide on a filter to be applied to pixels in the one transformation block and a strength to be used for the deciding unit to decide on a filter to be applied to pixels in the other transformation block. 5. The processing apparatus according to claim 1,
wherein the deciding unit is further configured to decide whether or not a filter is to be applied to the boundary using decision criteria including the strength of the boundary, and in the decision criteria, the strength of the boundary being greater than a predetermined value is one condition for applying a filter to the boundary. 6. The processing apparatus according to claim 5,
wherein if a filter is to be applied to the boundary, the deciding unit is further configured to decide on the filter that is to be applied to the boundary from among a plurality of filters with different strengths, and in the decision criteria, a second threshold for deciding on the filter to be applied to the boundary is decided on based on the strength of the boundary. 7. The processing apparatus according to claim 6,
wherein if a filter is to be applied to the boundary, the deciding unit is further configured to decide on the filter that is to be applied to the boundary from among a filter with a first strength and a filter with a second strength that is stronger than the filter with the first strength, in the decision criteria, the second threshold is set based on a relationship between the strength of the boundary and the second threshold, and an absolute value of a difference between a predetermined pixel of one block at the boundary and a predetermined pixel of another block at the boundary being smaller than the second threshold is one condition for selecting the filter with the second strength, and the relationship between the strength of the boundary and the second threshold value is a relationship in which if the strength of the boundary changes from a first value to a second value that is greater than the first value, the second threshold changes from a third value to a value that is greater than or equal to the third value. 8. A moving image processing apparatus, comprising:
a detection unit configured to detect a boundary of blocks; and a deciding unit configured to decide whether or not a filter is to be applied to the boundary detected by the detection unit, if the boundary is a boundary between transformation blocks and a size in a direction of the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, the deciding unit is further configured to decide that a filter is to be applied to the boundary. 9. The processing apparatus according to claim 8,
wherein if a filter is to be applied to the boundary, the deciding unit is further configured to decide on the filter that is to be applied to the boundary from among a plurality of filters with different strengths, and if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to the first threshold, the deciding unit is further configured to decide that a filter with the highest strength among the plurality of filters with different strengths is to be applied to the boundary. 10. The processing apparatus according to claim 8,
wherein if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, the deciding unit is further configured to increase the distance from the boundary of a pixel region to which the filter to be applied to the boundary is to be applied, compared to a case where the size is less than the first threshold. 11. The processing apparatus according to claim 9,
wherein if the boundary is a boundary between transformation blocks, the size in the same direction as the boundary of one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to the first threshold, and the size in the same direction as the boundary of another transformation block is less than the first threshold, then the deciding unit is further configured to decide on filters such that a filter to be applied to pixels in the one transformation block and a filter to be applied to pixels in the other transformation block are different. 12. A moving image processing method for a processing apparatus, comprising:
detecting a boundary of blocks; determining a strength of the boundary detected in the detecting; and deciding whether or not a filter is to be applied to the boundary based on the strength of the boundary determined in the determining, wherein in the determining, a size of a transformation block is used to determine the strength of the boundary. 13. A moving image processing method for a processing apparatus, comprising:
detecting a boundary of blocks; and deciding whether or not a filter is to be applied to the boundary detected in the detecting, wherein in the deciding, if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, it is decided that a filter is to be applied to the boundary. 14. A non-transitory computer-readable storage medium including a program that, when executed on a processor of a computer, cause the computer to:
detect a boundary of blocks; determine a strength of the boundary; and deciding whether or not a filter is to be applied to the boundary based on the strength of the boundary, wherein a size of a transformation block is used to determine the strength of the boundary. 15. A non-transitory computer-readable storage medium including a program that, when executed on a processor of a computer, cause the computer to:
detect a boundary of blocks; and decide whether or not a filter is to be applied to the boundary, wherein in the deciding, if the boundary is a boundary between transformation blocks and a size in the same direction as the boundary of at least one transformation block among the transformation blocks on both sides of the boundary is greater than or equal to a first threshold, it is decided that a filter is to be applied to the boundary. | 2,400 |
9,432 | 9,432 | 15,862,493 | 2,435 | A system, method, and computer program product are provided for preventing access to data associated with a data access attempt. In use, a data access attempt associated with a remote data sharing session is identified. Further, access to the data is prevented. | 1. A machine-readable medium, on which are stored instructions, comprising instructions that when executed cause a machine to:
detect a request to access data; determine whether the data has a predetermined fingerprint associated with one or more applications; identify an application associated with the request; and determine whether to allow the request based on the predetermined fingerprint and the identified application. 2. The machine-readable medium of claim 1, wherein the request includes an identifier of an application that issued the request. 3. The machine-readable medium of claim 1, wherein the instructions that when executed cause the machine to determine whether the data has a predetermined fingerprint associated with one or more applications comprise instructions that when executed cause the machine to:
lookup a fingerprint of the data in a database of predetermined fingerprints. 4. The machine-readable medium of claim 3, wherein the database comprises fingerprints and applications associated with the fingerprints that are allowed to access the data. 5. The machine-readable medium of claim 3, wherein the database comprises fingerprints and applications associated with the fingerprints that are not allowed to access the data. 6. The machine-readable medium of claim 3, wherein the database comprises an identification of a dedicated application that is allowed to access any data. 7. The machine-readable medium of claim 1, wherein the instructions that when executed cause the machine to determine whether to allow the request comprise instructions that when executed cause the machine to:
determine whether a remote desktop sharing session is in operation; and prevent initiation of the identified application responsive to the determination. 8. A machine-readable medium, on which are stored instructions, comprising instructions that when executed cause a machine to:
determine whether remote data sharing is currently enabled; identify a fingerprint of data to which access is requested, responsive to a determination that remote data sharing is currently enabled; and determine whether to allow access to the data responsive to a match of the fingerprint with a predetermined fingerprint. 9. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to determine whether remote data sharing is currently enabled comprise instructions that when executed cause the machine to determine whether a remote data sharing application is executing. 10. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to identify a fingerprint of data to which access is requested comprise instructions that when executed cause the machine to hash the data. 11. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to identify a fingerprint of data to which access is requested comprise instructions that when executed cause the machine to calculate a value of the data utilizing a predetermined algorithm. 12. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to determine whether to allow access to the data comprise instructions that when executed cause the machine to lookup a fingerprint of the data in a database of predetermined fingerprints of data. 13. The machine-readable medium of claim 12, wherein the database is stored remotely to the machine. 14. The machine-readable medium of claim 8, wherein the instructions further comprise instructions that when executed cause the machine to close data already opened prior to enablement of a remote desktop sharing session. 15. A method for preventing data loss by determining whether to allow a request to access data, comprising:
detecting, by a computer system, a request to access data; determining, by the computer system, whether the data has a predetermined fingerprint associated with one or more applications; identifying, by the computer system, an application associated with the request; and determining, by the computer system, whether to allow the request based on the predetermined fingerprint and the identified application. 16. The method of claim 15, wherein determining, by the computer system, whether the data has a predetermined fingerprint associated with one or more applications comprises:
looking up a fingerprint of the data in a database of predetermined fingerprints and applications associated with the predetermined fingerprints. 17. The method of claim 16, wherein determining, by the computer system, whether the data has a predetermined fingerprint associated with one or more applications further comprises:
determining whether an application request access to the data is a dedicated application allowed to access any data. 18. A method for preventing data loss by determining whether to allow access to data, comprising:
determining, by a computer system, whether remote data sharing is currently enabled; identifying, by the computer system, a fingerprint of data to which access is requested, responsive to a determination that remote data sharing is currently enabled; and determining, by the computer system, whether to allow access to the data responsive to a match of the fingerprint with a predetermined fingerprint. 19. The method of claim 18, wherein determining, by the computer system, whether to allow access to the data comprises looking up a fingerprint of the data in database of predetermined fingerprints of data stored remotely to the computer system. 20. The method of claim 18, further comprising:
determining, by the computer system, that the data was opened prior to enablement of the remote data sharing session; and closing, by the computer system, the data in response to a request to initiate the remote data sharing session. | A system, method, and computer program product are provided for preventing access to data associated with a data access attempt. In use, a data access attempt associated with a remote data sharing session is identified. Further, access to the data is prevented.1. A machine-readable medium, on which are stored instructions, comprising instructions that when executed cause a machine to:
detect a request to access data; determine whether the data has a predetermined fingerprint associated with one or more applications; identify an application associated with the request; and determine whether to allow the request based on the predetermined fingerprint and the identified application. 2. The machine-readable medium of claim 1, wherein the request includes an identifier of an application that issued the request. 3. The machine-readable medium of claim 1, wherein the instructions that when executed cause the machine to determine whether the data has a predetermined fingerprint associated with one or more applications comprise instructions that when executed cause the machine to:
lookup a fingerprint of the data in a database of predetermined fingerprints. 4. The machine-readable medium of claim 3, wherein the database comprises fingerprints and applications associated with the fingerprints that are allowed to access the data. 5. The machine-readable medium of claim 3, wherein the database comprises fingerprints and applications associated with the fingerprints that are not allowed to access the data. 6. The machine-readable medium of claim 3, wherein the database comprises an identification of a dedicated application that is allowed to access any data. 7. The machine-readable medium of claim 1, wherein the instructions that when executed cause the machine to determine whether to allow the request comprise instructions that when executed cause the machine to:
determine whether a remote desktop sharing session is in operation; and prevent initiation of the identified application responsive to the determination. 8. A machine-readable medium, on which are stored instructions, comprising instructions that when executed cause a machine to:
determine whether remote data sharing is currently enabled; identify a fingerprint of data to which access is requested, responsive to a determination that remote data sharing is currently enabled; and determine whether to allow access to the data responsive to a match of the fingerprint with a predetermined fingerprint. 9. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to determine whether remote data sharing is currently enabled comprise instructions that when executed cause the machine to determine whether a remote data sharing application is executing. 10. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to identify a fingerprint of data to which access is requested comprise instructions that when executed cause the machine to hash the data. 11. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to identify a fingerprint of data to which access is requested comprise instructions that when executed cause the machine to calculate a value of the data utilizing a predetermined algorithm. 12. The machine-readable medium of claim 8, wherein the instructions that when executed cause the machine to determine whether to allow access to the data comprise instructions that when executed cause the machine to lookup a fingerprint of the data in a database of predetermined fingerprints of data. 13. The machine-readable medium of claim 12, wherein the database is stored remotely to the machine. 14. The machine-readable medium of claim 8, wherein the instructions further comprise instructions that when executed cause the machine to close data already opened prior to enablement of a remote desktop sharing session. 15. A method for preventing data loss by determining whether to allow a request to access data, comprising:
detecting, by a computer system, a request to access data; determining, by the computer system, whether the data has a predetermined fingerprint associated with one or more applications; identifying, by the computer system, an application associated with the request; and determining, by the computer system, whether to allow the request based on the predetermined fingerprint and the identified application. 16. The method of claim 15, wherein determining, by the computer system, whether the data has a predetermined fingerprint associated with one or more applications comprises:
looking up a fingerprint of the data in a database of predetermined fingerprints and applications associated with the predetermined fingerprints. 17. The method of claim 16, wherein determining, by the computer system, whether the data has a predetermined fingerprint associated with one or more applications further comprises:
determining whether an application request access to the data is a dedicated application allowed to access any data. 18. A method for preventing data loss by determining whether to allow access to data, comprising:
determining, by a computer system, whether remote data sharing is currently enabled; identifying, by the computer system, a fingerprint of data to which access is requested, responsive to a determination that remote data sharing is currently enabled; and determining, by the computer system, whether to allow access to the data responsive to a match of the fingerprint with a predetermined fingerprint. 19. The method of claim 18, wherein determining, by the computer system, whether to allow access to the data comprises looking up a fingerprint of the data in database of predetermined fingerprints of data stored remotely to the computer system. 20. The method of claim 18, further comprising:
determining, by the computer system, that the data was opened prior to enablement of the remote data sharing session; and closing, by the computer system, the data in response to a request to initiate the remote data sharing session. | 2,400 |
9,433 | 9,433 | 15,288,002 | 2,453 | A method and system for providing a communication stream for associating messages are described. A communication stream receives various message types including messages, posts, events, tasks, and comments, and presents them to users. Private messages relating to one or more messages may be sent between and among one or more users. | 1. A computer-implemented method for providing a communication stream for messages, the method comprising:
receiving one or more email messages; analyzing the one or more email messages; detecting a bulk transmission based on the analyzing the one or more email messages; and initiating creation of the communication stream corresponding to the detected bulk transmission. 2. The computer-implemented method of claim 1, the analyzing including identifying one or more recipients of the detected bulk transmission. 3. The computer-implemented method of claim 1, wherein the initiating creation of the communication stream includes requesting creation of the communication stream corresponding to the detected bulk transmission. 4. The computer-implemented method of claim 3, wherein the requesting is directed to a stream service. 5. The computer-implemented method of claim 3, the request comprising a stream identifier identifying the communication stream, and content of the one or more email messages. 6. The computer-implemented method of claim 3, the request comprising a stream identifier identifying the communication stream and one or more recipients of the detected bulk transmission. 7. The computer-implemented method of claim 3, the method further comprising receiving a response confirming creation of the communication stream, and displaying a bulk transmission indication. 8. The computer-implemented method of claim 7, wherein the response confirming creation of the communication stream is received from a stream service. 9. The computer-implemented method of claim 7, further comprising displaying the bulk transmission indication on a user interface corresponding to at least one of one or more recipients of the detected bulk transmission. 10. The computer-implemented method of claim 9, the bulk transmission indication further comprising a command for initiating joining the at least one of the one or more recipients to the communication stream. 11. The computer-implemented method of claim 7, the method further comprising requesting bulk stream information. 12. The computer-implemented method of claim 11, wherein the requesting is directed to a stream service. 13. The computer-implemented method of claim 11, the method further comprising displaying a bulk transmission indication corresponding to the bulk stream information and content. 14. The computer-implemented method of claim 7, the method further comprising receiving bulk stream information and displaying a bulk transmission indication corresponding to the bulk stream information. 15. The computer-implemented method of claim 14, wherein the displaying includes a context-sensitive indication. 16. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises an icon. 17. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises a letter. 18. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises a number. 19. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises displaying stream messages. 20. A computer-implemented method for providing a communication stream for messages, the method comprising:
receiving one or more email messages; analyzing the one or more email messages; detecting a bulk transmission based on the analyzing the one or more email messages, and responsive to the detecting the bulk transmission: providing a user interface for email messages, to create a communication stream corresponding to the detected bulk transmission;
receiving from the user interface a request to create a communication stream corresponding to the detected bulk transmission; and
in response to the request, initiating creation of the communication stream corresponding to the detected bulk transmission. 21. The computer-implemented method of claim 20, the request including information for creating the communication stream. 22. A computer-implemented method for providing a communication stream for messages, the method comprising:
receiving a request to create a bulk stream corresponding to a detected bulk transmission, and in response, creating the bulk stream; and providing notice of the creating of the bulk stream. 23. The computer-implemented method of claim 22, wherein the request to create the bulk stream corresponding to a bulk transmission is directed from an email service. 24. The computer-implemented method of claim 22, wherein the providing notice is directed to an email service. 25. The computer-implemented method of claim 24, further comprising including in the notice, one or more invitations to one or more users to join the bulk stream. 26. The computer-implemented method of claim 25, the method further comprising receiving requests from the one or more users to join the bulk stream and in response, joining the one or more users to the bulk stream. 27. The computer-implemented method of claim 22, further comprising receiving a request for bulk stream information and in response, providing the bulk stream information. 28. The computer-implemented method of claim 27, wherein the request for bulk stream information is directed from an email service. 29. The computer-implemented method of claim 27, wherein the response providing the bulk stream information is directed to an email service. 30. The computer-implemented method of claim 22, the method further comprising providing bulk stream information to an email service. 31. A computer-implemented system for providing a communication stream for messages, the computer-implemented system comprising:
a processor; a memory for holding instructions for execution by the processor, the instructions comprising: a first service for receiving one or more email messages; a second service for analyzing the one or more email messages; a third service for detecting a bulk transmission based on the analyzing the one or more email messages; and a fourth service for initiating creation of the communication stream corresponding to the detected bulk transmission. | A method and system for providing a communication stream for associating messages are described. A communication stream receives various message types including messages, posts, events, tasks, and comments, and presents them to users. Private messages relating to one or more messages may be sent between and among one or more users.1. A computer-implemented method for providing a communication stream for messages, the method comprising:
receiving one or more email messages; analyzing the one or more email messages; detecting a bulk transmission based on the analyzing the one or more email messages; and initiating creation of the communication stream corresponding to the detected bulk transmission. 2. The computer-implemented method of claim 1, the analyzing including identifying one or more recipients of the detected bulk transmission. 3. The computer-implemented method of claim 1, wherein the initiating creation of the communication stream includes requesting creation of the communication stream corresponding to the detected bulk transmission. 4. The computer-implemented method of claim 3, wherein the requesting is directed to a stream service. 5. The computer-implemented method of claim 3, the request comprising a stream identifier identifying the communication stream, and content of the one or more email messages. 6. The computer-implemented method of claim 3, the request comprising a stream identifier identifying the communication stream and one or more recipients of the detected bulk transmission. 7. The computer-implemented method of claim 3, the method further comprising receiving a response confirming creation of the communication stream, and displaying a bulk transmission indication. 8. The computer-implemented method of claim 7, wherein the response confirming creation of the communication stream is received from a stream service. 9. The computer-implemented method of claim 7, further comprising displaying the bulk transmission indication on a user interface corresponding to at least one of one or more recipients of the detected bulk transmission. 10. The computer-implemented method of claim 9, the bulk transmission indication further comprising a command for initiating joining the at least one of the one or more recipients to the communication stream. 11. The computer-implemented method of claim 7, the method further comprising requesting bulk stream information. 12. The computer-implemented method of claim 11, wherein the requesting is directed to a stream service. 13. The computer-implemented method of claim 11, the method further comprising displaying a bulk transmission indication corresponding to the bulk stream information and content. 14. The computer-implemented method of claim 7, the method further comprising receiving bulk stream information and displaying a bulk transmission indication corresponding to the bulk stream information. 15. The computer-implemented method of claim 14, wherein the displaying includes a context-sensitive indication. 16. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises an icon. 17. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises a letter. 18. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises a number. 19. The computer-implemented method of claim 14, wherein the bulk transmission indication comprises displaying stream messages. 20. A computer-implemented method for providing a communication stream for messages, the method comprising:
receiving one or more email messages; analyzing the one or more email messages; detecting a bulk transmission based on the analyzing the one or more email messages, and responsive to the detecting the bulk transmission: providing a user interface for email messages, to create a communication stream corresponding to the detected bulk transmission;
receiving from the user interface a request to create a communication stream corresponding to the detected bulk transmission; and
in response to the request, initiating creation of the communication stream corresponding to the detected bulk transmission. 21. The computer-implemented method of claim 20, the request including information for creating the communication stream. 22. A computer-implemented method for providing a communication stream for messages, the method comprising:
receiving a request to create a bulk stream corresponding to a detected bulk transmission, and in response, creating the bulk stream; and providing notice of the creating of the bulk stream. 23. The computer-implemented method of claim 22, wherein the request to create the bulk stream corresponding to a bulk transmission is directed from an email service. 24. The computer-implemented method of claim 22, wherein the providing notice is directed to an email service. 25. The computer-implemented method of claim 24, further comprising including in the notice, one or more invitations to one or more users to join the bulk stream. 26. The computer-implemented method of claim 25, the method further comprising receiving requests from the one or more users to join the bulk stream and in response, joining the one or more users to the bulk stream. 27. The computer-implemented method of claim 22, further comprising receiving a request for bulk stream information and in response, providing the bulk stream information. 28. The computer-implemented method of claim 27, wherein the request for bulk stream information is directed from an email service. 29. The computer-implemented method of claim 27, wherein the response providing the bulk stream information is directed to an email service. 30. The computer-implemented method of claim 22, the method further comprising providing bulk stream information to an email service. 31. A computer-implemented system for providing a communication stream for messages, the computer-implemented system comprising:
a processor; a memory for holding instructions for execution by the processor, the instructions comprising: a first service for receiving one or more email messages; a second service for analyzing the one or more email messages; a third service for detecting a bulk transmission based on the analyzing the one or more email messages; and a fourth service for initiating creation of the communication stream corresponding to the detected bulk transmission. | 2,400 |
9,434 | 9,434 | 13,446,479 | 2,424 | In a system for broadcasting video programs to a user including a display, a system and method for providing program information or a copy of at least a portion of a program to the user. In one embodiment, a controller receives an input signal representing a request for summary information concerning a program, the program having a beginning and the input signal generated at a time during the broadcast. The controller provides via the display a summary of the program from the program beginning to the input signal time in response to the input signal. A controller may alternatively monitor a period of time during which the display is tuned to a broadcast of a program, the period starting during the broadcast. The controller is used to provide via the display a copy of at least a portion of the program when the period exceeds a predetermined threshold time. | 1. A method comprising:
receiving, at a terminal, a request to present content, wherein the request is received after a start time of content transmission; communicating a request to retrieve a portion of the content subsequent to the request to present the content; and receiving the portion of the content, wherein the portion comprises the content transmitted between the start time and a receipt time of the request to present the content. 2. The method of claim 1, further comprising generating a prompt requesting approval prior to generating the request to retrieve the portion of the content. 3. The method of claim 1, further comprising causing a user device to present the portion of the content. 4. The method of claim 1, wherein the portion of the content does not include content transmitted after the receipt time. 5. The method of claim 1, further comprising:
receiving a request for a synopsis of the content; subsequent to receipt of the request for the synopsis, identifying a portion of the content that has been transmitted as of an identified clock time; and causing presentation of the synopsis of the content that summarizes the portion of the content that has been transmitted from a beginning of content transmission until the identified clock time. 6. The method of claim 5, wherein the synopsis comprises a summary of events. 7. The method of claim 5, further comprising determining that a user device has been presenting the content for a predefined period of time before causing presentation of the synopsis. 8. A method comprising:
receiving, at a terminal, a request to present content, wherein the request is received after a start time of content transmission; monitoring a length of time during which the content has been available; determining, by the terminal, that the length of time exceeds a predetermined threshold amount of time; communicating a request to retrieve a portion of the content subsequent to the request to present the content and said determining; and receiving the portion of the content, wherein the portion comprises the content transmitted between the start time and a receipt time of the request to present the content. 9. The method of claim 8, wherein the monitoring is performed by the terminal. 10. The method of claim 8, further comprising communicating, by the terminal, the content to a user device for presentation. 11. The method of claim 10, wherein the monitoring comprises determining an amount of time that the content has been transmitted to the user device. 12. The method of claim 10, wherein the monitoring comprises determining an amount of time that the user device has been tuned to receive the content. 13. The method of claim 8, further comprising generating a prompt requesting approval prior to communicating the request to retrieve the portion of the content. 14. The method of claim 8, wherein the portion of the content does not include content transmitted after the receipt time. 15. The method of claim 8, further comprising:
receiving a request for a synopsis of the content; subsequent to receipt of the request for the synopsis, identifying a portion of the content that has been transmitted as of an identified clock time; and causing presentation of the synopsis of the content that summarizes the portion of the content that has been transmitted from a beginning of content transmission until the identified clock time. 16. The method of claim 15, further comprising determining that a user device has been presenting the content for a predefined period of time before causing presentation of the synopsis. 17. The method of claim 15, wherein the synopsis comprises a summary of events. 18. A method comprising:
causing, by a computing device, transmission of a program to a terminal; subsequent to a start time of the transmission, receiving a request from the terminal that requests a portion of the program; and causing transmission of the portion of the program to the terminal, wherein the portion of the program comprises the program transmitted between the start time and a second time corresponding to when a device first tuned to the program. 19. The method of claim 18, wherein the portion of the content comprises a complete copy of the program. 20. The method of claim 18, wherein the portion of the content comprises less than a complete copy of the program. | In a system for broadcasting video programs to a user including a display, a system and method for providing program information or a copy of at least a portion of a program to the user. In one embodiment, a controller receives an input signal representing a request for summary information concerning a program, the program having a beginning and the input signal generated at a time during the broadcast. The controller provides via the display a summary of the program from the program beginning to the input signal time in response to the input signal. A controller may alternatively monitor a period of time during which the display is tuned to a broadcast of a program, the period starting during the broadcast. The controller is used to provide via the display a copy of at least a portion of the program when the period exceeds a predetermined threshold time.1. A method comprising:
receiving, at a terminal, a request to present content, wherein the request is received after a start time of content transmission; communicating a request to retrieve a portion of the content subsequent to the request to present the content; and receiving the portion of the content, wherein the portion comprises the content transmitted between the start time and a receipt time of the request to present the content. 2. The method of claim 1, further comprising generating a prompt requesting approval prior to generating the request to retrieve the portion of the content. 3. The method of claim 1, further comprising causing a user device to present the portion of the content. 4. The method of claim 1, wherein the portion of the content does not include content transmitted after the receipt time. 5. The method of claim 1, further comprising:
receiving a request for a synopsis of the content; subsequent to receipt of the request for the synopsis, identifying a portion of the content that has been transmitted as of an identified clock time; and causing presentation of the synopsis of the content that summarizes the portion of the content that has been transmitted from a beginning of content transmission until the identified clock time. 6. The method of claim 5, wherein the synopsis comprises a summary of events. 7. The method of claim 5, further comprising determining that a user device has been presenting the content for a predefined period of time before causing presentation of the synopsis. 8. A method comprising:
receiving, at a terminal, a request to present content, wherein the request is received after a start time of content transmission; monitoring a length of time during which the content has been available; determining, by the terminal, that the length of time exceeds a predetermined threshold amount of time; communicating a request to retrieve a portion of the content subsequent to the request to present the content and said determining; and receiving the portion of the content, wherein the portion comprises the content transmitted between the start time and a receipt time of the request to present the content. 9. The method of claim 8, wherein the monitoring is performed by the terminal. 10. The method of claim 8, further comprising communicating, by the terminal, the content to a user device for presentation. 11. The method of claim 10, wherein the monitoring comprises determining an amount of time that the content has been transmitted to the user device. 12. The method of claim 10, wherein the monitoring comprises determining an amount of time that the user device has been tuned to receive the content. 13. The method of claim 8, further comprising generating a prompt requesting approval prior to communicating the request to retrieve the portion of the content. 14. The method of claim 8, wherein the portion of the content does not include content transmitted after the receipt time. 15. The method of claim 8, further comprising:
receiving a request for a synopsis of the content; subsequent to receipt of the request for the synopsis, identifying a portion of the content that has been transmitted as of an identified clock time; and causing presentation of the synopsis of the content that summarizes the portion of the content that has been transmitted from a beginning of content transmission until the identified clock time. 16. The method of claim 15, further comprising determining that a user device has been presenting the content for a predefined period of time before causing presentation of the synopsis. 17. The method of claim 15, wherein the synopsis comprises a summary of events. 18. A method comprising:
causing, by a computing device, transmission of a program to a terminal; subsequent to a start time of the transmission, receiving a request from the terminal that requests a portion of the program; and causing transmission of the portion of the program to the terminal, wherein the portion of the program comprises the program transmitted between the start time and a second time corresponding to when a device first tuned to the program. 19. The method of claim 18, wherein the portion of the content comprises a complete copy of the program. 20. The method of claim 18, wherein the portion of the content comprises less than a complete copy of the program. | 2,400 |
9,435 | 9,435 | 15,528,121 | 2,439 | A technique for generating a password ( 306 ) is provided. As to a method aspect of the technique, an input sequence ( 304 ) is received. The input sequence ( 304 ) is indicative of a time sequence. The password ( 306 ) is generated based on an output ( 302 ) of a pseudo-random number generator ( 104 ) and the input sequence ( 304 ). | 1-18. (canceled) 19. A method of generating a password, the method comprising:
receiving an input sequence, wherein the input sequence is indicative of a time sequence; and generating the password based on an output of a pseudo-random number generator and the input sequence. 20. The method of claim 19, wherein the input sequence includes a plurality of entries and is indicative of the time sequence of the entries. 21. The method of claim 20, wherein the time sequence includes timestamps, each of the entries being associated with one of the timestamps. 22. The method of claim 21, wherein each of the timestamps specifies a time of a keystroke for the associated entry. 23. The method of claim 20, wherein the generating the password comprises generating the password from sections of the output of the pseudo-random number generator. 24. The method of claim 23, wherein the password is generated by concatenating the sections from which the password is generated. 25. The method of claims 23, wherein the output of the pseudo-random number generator is partitioned into a plurality of sections, out of which the sections for generating the password are selected based on the input sequence. 26. The method of claim 25, wherein a length of the password is an integer multiple of a length of the input sequence. 27. The method of claim 25, wherein one section out of the plurality of sections is selected for each entry in the input sequence. 28. The method of claim 25, wherein the selection depends on time differences between consecutive entries. 29. The method of claim 28, wherein each of the time differences is nonlinearly discretized to an integer value. 30. The method of claims 28, wherein each section for generating the password is selected based on a function of the entry and the time difference associated with the entry. 31. The method of claim 19, further comprising:
receiving at least one identifier; and initializing the pseudo-random number generator using the at least one identifier. 32. The method of claim 31, wherein the at least one identifier includes at least one of a user name, a user identifier, and a service provider name. 33. A non-transitory computer readable recording medium storing a computer program product for generating a password, the computer program product comprising software instructions which, when run on processing circuitry of a computing device, causes the computing device to:
receive an input sequence, wherein the input sequence is indicative of a time sequence; and generate the password based on an output of a pseudo-random number generator and the input sequence. 34. A device for generating a password, the device comprising:
processing circuitry; memory containing instructions executable by the processing circuitry whereby the device is operative to:
receive an input sequence, wherein the input sequence is indicative of a time sequence;
generate the password based on an output of a pseudo-random number generator and the input sequence. | A technique for generating a password ( 306 ) is provided. As to a method aspect of the technique, an input sequence ( 304 ) is received. The input sequence ( 304 ) is indicative of a time sequence. The password ( 306 ) is generated based on an output ( 302 ) of a pseudo-random number generator ( 104 ) and the input sequence ( 304 ).1-18. (canceled) 19. A method of generating a password, the method comprising:
receiving an input sequence, wherein the input sequence is indicative of a time sequence; and generating the password based on an output of a pseudo-random number generator and the input sequence. 20. The method of claim 19, wherein the input sequence includes a plurality of entries and is indicative of the time sequence of the entries. 21. The method of claim 20, wherein the time sequence includes timestamps, each of the entries being associated with one of the timestamps. 22. The method of claim 21, wherein each of the timestamps specifies a time of a keystroke for the associated entry. 23. The method of claim 20, wherein the generating the password comprises generating the password from sections of the output of the pseudo-random number generator. 24. The method of claim 23, wherein the password is generated by concatenating the sections from which the password is generated. 25. The method of claims 23, wherein the output of the pseudo-random number generator is partitioned into a plurality of sections, out of which the sections for generating the password are selected based on the input sequence. 26. The method of claim 25, wherein a length of the password is an integer multiple of a length of the input sequence. 27. The method of claim 25, wherein one section out of the plurality of sections is selected for each entry in the input sequence. 28. The method of claim 25, wherein the selection depends on time differences between consecutive entries. 29. The method of claim 28, wherein each of the time differences is nonlinearly discretized to an integer value. 30. The method of claims 28, wherein each section for generating the password is selected based on a function of the entry and the time difference associated with the entry. 31. The method of claim 19, further comprising:
receiving at least one identifier; and initializing the pseudo-random number generator using the at least one identifier. 32. The method of claim 31, wherein the at least one identifier includes at least one of a user name, a user identifier, and a service provider name. 33. A non-transitory computer readable recording medium storing a computer program product for generating a password, the computer program product comprising software instructions which, when run on processing circuitry of a computing device, causes the computing device to:
receive an input sequence, wherein the input sequence is indicative of a time sequence; and generate the password based on an output of a pseudo-random number generator and the input sequence. 34. A device for generating a password, the device comprising:
processing circuitry; memory containing instructions executable by the processing circuitry whereby the device is operative to:
receive an input sequence, wherein the input sequence is indicative of a time sequence;
generate the password based on an output of a pseudo-random number generator and the input sequence. | 2,400 |
9,436 | 9,436 | 16,853,932 | 2,426 | In one aspect, a method includes identifying an upcoming content modification opportunity on a channel. The method also includes responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel. The method also includes for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. The method also includes using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices. The method also includes performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. | 1. A method comprising:
identifying an upcoming content modification opportunity on a channel; responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel; for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel; using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices; and performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 2. The method of claim 1, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing broadcast schedule data associated with the channel; and using the accessed broadcast schedule data to identify the upcoming content modification opportunity on the channel. 3. The method of claim 1, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing in-band message data that was extracted from content transmitted by a content-distribution system on the channel; and using the accessed in-band message data to identify the upcoming content modification opportunity on the channel. 4. The method of claim 1, wherein determining a respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel comprises:
accessing historical content-modification operation data associated with that content-presentation device; and using at least the accessed historical content-modification operation data to determine the respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 5. The method of claim 4, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed respective content-modification operations in the past. 6. The method of claim 4, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed, in the past, a set of actions to prepare that content-presentation device to perform a content-modification operation. 7. The method of claim 1, wherein selecting the subgroup of content-presentation devices is based on the content-presentation devices in the subgroup having respective probabilities that are greater than a threshold amount. 8. A non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by a processor, cause performance of a set of operations comprising:
identifying an upcoming content modification opportunity on a channel; responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel; for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel; using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices; and performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 9. The non-transitory computer-readable storage medium of claim 8, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing broadcast schedule data associated with the channel; and using the accessed broadcast schedule data to identify the upcoming content modification opportunity on the channel. 10. The non-transitory computer-readable storage medium of claim 8, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing in-band message data that was extracted from content transmitted by a content-distribution system on the channel; and using the accessed in-band message data to identify the upcoming content modification opportunity on the channel. 11. The non-transitory computer-readable storage medium of claim 8, wherein determining a respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel comprises:
accessing historical content-modification operation data associated with that content-presentation device; and using at least the accessed historical content-modification operation data to determine the respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 12. The non-transitory computer-readable storage medium of claim 11, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed respective content-modification operations in the past. 13. The non-transitory computer-readable storage medium of claim 11, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed, in the past, a set of actions to prepare that content-presentation device to perform a content-modification operation. 14. The non-transitory computer-readable storage medium of claim 8, wherein selecting the subgroup of content-presentation devices is based on the content-presentation devices in the subgroup having respective probabilities that are greater than a threshold amount. 15. A computing system comprising:
a processor; and a non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by the processor, cause performance of a set of operations comprising:
identifying an upcoming content modification opportunity on a channel;
responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel;
for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel;
using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices; and
performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 16. The computing system of claim 15, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing broadcast schedule data associated with the channel; and using the accessed broadcast schedule data to identify the upcoming content modification opportunity on the channel. 17. The computing system of claim 15, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing in-band message data that was extracted from content transmitted by a content-distribution system on the channel; and using the accessed in-band message data to identify the upcoming content modification opportunity on the channel. 18. The computing system of claim 15, wherein determining a respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel comprises:
accessing historical content-modification operation data associated with that content-presentation device; and using at least the accessed historical content-modification operation data to determine the respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 19. The computing system of claim 18, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed respective content-modification operations in the past. 20. The computing system of claim 18, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed, in the past, a set of actions to prepare that content-presentation device to perform a content-modification operation. | In one aspect, a method includes identifying an upcoming content modification opportunity on a channel. The method also includes responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel. The method also includes for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. The method also includes using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices. The method also includes performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel.1. A method comprising:
identifying an upcoming content modification opportunity on a channel; responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel; for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel; using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices; and performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 2. The method of claim 1, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing broadcast schedule data associated with the channel; and using the accessed broadcast schedule data to identify the upcoming content modification opportunity on the channel. 3. The method of claim 1, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing in-band message data that was extracted from content transmitted by a content-distribution system on the channel; and using the accessed in-band message data to identify the upcoming content modification opportunity on the channel. 4. The method of claim 1, wherein determining a respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel comprises:
accessing historical content-modification operation data associated with that content-presentation device; and using at least the accessed historical content-modification operation data to determine the respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 5. The method of claim 4, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed respective content-modification operations in the past. 6. The method of claim 4, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed, in the past, a set of actions to prepare that content-presentation device to perform a content-modification operation. 7. The method of claim 1, wherein selecting the subgroup of content-presentation devices is based on the content-presentation devices in the subgroup having respective probabilities that are greater than a threshold amount. 8. A non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by a processor, cause performance of a set of operations comprising:
identifying an upcoming content modification opportunity on a channel; responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel; for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel; using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices; and performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 9. The non-transitory computer-readable storage medium of claim 8, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing broadcast schedule data associated with the channel; and using the accessed broadcast schedule data to identify the upcoming content modification opportunity on the channel. 10. The non-transitory computer-readable storage medium of claim 8, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing in-band message data that was extracted from content transmitted by a content-distribution system on the channel; and using the accessed in-band message data to identify the upcoming content modification opportunity on the channel. 11. The non-transitory computer-readable storage medium of claim 8, wherein determining a respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel comprises:
accessing historical content-modification operation data associated with that content-presentation device; and using at least the accessed historical content-modification operation data to determine the respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 12. The non-transitory computer-readable storage medium of claim 11, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed respective content-modification operations in the past. 13. The non-transitory computer-readable storage medium of claim 11, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed, in the past, a set of actions to prepare that content-presentation device to perform a content-modification operation. 14. The non-transitory computer-readable storage medium of claim 8, wherein selecting the subgroup of content-presentation devices is based on the content-presentation devices in the subgroup having respective probabilities that are greater than a threshold amount. 15. A computing system comprising:
a processor; and a non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by the processor, cause performance of a set of operations comprising:
identifying an upcoming content modification opportunity on a channel;
responsive to identifying the upcoming content modification opportunity on the channel, identifying a group of multiple content-presentation devices tuned to the channel;
for each content-presentation device in the identified group, determining a respective probability of that content-presentation device successfully performing a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel;
using at least the determined probabilities as a basis to select, from among the content-presentation devices in the identified group, a subgroup of content-presentation devices; and
performing actions that facilitate causing each of at least some of the content-presentation devices in the selected subgroup to perform a respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 16. The computing system of claim 15, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing broadcast schedule data associated with the channel; and using the accessed broadcast schedule data to identify the upcoming content modification opportunity on the channel. 17. The computing system of claim 15, wherein identifying the upcoming content modification opportunity on the channel comprises:
accessing in-band message data that was extracted from content transmitted by a content-distribution system on the channel; and using the accessed in-band message data to identify the upcoming content modification opportunity on the channel. 18. The computing system of claim 15, wherein determining a respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel comprises:
accessing historical content-modification operation data associated with that content-presentation device; and using at least the accessed historical content-modification operation data to determine the respective probability of that content-presentation device successfully performing the respective content-modification operation in connection with the identified upcoming content modification opportunity on the channel. 19. The computing system of claim 18, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed respective content-modification operations in the past. 20. The computing system of claim 18, wherein the respective historical content-modification operation data indicates an extent to which that content-presentation device has successfully performed, in the past, a set of actions to prepare that content-presentation device to perform a content-modification operation. | 2,400 |
9,437 | 9,437 | 16,586,552 | 2,421 | A computing system detects a channel multi-match with non-matching programs, based on fingerprint-based ACR analysis of digital fingerprint data representing a channel rendered by a content presentation device. The system then responsively performs disambiguation based at least in part on detecting an earlier single-channel match and/or a later single-channel match, the disambiguation establishing that the channel rendered by the content presentation device is the single known channel. And based on the disambiguation, the system then uses the single known channel as a basis for carrying out of at least one channel-specific operation, such as recording audience-measurement data and/or invoking dynamic content modification. | 1. A method comprising:
detecting by a computing system a channel multi-match with non-matching programs, wherein detecting the channel multi-match with non-matching programs includes (i) detecting, based on digital-fingerprint comparison, a channel multi-match in which query fingerprint data representing a channel rendered by a content presentation device matches multiple instances of reference fingerprint data corresponding respectively with multiple known channels and (ii) detecting that, at a time of the detected channel multi-match, the multiple known channels were scheduled to be presenting different programs than each other; responsive to at least detecting the channel multi-match with non-matching programs, performing by the computing system disambiguation based at least in part on detecting at least one of an earlier or later single-channel match in which the query fingerprint data matches reference fingerprint data corresponding with just a single known channel, wherein the disambiguation establishes that the channel rendered by the content presentation device is the single known channel; and based on the disambiguation, using by the computing system the single known channel as a basis for carrying out of at least one channel-specific operation. 2. The method of claim 1, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting both the earlier single-channel match and the later single-channel match and determining that both the earlier single-channel match and the later single-channel match identify as the single known channel the same channel as each other. 3. The method of claim 1, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the earlier single-channel match. 4. The method of claim 3, wherein performing the disambiguation based at least in part on detecting the earlier single-channel match comprises:
identifying as the earlier single-channel match a single-channel match that most recently precedes the time of the detected channel multi-match. 5. The method of claim 4, wherein identifying the single-channel match that most recently precedes the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match is threshold near in time to the time of the detected channel multi-match. 6. The method of claim 4, wherein identifying the single-channel match that most recently precedes the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match ends a continuous time sequence of single-channel matches identifying the same single channel as each other. 7. The method of claim 1, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the later single-channel match. 8. The method of claim 7, wherein performing the disambiguation based at least in part on detecting the later single-channel match comprises:
identifying as the later single-channel match a single-channel match that follows and is nearest in time to the time of the detected channel multi-match. 9. The method of claim 8, wherein identifying the single-channel match that follows and is nearest in time to the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match is threshold near in time to the time of the detected channel multi-match. 10. The method of claim 8, wherein identifying the single-channel match that follows and is nearest in time to the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match starts a continuous time sequence of single-channel matches identifying the same single channel as each other. 11. The method of claim 1, wherein the at least one channel-specific operation comprises providing a record of the content presentation device rendering the single known channel, for use in channel ratings. 12. The method of claim 1, wherein the at least one channel-specific operation comprises using an identity of the single known channel as a basis to invoke dynamic content modification. 13. The method of claim 12, wherein the dynamic content modification comprises dynamic advertisement insertion. 14. A computing system comprising:
at least one a network communication interface; at least one a processing unit; at least one non-transitory data storage; and program instructions stored in the at least one non-transitory data storage and executable by the at least one processing unit to carry out operations including:
receiving from a content presentation device, via the at least one network communication interface, query fingerprint data representing a channel of content rendered by the media presentation device,
detecting a channel multi-match with non-matching programs, wherein detecting the channel multi-match with non-matching programs includes (i) detecting, based on digital-fingerprint comparison, a channel multi-match in which the received query fingerprint data matches multiple instances of reference fingerprint data corresponding respectively with multiple known channels and (ii) detecting that, at a time of the detected channel multi-match, the multiple known channels were scheduled to be presenting different programs than each other,
responsive to at least detecting the channel multi-match with non-matching programs, performing disambiguation based at least in part on detecting at least one of an earlier or later single-channel match in which the query fingerprint data matches reference fingerprint data corresponding with just a single known channel, wherein the disambiguation establishes that the channel rendered by the content presentation device is the single known channel, and
based on the disambiguation, using the single known channel as a basis for carrying out of at least one channel-specific operation. 15. The computing system of claim 14, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting both the earlier single-channel match and the later single-channel match and determining that both the earlier single-channel match and the later single-channel match identify as the single known channel the same channel as each other. 16. The computing system of claim 14, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the earlier single-channel match. 17. The computing system of claim 14, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the later single-channel match. 18. The computing system of claim 14, wherein the at least one channel-specific operation comprises providing a record of the content presentation device rendering the single known channel, for use in channel ratings. 19. The computing system of claim 14, wherein the at least one channel-specific operation comprises using an identity of the single known channel as a basis to invoke dynamic content modification. 20. A non-transitory computer-readable medium having stored thereon instructions executable by a processing unit to carry out operations including:
detecting a channel multi-match with non-matching programs, wherein detecting the channel multi-match with non-matching programs includes (i) detecting, based on digital-fingerprint comparison, a channel multi-match in which query fingerprint data representing a channel rendered by a content presentation device matches multiple instances of reference fingerprint data corresponding respectively with multiple known channels and (ii) detecting that, at a time of the detected channel multi-match, the multiple known channels were scheduled to be presenting different programs than each other, responsive to at least detecting the channel multi-match with non-matching programs, performing disambiguation based at least in part on detecting at least one of an earlier or later single-channel match in which the query fingerprint data matches reference fingerprint data corresponding with just a single known channel, wherein the disambiguation establishes that the channel rendered by the content presentation device is the single known channel, and based on the disambiguation, using the single known channel as a basis for carrying out of at least one channel-specific operation. | A computing system detects a channel multi-match with non-matching programs, based on fingerprint-based ACR analysis of digital fingerprint data representing a channel rendered by a content presentation device. The system then responsively performs disambiguation based at least in part on detecting an earlier single-channel match and/or a later single-channel match, the disambiguation establishing that the channel rendered by the content presentation device is the single known channel. And based on the disambiguation, the system then uses the single known channel as a basis for carrying out of at least one channel-specific operation, such as recording audience-measurement data and/or invoking dynamic content modification.1. A method comprising:
detecting by a computing system a channel multi-match with non-matching programs, wherein detecting the channel multi-match with non-matching programs includes (i) detecting, based on digital-fingerprint comparison, a channel multi-match in which query fingerprint data representing a channel rendered by a content presentation device matches multiple instances of reference fingerprint data corresponding respectively with multiple known channels and (ii) detecting that, at a time of the detected channel multi-match, the multiple known channels were scheduled to be presenting different programs than each other; responsive to at least detecting the channel multi-match with non-matching programs, performing by the computing system disambiguation based at least in part on detecting at least one of an earlier or later single-channel match in which the query fingerprint data matches reference fingerprint data corresponding with just a single known channel, wherein the disambiguation establishes that the channel rendered by the content presentation device is the single known channel; and based on the disambiguation, using by the computing system the single known channel as a basis for carrying out of at least one channel-specific operation. 2. The method of claim 1, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting both the earlier single-channel match and the later single-channel match and determining that both the earlier single-channel match and the later single-channel match identify as the single known channel the same channel as each other. 3. The method of claim 1, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the earlier single-channel match. 4. The method of claim 3, wherein performing the disambiguation based at least in part on detecting the earlier single-channel match comprises:
identifying as the earlier single-channel match a single-channel match that most recently precedes the time of the detected channel multi-match. 5. The method of claim 4, wherein identifying the single-channel match that most recently precedes the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match is threshold near in time to the time of the detected channel multi-match. 6. The method of claim 4, wherein identifying the single-channel match that most recently precedes the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match ends a continuous time sequence of single-channel matches identifying the same single channel as each other. 7. The method of claim 1, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the later single-channel match. 8. The method of claim 7, wherein performing the disambiguation based at least in part on detecting the later single-channel match comprises:
identifying as the later single-channel match a single-channel match that follows and is nearest in time to the time of the detected channel multi-match. 9. The method of claim 8, wherein identifying the single-channel match that follows and is nearest in time to the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match is threshold near in time to the time of the detected channel multi-match. 10. The method of claim 8, wherein identifying the single-channel match that follows and is nearest in time to the time of the detected channel multi-match comprises identifying the single-channel match only if the single-channel match starts a continuous time sequence of single-channel matches identifying the same single channel as each other. 11. The method of claim 1, wherein the at least one channel-specific operation comprises providing a record of the content presentation device rendering the single known channel, for use in channel ratings. 12. The method of claim 1, wherein the at least one channel-specific operation comprises using an identity of the single known channel as a basis to invoke dynamic content modification. 13. The method of claim 12, wherein the dynamic content modification comprises dynamic advertisement insertion. 14. A computing system comprising:
at least one a network communication interface; at least one a processing unit; at least one non-transitory data storage; and program instructions stored in the at least one non-transitory data storage and executable by the at least one processing unit to carry out operations including:
receiving from a content presentation device, via the at least one network communication interface, query fingerprint data representing a channel of content rendered by the media presentation device,
detecting a channel multi-match with non-matching programs, wherein detecting the channel multi-match with non-matching programs includes (i) detecting, based on digital-fingerprint comparison, a channel multi-match in which the received query fingerprint data matches multiple instances of reference fingerprint data corresponding respectively with multiple known channels and (ii) detecting that, at a time of the detected channel multi-match, the multiple known channels were scheduled to be presenting different programs than each other,
responsive to at least detecting the channel multi-match with non-matching programs, performing disambiguation based at least in part on detecting at least one of an earlier or later single-channel match in which the query fingerprint data matches reference fingerprint data corresponding with just a single known channel, wherein the disambiguation establishes that the channel rendered by the content presentation device is the single known channel, and
based on the disambiguation, using the single known channel as a basis for carrying out of at least one channel-specific operation. 15. The computing system of claim 14, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting both the earlier single-channel match and the later single-channel match and determining that both the earlier single-channel match and the later single-channel match identify as the single known channel the same channel as each other. 16. The computing system of claim 14, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the earlier single-channel match. 17. The computing system of claim 14, wherein performing the disambiguation based at least in part on the detecting at least one of the earlier or later single-channel match comprises performing the disambiguation based at least in part on detecting the later single-channel match. 18. The computing system of claim 14, wherein the at least one channel-specific operation comprises providing a record of the content presentation device rendering the single known channel, for use in channel ratings. 19. The computing system of claim 14, wherein the at least one channel-specific operation comprises using an identity of the single known channel as a basis to invoke dynamic content modification. 20. A non-transitory computer-readable medium having stored thereon instructions executable by a processing unit to carry out operations including:
detecting a channel multi-match with non-matching programs, wherein detecting the channel multi-match with non-matching programs includes (i) detecting, based on digital-fingerprint comparison, a channel multi-match in which query fingerprint data representing a channel rendered by a content presentation device matches multiple instances of reference fingerprint data corresponding respectively with multiple known channels and (ii) detecting that, at a time of the detected channel multi-match, the multiple known channels were scheduled to be presenting different programs than each other, responsive to at least detecting the channel multi-match with non-matching programs, performing disambiguation based at least in part on detecting at least one of an earlier or later single-channel match in which the query fingerprint data matches reference fingerprint data corresponding with just a single known channel, wherein the disambiguation establishes that the channel rendered by the content presentation device is the single known channel, and based on the disambiguation, using the single known channel as a basis for carrying out of at least one channel-specific operation. | 2,400 |
9,438 | 9,438 | 15,222,611 | 2,448 | Securing information within a user interface can include mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and the avatar are stored within a data storage device, and generating, using the processor, a user interface including a message correlated with the electronic mail address. The user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. | 1-7. (canceled) 8. A system for securing information, comprising:
a processor programmed to initiate executable operations including:
mapping an electronic mail address to an avatar, wherein the mapped electronic mail address and avatar are stored within a data storage device; and
generating a user interface comprising a message correlated with the electronic mail address, wherein the user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. 9. The system of claim 8, wherein the processor is further programmed to initiate executable operations comprising:
responsive to a user input, displaying at least one of the name of the user of the electronic mail address or the electronic mail address. 10. The system of claim 8, wherein a plurality of electronic mail addresses are mapped to a plurality of avatars, wherein the processor is further programmed to initiate executable operations comprising:
responsive to receiving user input specifying a recipient of a message, determining electronic mail addresses matching the received user input and displaying only the avatar of each matching electronic mail address in lieu of displaying correspondent data for each matching electronic mail address. 11. The system of claim 10, wherein characters of the user input are not displayed. 12. The system of claim 8, wherein the user interface displays the message opened, wherein each electronic mail address correlated with the message is represented using only the avatar for electronic mail address. 13. The system of claim 8, wherein the user interface displays a plurality of records for messages arranged in a list, wherein for each record, at least one of a sender or a recipient is specified using only an avatar for an electronic mail address of the sender or recipient. 14. The system of claim 8, wherein the processor is further programmed to initiate executable operations comprising:
first determining that the electronic mail address correlated with the message is not mapped to an avatar, and responsive to the determining, performing the mapping by generating an avatar based on at least one of the electronic mail address or a name for the electronic mail address, and using the generated avatar for the electronic mail address. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method of securing information, comprising:
mapping, using the processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and avatar are stored within a data storage device; and generating, using the processor, a user interface comprising a message correlated with the electronic mail address, wherein the user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. 16. The computer program product of claim 15, wherein the method further comprises:
responsive to a user input, displaying at least one of the name of the user of the electronic mail address or the electronic mail address. 17. The computer program product of claim 15, wherein a plurality of electronic mail addresses are mapped to a plurality of avatars, the method further comprising:
responsive to receiving user input specifying a recipient of a message, determining electronic mail addresses matching the received user input and displaying only the avatar of each matching electronic mail address in lieu of displaying correspondent data for each matching electronic mail address. 18. The computer program product of claim 17, wherein characters of the user input are not displayed. 19. The computer program product of claim 15, wherein the user interface displays a plurality of records for messages arranged in a list, wherein for each record, at least one of a sender or a recipient is specified using only an avatar for an electronic mail address of the sender or recipient. 20. The computer program product of claim 15, wherein the method further comprises:
first determining that the electronic mail address correlated with the message is not mapped to an avatar, and responsive to the determining, performing the mapping by generating an avatar based on at least one of the electronic mail address or a name for the electronic mail address, and using the generated avatar for the electronic mail address. | Securing information within a user interface can include mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and the avatar are stored within a data storage device, and generating, using the processor, a user interface including a message correlated with the electronic mail address. The user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address.1-7. (canceled) 8. A system for securing information, comprising:
a processor programmed to initiate executable operations including:
mapping an electronic mail address to an avatar, wherein the mapped electronic mail address and avatar are stored within a data storage device; and
generating a user interface comprising a message correlated with the electronic mail address, wherein the user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. 9. The system of claim 8, wherein the processor is further programmed to initiate executable operations comprising:
responsive to a user input, displaying at least one of the name of the user of the electronic mail address or the electronic mail address. 10. The system of claim 8, wherein a plurality of electronic mail addresses are mapped to a plurality of avatars, wherein the processor is further programmed to initiate executable operations comprising:
responsive to receiving user input specifying a recipient of a message, determining electronic mail addresses matching the received user input and displaying only the avatar of each matching electronic mail address in lieu of displaying correspondent data for each matching electronic mail address. 11. The system of claim 10, wherein characters of the user input are not displayed. 12. The system of claim 8, wherein the user interface displays the message opened, wherein each electronic mail address correlated with the message is represented using only the avatar for electronic mail address. 13. The system of claim 8, wherein the user interface displays a plurality of records for messages arranged in a list, wherein for each record, at least one of a sender or a recipient is specified using only an avatar for an electronic mail address of the sender or recipient. 14. The system of claim 8, wherein the processor is further programmed to initiate executable operations comprising:
first determining that the electronic mail address correlated with the message is not mapped to an avatar, and responsive to the determining, performing the mapping by generating an avatar based on at least one of the electronic mail address or a name for the electronic mail address, and using the generated avatar for the electronic mail address. 15. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method of securing information, comprising:
mapping, using the processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and avatar are stored within a data storage device; and generating, using the processor, a user interface comprising a message correlated with the electronic mail address, wherein the user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. 16. The computer program product of claim 15, wherein the method further comprises:
responsive to a user input, displaying at least one of the name of the user of the electronic mail address or the electronic mail address. 17. The computer program product of claim 15, wherein a plurality of electronic mail addresses are mapped to a plurality of avatars, the method further comprising:
responsive to receiving user input specifying a recipient of a message, determining electronic mail addresses matching the received user input and displaying only the avatar of each matching electronic mail address in lieu of displaying correspondent data for each matching electronic mail address. 18. The computer program product of claim 17, wherein characters of the user input are not displayed. 19. The computer program product of claim 15, wherein the user interface displays a plurality of records for messages arranged in a list, wherein for each record, at least one of a sender or a recipient is specified using only an avatar for an electronic mail address of the sender or recipient. 20. The computer program product of claim 15, wherein the method further comprises:
first determining that the electronic mail address correlated with the message is not mapped to an avatar, and responsive to the determining, performing the mapping by generating an avatar based on at least one of the electronic mail address or a name for the electronic mail address, and using the generated avatar for the electronic mail address. | 2,400 |
9,439 | 9,439 | 15,811,696 | 2,448 | Securing information within a user interface can include mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and the avatar are stored within a data storage device, and generating, using the processor, a user interface including a message correlated with the electronic mail address. The user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. | 1. A computer-implemented method of securing information, comprising:
mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and avatar are stored within a data storage device; and generating, using the processor, a user interface comprising a message correlated with the electronic mail address, wherein the user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. 2. The method of claim 1, further comprising:
responsive to a user input, displaying at least one of the name of the user of the electronic mail address or the electronic mail address. 3. The method of claim 1, wherein a plurality of electronic mail addresses are mapped to a plurality of avatars, the method further comprising:
responsive to receiving user input specifying a recipient of a message, determining electronic mail addresses matching the received user input and displaying only the avatar of each matching electronic mail address in lieu of displaying correspondent data for each matching electronic mail address. 4. The method of claim 3, wherein characters of the user input are not displayed. 5. The method of claim 1, wherein the user interface displays the message opened, wherein each electronic mail address correlated with the message is represented using only the avatar for electronic mail address. 6. The method of claim 1, wherein the user interface displays a plurality of records for messages arranged in a list, wherein for each record, at least one of a sender or a recipient is specified using only an avatar for an electronic mail address of the sender or recipient. 7. The method of claim 1, further comprising:
first determining that the electronic mail address correlated with the message is not mapped to an avatar, and responsive to the determining, performing the mapping by generating an avatar based on at least one of the electronic mail address or a name for the electronic mail address, and using the generated avatar for the electronic mail address. 8-20. (canceled) | Securing information within a user interface can include mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and the avatar are stored within a data storage device, and generating, using the processor, a user interface including a message correlated with the electronic mail address. The user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address.1. A computer-implemented method of securing information, comprising:
mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and avatar are stored within a data storage device; and generating, using the processor, a user interface comprising a message correlated with the electronic mail address, wherein the user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address. 2. The method of claim 1, further comprising:
responsive to a user input, displaying at least one of the name of the user of the electronic mail address or the electronic mail address. 3. The method of claim 1, wherein a plurality of electronic mail addresses are mapped to a plurality of avatars, the method further comprising:
responsive to receiving user input specifying a recipient of a message, determining electronic mail addresses matching the received user input and displaying only the avatar of each matching electronic mail address in lieu of displaying correspondent data for each matching electronic mail address. 4. The method of claim 3, wherein characters of the user input are not displayed. 5. The method of claim 1, wherein the user interface displays the message opened, wherein each electronic mail address correlated with the message is represented using only the avatar for electronic mail address. 6. The method of claim 1, wherein the user interface displays a plurality of records for messages arranged in a list, wherein for each record, at least one of a sender or a recipient is specified using only an avatar for an electronic mail address of the sender or recipient. 7. The method of claim 1, further comprising:
first determining that the electronic mail address correlated with the message is not mapped to an avatar, and responsive to the determining, performing the mapping by generating an avatar based on at least one of the electronic mail address or a name for the electronic mail address, and using the generated avatar for the electronic mail address. 8-20. (canceled) | 2,400 |
9,440 | 9,440 | 15,674,035 | 2,483 | A device includes a memory device configured to store video data including a current block, and processing circuitry in communication with the memory. The processing circuitry configured to obtain a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data stored to the memory device, the one or more neighbor blocks being positioned within a spatio-temporal neighborhood of the current block, the spatio-temporal neighborhood including one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block. The processing circuitry is also configured to code the current block of the video data stored to the memory device. | 1. A method of coding a current block of video data, the method comprising:
obtaining a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data positioned within a spatio-temporal neighborhood of the current block, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and coding the current block of the video data based on the obtained parameter value. 2. The method of claim 1, wherein the obtained parameter value comprises a quantization parameter (QP) value, and wherein coding the current block based on the obtained parameter value comprises decoding the current block at least in part by dequantizing samples of the current block using the QP value. 3. The method of claim 2, wherein obtaining the QP value comprises:
receiving, in an encoded video bitstream, a delta quantization parameter (QP) value; obtaining a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; and adding the delta QP value to the reference QP value to derive the QP value for dequantizing the samples of the current block. 4. The method of claim 1, wherein the obtained parameter value comprises a scaling parameter value, and wherein coding the current block based on the obtained parameter value comprises decoding the current block at least in part by inverse scaling transform coefficients of the current block using the scaling parameter value. 5. The method of claim 4, wherein inverse scaling the transform coefficients of the current block comprises:
applying a first inverse scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled DC transform coefficients; and applying a second inverse scaling derivation process to the plurality of inverse-scaled DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled AC transform coefficients. 6. The method of claim 1, wherein obtaining the parameter value comprises obtaining a quantization parameter (QP) value, comprising:
selecting neighbor QP values associated with samples of two or more of the spatial neighbor blocks or the temporal neighbor block; averaging the selected neighbor QP values to obtain an average QP value; and deriving the QP value for the current block from the average QP value, wherein coding the current block based on the obtained parameter value comprises encoding the current block at least in part by quantizing the current block using the QP value. 7. The method of claim 6, further comprising:
obtaining a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; subtracting the reference QP value from the QP value to derive a delta quantization parameter (QP) value for the samples of the current block; and signaling, in an encoded video bitstream, the delta QP value. 8. The method of claim 1, wherein the obtained parameter value comprises a scaling parameter value, and wherein coding the current block based on the obtained parameter value comprises encoding the current block at least in part by scaling transform coefficients of the current block using the scaling parameter value. 9. The method of claim 8, wherein scaling the transform coefficients of the current block comprises:
applying a first scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block; and applying a second scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block. 10. The method of claim 1, wherein the obtained parameter value comprises a global parameter value that is applicable to all blocks of a slice that includes the current block. 11. A device for coding video data, the device comprising:
a memory configured to store video data including a current block; and processing circuitry in communication with the memory, the processing circuitry being configured to:
obtain a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data stored to the memory, the one or more neighbor blocks being positioned within a spatio-temporal neighborhood of the current block, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and
code the current block of the video data stored to the memory. 12. The device of claim 11, wherein the obtained parameter value comprises a quantization parameter (QP) value, and wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to decode the current block at least in part by dequantizing samples of the current block using the QP value. 13. The device of claim 12, wherein to obtain the QP value, the processing circuitry is configured to:
receive, in an encoded video bitstream, a delta quantization parameter (QP) value; obtain a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; and add the delta QP value to the reference QP value to derive the QP value for dequantizing the samples of the current block. 14. The device of claim 11, wherein the obtained parameter value comprises a scaling parameter value, and wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to decode the current block at least in part by inverse scaling transform coefficients of the current block using the scaling parameter value. 15. The device of claim 14, wherein to inverse scale the transform coefficients of the current block, the processing circuitry is configured to:
apply a first inverse scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled DC transform coefficients; and apply a second inverse scaling derivation process to the plurality of inverse-scaled DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled AC transform coefficients. 16. The device of claim 11,
wherein the parameter value comprises a quantization parameter (QP) value, wherein to obtain the QP value, the processing circuitry is configured to:
select neighbor QP values associated with samples of two or more of the spatial neighbor blocks or the temporal neighbor block;
average the selected neighbor QP values to obtain an average QP value; and
derive the QP value for the current block from the average QP value, and
wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to encode the current block at least in part by quantizing the current block using the QP value. 17. The device of claim 16, wherein the processing circuitry is further configured to:
obtain a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; subtract the reference QP value from the QP value to derive a delta quantization parameter (QP) value for the samples of the current block; and signal, in an encoded video bitstream, the delta QP value. 18. The device of claim 11, wherein the obtained parameter value comprises a scaling parameter value, and wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to encode the current block at least in part by scaling transform coefficients of the current block using the scaling parameter value. 19. The device of claim 18, wherein to scale the transform coefficients of the current block, the processing circuitry is configured to:
apply a first scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block; and apply a second scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block. 20. The device of claim 11, wherein the obtained parameter value comprises a global parameter value that is applicable to all blocks of a slice that includes the current block. 21. An apparatus for coding video data, the apparatus comprising:
means for obtaining a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data positioned within a spatio-temporal neighborhood of a current block of the video data, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and means for coding the current block of the video data based on the obtained parameter value. 22. A non-transitory computer-readable storage medium encoded with instructions that, when executed, cause processing circuitry of a video coding device to:
obtain a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data positioned within a spatio-temporal neighborhood of a current block of the video data, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and code the current block of the video data based on the obtained parameter value. | A device includes a memory device configured to store video data including a current block, and processing circuitry in communication with the memory. The processing circuitry configured to obtain a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data stored to the memory device, the one or more neighbor blocks being positioned within a spatio-temporal neighborhood of the current block, the spatio-temporal neighborhood including one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block. The processing circuitry is also configured to code the current block of the video data stored to the memory device.1. A method of coding a current block of video data, the method comprising:
obtaining a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data positioned within a spatio-temporal neighborhood of the current block, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and coding the current block of the video data based on the obtained parameter value. 2. The method of claim 1, wherein the obtained parameter value comprises a quantization parameter (QP) value, and wherein coding the current block based on the obtained parameter value comprises decoding the current block at least in part by dequantizing samples of the current block using the QP value. 3. The method of claim 2, wherein obtaining the QP value comprises:
receiving, in an encoded video bitstream, a delta quantization parameter (QP) value; obtaining a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; and adding the delta QP value to the reference QP value to derive the QP value for dequantizing the samples of the current block. 4. The method of claim 1, wherein the obtained parameter value comprises a scaling parameter value, and wherein coding the current block based on the obtained parameter value comprises decoding the current block at least in part by inverse scaling transform coefficients of the current block using the scaling parameter value. 5. The method of claim 4, wherein inverse scaling the transform coefficients of the current block comprises:
applying a first inverse scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled DC transform coefficients; and applying a second inverse scaling derivation process to the plurality of inverse-scaled DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled AC transform coefficients. 6. The method of claim 1, wherein obtaining the parameter value comprises obtaining a quantization parameter (QP) value, comprising:
selecting neighbor QP values associated with samples of two or more of the spatial neighbor blocks or the temporal neighbor block; averaging the selected neighbor QP values to obtain an average QP value; and deriving the QP value for the current block from the average QP value, wherein coding the current block based on the obtained parameter value comprises encoding the current block at least in part by quantizing the current block using the QP value. 7. The method of claim 6, further comprising:
obtaining a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; subtracting the reference QP value from the QP value to derive a delta quantization parameter (QP) value for the samples of the current block; and signaling, in an encoded video bitstream, the delta QP value. 8. The method of claim 1, wherein the obtained parameter value comprises a scaling parameter value, and wherein coding the current block based on the obtained parameter value comprises encoding the current block at least in part by scaling transform coefficients of the current block using the scaling parameter value. 9. The method of claim 8, wherein scaling the transform coefficients of the current block comprises:
applying a first scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block; and applying a second scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block. 10. The method of claim 1, wherein the obtained parameter value comprises a global parameter value that is applicable to all blocks of a slice that includes the current block. 11. A device for coding video data, the device comprising:
a memory configured to store video data including a current block; and processing circuitry in communication with the memory, the processing circuitry being configured to:
obtain a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data stored to the memory, the one or more neighbor blocks being positioned within a spatio-temporal neighborhood of the current block, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and
code the current block of the video data stored to the memory. 12. The device of claim 11, wherein the obtained parameter value comprises a quantization parameter (QP) value, and wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to decode the current block at least in part by dequantizing samples of the current block using the QP value. 13. The device of claim 12, wherein to obtain the QP value, the processing circuitry is configured to:
receive, in an encoded video bitstream, a delta quantization parameter (QP) value; obtain a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; and add the delta QP value to the reference QP value to derive the QP value for dequantizing the samples of the current block. 14. The device of claim 11, wherein the obtained parameter value comprises a scaling parameter value, and wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to decode the current block at least in part by inverse scaling transform coefficients of the current block using the scaling parameter value. 15. The device of claim 14, wherein to inverse scale the transform coefficients of the current block, the processing circuitry is configured to:
apply a first inverse scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled DC transform coefficients; and apply a second inverse scaling derivation process to the plurality of inverse-scaled DC transform coefficients of the transform coefficients of the current block to obtain a plurality of inverse-scaled AC transform coefficients. 16. The device of claim 11,
wherein the parameter value comprises a quantization parameter (QP) value, wherein to obtain the QP value, the processing circuitry is configured to:
select neighbor QP values associated with samples of two or more of the spatial neighbor blocks or the temporal neighbor block;
average the selected neighbor QP values to obtain an average QP value; and
derive the QP value for the current block from the average QP value, and
wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to encode the current block at least in part by quantizing the current block using the QP value. 17. The device of claim 16, wherein the processing circuitry is further configured to:
obtain a reference QP value for samples of the current block based on samples of the spatio-temporal neighborhood; subtract the reference QP value from the QP value to derive a delta quantization parameter (QP) value for the samples of the current block; and signal, in an encoded video bitstream, the delta QP value. 18. The device of claim 11, wherein the obtained parameter value comprises a scaling parameter value, and wherein to code the current block based on the obtained parameter value, the processing circuitry is configured to encode the current block at least in part by scaling transform coefficients of the current block using the scaling parameter value. 19. The device of claim 18, wherein to scale the transform coefficients of the current block, the processing circuitry is configured to:
apply a first scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block; and apply a second scaling derivation process to a plurality of DC transform coefficients of the transform coefficients of the current block. 20. The device of claim 11, wherein the obtained parameter value comprises a global parameter value that is applicable to all blocks of a slice that includes the current block. 21. An apparatus for coding video data, the apparatus comprising:
means for obtaining a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data positioned within a spatio-temporal neighborhood of a current block of the video data, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and means for coding the current block of the video data based on the obtained parameter value. 22. A non-transitory computer-readable storage medium encoded with instructions that, when executed, cause processing circuitry of a video coding device to:
obtain a parameter value that is based on one or more corresponding parameter values associated with one or more neighbor blocks of the video data positioned within a spatio-temporal neighborhood of a current block of the video data, wherein the spatio-temporal neighborhood includes one or more spatial neighbor blocks that are positioned adjacent to the current block and a temporal neighbor block that is pointed to by a disparity vector (DV) associated with the current block, and wherein the obtained parameter value is used to modify residual data associated with the current block in a coding process; and code the current block of the video data based on the obtained parameter value. | 2,400 |
9,441 | 9,441 | 16,105,264 | 2,411 | An example method of provisioning a network service in a cloud computing system includes: defining, at an orchestrator, the network service to include a plurality of network functions; defining, at the orchestrator, network connectivity among the plurality of network functions; identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. | 1. A method of provisioning a network service in a cloud computing system, comprising:
defining, at an orchestrator, the network service to include a plurality of network functions; defining, at the orchestrator, network connectivity among the plurality of network functions; identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. 2. The method of claim 1, further comprising:
defining an order for the plurality of network functions of the network service; wherein the network connectivity and the deployment of the virtual network functions is based on the order defined for the network functions of the network service. 3. The method of claim 1, further comprising:
defining a location of each network function of the network service; wherein the VDMs are identified based on the location of each network function of the network service. 4. The method of claim 1, wherein the connectivity includes layer-2 or layer-3 network connectivity between network functions. 5. The method of claim 1, wherein the orchestrator is configured to deploy a plurality of built-in virtual network functions, and wherein the method further comprises:
identifying at least one built-in virtual network function for implementing a respective at least one network function of the network service; and identifying, at the orchestrator, additional network connectivity between the virtual network functions and the built-in virtual network functions. 6. The method of claim 5, further comprising:
deploying, by the orchestrator, the at least one build-in virtual network function having the defined additional network connectivity. 7. The method of claim 1, wherein the orchestrator is implemented in a first data center and each of the plurality of VDMs is implemented in an additional data center. 8. A non-transitory computer readable medium comprising instructions, which when executed in a computer system, causes the computer system to carry out a method of provisioning a network service in a cloud computing system, comprising:
defining, at an orchestrator, the network service to include a plurality of network functions; defining, at the orchestrator, network connectivity among the plurality of network functions; identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. 9. The non-transitory computer readable medium of claim 8, further comprising:
defining an order for the plurality of network functions of the network service; wherein the network connectivity and the deployment of the virtual network functions is based on the order defined for the network functions of the network service. 10. The non-transitory computer readable medium of claim 8, further comprising:
defining a location of each network function of the network service; wherein the VDMs are identified based on the location of each network function of the network service. 11. The non-transitory computer readable medium of claim 8, wherein the connectivity includes layer-2 or layer-3 network connectivity between network functions. 12. The non-transitory computer readable medium of claim 8, wherein the orchestrator is configured to deploy a plurality of built-in virtual network functions, and wherein the method further comprises:
identifying at least one built-in virtual network function for implementing a respective at least one network function of the network service; and identifying, at the orchestrator, additional network connectivity between the virtual network functions and the built-in virtual network functions. 13. The non-transitory computer readable medium of claim 12, further comprising:
deploying, by the orchestrator, the at least one build-in virtual network function having the defined additional network connectivity. 14. The non-transitory computer readable medium of claim 8, wherein the orchestrator is implemented in a first data center and each of the plurality of VDMs is implemented in an additional data center. 15. A computing system, comprising:
a memory storing program code; and a processor, coupled to the memory, configured to execute the program code to provision a network service in a cloud computing system by:
defining, at an orchestrator, the network service to include a plurality of network functions;
defining, at the orchestrator, network connectivity among the plurality of network functions;
identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and
instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. 16. The computing system of claim 15, wherein the processor is further configured to:
define an order for the plurality of network functions of the network service; wherein the network connectivity and the deployment of the virtual network functions is based on the order defined for the network functions of the network service. 17. The computing system of claim 15, wherein the processor is further configured to:
define a location of each network function of the network service; wherein the VDMs are identified based on the location of each network function of the network service. 18. The computing system of claim 15, wherein the connectivity includes layer-2 or layer-3 network connectivity between network functions. 19. The computing system of claim 15, wherein the orchestrator is configured to deploy a plurality of built-in virtual network functions, and wherein the processor is further configured to:
identify at least one built-in virtual network function for implementing a respective at least one network function of the network service; and identify, at the orchestrator, additional network connectivity between the virtual network functions and the built-in virtual network functions. 20. The computing system of claim 19, wherein the processor is further configured to:
deploy, by the orchestrator, the at least one build-in virtual network function having the defined additional network connectivity. | An example method of provisioning a network service in a cloud computing system includes: defining, at an orchestrator, the network service to include a plurality of network functions; defining, at the orchestrator, network connectivity among the plurality of network functions; identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity.1. A method of provisioning a network service in a cloud computing system, comprising:
defining, at an orchestrator, the network service to include a plurality of network functions; defining, at the orchestrator, network connectivity among the plurality of network functions; identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. 2. The method of claim 1, further comprising:
defining an order for the plurality of network functions of the network service; wherein the network connectivity and the deployment of the virtual network functions is based on the order defined for the network functions of the network service. 3. The method of claim 1, further comprising:
defining a location of each network function of the network service; wherein the VDMs are identified based on the location of each network function of the network service. 4. The method of claim 1, wherein the connectivity includes layer-2 or layer-3 network connectivity between network functions. 5. The method of claim 1, wherein the orchestrator is configured to deploy a plurality of built-in virtual network functions, and wherein the method further comprises:
identifying at least one built-in virtual network function for implementing a respective at least one network function of the network service; and identifying, at the orchestrator, additional network connectivity between the virtual network functions and the built-in virtual network functions. 6. The method of claim 5, further comprising:
deploying, by the orchestrator, the at least one build-in virtual network function having the defined additional network connectivity. 7. The method of claim 1, wherein the orchestrator is implemented in a first data center and each of the plurality of VDMs is implemented in an additional data center. 8. A non-transitory computer readable medium comprising instructions, which when executed in a computer system, causes the computer system to carry out a method of provisioning a network service in a cloud computing system, comprising:
defining, at an orchestrator, the network service to include a plurality of network functions; defining, at the orchestrator, network connectivity among the plurality of network functions; identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. 9. The non-transitory computer readable medium of claim 8, further comprising:
defining an order for the plurality of network functions of the network service; wherein the network connectivity and the deployment of the virtual network functions is based on the order defined for the network functions of the network service. 10. The non-transitory computer readable medium of claim 8, further comprising:
defining a location of each network function of the network service; wherein the VDMs are identified based on the location of each network function of the network service. 11. The non-transitory computer readable medium of claim 8, wherein the connectivity includes layer-2 or layer-3 network connectivity between network functions. 12. The non-transitory computer readable medium of claim 8, wherein the orchestrator is configured to deploy a plurality of built-in virtual network functions, and wherein the method further comprises:
identifying at least one built-in virtual network function for implementing a respective at least one network function of the network service; and identifying, at the orchestrator, additional network connectivity between the virtual network functions and the built-in virtual network functions. 13. The non-transitory computer readable medium of claim 12, further comprising:
deploying, by the orchestrator, the at least one build-in virtual network function having the defined additional network connectivity. 14. The non-transitory computer readable medium of claim 8, wherein the orchestrator is implemented in a first data center and each of the plurality of VDMs is implemented in an additional data center. 15. A computing system, comprising:
a memory storing program code; and a processor, coupled to the memory, configured to execute the program code to provision a network service in a cloud computing system by:
defining, at an orchestrator, the network service to include a plurality of network functions;
defining, at the orchestrator, network connectivity among the plurality of network functions;
identifying a plurality of vendor device managers (VDMs) configured to provision virtual network functions that implement the plurality of network functions; and
instructing, by the orchestrator, the VDMs to deploy the virtual network functions having the defined network connectivity. 16. The computing system of claim 15, wherein the processor is further configured to:
define an order for the plurality of network functions of the network service; wherein the network connectivity and the deployment of the virtual network functions is based on the order defined for the network functions of the network service. 17. The computing system of claim 15, wherein the processor is further configured to:
define a location of each network function of the network service; wherein the VDMs are identified based on the location of each network function of the network service. 18. The computing system of claim 15, wherein the connectivity includes layer-2 or layer-3 network connectivity between network functions. 19. The computing system of claim 15, wherein the orchestrator is configured to deploy a plurality of built-in virtual network functions, and wherein the processor is further configured to:
identify at least one built-in virtual network function for implementing a respective at least one network function of the network service; and identify, at the orchestrator, additional network connectivity between the virtual network functions and the built-in virtual network functions. 20. The computing system of claim 19, wherein the processor is further configured to:
deploy, by the orchestrator, the at least one build-in virtual network function having the defined additional network connectivity. | 2,400 |
9,442 | 9,442 | 15,879,618 | 2,488 | Methods and systems for generating free viewpoint videos (FVVs) based on images captured in a sports arena. A method includes projecting, onto objects within a filming area within the sports arena, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; creating, based on the plurality of point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. | 1. A method for generating a free viewpoint video (FVV) based on images captured in a sports arena, comprising:
projecting, onto objects within a filming area within the sports arena, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; creating, based on the plurality of point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 2. The method of claim 1, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 3. The method of claim 2, wherein the pattern sensing cameras are black/white cameras with filters adapted to a spectral band of the projected pattern. 4. The method of claim 1, wherein the projection of the predefined pattern is performed by at least one projector. 5. The method of claim 4, wherein a distance at which each of the plurality of depth cameras can capture signals reflected off of the objects in the filming area is based on a light source utilized by the at least one projector. 6. The method of claim 5, wherein the light source is a light emitting diode (LED), wherein the distance from each depth camera to a respective far end of the filming area is at most 20 meters. 7. The method of claim 5, wherein the light source is an extended source. 8. The method of claim 5, wherein the light source is an eye safe laser having a spectral band of between 1.5 and 2 microns. 9. The method of claim 1, further comprising:
rendering the textured 3D model as a continuous sequence of viewpoints along a predetermined path. 10. The method of claim 9, further comprising:
producing instant replays from any viewpoint from the continuous sequence of viewpoints. 11. The method of claim 1, further comprising:
providing a live producing system allowing for switching during a live event to at least one selected viewpoint, wherein each viewpoint represents a virtual camera having at least a predetermined location and pose. 12. The method of claim 11, further comprising:
changing a sound based on a location of the at least one selected viewpoint. 13. The method of claim 11, further comprising:
automatically selecting the at least one viewpoint based on a trained AI model. 14. The method of claim 11, wherein the at least one selected viewpoint is determined based on at least one user input. 15. The method of claim 1, further comprising:
sending, in real-time during a sports event, the FVV to at least one recipient device. 16. The method of 1, further comprising:
compressing the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 17. The method of claim 1, further comprising:
dynamically calibrating the plurality of depth cameras to compensate for small perturbations. 18. The method of claim 1, wherein a number of depth cameras of the plurality of depth cameras is between 2 and 16. 19. The method of claim 1, further comprising:
detecting a skeleton in any of the plurality of point clouds and the images utilized for the texturing; and adjusting, based on the detected skeleton, the meshing of the points in the point cloud. 20. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 1. 21. A method for generating a free viewpoint video (FVV) based on images captured in a sports arena, comprising:
generating, based on scanning performed by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to a filming area within the sports arena; creating, based on the plurality of point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 22. The method of claim 21, wherein each depth camera includes a light detection and ranging (LIDAR) scanner and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 23. The method of claim 22, further comprising:
dynamically tracking, by at least one ROI tracking module located in proximity to the filming area, instantaneous ROIs in the filming area; scanning, by each LIDAR scanner, an area of each designated ROI; and creating, based on the scanning, the point cloud for each designated ROI at a current video frame. 24. The method of claim of 21, wherein the distance from each depth camera to a respective far end of the filming area is at most 200 meters. 25. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 21. 26. A free viewpoint video (FVV) production system for sports events, comprising:
a plurality of depth cameras deployed in proximity to a filming area within a sports arena; and a FVV generator communicatively connected to the plurality of depth cameras; wherein each depth camera is configured to capture signals reflected off of objects within the filming area and an RGB image of the objects; and
wherein the FVV generator is configured to:
generate, based on reflected signals captured by each of the plurality of depth cameras, a point cloud for each depth camera,
create, based on the at least one point cloud, a unified point cloud,
mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects,
texture the 3D model based on images captured by the plurality of depth cameras, and
render the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 27. The FVV production system of claim 26, further comprising:
at least one projector configured to project a predefined pattern including a large set of features onto the objects within the filming area. 28. A system for rendering free viewpoint video (FVV) based on images captured in a sports arena, comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: cause projection, onto objects in a filming area within the sports arena, of a predefined pattern including a large set of features; generate, based on signals captured by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the sports arena; create, based on the plurality of point clouds, a unified point cloud; mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texture the 3D model based on images captured by the plurality of depth cameras; and render the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 29. The system of claim 28, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 30. The system of claim 29, wherein the pattern sensing cameras are black/white cameras with filters adapted to a spectral band of the projected pattern. 31. The system of claim 28, wherein the projection of the predefined pattern is performed by at least one projector. 32. The system of claim 31, wherein a distance at which each of the plurality of depth cameras can capture signals reflected off of the objects in the filming area is based on a light source utilized by the at least one projector. 33. The system of claim 32, wherein the light source is a light emitting diode (LED), wherein the distance from each depth camera to a respective far end of the filming area is at most 20 meters. 34. The system of claim 32, wherein the light source is an extended source. 35. The system of claim 32, wherein the light source is an eye safe laser having a spectral band of between 1.5 and 2 microns. 36. The system of claim 28, wherein the system is further configured to:
render the textured 3D model as a continuous sequence of viewpoints along a predetermined path. 37. The system of claim 36, wherein the system is further configured to:
produce instant replays from any viewpoint from the continuous sequence of viewpoints. 38. The system of claim 28, wherein the system is further configured to:
provide a live producing system allowing for switching during a live event to at least one selected viewpoint, wherein each viewpoint represents a virtual camera having at least a predetermined location and pose. 39. The system of claim 38, wherein the system is further configured to:
change a sound based on a location of the at least one selected viewpoint. 40. The system of claim 38, wherein the system is further configured to:
automatically select the at least one viewpoint based on a trained AI model. 41. The system of claim 38, wherein the at least one selected viewpoint is determined based on at least one user input. 42. The system of claim 28, wherein the system is further configured to:
send, in real-time during a sports event, the FVV to at least one recipient device. 43. The system of 28, wherein the system is further configured to:
compress the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 44. The system of claim 28, wherein the system is further configured to:
dynamically calibrate the plurality of depth cameras to compensate for small perturbations. 45. The system of claim 28, wherein a number of depth cameras of the plurality of depth cameras is between 2 and 16. 46. The system of claim 28, wherein the system is further configured to:
detect a skeleton in any of the plurality of point clouds and the images utilized for the texturing; and adjust, based on the detected skeleton, the meshing of the points in the point cloud. 47. A system for rendering free viewpoint video (FVV) based on images captured in a sports arena, comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: generate, based on scanning performed by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to a filming area within the sports arena; create, based on the plurality of point clouds, a unified point cloud; mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texture the 3D model based on images captured by the plurality of depth cameras; and render the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 48. The system of claim 47, wherein each depth camera includes a light detection and ranging (LIDAR) scanner and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 49. The system of claim 48, wherein the system is further configured to:
dynamically track, by at least one ROI tracking module located in proximity to the filming area, instantaneous ROIs in the filming area; scan, by each LIDAR scanner, an area of each designated ROI; and create, based on the scanning, the point cloud for each designated ROI at a current video frame. 50. The system of claim of 47, wherein the distance from each depth camera to a respective far end of the filming area is at most 200 meters. | Methods and systems for generating free viewpoint videos (FVVs) based on images captured in a sports arena. A method includes projecting, onto objects within a filming area within the sports arena, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; creating, based on the plurality of point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to a viewpoint.1. A method for generating a free viewpoint video (FVV) based on images captured in a sports arena, comprising:
projecting, onto objects within a filming area within the sports arena, a predefined pattern including a large set of features; generating, based on signals captured by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the filming area; creating, based on the plurality of point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 2. The method of claim 1, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 3. The method of claim 2, wherein the pattern sensing cameras are black/white cameras with filters adapted to a spectral band of the projected pattern. 4. The method of claim 1, wherein the projection of the predefined pattern is performed by at least one projector. 5. The method of claim 4, wherein a distance at which each of the plurality of depth cameras can capture signals reflected off of the objects in the filming area is based on a light source utilized by the at least one projector. 6. The method of claim 5, wherein the light source is a light emitting diode (LED), wherein the distance from each depth camera to a respective far end of the filming area is at most 20 meters. 7. The method of claim 5, wherein the light source is an extended source. 8. The method of claim 5, wherein the light source is an eye safe laser having a spectral band of between 1.5 and 2 microns. 9. The method of claim 1, further comprising:
rendering the textured 3D model as a continuous sequence of viewpoints along a predetermined path. 10. The method of claim 9, further comprising:
producing instant replays from any viewpoint from the continuous sequence of viewpoints. 11. The method of claim 1, further comprising:
providing a live producing system allowing for switching during a live event to at least one selected viewpoint, wherein each viewpoint represents a virtual camera having at least a predetermined location and pose. 12. The method of claim 11, further comprising:
changing a sound based on a location of the at least one selected viewpoint. 13. The method of claim 11, further comprising:
automatically selecting the at least one viewpoint based on a trained AI model. 14. The method of claim 11, wherein the at least one selected viewpoint is determined based on at least one user input. 15. The method of claim 1, further comprising:
sending, in real-time during a sports event, the FVV to at least one recipient device. 16. The method of 1, further comprising:
compressing the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 17. The method of claim 1, further comprising:
dynamically calibrating the plurality of depth cameras to compensate for small perturbations. 18. The method of claim 1, wherein a number of depth cameras of the plurality of depth cameras is between 2 and 16. 19. The method of claim 1, further comprising:
detecting a skeleton in any of the plurality of point clouds and the images utilized for the texturing; and adjusting, based on the detected skeleton, the meshing of the points in the point cloud. 20. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 1. 21. A method for generating a free viewpoint video (FVV) based on images captured in a sports arena, comprising:
generating, based on scanning performed by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to a filming area within the sports arena; creating, based on the plurality of point clouds, a unified point cloud; meshing points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texturing the 3D model based on images captured by the plurality of depth cameras; and rendering the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 22. The method of claim 21, wherein each depth camera includes a light detection and ranging (LIDAR) scanner and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 23. The method of claim 22, further comprising:
dynamically tracking, by at least one ROI tracking module located in proximity to the filming area, instantaneous ROIs in the filming area; scanning, by each LIDAR scanner, an area of each designated ROI; and creating, based on the scanning, the point cloud for each designated ROI at a current video frame. 24. The method of claim of 21, wherein the distance from each depth camera to a respective far end of the filming area is at most 200 meters. 25. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute the method of claim 21. 26. A free viewpoint video (FVV) production system for sports events, comprising:
a plurality of depth cameras deployed in proximity to a filming area within a sports arena; and a FVV generator communicatively connected to the plurality of depth cameras; wherein each depth camera is configured to capture signals reflected off of objects within the filming area and an RGB image of the objects; and
wherein the FVV generator is configured to:
generate, based on reflected signals captured by each of the plurality of depth cameras, a point cloud for each depth camera,
create, based on the at least one point cloud, a unified point cloud,
mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects,
texture the 3D model based on images captured by the plurality of depth cameras, and
render the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 27. The FVV production system of claim 26, further comprising:
at least one projector configured to project a predefined pattern including a large set of features onto the objects within the filming area. 28. A system for rendering free viewpoint video (FVV) based on images captured in a sports arena, comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: cause projection, onto objects in a filming area within the sports arena, of a predefined pattern including a large set of features; generate, based on signals captured by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to the filming area, wherein the captured signals are reflected off of the objects within the sports arena; create, based on the plurality of point clouds, a unified point cloud; mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texture the 3D model based on images captured by the plurality of depth cameras; and render the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 29. The system of claim 28, wherein each depth camera comprises:
a pair of pattern sensing cameras for capturing the reflected signals and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 30. The system of claim 29, wherein the pattern sensing cameras are black/white cameras with filters adapted to a spectral band of the projected pattern. 31. The system of claim 28, wherein the projection of the predefined pattern is performed by at least one projector. 32. The system of claim 31, wherein a distance at which each of the plurality of depth cameras can capture signals reflected off of the objects in the filming area is based on a light source utilized by the at least one projector. 33. The system of claim 32, wherein the light source is a light emitting diode (LED), wherein the distance from each depth camera to a respective far end of the filming area is at most 20 meters. 34. The system of claim 32, wherein the light source is an extended source. 35. The system of claim 32, wherein the light source is an eye safe laser having a spectral band of between 1.5 and 2 microns. 36. The system of claim 28, wherein the system is further configured to:
render the textured 3D model as a continuous sequence of viewpoints along a predetermined path. 37. The system of claim 36, wherein the system is further configured to:
produce instant replays from any viewpoint from the continuous sequence of viewpoints. 38. The system of claim 28, wherein the system is further configured to:
provide a live producing system allowing for switching during a live event to at least one selected viewpoint, wherein each viewpoint represents a virtual camera having at least a predetermined location and pose. 39. The system of claim 38, wherein the system is further configured to:
change a sound based on a location of the at least one selected viewpoint. 40. The system of claim 38, wherein the system is further configured to:
automatically select the at least one viewpoint based on a trained AI model. 41. The system of claim 38, wherein the at least one selected viewpoint is determined based on at least one user input. 42. The system of claim 28, wherein the system is further configured to:
send, in real-time during a sports event, the FVV to at least one recipient device. 43. The system of 28, wherein the system is further configured to:
compress the FVV based on a compression ratio, wherein the compression ratio is high for areas of low interest, wherein the compression area is low for areas of high interest. 44. The system of claim 28, wherein the system is further configured to:
dynamically calibrate the plurality of depth cameras to compensate for small perturbations. 45. The system of claim 28, wherein a number of depth cameras of the plurality of depth cameras is between 2 and 16. 46. The system of claim 28, wherein the system is further configured to:
detect a skeleton in any of the plurality of point clouds and the images utilized for the texturing; and adjust, based on the detected skeleton, the meshing of the points in the point cloud. 47. A system for rendering free viewpoint video (FVV) based on images captured in a sports arena, comprising:
a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: generate, based on scanning performed by each of a plurality of depth cameras, a point cloud for each depth camera, wherein the plurality of depth cameras is deployed in proximity to a filming area within the sports arena; create, based on the plurality of point clouds, a unified point cloud; mesh points in the unified point cloud to generate a three-dimensional (3D) model of the objects; texture the 3D model based on images captured by the plurality of depth cameras; and render the textured 3D model as a FVV including a series of video frames with respect to a viewpoint. 48. The system of claim 47, wherein each depth camera includes a light detection and ranging (LIDAR) scanner and a red-green-blue (RGB) camera for capturing the images utilized for the texturing. 49. The system of claim 48, wherein the system is further configured to:
dynamically track, by at least one ROI tracking module located in proximity to the filming area, instantaneous ROIs in the filming area; scan, by each LIDAR scanner, an area of each designated ROI; and create, based on the scanning, the point cloud for each designated ROI at a current video frame. 50. The system of claim of 47, wherein the distance from each depth camera to a respective far end of the filming area is at most 200 meters. | 2,400 |
9,443 | 9,443 | 16,034,888 | 2,426 | A method of adjusting a bitrate of an image based includes: identifying magnitudes of one or more frequency components in the image; determining a frequency filter based on a difference between a current bitrate and a target bitrate of the image such that the greater is the difference between the current bitrate and the target bitrate, magnitudes of the more high frequency components are reduced by the frequency filter; and applying the determined frequency filter to the magnitudes of the one or more frequency components. | 1. A method of adjusting a bitrate of an image, the method comprising:
identifying magnitudes of one or more frequency components in the image; determining a frequency filter based on a difference between a current bitrate and a target bitrate of the image such that the greater is the difference between the current bitrate and the target bitrate, magnitudes of the more high frequency components are reduced by the frequency filter; and applying the determined frequency filter to the magnitudes of the one or more frequency components. 2. The method of claim 1, wherein the identifying the magnitudes of the one or more frequency components comprises:
performing a two-dimensional (2D) discrete cosine transformation (DCT) on the image; and arranging the magnitudes of the one or more frequency components on a 2D plane in a first direction and a second direction of the image. 3. The method of claim 2, wherein the frequency filter is configured to reduce magnitudes of frequency components other than magnitudes of frequency components existing between an origin point and a predetermined boundary line on the 2D plane, and
wherein the predetermined boundary line is a straight line extending in a direction different from the first direction and the second direction, and the first direction and the second direction are perpendicular to each other. 4. The method of claim 3, wherein the frequency filter comprises:
a first filter value corresponding to each of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane; and a second filter value corresponding to each of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane. 5. The method of claim 4, wherein the first filter value is 1 and the second filter value is 0. 6. The method of claim 4, wherein the applying the frequency filter to the magnitudes of the one or more frequency components comprises:
multiplying each of the magnitudes of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the first filter value; and multiplying each of the magnitudes of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the second filter value. 7. The method of claim 3, wherein the predetermined boundary line is perpendicular to a line bisecting an angle formed by the first direction and the second direction. 8. The method of claim 1, further comprising:
after the applying the frequency filter, generating an output image based on the magnitudes of the one or more frequency components to which the frequency filter is applied; and encoding the output image. 9. The method of claim 1, wherein the image comprises a plurality of image blocks,
wherein the identifying the magnitudes of the one or more frequency components comprises identifying magnitudes of one or more frequency components in each of at least one image block from among the plurality of image blocks, wherein the determining the frequency filter comprises determining a frequency filter corresponding to a difference between an output bitrate and a target bitrate of each image block, with respect to each of the at least one image block, and wherein the applying the frequency filter comprises applying the frequency filter, which is determined with respect to each of the at least one image block, to the magnitudes of the one or more frequency components in each image block. 10. An image capturing apparatus comprising at least one processor to implement a controller, and a memory,
wherein the controller is configured to identify magnitudes of one or more frequency components in an image input to the image capturing apparatus, determine a frequency based on a difference between a current bitrate and a target bitrate of the image such that the greater is the difference between the current bitrate and the target bitrate, magnitudes of the more high frequency components are reduced by the frequency filter, and apply the determined frequency filter to the magnitudes of the one or more frequency components. 11. The image capturing apparatus of claim 10, wherein the controller is configured to perform a two-dimensional (2D) discrete cosine transformation (DCT) on the image, and arrange the magnitudes of the one or more frequency components on a 2D plane in a first direction and a second direction of the image. 12. The image capturing apparatus of claim 11, wherein the frequency filter is configured to reduce magnitudes of frequency components other than magnitudes of frequency components existing between an origin point and a predetermined boundary line on the 2D plane,
wherein the predetermined boundary line is a straight line extending in a direction different from the first direction and the second direction, and the first direction and the second direction are perpendicular to each other. 13. The image capturing apparatus of claim 12, wherein the frequency filter comprises:
a first filter value corresponding to each of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane; and a second filter value corresponding to each of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane. 14. The image capturing apparatus of claim 13, wherein the first filter value is 1 and the second filter value is 0. 15. The image capturing apparatus of claim 13, wherein the controller is configured to multiply each of the magnitudes of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the first filter value, and multiply each of the magnitudes of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the second filter value. 16. The image capturing apparatus of claim 12, wherein the predetermined boundary line is perpendicular to a line bisecting an angle formed by the first direction and the second direction. 17. The image capturing apparatus of claim 10, wherein the controller is configured to generate an output image based on the magnitudes of the one or more frequency components, to which the frequency filter is applied, and encode the output image. 18. The image capturing apparatus of claim 10, wherein the image comprises a plurality of image blocks, and
wherein the controller is configured to identify magnitudes of one or more frequency components in each of at least one image block from among the plurality of image blocks, to determine a frequency filter corresponding to a difference between an output bitrate and a target bitrate of each image block, with respect to each of the at least one image block, and to apply the frequency filter, which is determined with respect to each of the at least one image block, to the magnitudes of the one or more frequency components in each image block. 19. An image capturing apparatus comprising at least one processor to implement a controller, and a memory,
wherein the controller is configured to selectively apply a frequency filter to an input image such that a portion of the input image where a magnitude of frequency components is changed by the frequency filter depending on a difference between a bitrate of the input image and a target bit rate of the input image for transmission by the image capturing apparatus. 20. The image capturing apparatus of claim 19, wherein the frequency filter is selected from a plurality of frequency filters such that the greater is the difference between the current bitrate and the target bitrate become, the greater is a size of the portion of the input image where the magnitude of the frequency components is reduced by the selected frequency filter. | A method of adjusting a bitrate of an image based includes: identifying magnitudes of one or more frequency components in the image; determining a frequency filter based on a difference between a current bitrate and a target bitrate of the image such that the greater is the difference between the current bitrate and the target bitrate, magnitudes of the more high frequency components are reduced by the frequency filter; and applying the determined frequency filter to the magnitudes of the one or more frequency components.1. A method of adjusting a bitrate of an image, the method comprising:
identifying magnitudes of one or more frequency components in the image; determining a frequency filter based on a difference between a current bitrate and a target bitrate of the image such that the greater is the difference between the current bitrate and the target bitrate, magnitudes of the more high frequency components are reduced by the frequency filter; and applying the determined frequency filter to the magnitudes of the one or more frequency components. 2. The method of claim 1, wherein the identifying the magnitudes of the one or more frequency components comprises:
performing a two-dimensional (2D) discrete cosine transformation (DCT) on the image; and arranging the magnitudes of the one or more frequency components on a 2D plane in a first direction and a second direction of the image. 3. The method of claim 2, wherein the frequency filter is configured to reduce magnitudes of frequency components other than magnitudes of frequency components existing between an origin point and a predetermined boundary line on the 2D plane, and
wherein the predetermined boundary line is a straight line extending in a direction different from the first direction and the second direction, and the first direction and the second direction are perpendicular to each other. 4. The method of claim 3, wherein the frequency filter comprises:
a first filter value corresponding to each of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane; and a second filter value corresponding to each of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane. 5. The method of claim 4, wherein the first filter value is 1 and the second filter value is 0. 6. The method of claim 4, wherein the applying the frequency filter to the magnitudes of the one or more frequency components comprises:
multiplying each of the magnitudes of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the first filter value; and multiplying each of the magnitudes of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the second filter value. 7. The method of claim 3, wherein the predetermined boundary line is perpendicular to a line bisecting an angle formed by the first direction and the second direction. 8. The method of claim 1, further comprising:
after the applying the frequency filter, generating an output image based on the magnitudes of the one or more frequency components to which the frequency filter is applied; and encoding the output image. 9. The method of claim 1, wherein the image comprises a plurality of image blocks,
wherein the identifying the magnitudes of the one or more frequency components comprises identifying magnitudes of one or more frequency components in each of at least one image block from among the plurality of image blocks, wherein the determining the frequency filter comprises determining a frequency filter corresponding to a difference between an output bitrate and a target bitrate of each image block, with respect to each of the at least one image block, and wherein the applying the frequency filter comprises applying the frequency filter, which is determined with respect to each of the at least one image block, to the magnitudes of the one or more frequency components in each image block. 10. An image capturing apparatus comprising at least one processor to implement a controller, and a memory,
wherein the controller is configured to identify magnitudes of one or more frequency components in an image input to the image capturing apparatus, determine a frequency based on a difference between a current bitrate and a target bitrate of the image such that the greater is the difference between the current bitrate and the target bitrate, magnitudes of the more high frequency components are reduced by the frequency filter, and apply the determined frequency filter to the magnitudes of the one or more frequency components. 11. The image capturing apparatus of claim 10, wherein the controller is configured to perform a two-dimensional (2D) discrete cosine transformation (DCT) on the image, and arrange the magnitudes of the one or more frequency components on a 2D plane in a first direction and a second direction of the image. 12. The image capturing apparatus of claim 11, wherein the frequency filter is configured to reduce magnitudes of frequency components other than magnitudes of frequency components existing between an origin point and a predetermined boundary line on the 2D plane,
wherein the predetermined boundary line is a straight line extending in a direction different from the first direction and the second direction, and the first direction and the second direction are perpendicular to each other. 13. The image capturing apparatus of claim 12, wherein the frequency filter comprises:
a first filter value corresponding to each of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane; and a second filter value corresponding to each of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane. 14. The image capturing apparatus of claim 13, wherein the first filter value is 1 and the second filter value is 0. 15. The image capturing apparatus of claim 13, wherein the controller is configured to multiply each of the magnitudes of the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the first filter value, and multiply each of the magnitudes of the frequency components other than the frequency components existing between the origin point and the predetermined boundary line on the 2D plane by the second filter value. 16. The image capturing apparatus of claim 12, wherein the predetermined boundary line is perpendicular to a line bisecting an angle formed by the first direction and the second direction. 17. The image capturing apparatus of claim 10, wherein the controller is configured to generate an output image based on the magnitudes of the one or more frequency components, to which the frequency filter is applied, and encode the output image. 18. The image capturing apparatus of claim 10, wherein the image comprises a plurality of image blocks, and
wherein the controller is configured to identify magnitudes of one or more frequency components in each of at least one image block from among the plurality of image blocks, to determine a frequency filter corresponding to a difference between an output bitrate and a target bitrate of each image block, with respect to each of the at least one image block, and to apply the frequency filter, which is determined with respect to each of the at least one image block, to the magnitudes of the one or more frequency components in each image block. 19. An image capturing apparatus comprising at least one processor to implement a controller, and a memory,
wherein the controller is configured to selectively apply a frequency filter to an input image such that a portion of the input image where a magnitude of frequency components is changed by the frequency filter depending on a difference between a bitrate of the input image and a target bit rate of the input image for transmission by the image capturing apparatus. 20. The image capturing apparatus of claim 19, wherein the frequency filter is selected from a plurality of frequency filters such that the greater is the difference between the current bitrate and the target bitrate become, the greater is a size of the portion of the input image where the magnitude of the frequency components is reduced by the selected frequency filter. | 2,400 |
9,444 | 9,444 | 16,248,304 | 2,462 | Techniques for migrating a plurality of communications services in a data communication network are disclosed. Aspects include accessing a migration map for the plurality of communications services in the data communication network; identifying a communications dependency between a first service and a second service in the plurality of communications services, wherein according to the migration map the first service is configured to migrate from a first route to a second route, the second service is configured to migrate from a third route to a fourth route, and the third route overlaps with the second route; determining, based on the identified communications dependency, a migration sequence for migrating the plurality of communications services in the data communication network; and migrating the plurality of communications services from a first plurality of configurations to a second plurality of configurations according to the migration sequence. | 1-55. (canceled) 56. A method for determining sets of service links for a plurality of service demands in a data communication network, comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold; wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands; calculating a cost associated with each of the plurality of connected components; determining sets of service demands based on the plurality of connected components and the calculated cost; and determining the sets of service links for the plurality of service demands based on the sets of service demands. 57. The method of claim 56, wherein the sets of service demands are determined by using a set cover algorithm. 58. The method of claim 57, wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm. 59. The method of claim 56, wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the sets of service demands. 60. A network management system for determining sets of service links for a plurality of service demands in a data communication network, the system comprising:
at least one processor; and a memory for storing instructions executable by the at least one processor; wherein the at least one processor is configured to: identify a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold; wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands; calculate a cost associated with each of the plurality of connected components; determine sets of service demands based on the plurality of connected components and the calculated cost; and determine the sets of service links for the plurality of service demands based on the sets of service demands. 61. The network management system of claim 60, wherein the sets of service demands are determined by using a set cover algorithm. 62. The network management system of claim 61, wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm. 63. The network management system of claim 60, wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the sets of service demands. 64. A non-transitory computer readable medium storing a set of instructions that is executable by at least one processor of a network management system to cause the network management system to perform a method for determining sets of service links for a plurality of service demands in a data communication network, the method comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold; wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands; calculating a cost associated with each of the plurality of connected components; determining sets of service demands based on the plurality of connected components and the calculated cost; and determining the sets of service links for the plurality of service demands based on the sets of service demands. 65. The non-transitory computer readable medium of claim 64, wherein the sets of service demands are determined by using a set cover algorithm. 66. The non-transitory computer readable medium of claim 65, wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm. 67. The non-transitory computer readable medium of claim 64, wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the sets of service demands. 68. A method for determining sets of service links for a plurality of service demands in a data communication network, comprising:
accessing a demand graph formed as a disjoint union of a plurality of complete graphs, each complete graph being formed by 5 vertices and a plurality of edges, wherein each of the plurality of edges corresponds to a different service demand, the plurality of service demands each being satisfied with a main path and a backup path, and a size threshold is 10; determining that each of a plurality of connected components is a set of all 10 edges of each of the complete graphs; determining that sets of the plurality of service demands are all sets of the plurality of service demands corresponding to the set of all 10 edges; determining a cost for each of the sets of the plurality of service demands to be 5; and determining the sets of service links for the plurality of service demands to be a set of 5 service links for each of the sets of the plurality of service demands. | Techniques for migrating a plurality of communications services in a data communication network are disclosed. Aspects include accessing a migration map for the plurality of communications services in the data communication network; identifying a communications dependency between a first service and a second service in the plurality of communications services, wherein according to the migration map the first service is configured to migrate from a first route to a second route, the second service is configured to migrate from a third route to a fourth route, and the third route overlaps with the second route; determining, based on the identified communications dependency, a migration sequence for migrating the plurality of communications services in the data communication network; and migrating the plurality of communications services from a first plurality of configurations to a second plurality of configurations according to the migration sequence.1-55. (canceled) 56. A method for determining sets of service links for a plurality of service demands in a data communication network, comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold; wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands; calculating a cost associated with each of the plurality of connected components; determining sets of service demands based on the plurality of connected components and the calculated cost; and determining the sets of service links for the plurality of service demands based on the sets of service demands. 57. The method of claim 56, wherein the sets of service demands are determined by using a set cover algorithm. 58. The method of claim 57, wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm. 59. The method of claim 56, wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the sets of service demands. 60. A network management system for determining sets of service links for a plurality of service demands in a data communication network, the system comprising:
at least one processor; and a memory for storing instructions executable by the at least one processor; wherein the at least one processor is configured to: identify a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold; wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands; calculate a cost associated with each of the plurality of connected components; determine sets of service demands based on the plurality of connected components and the calculated cost; and determine the sets of service links for the plurality of service demands based on the sets of service demands. 61. The network management system of claim 60, wherein the sets of service demands are determined by using a set cover algorithm. 62. The network management system of claim 61, wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm. 63. The network management system of claim 60, wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the sets of service demands. 64. A non-transitory computer readable medium storing a set of instructions that is executable by at least one processor of a network management system to cause the network management system to perform a method for determining sets of service links for a plurality of service demands in a data communication network, the method comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold; wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands; calculating a cost associated with each of the plurality of connected components; determining sets of service demands based on the plurality of connected components and the calculated cost; and determining the sets of service links for the plurality of service demands based on the sets of service demands. 65. The non-transitory computer readable medium of claim 64, wherein the sets of service demands are determined by using a set cover algorithm. 66. The non-transitory computer readable medium of claim 65, wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm. 67. The non-transitory computer readable medium of claim 64, wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the sets of service demands. 68. A method for determining sets of service links for a plurality of service demands in a data communication network, comprising:
accessing a demand graph formed as a disjoint union of a plurality of complete graphs, each complete graph being formed by 5 vertices and a plurality of edges, wherein each of the plurality of edges corresponds to a different service demand, the plurality of service demands each being satisfied with a main path and a backup path, and a size threshold is 10; determining that each of a plurality of connected components is a set of all 10 edges of each of the complete graphs; determining that sets of the plurality of service demands are all sets of the plurality of service demands corresponding to the set of all 10 edges; determining a cost for each of the sets of the plurality of service demands to be 5; and determining the sets of service links for the plurality of service demands to be a set of 5 service links for each of the sets of the plurality of service demands. | 2,400 |
9,445 | 9,445 | 16,501,863 | 2,433 | A system and/or a method based on a scalable requirement, active compliance and resource management for enhancing real-time and/or near real-time Cyber security, utilizing a learning (self-learning) computer integrated with (a) one or more learning/quantum learning/fuzzy/neuro-fuzzy logic algorithms in real-time or near real-time and/or (b) one or more software agents in real-time or near real-time and/or (c) encrypted data or a set of encrypted data blocks identified with a blockchain, further coupled with a (quantum computing resistant) public key/private cryptosystem and/or semantic web and/or hardware authentication is disclosed. | 1. A method of requirement, active compliance, active detection and resource management algorithm for cyber security utilizes: a learning computer system,
wherein the learning computer system comprises: a premise computer system, or a mobile computer system, or a cloud computer system, wherein the learning computer system further comprises: one or more hardware processors, or system on chips based on neural networks, in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores one or more software modules, including step-by-step instructions for the method of requirement, active compliance, active detection and resource management algorithm for cyber security, one or more learning algorithms, and/or quantum computing learning algorithms that are executable by the one or more hardware processors, or system on chips based on neural networks, wherein the one or more learning algorithms, and/or quantum computing learning algorithms are coupled with learning and/or adoption and/or data analysis in any cyber security risk in real-time or near real-time, wherein the method of requirement, active compliance, active detection and resource management algorithm comprises: steps (a) and (b), at least in an ordered manner or an ordered sequence,
(a) collection of encrypted data; and
(b) high-speed processing of the encrypted data;
wherein the high-speed processing of the encrypted data is coupled with a set of step-by-step instructions for analyzing Big Data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for analyzing contextual data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for deep learning algorithm,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for prescriptive analysis to extract wisdom or knowledge from a large set of data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for enhancing immunity of a network, or the internet,
wherein the method of requirement, active compliance, active detection and resource management algorithm is coupled with an algorithm for scanning the network, or the internet in real-time to detect any risk of cyber security. 2. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a remote browser to reduce any risk of cyber security. 3. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 2, wherein the remote browser is further coupled with a physical un-clonable function device (PUFD) to reduce any risk of cyber security, wherein the physical un-clonable function device (PUFD) comprises one or more memristors. 4. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a semantic web to reduce any risk of cyber security. 5. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a blockchain to reduce any risk of cyber security. 6. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with hardware authentication to reduce any risk of cyber security. 7. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a quantum computing resistant cryptosystem. 8. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, further comprising: a neuro-fuzzy logic algorithm or a set of step-by-step instructions to account for inexactness of data analysis. 9. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a set of step-by-step instructions for a continuous risk, or trust assessment of cyber security. 10. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a set of step-by-step instructions for identifying a risk, when the requirement of cyber security changes. 11. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with one more software agents, wherein the one software agent is coupled with the learning computer system. 12. A method of requirement, active compliance, active detection and resource management algorithm for cyber security utilizes: a learning computer system,
wherein the learning computer system comprises: a premise computer system, or a mobile computer system, or a cloud computer system, wherein the learning computer system further comprises: one or more hardware processors, or system on chips based on neural networks, in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores one or more software modules, including step-by-step instructions for the method of requirement, active compliance, active detection and resource management algorithm for cyber security, one or more learning algorithms, and/or quantum computing learning algorithms, and/or one or more software agents, that are executable by the one or more hardware processors, or system on chips based on neural networks, wherein the one or more learning algorithms, and/or quantum computing learning algorithms are coupled with learning and/or adoption and/or data analysis in any cyber security risk in real-time or near real-time, wherein the one software agent is coupled with the learning computer, wherein the one or more software agents are coupled to search the Internet for cyber security risk in real-time or near real-time, wherein the method of requirement, active compliance, active detection and resource management algorithm comprises: steps (a) and (b), at least in an ordered manner or an ordered sequence,
(a) collection of encrypted data; and
wherein the encrypted data is coupled with a blockchain,
(b) high-speed processing of the encrypted data;
wherein the high-speed processing of the encrypted data is coupled with a set of step-by-step instructions for analyzing Big Data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for analyzing contextual data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for deep learning algorithm,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for prescriptive analysis to extract wisdom or knowledge from a large set of data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for enhancing immunity of a network, or the internet,
wherein the method of requirement, active compliance, active detection and resource management algorithm is coupled with an algorithm for scanning the network, or the internet in real-time to detect any risk of cyber security. 13. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a remote browser to reduce any risk of cyber security. 14. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 13, wherein the remote browser is further coupled with a physical un-clonable function device (PUFD) to reduce any risk of cyber security, wherein the physical un-clonable function device (PUFD) comprises one or more memristors. 15. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a semantic web to reduce any risk of cyber security. 16. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with hardware authentication to reduce any risk of cyber security. 17. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a quantum computing resistant cryptosystem. 18. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, further comprising: a neuro-fuzzy logic algorithm or a set of step-by-step instructions to account for inexactness of data analysis. 19. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a set of step-by-step instructions for a continuous risk, or trust assessment of cyber security. 20. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a set of step-by-step instructions for identifying a risk, when the requirement of cyber security changes. 21. A method of requirement, active compliance, active detection and resource management algorithm for cyber security utilizes: a learning computer system,
wherein the learning computer system comprises: a premise computer system, or a mobile computer system, or a cloud computer system, wherein the learning computer system further comprises: one or more hardware processors, or system on chips based on neural networks, in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores one or more software modules, including step-by-step instructions for the method of requirement, active compliance, active detection and resource management algorithm for cyber security, one or more learning algorithms, and/or quantum computing learning algorithms, and/or one or more software agents, that are executable by the one or more hardware processors, or system on chips based on neural networks, wherein the one or more learning algorithms, and/or quantum computing learning algorithms are coupled with learning and/or adoption and/or data analysis in any cyber security risk in real-time or near real-time, wherein the one software agent is coupled with the learning computer, wherein the one or more software agents are coupled to search the Internet for cyber security risk in real-time or near real-time, wherein the method of requirement, active compliance, active detection and resource management algorithm comprises: steps (a) and (b), at least in an ordered manner or an ordered sequence,
(a) collection of encrypted data; and
wherein the encrypted data is coupled with a blockchain,
(b) high-speed processing of the encrypted data;
wherein the high-speed processing of the encrypted data is coupled with a set of step-by-step instructions for analyzing Big Data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for analyzing contextual data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for deep learning algorithm,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for prescriptive analysis to extract wisdom or knowledge from a large set of data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for enhancing immunity of a network, or the internet,
wherein the method of requirement, active compliance, active detection and resource management algorithm is coupled with an algorithm for scanning the network, or the internet in real-time to detect any risk of cyber security, wherein the method of requirement, active compliance, active detection and resource management algorithm is further coupled with a semantic web to reduce any risk of cyber security. | A system and/or a method based on a scalable requirement, active compliance and resource management for enhancing real-time and/or near real-time Cyber security, utilizing a learning (self-learning) computer integrated with (a) one or more learning/quantum learning/fuzzy/neuro-fuzzy logic algorithms in real-time or near real-time and/or (b) one or more software agents in real-time or near real-time and/or (c) encrypted data or a set of encrypted data blocks identified with a blockchain, further coupled with a (quantum computing resistant) public key/private cryptosystem and/or semantic web and/or hardware authentication is disclosed.1. A method of requirement, active compliance, active detection and resource management algorithm for cyber security utilizes: a learning computer system,
wherein the learning computer system comprises: a premise computer system, or a mobile computer system, or a cloud computer system, wherein the learning computer system further comprises: one or more hardware processors, or system on chips based on neural networks, in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores one or more software modules, including step-by-step instructions for the method of requirement, active compliance, active detection and resource management algorithm for cyber security, one or more learning algorithms, and/or quantum computing learning algorithms that are executable by the one or more hardware processors, or system on chips based on neural networks, wherein the one or more learning algorithms, and/or quantum computing learning algorithms are coupled with learning and/or adoption and/or data analysis in any cyber security risk in real-time or near real-time, wherein the method of requirement, active compliance, active detection and resource management algorithm comprises: steps (a) and (b), at least in an ordered manner or an ordered sequence,
(a) collection of encrypted data; and
(b) high-speed processing of the encrypted data;
wherein the high-speed processing of the encrypted data is coupled with a set of step-by-step instructions for analyzing Big Data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for analyzing contextual data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for deep learning algorithm,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for prescriptive analysis to extract wisdom or knowledge from a large set of data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for enhancing immunity of a network, or the internet,
wherein the method of requirement, active compliance, active detection and resource management algorithm is coupled with an algorithm for scanning the network, or the internet in real-time to detect any risk of cyber security. 2. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a remote browser to reduce any risk of cyber security. 3. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 2, wherein the remote browser is further coupled with a physical un-clonable function device (PUFD) to reduce any risk of cyber security, wherein the physical un-clonable function device (PUFD) comprises one or more memristors. 4. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a semantic web to reduce any risk of cyber security. 5. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a blockchain to reduce any risk of cyber security. 6. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with hardware authentication to reduce any risk of cyber security. 7. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a quantum computing resistant cryptosystem. 8. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, further comprising: a neuro-fuzzy logic algorithm or a set of step-by-step instructions to account for inexactness of data analysis. 9. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a set of step-by-step instructions for a continuous risk, or trust assessment of cyber security. 10. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with a set of step-by-step instructions for identifying a risk, when the requirement of cyber security changes. 11. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 1, is further coupled with one more software agents, wherein the one software agent is coupled with the learning computer system. 12. A method of requirement, active compliance, active detection and resource management algorithm for cyber security utilizes: a learning computer system,
wherein the learning computer system comprises: a premise computer system, or a mobile computer system, or a cloud computer system, wherein the learning computer system further comprises: one or more hardware processors, or system on chips based on neural networks, in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores one or more software modules, including step-by-step instructions for the method of requirement, active compliance, active detection and resource management algorithm for cyber security, one or more learning algorithms, and/or quantum computing learning algorithms, and/or one or more software agents, that are executable by the one or more hardware processors, or system on chips based on neural networks, wherein the one or more learning algorithms, and/or quantum computing learning algorithms are coupled with learning and/or adoption and/or data analysis in any cyber security risk in real-time or near real-time, wherein the one software agent is coupled with the learning computer, wherein the one or more software agents are coupled to search the Internet for cyber security risk in real-time or near real-time, wherein the method of requirement, active compliance, active detection and resource management algorithm comprises: steps (a) and (b), at least in an ordered manner or an ordered sequence,
(a) collection of encrypted data; and
wherein the encrypted data is coupled with a blockchain,
(b) high-speed processing of the encrypted data;
wherein the high-speed processing of the encrypted data is coupled with a set of step-by-step instructions for analyzing Big Data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for analyzing contextual data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for deep learning algorithm,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for prescriptive analysis to extract wisdom or knowledge from a large set of data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for enhancing immunity of a network, or the internet,
wherein the method of requirement, active compliance, active detection and resource management algorithm is coupled with an algorithm for scanning the network, or the internet in real-time to detect any risk of cyber security. 13. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a remote browser to reduce any risk of cyber security. 14. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 13, wherein the remote browser is further coupled with a physical un-clonable function device (PUFD) to reduce any risk of cyber security, wherein the physical un-clonable function device (PUFD) comprises one or more memristors. 15. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a semantic web to reduce any risk of cyber security. 16. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with hardware authentication to reduce any risk of cyber security. 17. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a quantum computing resistant cryptosystem. 18. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, further comprising: a neuro-fuzzy logic algorithm or a set of step-by-step instructions to account for inexactness of data analysis. 19. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a set of step-by-step instructions for a continuous risk, or trust assessment of cyber security. 20. The method of requirement, active compliance, active detection and resource management algorithm for cyber security in claim 12, is further coupled with a set of step-by-step instructions for identifying a risk, when the requirement of cyber security changes. 21. A method of requirement, active compliance, active detection and resource management algorithm for cyber security utilizes: a learning computer system,
wherein the learning computer system comprises: a premise computer system, or a mobile computer system, or a cloud computer system, wherein the learning computer system further comprises: one or more hardware processors, or system on chips based on neural networks, in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium stores one or more software modules, including step-by-step instructions for the method of requirement, active compliance, active detection and resource management algorithm for cyber security, one or more learning algorithms, and/or quantum computing learning algorithms, and/or one or more software agents, that are executable by the one or more hardware processors, or system on chips based on neural networks, wherein the one or more learning algorithms, and/or quantum computing learning algorithms are coupled with learning and/or adoption and/or data analysis in any cyber security risk in real-time or near real-time, wherein the one software agent is coupled with the learning computer, wherein the one or more software agents are coupled to search the Internet for cyber security risk in real-time or near real-time, wherein the method of requirement, active compliance, active detection and resource management algorithm comprises: steps (a) and (b), at least in an ordered manner or an ordered sequence,
(a) collection of encrypted data; and
wherein the encrypted data is coupled with a blockchain,
(b) high-speed processing of the encrypted data;
wherein the high-speed processing of the encrypted data is coupled with a set of step-by-step instructions for analyzing Big Data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for analyzing contextual data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for deep learning algorithm,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for prescriptive analysis to extract wisdom or knowledge from a large set of data,
wherein the high-speed processing of the encrypted data is further coupled with a set of step-by-step instructions for enhancing immunity of a network, or the internet,
wherein the method of requirement, active compliance, active detection and resource management algorithm is coupled with an algorithm for scanning the network, or the internet in real-time to detect any risk of cyber security, wherein the method of requirement, active compliance, active detection and resource management algorithm is further coupled with a semantic web to reduce any risk of cyber security. | 2,400 |
9,446 | 9,446 | 13,391,509 | 2,483 | The present disclosure relates to a method and apparatus for improving the encoding efficiency by adaptively changing the resolution of the motion vector in the inter prediction encoding and inter prediction decoding of a video. The video encoding/decoding apparatus includes: a video encoder for determining a motion vector resolution of each area or motion vector of a video and performing an inter prediction encoding of the video by using a motion vector according to the motion vector resolution determined for each area or motion vector; and a video decoder for reconstructing a resolution by extracting resolution information from a bitstream, and then performing an inter prediction decoding by using a motion vector according to the motion vector resolution of each reconstructed area or motion vector. | 1. A video encoding/decoding apparatus comprising:
a video encoder for determining a motion vector resolution of each area or motion vector of a video and performing an inter prediction encoding of the video by using a motion vector according to the motion vector resolution determined for each area or motion vector; and a video decoder for reconstructing a resolution by extracting resolution information from a bitstream, and then performing an inter prediction decoding by using a motion vector according to the motion vector resolution of each reconstructed area or motion vector. 2. A video encoding apparatus comprising:
a resolution determiner for determining a motion vector resolution of each area or motion vector; and an inter prediction encoder for performing an inter prediction encoding by using a motion vector according to the motion vector resolution determined for each area or motion vector. 3. The video encoding apparatus of claim 2, further comprising a resolution change flag generator for generating a resolution change flag, which indicates whether a motion vector resolution is determined for each motion vector or each area of a video. 4. The video encoding apparatus of claim 2, further comprising a resolution encoder for encoding a resolution identification flag indicating a motion vector resolution determined for each motion vector or each area of a video. 5. The video encoding apparatus of claim 2, further comprising a differential vector encoder for encoding a differential motion vector corresponding to a difference between a predicted motion vector and a motion vector according to the motion vector resolution determined for each motion vector or area, wherein the differential vector encoder differently encodes the differential motion vector according to the differential motion vector resolution. 6. The video encoding apparatus of claim 4, wherein the resolution identification flag corresponds to one or more combinations of a resolution of a motion vector and a resolution of a differential motion vector. 7. The video encoding apparatus of claim 5, wherein, when the differential vector encoder encodes the differential motion vector, the differential vector encoder determines a reference resolution, converts a motion vector having a resolution, which is not a reference resolution, to a motion vector having a reference resolution, and calculates the differential motion vector by using a reference predicted motion vector obtained from a reference motion vector of surrounding blocks. 8. The video encoding apparatus of claim 5, wherein, when the reference resolution and the resolution of the motion vector are different from each other, the differential vector encoder additionally encodes a reference resolution flag. 9. The video encoding apparatus of claim 2, further comprising a resolution appointment flag generator for generating a resolution appointment flag appointing a different resolution set according to area or motion vector of a video. 10. The video encoding apparatus of claim 2, wherein, when it is available to obtain the resolution of the current block by using a reference picture index, the resolution determiner encodes information on the resolution by encoding the reference picture index without generating a resolution identification flag. 11. The video encoding apparatus of claim 9, wherein, when using multiple reference pictures, the resolution appointment flag generator sets the resolution set to be different according to reference picture based on a predetermined criterion without encoding the resolution identification flag. 12. The video encoding apparatus of claim 11, wherein the predetermined criterion comprises one of a distance between a reference picture and a current picture, an error value between resolutions measured by an error measurement means, and a table including resolution sets corresponding to reference pictures. 13. The video encoding apparatus of claim 11, wherein the resolution appointment flag generator sets different resolution sets for a picture to be used as a reference picture and a picture not to be used as a reference picture, respectively. 14. The video encoding apparatus of claim 2, further comprising a resolution conversion flag generator for generating a resolution conversion flag, which indicates a change between a resolution of an area to be currently encoded and a resolution of surrounding areas or a resolution of a previous block. 15. A video decoding apparatus comprising:
a resolution change flag extractor for extracting a resolution change flag from a bitstream; a resolution decoder for extracting an encoded resolution identification flag from the bitstream according to the extracted resolution change flag and decoding the extracted resolution identification flag, so as to reconstruct a motion vector resolution of each area or motion vector; and an inter prediction decoder for performing an inter prediction decoding by using a motion vector according to the reconstructed motion vector resolution of each area or motion vector. 16. The video decoding apparatus of claim 15, further comprising a differential vector decoder for reconstructing a differential motion vector of each area by extracting an encoded differential motion vector from the bitstream and decoding the extracted differential motion vector, wherein the inter prediction decoder predicts a predicted motion vector of each area and reconstructs a motion vector of each area by using the predicted motion vector and the reconstructed differential motion vector. 17. A video decoding apparatus comprising:
a resolution decoder for reconstructing a resolution of each area or motion vector by using information received through a bitstream; and an inter prediction decoder for performing an inter prediction decoding by using a motion vector according to the reconstructed resolution of each area or motion vector. 18. The video decoding apparatus of claim 17, further comprising a resolution appointment flag extractor for extracting a resolution appointment flag from the bitstream,
wherein the resolution decoder decodes the resolution according to the extracted resolution appointment flag. 19. The video decoding apparatus of claim 18, wherein the resolution appointment flag corresponds to a flag indicating that it is fixed to a single resolution or a resolution set including multiple resolutions. 20. The video decoding apparatus of claim 18, wherein, when using multiple reference pictures, the resolution appointment flag extractor establishes different resolution sets according to reference pictures based on a predetermined criterion, respectively. 21. The video decoding apparatus of claim 20, wherein the predetermined criterion comprises one of a distance between a reference picture and a current picture, an error value between resolutions measured by an error measurement means, and a table including resolution sets corresponding to reference pictures. 22. The video decoding apparatus of claim 18, wherein the resolution decoder calculates a resolution set for a reference picture index. 23. The video decoding apparatus of claim 17, further comprising a resolution conversion flag extractor for extracting a resolution conversion flag and then extracting a resolution identification flag according to a value of the resolution conversion flag. 24. The video decoding apparatus of claim 23, wherein the resolution decoder extracts a resolution identification flag according to a resolution kind of the resolution conversion flag decoded after being extracted from a header of the bitstream, and the differential vector decoder extracts a value of a differential motion vector corresponding to a pertinent resolution by referring to a code number extracted from a code number table by using the extracted resolution identification flag. 25. A method for encoding/decoding a video, the method comprising:
encoding a video by determining a motion vector resolution of each area or motion vector of a video and then performing an inter prediction encoding of the video by using a motion vector according to the motion vector resolution determined for each area or motion vector; and decoding a video by reconstructing a resolution by extracting resolution information from a bitstream and then performing an inter prediction decoding by using a motion vector according to the motion vector resolution of each reconstructed area or motion vector. 26. A method for encoding a video, the method comprising:
determining a motion vector resolution of each area or motion vector; and performing an inter prediction encoding by using a motion vector according to the motion vector resolution determined for each area or motion vector. 27. The method of claim 26, wherein the motion vector resolution has different values for an x component and a y component of a motion vector. 28. The method of claim 26, further comprising generating a resolution change flag, which indicates whether a motion vector resolution is determined for each motion vector or each area of a video. 29. The method of claim 26, further comprising encoding the motion vector resolution determined for each area or motion vector. 30. The method of claim 29, wherein the step of encoding the motion vector resolution comprises hierarchically encoding motion vector resolutions determined for respective areas or motion vectors in a Quadtree structure by grouping areas having an equal motion vector resolution together. 31. The method of claim 30, wherein the step of encoding the motion vector resolution comprises encoding an identifier, which indicates a maximum number of Quadtree layers and a size of an area indicated by a lowest node of the Quadtree layers. 32. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector by using a motion vector resolution predicted using motion vector resolutions of surrounding areas of each area. 33. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector by using a run and length. 34. The method of claim 29, wherein the step of encoding the motion vector resolution comprises hierarchically encoding motion vector resolutions determined for respective areas or motion vectors by using a tag tree. 35. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector while changing a number of bits allocated to the motion vector resolution according to a frequency of the motion vector resolution. 36. The method of claim 29, wherein the step of encoding the motion vector resolution comprises:
determining whether a video decoding apparatus can estimate the motion vector resolution determined for each area or motion vector according to a pre-promised estimation scheme; and encoding an identifier indicating a capability of estimation for an area having a motion vector resolution that can be estimated and encoding an identifier indicating an incapability of estimation for an area having a motion vector resolution that cannot be estimated. 37. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector by allocating different numbers of bits according to a distribution of motion vector resolutions of surrounding areas of each area. 38. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector, through an arithmetic encoding, by using different methods of generating a bit string according to a distribution of motion vector resolutions of surrounding areas of each area. 39. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector, through an arithmetic encoding, by using different context models according to a distribution of motion vector resolutions of surrounding areas and occurrence probabilities of the motion vector resolution, and performing a context model update. 40. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector only when each component of the differential motion vector is not “0”. 41. The method of claim 26, wherein the step of determining the motion vector resolution comprises, when a size of a predicted motion vector or differential motion vector of a motion vector according to the motion vector resolution determined for each area or motion vector is larger than a threshold, determining a predetermined value as the motion vector resolution determined for each area or motion vector. 42. The method of claim 26, further comprising encoding a differential motion vector corresponding to a difference between a predicted motion vector and a motion vector according to the motion vector resolution determined for each area or motion vector, wherein the differential motion vector may be differently encoded according to the motion vector resolution. 43. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the differential vector is encoded by using a Universal Variable Length Coding (UVLC) scheme, encoding the differential motion vector by using a K-th order Exp-Golomb code, wherein a degree (K) of order of the Exp-Golomb code changes according to the motion vector resolution determined for each area. 44. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the differential vector is encoded by using a text-based binary arithmetic coding scheme, decoding the differential motion vector by using a Concatenated Truncated Unary/K-th Order Exp-Golomb Code while changing a degree (K) of order and a maximum value (T) of the Concatenated Truncated Unary/K-th Order Exp-Golomb Code according to the motion vector resolution of each area or motion vector. 45. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the differential vector is encoded by using a text-based binary arithmetic coding, decoding the differential motion vector by obtaining different accumulation probabilities according to the motion vector resolution of each area or motion vector. 46. The method of claim 42, wherein the step of encoding the differential motion vector comprises predicting a predicted motion vector for a motion vector of each area by using motion vectors of surrounding areas of each area, wherein, when motion vector resolutions of surrounding areas are not equal to the motion vector resolution of each area, the predicted motion vector is predicted after the motion vector resolutions of the surrounding areas are converted to the motion vector resolution of said each area. 47. The method of claim 46, wherein the step of encoding the differential motion vector comprises, when at least one area corresponds to a block and a block mode of the block is a skip mode, converting a motion vector resolution of an area of a motion vector to be predicted to a highest resolution among the motion vector resolutions of the surrounding areas and then predicting the predicted motion vector. 48. The method of claim 26, wherein the step of performing the inter prediction encoding comprises:
determining an optimum filter coefficient having minimum errors between a current picture and a reference picture for each motion vector resolution; performing the inter prediction encoding by using an interpolation filter having the determined filter coefficient and by using different reference pictures according to the motion vector resolutions; and encoding the determined filter coefficient. 49. The method of claim 42, wherein the step of encoding the differential motion vector comprises:
determining a reference resolution; converting a motion vector having a resolution other than a reference resolution to a motion vector having a reference resolution; and calculating the differential motion vector by using a reference predicted motion vector obtained from a reference motion vector of surrounding blocks. 50. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the reference resolution and the resolution of the motion vector are different from each other, additionally encoding a reference resolution flag. 51. The method of claim 26, further comprising generating a resolution appointment flag differently appointing a resolution set according to each area or motion vector of a video. 52. The method of claim 26, wherein the step of determining the motion vector resolution comprises, when it is possible to obtain a resolution of a current block by using a reference picture index, encoding information on the resolution by encoding a reference picture index without generating a resolution identification flag. 53. The method of claim 51, wherein the step of generating the resolution appointment flag comprises, when multiple reference pictures are used, establishing different resolution sets according to reference pictures based on a predetermined criterion without encoding the resolution identification flag. 54. The method of claim 53, wherein the predetermined criterion comprises one of a distance between a reference picture and a current picture, an error value between resolutions measured by an error measurement means, and a table including resolution sets corresponding to reference pictures. 55. The method of claim 53, wherein the step of generating the resolution appointment flag comprises establishing different resolution sets for a picture to be used as a reference picture and a picture not to be used as a reference picture, respectively. 56. The method of claim 26, further comprising generating a resolution conversion flag, which indicates a change between a resolution of an area to be currently encoded and a resolution of surrounding areas or a resolution of a previous block. 57. A method for decoding a video, the method comprising:
extracting a resolution change flag from a bitstream; reconstructing a motion vector resolution of each area or motion vector by extracting an encoded resolution identification flag from the bitstream according to the extracted resolution change flag and decoding the extracted resolution identification flag; and performing an inter prediction decoding by using a motion vector according to the reconstructed motion vector resolution of each area or motion vector. 58. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing motion vector resolutions of respective areas or motion vectors by decoding the motion vector resolutions hierarchically encoded in a Quadtree structure by grouping areas having an equal motion vector resolution together. 59. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises decoding an identifier, which indicates a maximum number of Quadtree layers and a size of an area indicated by a lowest node of the Quadtree layers. 60. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding the encoded resolution identification flag by using a motion vector resolution predicted using motion vector resolutions of surrounding areas of each area or motion vector. 61. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding a resolution identification flag in which a run and length of the motion vector resolution of each area or motion vector have been encoded. 62. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding a resolution identification flag in which motion vector resolutions of respective areas or motion vectors hierarchically encoded by using a tag tree. 63. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding the motion vector resolution while changing a number of bits allocated to the motion vector resolution according to a frequency of the motion vector resolution. 64. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises estimating a motion vector resolution according to a pre-promised estimation scheme and reconstructing the estimated motion vector resolution as a motion vector resolution of a pertinent area when the resolution identification flag decoded for each area or motion vector is a flag indicating a capability of estimation, and reconstructing the motion vector resolution indicated by the decoded resolution identification flag as the motion vector resolution of the pertinent area when the resolution identification flag decoded for each area or motion vector is a flag indicating an incapability of estimation. 65. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the motion vector resolution of each area or motion vector only when each component of the differential motion vector is not “0”. 66. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the resolution identification flag by allocating different numbers of bits according to a distribution of motion vector resolutions of surrounding areas of each area. 67. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the resolution identification flag by using different methods of generating a bit string according to a distribution of motion vector resolutions of surrounding areas of each area. 68. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the resolution identification flag by using an arithmetic encoding scheme and by using different context models according to occurrence probabilities of the motion vector resolution and a distribution of motion vector resolutions of surrounding areas. 69. The method of claim 57, further comprising reconstructing a filter coefficient of each motion vector resolution by extracting an encoded filter coefficient of each motion vector resolution from the bitstream and decoding the extracted filter coefficient,
wherein the step of performing the inter prediction decoding comprises: interpolating a reference picture by using the reconstructed filter coefficient of each motion vector resolution; and performing an inter prediction encoding by using another reference picture of each motion vector resolution. 70. The method of claim 57, further comprising reconstructing a differential motion vector of each area by extracting an encoded differential motion vector from the bitstream and decoding the extracted differential motion vector,
wherein the step of performing the inter prediction decoding comprises: predicting a predicted motion vector of each area; and reconstructing a motion vector of each area by using the predicted motion vector and the reconstructed differential motion vector. 71. The method of claim 70, wherein the step of reconstructing the differential motion vector comprises decoding the differential motion vector by using a Universal Variable Length Coding (UVLC) scheme and by using a K-th order Exp-Golomb code, wherein a degree (K) of order of the Exp-Golomb code changes according to the motion vector resolution of each reconstructed area or motion vector. 72. The method of claim 71, wherein the step of reconstructing the differential motion vector comprises decoding the differential motion vector by using a text-based binary arithmetic coding scheme and by using a Concatenated Truncated Unary/K-th Order Exp-Golomb Code while changing a degree (K) of order and a maximum value (T) of the Concatenated Truncated Unary/K-th Order Exp-Golomb Code according to the motion vector resolution of each reconstructed area or motion vector. 73. The method of claim 70, wherein the step of reconstructing the differential motion vector comprises decoding the differential motion vector by using a text-based binary arithmetic coding scheme and by obtaining different accumulation probabilities according to the motion vector resolution of each reconstructed area or motion vector. 74. The method of claim 70, wherein the step of predicting the predicted motion vector comprises predicting a predicted motion vector for a motion vector of each area by using motion vectors of surrounding areas of each area, wherein, when motion vector resolutions of surrounding areas are not equal to the motion vector resolution of each area, the predicted motion vector is predicted after the motion vector resolutions of the surrounding areas are converted to the motion vector resolution of said each area. 75. The method of claim 74, wherein the step of predicting the predicted motion vector comprises, when at least one area corresponds to a block and a block mode of the block is a skip mode, converting a motion vector resolution of an area of a motion vector to be predicted to a highest resolution among the motion vector resolutions of the surrounding areas and then predicting the predicted motion vector. 76. A method for decoding a video, the method comprising:
reconstructing a resolution of each area or motion vector by using information received through a bitstream; and performing an inter prediction decoding by using a motion vector according to the reconstructed resolution of each area. 77. The method of claim 76, further comprising extracting a resolution appointment flag from the bitstream,
wherein reconstructing of the resolution comprises reconstructing the resolution according to the extracted resolution appointment flag. 78. The method of claim 77, wherein the step of extracting the resolution appointment flag comprises, when multiple reference pictures are used, establishing different resolution sets according to reference pictures based on a predetermined criterion, respectively. 79. The method of claim 76, further comprising:
extracting a resolution conversion flag; and extracting a resolution identification flag according to a value of the resolution conversion flag. 80. The method of claim 79, wherein reconstructing of the resolution comprises:
extracting a resolution identification flag according to a resolution kind of the resolution conversion flag decoded after being extracted from a header of the bitstream; and extracting a value of a differential motion vector corresponding to a pertinent resolution by referring to a code number extracted from a code number table by using the extracted resolution identification flag. | The present disclosure relates to a method and apparatus for improving the encoding efficiency by adaptively changing the resolution of the motion vector in the inter prediction encoding and inter prediction decoding of a video. The video encoding/decoding apparatus includes: a video encoder for determining a motion vector resolution of each area or motion vector of a video and performing an inter prediction encoding of the video by using a motion vector according to the motion vector resolution determined for each area or motion vector; and a video decoder for reconstructing a resolution by extracting resolution information from a bitstream, and then performing an inter prediction decoding by using a motion vector according to the motion vector resolution of each reconstructed area or motion vector.1. A video encoding/decoding apparatus comprising:
a video encoder for determining a motion vector resolution of each area or motion vector of a video and performing an inter prediction encoding of the video by using a motion vector according to the motion vector resolution determined for each area or motion vector; and a video decoder for reconstructing a resolution by extracting resolution information from a bitstream, and then performing an inter prediction decoding by using a motion vector according to the motion vector resolution of each reconstructed area or motion vector. 2. A video encoding apparatus comprising:
a resolution determiner for determining a motion vector resolution of each area or motion vector; and an inter prediction encoder for performing an inter prediction encoding by using a motion vector according to the motion vector resolution determined for each area or motion vector. 3. The video encoding apparatus of claim 2, further comprising a resolution change flag generator for generating a resolution change flag, which indicates whether a motion vector resolution is determined for each motion vector or each area of a video. 4. The video encoding apparatus of claim 2, further comprising a resolution encoder for encoding a resolution identification flag indicating a motion vector resolution determined for each motion vector or each area of a video. 5. The video encoding apparatus of claim 2, further comprising a differential vector encoder for encoding a differential motion vector corresponding to a difference between a predicted motion vector and a motion vector according to the motion vector resolution determined for each motion vector or area, wherein the differential vector encoder differently encodes the differential motion vector according to the differential motion vector resolution. 6. The video encoding apparatus of claim 4, wherein the resolution identification flag corresponds to one or more combinations of a resolution of a motion vector and a resolution of a differential motion vector. 7. The video encoding apparatus of claim 5, wherein, when the differential vector encoder encodes the differential motion vector, the differential vector encoder determines a reference resolution, converts a motion vector having a resolution, which is not a reference resolution, to a motion vector having a reference resolution, and calculates the differential motion vector by using a reference predicted motion vector obtained from a reference motion vector of surrounding blocks. 8. The video encoding apparatus of claim 5, wherein, when the reference resolution and the resolution of the motion vector are different from each other, the differential vector encoder additionally encodes a reference resolution flag. 9. The video encoding apparatus of claim 2, further comprising a resolution appointment flag generator for generating a resolution appointment flag appointing a different resolution set according to area or motion vector of a video. 10. The video encoding apparatus of claim 2, wherein, when it is available to obtain the resolution of the current block by using a reference picture index, the resolution determiner encodes information on the resolution by encoding the reference picture index without generating a resolution identification flag. 11. The video encoding apparatus of claim 9, wherein, when using multiple reference pictures, the resolution appointment flag generator sets the resolution set to be different according to reference picture based on a predetermined criterion without encoding the resolution identification flag. 12. The video encoding apparatus of claim 11, wherein the predetermined criterion comprises one of a distance between a reference picture and a current picture, an error value between resolutions measured by an error measurement means, and a table including resolution sets corresponding to reference pictures. 13. The video encoding apparatus of claim 11, wherein the resolution appointment flag generator sets different resolution sets for a picture to be used as a reference picture and a picture not to be used as a reference picture, respectively. 14. The video encoding apparatus of claim 2, further comprising a resolution conversion flag generator for generating a resolution conversion flag, which indicates a change between a resolution of an area to be currently encoded and a resolution of surrounding areas or a resolution of a previous block. 15. A video decoding apparatus comprising:
a resolution change flag extractor for extracting a resolution change flag from a bitstream; a resolution decoder for extracting an encoded resolution identification flag from the bitstream according to the extracted resolution change flag and decoding the extracted resolution identification flag, so as to reconstruct a motion vector resolution of each area or motion vector; and an inter prediction decoder for performing an inter prediction decoding by using a motion vector according to the reconstructed motion vector resolution of each area or motion vector. 16. The video decoding apparatus of claim 15, further comprising a differential vector decoder for reconstructing a differential motion vector of each area by extracting an encoded differential motion vector from the bitstream and decoding the extracted differential motion vector, wherein the inter prediction decoder predicts a predicted motion vector of each area and reconstructs a motion vector of each area by using the predicted motion vector and the reconstructed differential motion vector. 17. A video decoding apparatus comprising:
a resolution decoder for reconstructing a resolution of each area or motion vector by using information received through a bitstream; and an inter prediction decoder for performing an inter prediction decoding by using a motion vector according to the reconstructed resolution of each area or motion vector. 18. The video decoding apparatus of claim 17, further comprising a resolution appointment flag extractor for extracting a resolution appointment flag from the bitstream,
wherein the resolution decoder decodes the resolution according to the extracted resolution appointment flag. 19. The video decoding apparatus of claim 18, wherein the resolution appointment flag corresponds to a flag indicating that it is fixed to a single resolution or a resolution set including multiple resolutions. 20. The video decoding apparatus of claim 18, wherein, when using multiple reference pictures, the resolution appointment flag extractor establishes different resolution sets according to reference pictures based on a predetermined criterion, respectively. 21. The video decoding apparatus of claim 20, wherein the predetermined criterion comprises one of a distance between a reference picture and a current picture, an error value between resolutions measured by an error measurement means, and a table including resolution sets corresponding to reference pictures. 22. The video decoding apparatus of claim 18, wherein the resolution decoder calculates a resolution set for a reference picture index. 23. The video decoding apparatus of claim 17, further comprising a resolution conversion flag extractor for extracting a resolution conversion flag and then extracting a resolution identification flag according to a value of the resolution conversion flag. 24. The video decoding apparatus of claim 23, wherein the resolution decoder extracts a resolution identification flag according to a resolution kind of the resolution conversion flag decoded after being extracted from a header of the bitstream, and the differential vector decoder extracts a value of a differential motion vector corresponding to a pertinent resolution by referring to a code number extracted from a code number table by using the extracted resolution identification flag. 25. A method for encoding/decoding a video, the method comprising:
encoding a video by determining a motion vector resolution of each area or motion vector of a video and then performing an inter prediction encoding of the video by using a motion vector according to the motion vector resolution determined for each area or motion vector; and decoding a video by reconstructing a resolution by extracting resolution information from a bitstream and then performing an inter prediction decoding by using a motion vector according to the motion vector resolution of each reconstructed area or motion vector. 26. A method for encoding a video, the method comprising:
determining a motion vector resolution of each area or motion vector; and performing an inter prediction encoding by using a motion vector according to the motion vector resolution determined for each area or motion vector. 27. The method of claim 26, wherein the motion vector resolution has different values for an x component and a y component of a motion vector. 28. The method of claim 26, further comprising generating a resolution change flag, which indicates whether a motion vector resolution is determined for each motion vector or each area of a video. 29. The method of claim 26, further comprising encoding the motion vector resolution determined for each area or motion vector. 30. The method of claim 29, wherein the step of encoding the motion vector resolution comprises hierarchically encoding motion vector resolutions determined for respective areas or motion vectors in a Quadtree structure by grouping areas having an equal motion vector resolution together. 31. The method of claim 30, wherein the step of encoding the motion vector resolution comprises encoding an identifier, which indicates a maximum number of Quadtree layers and a size of an area indicated by a lowest node of the Quadtree layers. 32. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector by using a motion vector resolution predicted using motion vector resolutions of surrounding areas of each area. 33. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector by using a run and length. 34. The method of claim 29, wherein the step of encoding the motion vector resolution comprises hierarchically encoding motion vector resolutions determined for respective areas or motion vectors by using a tag tree. 35. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector while changing a number of bits allocated to the motion vector resolution according to a frequency of the motion vector resolution. 36. The method of claim 29, wherein the step of encoding the motion vector resolution comprises:
determining whether a video decoding apparatus can estimate the motion vector resolution determined for each area or motion vector according to a pre-promised estimation scheme; and encoding an identifier indicating a capability of estimation for an area having a motion vector resolution that can be estimated and encoding an identifier indicating an incapability of estimation for an area having a motion vector resolution that cannot be estimated. 37. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector by allocating different numbers of bits according to a distribution of motion vector resolutions of surrounding areas of each area. 38. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector, through an arithmetic encoding, by using different methods of generating a bit string according to a distribution of motion vector resolutions of surrounding areas of each area. 39. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector, through an arithmetic encoding, by using different context models according to a distribution of motion vector resolutions of surrounding areas and occurrence probabilities of the motion vector resolution, and performing a context model update. 40. The method of claim 29, wherein the step of encoding the motion vector resolution comprises encoding the motion vector resolution determined for each area or motion vector only when each component of the differential motion vector is not “0”. 41. The method of claim 26, wherein the step of determining the motion vector resolution comprises, when a size of a predicted motion vector or differential motion vector of a motion vector according to the motion vector resolution determined for each area or motion vector is larger than a threshold, determining a predetermined value as the motion vector resolution determined for each area or motion vector. 42. The method of claim 26, further comprising encoding a differential motion vector corresponding to a difference between a predicted motion vector and a motion vector according to the motion vector resolution determined for each area or motion vector, wherein the differential motion vector may be differently encoded according to the motion vector resolution. 43. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the differential vector is encoded by using a Universal Variable Length Coding (UVLC) scheme, encoding the differential motion vector by using a K-th order Exp-Golomb code, wherein a degree (K) of order of the Exp-Golomb code changes according to the motion vector resolution determined for each area. 44. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the differential vector is encoded by using a text-based binary arithmetic coding scheme, decoding the differential motion vector by using a Concatenated Truncated Unary/K-th Order Exp-Golomb Code while changing a degree (K) of order and a maximum value (T) of the Concatenated Truncated Unary/K-th Order Exp-Golomb Code according to the motion vector resolution of each area or motion vector. 45. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the differential vector is encoded by using a text-based binary arithmetic coding, decoding the differential motion vector by obtaining different accumulation probabilities according to the motion vector resolution of each area or motion vector. 46. The method of claim 42, wherein the step of encoding the differential motion vector comprises predicting a predicted motion vector for a motion vector of each area by using motion vectors of surrounding areas of each area, wherein, when motion vector resolutions of surrounding areas are not equal to the motion vector resolution of each area, the predicted motion vector is predicted after the motion vector resolutions of the surrounding areas are converted to the motion vector resolution of said each area. 47. The method of claim 46, wherein the step of encoding the differential motion vector comprises, when at least one area corresponds to a block and a block mode of the block is a skip mode, converting a motion vector resolution of an area of a motion vector to be predicted to a highest resolution among the motion vector resolutions of the surrounding areas and then predicting the predicted motion vector. 48. The method of claim 26, wherein the step of performing the inter prediction encoding comprises:
determining an optimum filter coefficient having minimum errors between a current picture and a reference picture for each motion vector resolution; performing the inter prediction encoding by using an interpolation filter having the determined filter coefficient and by using different reference pictures according to the motion vector resolutions; and encoding the determined filter coefficient. 49. The method of claim 42, wherein the step of encoding the differential motion vector comprises:
determining a reference resolution; converting a motion vector having a resolution other than a reference resolution to a motion vector having a reference resolution; and calculating the differential motion vector by using a reference predicted motion vector obtained from a reference motion vector of surrounding blocks. 50. The method of claim 42, wherein the step of encoding the differential motion vector comprises, when the reference resolution and the resolution of the motion vector are different from each other, additionally encoding a reference resolution flag. 51. The method of claim 26, further comprising generating a resolution appointment flag differently appointing a resolution set according to each area or motion vector of a video. 52. The method of claim 26, wherein the step of determining the motion vector resolution comprises, when it is possible to obtain a resolution of a current block by using a reference picture index, encoding information on the resolution by encoding a reference picture index without generating a resolution identification flag. 53. The method of claim 51, wherein the step of generating the resolution appointment flag comprises, when multiple reference pictures are used, establishing different resolution sets according to reference pictures based on a predetermined criterion without encoding the resolution identification flag. 54. The method of claim 53, wherein the predetermined criterion comprises one of a distance between a reference picture and a current picture, an error value between resolutions measured by an error measurement means, and a table including resolution sets corresponding to reference pictures. 55. The method of claim 53, wherein the step of generating the resolution appointment flag comprises establishing different resolution sets for a picture to be used as a reference picture and a picture not to be used as a reference picture, respectively. 56. The method of claim 26, further comprising generating a resolution conversion flag, which indicates a change between a resolution of an area to be currently encoded and a resolution of surrounding areas or a resolution of a previous block. 57. A method for decoding a video, the method comprising:
extracting a resolution change flag from a bitstream; reconstructing a motion vector resolution of each area or motion vector by extracting an encoded resolution identification flag from the bitstream according to the extracted resolution change flag and decoding the extracted resolution identification flag; and performing an inter prediction decoding by using a motion vector according to the reconstructed motion vector resolution of each area or motion vector. 58. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing motion vector resolutions of respective areas or motion vectors by decoding the motion vector resolutions hierarchically encoded in a Quadtree structure by grouping areas having an equal motion vector resolution together. 59. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises decoding an identifier, which indicates a maximum number of Quadtree layers and a size of an area indicated by a lowest node of the Quadtree layers. 60. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding the encoded resolution identification flag by using a motion vector resolution predicted using motion vector resolutions of surrounding areas of each area or motion vector. 61. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding a resolution identification flag in which a run and length of the motion vector resolution of each area or motion vector have been encoded. 62. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding a resolution identification flag in which motion vector resolutions of respective areas or motion vectors hierarchically encoded by using a tag tree. 63. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing a motion vector resolution of each areas or motion vector by decoding the motion vector resolution while changing a number of bits allocated to the motion vector resolution according to a frequency of the motion vector resolution. 64. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises estimating a motion vector resolution according to a pre-promised estimation scheme and reconstructing the estimated motion vector resolution as a motion vector resolution of a pertinent area when the resolution identification flag decoded for each area or motion vector is a flag indicating a capability of estimation, and reconstructing the motion vector resolution indicated by the decoded resolution identification flag as the motion vector resolution of the pertinent area when the resolution identification flag decoded for each area or motion vector is a flag indicating an incapability of estimation. 65. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the motion vector resolution of each area or motion vector only when each component of the differential motion vector is not “0”. 66. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the resolution identification flag by allocating different numbers of bits according to a distribution of motion vector resolutions of surrounding areas of each area. 67. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the resolution identification flag by using different methods of generating a bit string according to a distribution of motion vector resolutions of surrounding areas of each area. 68. The method of claim 57, wherein the step of reconstructing the motion vector resolution comprises reconstructing the resolution identification flag by using an arithmetic encoding scheme and by using different context models according to occurrence probabilities of the motion vector resolution and a distribution of motion vector resolutions of surrounding areas. 69. The method of claim 57, further comprising reconstructing a filter coefficient of each motion vector resolution by extracting an encoded filter coefficient of each motion vector resolution from the bitstream and decoding the extracted filter coefficient,
wherein the step of performing the inter prediction decoding comprises: interpolating a reference picture by using the reconstructed filter coefficient of each motion vector resolution; and performing an inter prediction encoding by using another reference picture of each motion vector resolution. 70. The method of claim 57, further comprising reconstructing a differential motion vector of each area by extracting an encoded differential motion vector from the bitstream and decoding the extracted differential motion vector,
wherein the step of performing the inter prediction decoding comprises: predicting a predicted motion vector of each area; and reconstructing a motion vector of each area by using the predicted motion vector and the reconstructed differential motion vector. 71. The method of claim 70, wherein the step of reconstructing the differential motion vector comprises decoding the differential motion vector by using a Universal Variable Length Coding (UVLC) scheme and by using a K-th order Exp-Golomb code, wherein a degree (K) of order of the Exp-Golomb code changes according to the motion vector resolution of each reconstructed area or motion vector. 72. The method of claim 71, wherein the step of reconstructing the differential motion vector comprises decoding the differential motion vector by using a text-based binary arithmetic coding scheme and by using a Concatenated Truncated Unary/K-th Order Exp-Golomb Code while changing a degree (K) of order and a maximum value (T) of the Concatenated Truncated Unary/K-th Order Exp-Golomb Code according to the motion vector resolution of each reconstructed area or motion vector. 73. The method of claim 70, wherein the step of reconstructing the differential motion vector comprises decoding the differential motion vector by using a text-based binary arithmetic coding scheme and by obtaining different accumulation probabilities according to the motion vector resolution of each reconstructed area or motion vector. 74. The method of claim 70, wherein the step of predicting the predicted motion vector comprises predicting a predicted motion vector for a motion vector of each area by using motion vectors of surrounding areas of each area, wherein, when motion vector resolutions of surrounding areas are not equal to the motion vector resolution of each area, the predicted motion vector is predicted after the motion vector resolutions of the surrounding areas are converted to the motion vector resolution of said each area. 75. The method of claim 74, wherein the step of predicting the predicted motion vector comprises, when at least one area corresponds to a block and a block mode of the block is a skip mode, converting a motion vector resolution of an area of a motion vector to be predicted to a highest resolution among the motion vector resolutions of the surrounding areas and then predicting the predicted motion vector. 76. A method for decoding a video, the method comprising:
reconstructing a resolution of each area or motion vector by using information received through a bitstream; and performing an inter prediction decoding by using a motion vector according to the reconstructed resolution of each area. 77. The method of claim 76, further comprising extracting a resolution appointment flag from the bitstream,
wherein reconstructing of the resolution comprises reconstructing the resolution according to the extracted resolution appointment flag. 78. The method of claim 77, wherein the step of extracting the resolution appointment flag comprises, when multiple reference pictures are used, establishing different resolution sets according to reference pictures based on a predetermined criterion, respectively. 79. The method of claim 76, further comprising:
extracting a resolution conversion flag; and extracting a resolution identification flag according to a value of the resolution conversion flag. 80. The method of claim 79, wherein reconstructing of the resolution comprises:
extracting a resolution identification flag according to a resolution kind of the resolution conversion flag decoded after being extracted from a header of the bitstream; and extracting a value of a differential motion vector corresponding to a pertinent resolution by referring to a code number extracted from a code number table by using the extracted resolution identification flag. | 2,400 |
9,447 | 9,447 | 15,764,355 | 2,467 | There is provided a method including determining, at a user device capable of transmitting at least one subframe, the subframe having a subframe structure including at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel, if the respective one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol and, if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, causing transmission of a signal indicating channel occupancy during the at least one first symbol and transmission of the second channel during the at least one second symbol. | 1. A method comprising:
determining, at a user device capable of transmitting at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel, if the respective one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol; and if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, causing transmission of a signal indicating channel occupancy during the at least one first symbol and transmission of the second channel during the at least one second symbol. 2. A method according to claim 1, comprising, if the respective one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol, causing transmission of the respective one of the physical layer signal and first channel during the at least one first symbol and transmission of the second channel during the at least one second symbol 3. A method according to claim 1, wherein the at least one first symbol comprises at least two first symbols, wherein at least one symbol of the at least two first symbols Is associated with physical layer signals and at least one symbol of the at least two first symbols is associated with the first channel. 4. A method according to claim 3, comprising determining if physical layer signals are scheduled to be transmitted in the at least one symbol associated with physical layer signals; and
if physical layer signals are scheduled to be transmitted in the at least one symbol associated with physical layer signals, causing transmission of the physical layer signals during the at least one symbol associated with physical layer signals and transmission of the second channel during the at least one second symbol; and if physical layer signals are not scheduled to be transmitted in the at least one symbol associated with physical layer signals, causing transmission of the signal indicating channel occupancy in the at least one symbol associated with physical layer signals and transmission of the second channel during the at least one second symbol. 5. A method according to claim 4, comprising determining if the first channel is scheduled to be transmitted in the at least one symbol associated with the first channel; and
if the first channel is scheduled to be transmitted in the at least one symbol associated with the first channel, causing transmission of the first channel in the at least one symbol associated with the first channel and transmission of the second channel during the at least one second symbol; and if the first channel is not scheduled to be transmitted in the at least one symbol associated with the first channel, causing transmission of the signal Indicating channel occupancy in the at least one symbol associated with the first channel and transmission of the second channel during the at least one second symbol. 6. A method according to claim 1, comprising performing a listen before talk procedure to determine if said user device Is capable of transmitting the at least one subframe in a first channel. 7. A method according to claim 1, comprising receiving determined resources to be used for transmission of the respective one of physical layer signals and the first channel in the at least one first symbol. 8-11. (canceled) 12. A method according to claim 1, wherein the signal indicating the channel occupancy is a reference signal sequence. 13-17. (canceled) 18. A method comprising:
receiving, from a user device, at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel; and the sub frame comprising, if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, a signal indicating channel occupancy during the at least one first symbol and the second channel during the at least one second symbol. 19. A method according to claim 18, wherein the sub frame comprises, if the respective one of physical layer signals and the first channel Is scheduled to be transmitted in the at least one first symbol, the respective one of the physical layer signal and first channel during the at least one first symbol and the second channel during the at least one second symbol. 20. A method according to claim 18, wherein the at least one first symbol comprises at least two first symbols, wherein at least one symbol of the at least two first symbols Is associated with physical layer signals and at least one symbol of the at least two first symbols Is associated with the first channel. 21. A method according to claim 20 wherein
if physical layer signals are scheduled to be transmitted in the at least one symbol associated with physical layer signals, the subframe comprises physical layer signals during the at least one symbol associated with physical layer signals and the second channel during the at least one second symbol; and
if physical layer signals are not scheduled to be transmitted in the at least one symbol associated with physical layer signals, the subframe comprises a signal indicating channel occupancy in the at least one symbol associated with physical layer signals and the second channel during the at least one second symbol. 22. A method according to claim 20, comprising:
if the first channel is scheduled to be transmitted in the at least one symbol associated with the first channel, the subframe comprises the first channel In the at least one symbol associated with the first channel and the second channel during the at least one second symbol; and if the first channel is not scheduled to be transmitted in the at least one symbol associated with the first channel, the subframe comprises the signal Indicating channel occupancy In the at toast one symbol associated with the first channel and the second channel during the at least one second symbol. 23. A method according to claim 18 comprising determining resources to be used for transmission of the respective one of physical layer signals and the first channel in the at least one first symbol; and
providing the determined resources to the user device. 24. A method according to claim 18, comprising determining resources for the signal indicating channel occupancy, the resources associated with a cell to which the user device Is associated; and
providing the determined resources to the user device. 25-27. (canceled) 28. A method according to claim 18, wherein the signal Indicating the channel occupancy is a reference signal sequence. 29-35. (canceled) 36. An apparatus comprising:
at least one processor and at least one memory Including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: determine, at a user device capable of transmitting at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel, if the one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol; and if the one of physical layer signals and the first channel Is not scheduled to be transmitted in the at least one first symbol, cause transmission of a signal indicating channel occupancy during the at least one first symbol and the second channel during the at least one second symbol. 37. An apparatus comprising:
at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: receive, from a user device, at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel; and if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, the subframe comprising a signal indicating channel occupancy during the at least one first symbol and the second channel during the at least one second symbol. 38. A computer program embodied on a non-transitory computer-readable storage medium, the computer program comprising program code for controlling a process to execute a method according to claim 1. | There is provided a method including determining, at a user device capable of transmitting at least one subframe, the subframe having a subframe structure including at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel, if the respective one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol and, if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, causing transmission of a signal indicating channel occupancy during the at least one first symbol and transmission of the second channel during the at least one second symbol.1. A method comprising:
determining, at a user device capable of transmitting at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel, if the respective one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol; and if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, causing transmission of a signal indicating channel occupancy during the at least one first symbol and transmission of the second channel during the at least one second symbol. 2. A method according to claim 1, comprising, if the respective one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol, causing transmission of the respective one of the physical layer signal and first channel during the at least one first symbol and transmission of the second channel during the at least one second symbol 3. A method according to claim 1, wherein the at least one first symbol comprises at least two first symbols, wherein at least one symbol of the at least two first symbols Is associated with physical layer signals and at least one symbol of the at least two first symbols is associated with the first channel. 4. A method according to claim 3, comprising determining if physical layer signals are scheduled to be transmitted in the at least one symbol associated with physical layer signals; and
if physical layer signals are scheduled to be transmitted in the at least one symbol associated with physical layer signals, causing transmission of the physical layer signals during the at least one symbol associated with physical layer signals and transmission of the second channel during the at least one second symbol; and if physical layer signals are not scheduled to be transmitted in the at least one symbol associated with physical layer signals, causing transmission of the signal indicating channel occupancy in the at least one symbol associated with physical layer signals and transmission of the second channel during the at least one second symbol. 5. A method according to claim 4, comprising determining if the first channel is scheduled to be transmitted in the at least one symbol associated with the first channel; and
if the first channel is scheduled to be transmitted in the at least one symbol associated with the first channel, causing transmission of the first channel in the at least one symbol associated with the first channel and transmission of the second channel during the at least one second symbol; and if the first channel is not scheduled to be transmitted in the at least one symbol associated with the first channel, causing transmission of the signal Indicating channel occupancy in the at least one symbol associated with the first channel and transmission of the second channel during the at least one second symbol. 6. A method according to claim 1, comprising performing a listen before talk procedure to determine if said user device Is capable of transmitting the at least one subframe in a first channel. 7. A method according to claim 1, comprising receiving determined resources to be used for transmission of the respective one of physical layer signals and the first channel in the at least one first symbol. 8-11. (canceled) 12. A method according to claim 1, wherein the signal indicating the channel occupancy is a reference signal sequence. 13-17. (canceled) 18. A method comprising:
receiving, from a user device, at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel; and the sub frame comprising, if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, a signal indicating channel occupancy during the at least one first symbol and the second channel during the at least one second symbol. 19. A method according to claim 18, wherein the sub frame comprises, if the respective one of physical layer signals and the first channel Is scheduled to be transmitted in the at least one first symbol, the respective one of the physical layer signal and first channel during the at least one first symbol and the second channel during the at least one second symbol. 20. A method according to claim 18, wherein the at least one first symbol comprises at least two first symbols, wherein at least one symbol of the at least two first symbols Is associated with physical layer signals and at least one symbol of the at least two first symbols Is associated with the first channel. 21. A method according to claim 20 wherein
if physical layer signals are scheduled to be transmitted in the at least one symbol associated with physical layer signals, the subframe comprises physical layer signals during the at least one symbol associated with physical layer signals and the second channel during the at least one second symbol; and
if physical layer signals are not scheduled to be transmitted in the at least one symbol associated with physical layer signals, the subframe comprises a signal indicating channel occupancy in the at least one symbol associated with physical layer signals and the second channel during the at least one second symbol. 22. A method according to claim 20, comprising:
if the first channel is scheduled to be transmitted in the at least one symbol associated with the first channel, the subframe comprises the first channel In the at least one symbol associated with the first channel and the second channel during the at least one second symbol; and if the first channel is not scheduled to be transmitted in the at least one symbol associated with the first channel, the subframe comprises the signal Indicating channel occupancy In the at toast one symbol associated with the first channel and the second channel during the at least one second symbol. 23. A method according to claim 18 comprising determining resources to be used for transmission of the respective one of physical layer signals and the first channel in the at least one first symbol; and
providing the determined resources to the user device. 24. A method according to claim 18, comprising determining resources for the signal indicating channel occupancy, the resources associated with a cell to which the user device Is associated; and
providing the determined resources to the user device. 25-27. (canceled) 28. A method according to claim 18, wherein the signal Indicating the channel occupancy is a reference signal sequence. 29-35. (canceled) 36. An apparatus comprising:
at least one processor and at least one memory Including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: determine, at a user device capable of transmitting at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel, if the one of physical layer signals and the first channel is scheduled to be transmitted in the at least one first symbol; and if the one of physical layer signals and the first channel Is not scheduled to be transmitted in the at least one first symbol, cause transmission of a signal indicating channel occupancy during the at least one first symbol and the second channel during the at least one second symbol. 37. An apparatus comprising:
at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: receive, from a user device, at least one subframe, the subframe having a subframe structure comprising at least one first symbol associated with one of physical layer signals and a first channel, and at least one second symbol associated with a second channel; and if the respective one of physical layer signals and the first channel is not scheduled to be transmitted in the at least one first symbol, the subframe comprising a signal indicating channel occupancy during the at least one first symbol and the second channel during the at least one second symbol. 38. A computer program embodied on a non-transitory computer-readable storage medium, the computer program comprising program code for controlling a process to execute a method according to claim 1. | 2,400 |
9,448 | 9,448 | 15,745,409 | 2,477 | Described are mechanisms and methods for supporting Channel State Information (CSI) measurement and reporting, and for supporting Radio Resource Management (RRM) measurement and reporting, under License Assisted Access (LAA) with dynamic power sharing. An eNB may comprise one or more processors to generate a maximum number of Component Carriers (CCs) and a number of active CCs to a UE. The eNB may then be operable to process a reported quality rating from the UE and generate a scaled quality rating based upon the reported quality rating, the maximum number of CCs, and the number of active CCs. A UE may comprise one or more processors to process a reference signal transmission from an eNB, to generate an unfiltered reference signal transmission based upon the reference signal transmission, and to calculate a quality rating based upon the unfiltered reference signal transmission. | 1-20. canceled 21. An apparatus of an Evolved Node-B (eNB) operable to communicate with a User Equipment (UE) on a wireless network subject to License Assisted Access (LAA), comprising:
one or more processors to:
generate a maximum number of component carriers (CCs) for a bandwidth and a number of active CCs for the bandwidth;
generate a reference signal for the UE;
process a reported quality rating from the UE; and
generate a scaled quality rating based upon the reported quality rating, the maximum number of CCs for the bandwidth, and the number of active CCs for the bandwidth. 22. The apparatus of claim 21, wherein the maximum number of CCs for the bandwidth may include a Primary Cell (PCell) and one or more Secondary Cells (SCells). 23. The apparatus of claim 21, wherein the scaled quality rating is determined based upon the reported quality rating divided by a ratio of the number of active CCs for the bandwidth to the maximum number of CCs for the bandwidth. 24. The apparatus of claim 21, wherein the reported quality rating is part of a Channel Quality Indication (CQI) transmission based on the reference signal generated by the eNB. 25. The apparatus of claim 24, wherein the reference transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (CSI-RS) transmission. 26. The apparatus of claim 24, wherein the number of active CCs for the bandwidth is determined at one of: a predetermined time before the transmission of the reference signal, a time within a predetermined window of time before the transmission of the reference signal, or substantially the same time as the transmission of the reference signal. 27. Machine readable storage media having machine executable instructions that, when executed, cause one or more processors to perform an operation comprising:
generate, for an Evolved Node-B (eNB), a maximum number of Component Carriers (CCs) for a bandwidth and a number of active CCs for the bandwidth; generate a reference signal for a User Equipment (UE); process a reported quality rating from the UE; and generate a scaled quality rating based upon the reported quality rating, the maximum number of CCs for the bandwidth, and the number of active CCs for the bandwidth. 28. The machine readable storage media of claim 27, wherein the maximum number of CCs for the bandwidth may include a Primary Cell (PCell) and one or more Secondary Cells (SCells). 29. The machine readable storage media of claim 27, wherein the scaled quality rating is determined based upon the reported quality rating divided by a ratio of the number of active CCs for the bandwidth to the maximum number of CCs for the bandwidth. 30. The machine readable storage media of claim 27, wherein the reported quality rating is processed as part of a Channel Quality Indication (CQI) transmission based on the reference signal generated by the eNB. 31. The machine readable storage media of claim 30, wherein the reference transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (CSI-RS) transmission. 32. The machine readable storage media of claim 30, wherein the number of active CCs for the bandwidth is determined at one of: a predetermined time before the transmission of the reference signal, a time within a predetermined window of time before the transmission of the reference signal, or substantially the same as the transmission of the reference signal. 33. An apparatus of a User Equipment (UE) operable to communicate with an Evolved Node-B (eNB) on a wireless network subject to License Assisted Access (LAA), comprising: one or more processors to:
process a reference signal transmission from the eNB; generate an unfiltered reference signal transmission based on the reference signal transmission; and calculate a quality rating based upon the unfiltered reference signal transmission. 34. The apparatus of claim 33, wherein the quality reporting is included in a Channel Quality Indication (CQI) transmission. 35. The apparatus of claim 33, wherein the reference signal transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (C SI-RS) transmission. 36. Machine readable storage media having machine executable instructions that, when executed, cause one or more processors to perform an operation comprising:
process, for a User Equipment (UE), a reference signal transmission from an Evolved Node-B (eNB); generate an unfiltered reference signal transmission based on the reference signal transmission; and calculate a quality rating based upon the unfiltered reference signal transmission. 37. The machine readable storage media of claim 36, wherein the quality reporting is included in a Channel Quality Indication (CQI) transmission. 38. The machine readable storage media of claim 36, wherein the reference signal transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (CSI-RS) transmission. | Described are mechanisms and methods for supporting Channel State Information (CSI) measurement and reporting, and for supporting Radio Resource Management (RRM) measurement and reporting, under License Assisted Access (LAA) with dynamic power sharing. An eNB may comprise one or more processors to generate a maximum number of Component Carriers (CCs) and a number of active CCs to a UE. The eNB may then be operable to process a reported quality rating from the UE and generate a scaled quality rating based upon the reported quality rating, the maximum number of CCs, and the number of active CCs. A UE may comprise one or more processors to process a reference signal transmission from an eNB, to generate an unfiltered reference signal transmission based upon the reference signal transmission, and to calculate a quality rating based upon the unfiltered reference signal transmission.1-20. canceled 21. An apparatus of an Evolved Node-B (eNB) operable to communicate with a User Equipment (UE) on a wireless network subject to License Assisted Access (LAA), comprising:
one or more processors to:
generate a maximum number of component carriers (CCs) for a bandwidth and a number of active CCs for the bandwidth;
generate a reference signal for the UE;
process a reported quality rating from the UE; and
generate a scaled quality rating based upon the reported quality rating, the maximum number of CCs for the bandwidth, and the number of active CCs for the bandwidth. 22. The apparatus of claim 21, wherein the maximum number of CCs for the bandwidth may include a Primary Cell (PCell) and one or more Secondary Cells (SCells). 23. The apparatus of claim 21, wherein the scaled quality rating is determined based upon the reported quality rating divided by a ratio of the number of active CCs for the bandwidth to the maximum number of CCs for the bandwidth. 24. The apparatus of claim 21, wherein the reported quality rating is part of a Channel Quality Indication (CQI) transmission based on the reference signal generated by the eNB. 25. The apparatus of claim 24, wherein the reference transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (CSI-RS) transmission. 26. The apparatus of claim 24, wherein the number of active CCs for the bandwidth is determined at one of: a predetermined time before the transmission of the reference signal, a time within a predetermined window of time before the transmission of the reference signal, or substantially the same time as the transmission of the reference signal. 27. Machine readable storage media having machine executable instructions that, when executed, cause one or more processors to perform an operation comprising:
generate, for an Evolved Node-B (eNB), a maximum number of Component Carriers (CCs) for a bandwidth and a number of active CCs for the bandwidth; generate a reference signal for a User Equipment (UE); process a reported quality rating from the UE; and generate a scaled quality rating based upon the reported quality rating, the maximum number of CCs for the bandwidth, and the number of active CCs for the bandwidth. 28. The machine readable storage media of claim 27, wherein the maximum number of CCs for the bandwidth may include a Primary Cell (PCell) and one or more Secondary Cells (SCells). 29. The machine readable storage media of claim 27, wherein the scaled quality rating is determined based upon the reported quality rating divided by a ratio of the number of active CCs for the bandwidth to the maximum number of CCs for the bandwidth. 30. The machine readable storage media of claim 27, wherein the reported quality rating is processed as part of a Channel Quality Indication (CQI) transmission based on the reference signal generated by the eNB. 31. The machine readable storage media of claim 30, wherein the reference transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (CSI-RS) transmission. 32. The machine readable storage media of claim 30, wherein the number of active CCs for the bandwidth is determined at one of: a predetermined time before the transmission of the reference signal, a time within a predetermined window of time before the transmission of the reference signal, or substantially the same as the transmission of the reference signal. 33. An apparatus of a User Equipment (UE) operable to communicate with an Evolved Node-B (eNB) on a wireless network subject to License Assisted Access (LAA), comprising: one or more processors to:
process a reference signal transmission from the eNB; generate an unfiltered reference signal transmission based on the reference signal transmission; and calculate a quality rating based upon the unfiltered reference signal transmission. 34. The apparatus of claim 33, wherein the quality reporting is included in a Channel Quality Indication (CQI) transmission. 35. The apparatus of claim 33, wherein the reference signal transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (C SI-RS) transmission. 36. Machine readable storage media having machine executable instructions that, when executed, cause one or more processors to perform an operation comprising:
process, for a User Equipment (UE), a reference signal transmission from an Evolved Node-B (eNB); generate an unfiltered reference signal transmission based on the reference signal transmission; and calculate a quality rating based upon the unfiltered reference signal transmission. 37. The machine readable storage media of claim 36, wherein the quality reporting is included in a Channel Quality Indication (CQI) transmission. 38. The machine readable storage media of claim 36, wherein the reference signal transmission is one of: a Cell-specific Reference Signal (CRS) transmission, or a Channel State Information Reference Signal (CSI-RS) transmission. | 2,400 |
9,449 | 9,449 | 11,451,769 | 2,421 | Method and system of recommending program without individually compiling subscribe profile information. The method and system being suitable for recommending television programs, movies, and any other media, including but not limited to advertisements and music. | 1. A method of recommending related programs, the method comprising: determining metadata characteristics for a number of programs;
pairing programs with other programs having related metadata characteristics such that the programs are paired with one or more other programs to form program groups having related metadata characteristics; and recommending the program group associated with one of the programs, the recommended program group indicating programs having metadata characteristics related to the one program such that the recommended program group characterizes a recommendation of related programs. 2. The method of claim 1 further comprising providing a recommendations menu for listing titles associated with each program in the recommended program group. 3. The method of claim 2 further comprising executing a programming action in response to selection of one of the titles listed in the recommendations menu. 4. The method of claim 3 wherein executing the programming action includes setting a recording for the selected title, setting an alert for the selected title, adding the selected title to a playlist, or tuning to a channel showing the program associated with the selected title. 5. The method of claim 1 further comprising determining the one program as a function of a selected cell in a programming grid displayed within an electronic programming guide (EPG). 6. The method of claim 5 further comprising recommending different programs groups in response to selection of different cells. 7. The method of claim 5 further comprising populating the EPG programming grid based on EPG program details received from a service provider. 8. The method of claim 7 further comprising specifying the programs groups within the EPG program details such that recommended program groups are automatically displayed within the EPG with each cell selection and without requiring upstream communications with the service provider. 9. The method of claim 8 further comprising limiting the number of programs and program groups specified within the EPG program details such that the program details must be periodically downloaded in order to update the same. 10. The method of claim 1 further comprising selecting the programs to be paired with program groups as a function of a programming schedule for a particular servicing area. 11. The method of claim 10 further comprising defining the servicing area according to an area supported by a cable television headend. 12. The method of claim 1 further comprising filtering the recommended program group recommends less than all of the programs comprising the same. 13. The method of claim 12 further comprising filtering the recommended program group based on program availability. 14. The method of claim 12 further comprising filtering the recommended program group based on subscriber entitlements. 15. The method of claim 12 further comprising filtering the recommended program group based on content differences. 16. The method of claim 1 further comprising pre-loading one or more of the programs within the recommended program group on a server associated with providing the program to the subscriber so as to optimize program delivery. 17. The method of claim 1 further comprising prioritizing one or more of the programs within the recommended program group on a server associated with providing the program to the subscriber so as to optimize program delivery. 18. A recommendations element configured for: determining metadata characteristics for a number of programs;
pairing programs with other programs having related metadata characteristics such that the programs are paired with one or more other programs to form program groups having related metadata characteristics; and recommending the program group associated with one of the programs, the recommended program group indicating programs having metadata characteristics related to the one program such that the recommended program group characterizes a recommendation of related programs. 19. The element of claim 16 further configured for filtering the recommended program group to include less than all of the programs comprising the same. 20. The element of claim 17 further configured for filtering the recommended program group based on program availability, subscriber entitlements, or content differences. 21. A system comprising:
a subscriber access point for use in selecting a program; and a recommendations element configured for recommending a program group associated with the selected program, the recommended program group indicating programs having metadata characteristics related to the selected program such that the recommended program group characterizes a recommendation of related programs without requiring profile information on a subscriber selecting the selected program. 22. The system of claim 19 wherein the subscriber access point is configured to filter the programs include within the recommended program group. 23. The system of claim 20 wherein the subscriber access point is configured to filter the programs as a function of subscriber entitlements. 24. The system of claim 19 wherein the recommendations server downloads program details to the subscriber access point, the program details specifying the program groups, such that the subscriber access point process the program details in order to display the program group associated with the selected program. 25. The system of claim 19 wherein the subscriber access point provides an electronic programming guide (EPG) to facilitate selecting the program and displaying the recommended program group. 26. The system of claim 23 wherein recommended program groups are automatically displayed within the EPG with each cell selected within the EPG and without requiring upstream communications from the subscriber access point. 27. The system of claim 19 wherein the recommendations element is configured for determining metadata characteristics for a number of programs and pairing the programs with other programs having related metadata characteristics such that the programs are paired with one or more other programs to form the program groups. | Method and system of recommending program without individually compiling subscribe profile information. The method and system being suitable for recommending television programs, movies, and any other media, including but not limited to advertisements and music.1. A method of recommending related programs, the method comprising: determining metadata characteristics for a number of programs;
pairing programs with other programs having related metadata characteristics such that the programs are paired with one or more other programs to form program groups having related metadata characteristics; and recommending the program group associated with one of the programs, the recommended program group indicating programs having metadata characteristics related to the one program such that the recommended program group characterizes a recommendation of related programs. 2. The method of claim 1 further comprising providing a recommendations menu for listing titles associated with each program in the recommended program group. 3. The method of claim 2 further comprising executing a programming action in response to selection of one of the titles listed in the recommendations menu. 4. The method of claim 3 wherein executing the programming action includes setting a recording for the selected title, setting an alert for the selected title, adding the selected title to a playlist, or tuning to a channel showing the program associated with the selected title. 5. The method of claim 1 further comprising determining the one program as a function of a selected cell in a programming grid displayed within an electronic programming guide (EPG). 6. The method of claim 5 further comprising recommending different programs groups in response to selection of different cells. 7. The method of claim 5 further comprising populating the EPG programming grid based on EPG program details received from a service provider. 8. The method of claim 7 further comprising specifying the programs groups within the EPG program details such that recommended program groups are automatically displayed within the EPG with each cell selection and without requiring upstream communications with the service provider. 9. The method of claim 8 further comprising limiting the number of programs and program groups specified within the EPG program details such that the program details must be periodically downloaded in order to update the same. 10. The method of claim 1 further comprising selecting the programs to be paired with program groups as a function of a programming schedule for a particular servicing area. 11. The method of claim 10 further comprising defining the servicing area according to an area supported by a cable television headend. 12. The method of claim 1 further comprising filtering the recommended program group recommends less than all of the programs comprising the same. 13. The method of claim 12 further comprising filtering the recommended program group based on program availability. 14. The method of claim 12 further comprising filtering the recommended program group based on subscriber entitlements. 15. The method of claim 12 further comprising filtering the recommended program group based on content differences. 16. The method of claim 1 further comprising pre-loading one or more of the programs within the recommended program group on a server associated with providing the program to the subscriber so as to optimize program delivery. 17. The method of claim 1 further comprising prioritizing one or more of the programs within the recommended program group on a server associated with providing the program to the subscriber so as to optimize program delivery. 18. A recommendations element configured for: determining metadata characteristics for a number of programs;
pairing programs with other programs having related metadata characteristics such that the programs are paired with one or more other programs to form program groups having related metadata characteristics; and recommending the program group associated with one of the programs, the recommended program group indicating programs having metadata characteristics related to the one program such that the recommended program group characterizes a recommendation of related programs. 19. The element of claim 16 further configured for filtering the recommended program group to include less than all of the programs comprising the same. 20. The element of claim 17 further configured for filtering the recommended program group based on program availability, subscriber entitlements, or content differences. 21. A system comprising:
a subscriber access point for use in selecting a program; and a recommendations element configured for recommending a program group associated with the selected program, the recommended program group indicating programs having metadata characteristics related to the selected program such that the recommended program group characterizes a recommendation of related programs without requiring profile information on a subscriber selecting the selected program. 22. The system of claim 19 wherein the subscriber access point is configured to filter the programs include within the recommended program group. 23. The system of claim 20 wherein the subscriber access point is configured to filter the programs as a function of subscriber entitlements. 24. The system of claim 19 wherein the recommendations server downloads program details to the subscriber access point, the program details specifying the program groups, such that the subscriber access point process the program details in order to display the program group associated with the selected program. 25. The system of claim 19 wherein the subscriber access point provides an electronic programming guide (EPG) to facilitate selecting the program and displaying the recommended program group. 26. The system of claim 23 wherein recommended program groups are automatically displayed within the EPG with each cell selected within the EPG and without requiring upstream communications from the subscriber access point. 27. The system of claim 19 wherein the recommendations element is configured for determining metadata characteristics for a number of programs and pairing the programs with other programs having related metadata characteristics such that the programs are paired with one or more other programs to form the program groups. | 2,400 |
9,450 | 9,450 | 15,113,369 | 2,483 | A multi-view display controller ( 100, 200, 300 ) generates view information specifying view directions along which media data a media content is to be projected on a multi-view display ( 2 ) and specifying a selected view direction along which additional information is to be simultaneously projected as media data of the media content. The multi-view display controller ( 100, 200, 300 ) thereby enables an intuitive and efficient communication of additional information to the viewer ( 5 ) on the multi-view display ( 2 ). | 1. A multi-view display controller, wherein said multi-view display controller is configured to:
generate view information specifying, for at least one pixel area of a multi-view display, view directions of multiple view directions along which media data of a media content is to be projected; and specifying, for said at least one pixel area, a selected view direction along which additional information is to be simultaneously projected as media data of said media content. 2. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to select a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 3. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to determine at least one current view direction for said viewer based on said position information; and said multi-view display controller is configured to select said view direction along which said additional information is to be projected simultaneously as media data of said media content based on information of said at least one current view direction. 4. The multi-view display controller of claim 3, wherein said multi-view display controller is configured to select said view direction along which said additional information is to be projected simultaneously as media data of said media content based on said information of said at least one current view direction and the number of said multiple view directions for said at least one pixel area. 5. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to select an updated view direction among said multiple view directions for said at least one pixel area based on updated position information representing an updated position of said viewer relative to said multi-view display following expiry of a time period from detection of said viewer having moved from said position to said updated position; and said multi-view display controller is configured to generate said view information specifying, for said at least one pixel area, said view directions and specifying, for said at least one pixel area, said selected updated view direction along which said additional information is to be simultaneously projected as media data of said media content. 6. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to periodically receive, from a positioning device, respective position information representing respective positions of said viewer relative to said multi-view display at respective time instances; said multi-view display controller is configured to select an updated view direction among said multiple view directions for said at least one pixel area if at least a defined number of said respective position information represents a same updated position of said viewer relative to said multi-view display or fall within predetermined range; and said multi-view display controller is configured to generate said view information specifying, for said at least one pixel area, said view directions and specifying, for said at least one pixel area, said selected updated view direction along which said additional information is to be simultaneously projected as media data of said media content. 7. The multi-view display controller, wherein
said multi-view display controller is configured to select a first view direction and a second view direction among said multiple view directions for said at least one pixel area based on said position information; and said multi-view display controller is configured to generate said view information i) specifying, for said at least one pixel area, said view directions, ii) specifying, for said at least one pixel area, said selected first view direction along which first additional information is to be simultaneously projected as media data of said media content, and iii) specifying, for said at least one pixel area, said selected second view direction along which second additional information is to be simultaneously projected as media data of said media content. 8. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to receive media data of said media content; and said multi-view display controller is configured to receive said position information from a positioning device. 9. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to output media data of said media content and said additional information together with said view information to said multi-view display for simultaneous display of media data of said media content and said additional information. 10. The multi-view display controller claim 1, wherein said multi-view display controller is configured to generate said view information specifying said view directions for said at least one pixel area and specifying said selected view direction along which said additional information is to be projected and superimposed on media data of said media content. 11. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to generate said view information specifying, for said at least one pixel area, said view directions, said selected view direction and a time period during which said additional information is to be simultaneously projected as media data of said media content along said selected view direction. 12. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to generate said view information specifying said view directions and said selected view direction along which program information descriptive of said media content is to be simultaneously projected as media data of said media content. 13-14. (canceled) 15. The multi-view display controller of claim 1, comprising:
a processor; and a memory comprising instructions executable by said processor, wherein said processor is configured to generate said view information. 16. The multi-view display controller of claim 15, wherein said processor configured to select a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 17. The multi-view display controller of claim 16, further comprising communication circuitry, coupled to said processor, for:
receiving media data of said media content; receiving said position information from a positioning device; and outputting media data of said media content and said additional information together with said view information to said multi-view display for simultaneous display of media data of said media content and said additional information. 18. (canceled) 19. A multi-view display method, comprising;
generating view information specifying, for at least one pixel area of a multi-view display, view directions of multiple view directions along which media data of a media content is to be projected; and specifying, for said at least one pixel area, a selected view direction along which additional information is to be simultaneously projected as media data of said media content. 20. The multi-view display method of claim 19, further comprising selecting a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 21. A multi-view display system comprising:
a multi-view display controller of claim; and a multi-view display connectable to said multi-view display controller. 22. (canceled) 23. A computer program product comprising a non-transitory computer readable medium storing instructions, which when executed by a processor, cause said processor to:
generate view information specifying, for at least one pixel area of a multi-view display, view directions of multiple view directions along which media data of a media content is to be projected; and specify, for said at least one pixel area, a selected view direction along which additional information is to be simultaneously projected as media data of said media content. 24. The computer program of claim 23, wherein said instructions, when executed by said processor cause said processor to select a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 25-37. (canceled) | A multi-view display controller ( 100, 200, 300 ) generates view information specifying view directions along which media data a media content is to be projected on a multi-view display ( 2 ) and specifying a selected view direction along which additional information is to be simultaneously projected as media data of the media content. The multi-view display controller ( 100, 200, 300 ) thereby enables an intuitive and efficient communication of additional information to the viewer ( 5 ) on the multi-view display ( 2 ).1. A multi-view display controller, wherein said multi-view display controller is configured to:
generate view information specifying, for at least one pixel area of a multi-view display, view directions of multiple view directions along which media data of a media content is to be projected; and specifying, for said at least one pixel area, a selected view direction along which additional information is to be simultaneously projected as media data of said media content. 2. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to select a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 3. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to determine at least one current view direction for said viewer based on said position information; and said multi-view display controller is configured to select said view direction along which said additional information is to be projected simultaneously as media data of said media content based on information of said at least one current view direction. 4. The multi-view display controller of claim 3, wherein said multi-view display controller is configured to select said view direction along which said additional information is to be projected simultaneously as media data of said media content based on said information of said at least one current view direction and the number of said multiple view directions for said at least one pixel area. 5. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to select an updated view direction among said multiple view directions for said at least one pixel area based on updated position information representing an updated position of said viewer relative to said multi-view display following expiry of a time period from detection of said viewer having moved from said position to said updated position; and said multi-view display controller is configured to generate said view information specifying, for said at least one pixel area, said view directions and specifying, for said at least one pixel area, said selected updated view direction along which said additional information is to be simultaneously projected as media data of said media content. 6. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to periodically receive, from a positioning device, respective position information representing respective positions of said viewer relative to said multi-view display at respective time instances; said multi-view display controller is configured to select an updated view direction among said multiple view directions for said at least one pixel area if at least a defined number of said respective position information represents a same updated position of said viewer relative to said multi-view display or fall within predetermined range; and said multi-view display controller is configured to generate said view information specifying, for said at least one pixel area, said view directions and specifying, for said at least one pixel area, said selected updated view direction along which said additional information is to be simultaneously projected as media data of said media content. 7. The multi-view display controller, wherein
said multi-view display controller is configured to select a first view direction and a second view direction among said multiple view directions for said at least one pixel area based on said position information; and said multi-view display controller is configured to generate said view information i) specifying, for said at least one pixel area, said view directions, ii) specifying, for said at least one pixel area, said selected first view direction along which first additional information is to be simultaneously projected as media data of said media content, and iii) specifying, for said at least one pixel area, said selected second view direction along which second additional information is to be simultaneously projected as media data of said media content. 8. The multi-view display controller of claim 2, wherein
said multi-view display controller is configured to receive media data of said media content; and said multi-view display controller is configured to receive said position information from a positioning device. 9. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to output media data of said media content and said additional information together with said view information to said multi-view display for simultaneous display of media data of said media content and said additional information. 10. The multi-view display controller claim 1, wherein said multi-view display controller is configured to generate said view information specifying said view directions for said at least one pixel area and specifying said selected view direction along which said additional information is to be projected and superimposed on media data of said media content. 11. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to generate said view information specifying, for said at least one pixel area, said view directions, said selected view direction and a time period during which said additional information is to be simultaneously projected as media data of said media content along said selected view direction. 12. The multi-view display controller of claim 1, wherein said multi-view display controller is configured to generate said view information specifying said view directions and said selected view direction along which program information descriptive of said media content is to be simultaneously projected as media data of said media content. 13-14. (canceled) 15. The multi-view display controller of claim 1, comprising:
a processor; and a memory comprising instructions executable by said processor, wherein said processor is configured to generate said view information. 16. The multi-view display controller of claim 15, wherein said processor configured to select a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 17. The multi-view display controller of claim 16, further comprising communication circuitry, coupled to said processor, for:
receiving media data of said media content; receiving said position information from a positioning device; and outputting media data of said media content and said additional information together with said view information to said multi-view display for simultaneous display of media data of said media content and said additional information. 18. (canceled) 19. A multi-view display method, comprising;
generating view information specifying, for at least one pixel area of a multi-view display, view directions of multiple view directions along which media data of a media content is to be projected; and specifying, for said at least one pixel area, a selected view direction along which additional information is to be simultaneously projected as media data of said media content. 20. The multi-view display method of claim 19, further comprising selecting a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 21. A multi-view display system comprising:
a multi-view display controller of claim; and a multi-view display connectable to said multi-view display controller. 22. (canceled) 23. A computer program product comprising a non-transitory computer readable medium storing instructions, which when executed by a processor, cause said processor to:
generate view information specifying, for at least one pixel area of a multi-view display, view directions of multiple view directions along which media data of a media content is to be projected; and specify, for said at least one pixel area, a selected view direction along which additional information is to be simultaneously projected as media data of said media content. 24. The computer program of claim 23, wherein said instructions, when executed by said processor cause said processor to select a view direction among said multiple view directions for said at least one pixel area based on position information representing a position of a viewer relative to said multi-view display. 25-37. (canceled) | 2,400 |
9,451 | 9,451 | 15,541,089 | 2,439 | A malware detection system to detect malware in a client computer system includes a behavior profile generator adapted to generate a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; an interface adapted to communicate the behavior profile to the client; and an identifier responsive to a message from the client that the behavior profile is exhibited by the client and adapted to identify a reaction instruction for performance by the client, wherein the interface is further adapted to communicate the reaction instruction to the client. | 1. A computer implemented malware detection method to detect malware in a client computer system, the method comprising:
generating a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; communicating the behavior profile to the client computer system; and in response to a message from the client computer system that the behavior profile is exhibited by the client computer system, identifying a reaction instruction for performance by the client computer system and communicating the reaction instruction to the client computer system. 2. The method of claim 1 wherein the profile specifies one or more actions performed by a computer system. 3. The method of claim 1 wherein the reaction instruction instructs the client computer system to cease execution of one or more software components at the client. 4. The method of claim 1 wherein the reaction instruction instructs the client computer system to block one or more features or services of the client computer system. 5. The method of claim 1 wherein the reaction instruction instructs the client computer system to undertake a malware scan. 6. The method of claim 1 wherein the reaction instruction instructs the client computer system to transmit at least a portion of content stored in a memory of the client computer system, the method further comprising:
receiving the at least a portion of content; and
performing a malware scan on the received content. 7. The method of claim 1 wherein the profile is defined based on an analysis of one or more known malware software components such that the profile is suitable for identifying behavior consistent with the known malware. 8. The method of claim 1 wherein the client computer system is a resource constrained computer system such that executing a malware scan on the client computer system can be expected to cause a reduction in performance of the client computer system that denies at least some of the services, facilities or functions of the client computer system to a user of the client computer system for at least a portion of the duration of the malware scan. 9. The method of claim 1 wherein the behavioral operations are taken from a list including: network operations; process execution; data storage operations; the undertaking of telephony calls; the undertaking of messaging communications; service blocking; use of a camera associated with the client computer system; and use of a microphone associated with the client computer system. 10. A malware detection system to detect malware in a client computer system comprising:
a behavior profile generator adapted to generate a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; an interface adapted to communicate the behavior profile to the client computer system; and an identifier responsive to a message from the client computer system that the behavior profile is exhibited by the client computer system and adapted to identify a reaction instruction for performance by the client computer system, wherein the interface is further adapted to communicate the reaction instruction to the client computer system. 11. A malware detection system to detect malware in a client computer system, the malware detection system comprising a processor and a data store wherein the processor is adapted to undertake the following:
generating a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; communicating the behavior profile to the client computer system; and in response to a message from the client computer system that the behavior profile is exhibited by the client computer system, identifying a reaction instruction for performance by the client computer system and communicating the reaction instruction to the client computer system. 12. A non-transitory computer-readable storage medium storing a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the method as claimed in claim 1. | A malware detection system to detect malware in a client computer system includes a behavior profile generator adapted to generate a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; an interface adapted to communicate the behavior profile to the client; and an identifier responsive to a message from the client that the behavior profile is exhibited by the client and adapted to identify a reaction instruction for performance by the client, wherein the interface is further adapted to communicate the reaction instruction to the client.1. A computer implemented malware detection method to detect malware in a client computer system, the method comprising:
generating a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; communicating the behavior profile to the client computer system; and in response to a message from the client computer system that the behavior profile is exhibited by the client computer system, identifying a reaction instruction for performance by the client computer system and communicating the reaction instruction to the client computer system. 2. The method of claim 1 wherein the profile specifies one or more actions performed by a computer system. 3. The method of claim 1 wherein the reaction instruction instructs the client computer system to cease execution of one or more software components at the client. 4. The method of claim 1 wherein the reaction instruction instructs the client computer system to block one or more features or services of the client computer system. 5. The method of claim 1 wherein the reaction instruction instructs the client computer system to undertake a malware scan. 6. The method of claim 1 wherein the reaction instruction instructs the client computer system to transmit at least a portion of content stored in a memory of the client computer system, the method further comprising:
receiving the at least a portion of content; and
performing a malware scan on the received content. 7. The method of claim 1 wherein the profile is defined based on an analysis of one or more known malware software components such that the profile is suitable for identifying behavior consistent with the known malware. 8. The method of claim 1 wherein the client computer system is a resource constrained computer system such that executing a malware scan on the client computer system can be expected to cause a reduction in performance of the client computer system that denies at least some of the services, facilities or functions of the client computer system to a user of the client computer system for at least a portion of the duration of the malware scan. 9. The method of claim 1 wherein the behavioral operations are taken from a list including: network operations; process execution; data storage operations; the undertaking of telephony calls; the undertaking of messaging communications; service blocking; use of a camera associated with the client computer system; and use of a microphone associated with the client computer system. 10. A malware detection system to detect malware in a client computer system comprising:
a behavior profile generator adapted to generate a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; an interface adapted to communicate the behavior profile to the client computer system; and an identifier responsive to a message from the client computer system that the behavior profile is exhibited by the client computer system and adapted to identify a reaction instruction for performance by the client computer system, wherein the interface is further adapted to communicate the reaction instruction to the client computer system. 11. A malware detection system to detect malware in a client computer system, the malware detection system comprising a processor and a data store wherein the processor is adapted to undertake the following:
generating a behavior profile specifying operational behaviors of a computer system indicative of the existence of malware in the computer system; communicating the behavior profile to the client computer system; and in response to a message from the client computer system that the behavior profile is exhibited by the client computer system, identifying a reaction instruction for performance by the client computer system and communicating the reaction instruction to the client computer system. 12. A non-transitory computer-readable storage medium storing a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the method as claimed in claim 1. | 2,400 |
9,452 | 9,452 | 16,430,003 | 2,434 | Performing cryptographic operations such as encryption and decryption may be computationally expensive. In some contexts, initialization vectors and keystreams operable to perform encryption operations are generated and stored in a repository, and later retrieved for use in performing encryption operations. Multiple devices in a distributed system can each generate and store a subset of a larger set of keystreams. | 1. A system comprising memory to store instructions that, as a result of execution by one or more processors, cause the system to:
provide a key to a plurality of devices; cause the plurality of devices to collectively generate a set of keystreams using the key and a plurality of initialization vectors, a first portion of the plurality of initialization vectors being reserved for use by a first device of the plurality of devices and a second portion of the plurality of initialization vectors being reserved for use by a second device of the plurality of devices; identify a keystream of the set of keystreams that is unused for performance of cryptographic operations; and cause the keystream to be used to perform a cryptographic operation. 2. The system of claim 1, wherein the instructions that, as result of execution, cause the system to cause the keystream to be used to perform the cryptographic operation cause the system to perform the cryptographic operation in response to a request submitted to the system. 3. The system of claim 1, the set of keystreams is generated using a block cipher mode of operation. 4. The system of claim 3, wherein block cipher mode of operation is Advanced Encryption Standard Counter with CBC-MAC (AES-CCM). 5. A computer-implemented method, comprising:
providing a key to a plurality of devices; causing the plurality of devices to collectively generate a set of keystreams using the key and a plurality of initialization vectors, a first portion of the plurality of initialization vectors being reserved for use by a first device of the plurality of devices and a second portion of the plurality of initialization vectors being reserved for use by a second device of the plurality of devices; identifying a keystream of the set of keystreams that is unused for performance of cryptographic operations; and causing the keystream to be used to perform a cryptographic operation. 6. The computer-implemented method of claim 5, wherein causing the keystream to be used to perform the cryptographic operation comprises performing the cryptographic operation on a cryptographic key of a set of cryptographic keys that is managed by a key management service. 7. The computer-implemented method of claim 5, wherein causing the keystream to be used to perform the cryptographic operation comprises encrypting a data object to produce an encrypted data object. 8. The computer-implemented method of claim 7, further comprising obtaining the data object using a second key, wherein the second key is different from the key. 9. The computer-implemented method of claim 5, wherein each device of the plurality of devices is a security module. 10. The computer-implemented method of claim 5, wherein causing the plurality of devices to collectively generate the set of keystreams includes causing each device of the plurality of devices to generate a set of initialization vectors unused by any other device in the plurality of devices for generating keystreams. 11. The computer-implemented method of claim 10, wherein:
causing the keystream to be used to perform the cryptographic operation results in a set of encrypted data objects; and the method further comprises causing the set of encrypted data objects to be stored outside of the device. 12. The computer-implemented method of claim 10, wherein the key is programmatically unexportable from each device of the plurality of devices. 13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, if executed by one or more processors of a computer system, cause the computer system to at least:
provide a key to a plurality of devices; cause the plurality of devices to collectively generate a set of keystreams using the key and a plurality of initialization vectors, a first portion of the plurality of initialization vectors being reserved for use by a first device of the plurality of devices and a second portion of the plurality of initialization vectors being reserved for use by a second device of the plurality of devices; and cause a keystream of the set of keystreams that is unused for performance of cryptographic operations to be used to perform a cryptographic operation. 14. The non-transitory computer-readable storage medium of claim 13, wherein the cryptographic operation utilizes a stream cipher. 15. The non-transitory computer-readable storage medium of claim 14, wherein the stream cipher uses authenticated encryption. 16. The non-transitory computer-readable storage medium of claim 13, wherein the instructions that cause the plurality of devices to collectively generate the set of keystreams, if executed, cause the computer system to generate the set of keystreams using information specific to the plurality of devices. 17. The non-transitory computer-readable storage medium of claim 16, wherein the initialization vectors are determinable using the information specific to the plurality of devices. 18. The non-transitory computer-readable storage medium of claim 13, wherein the instructions to cause the keystream to be used to perform the cryptographic operation include instructions to:
make available, to a device of the plurality of devices a first encrypted data object, wherein the first encrypted data object is encrypted using a second key accessible to the plurality of devices; and obtain a second encrypted data object, wherein the second encrypted data object is encrypted using the key and the keystream. 19. The non-transitory computer-readable storage medium of claim 18, wherein the data object is a cryptographic key. 20. The non-transitory computer-readable storage medium of claim 13, further comprising instructions that, if executed by the one or more processors, cause the computer system to store an indication that the keystream was used for the performance of the cryptographic operation. | Performing cryptographic operations such as encryption and decryption may be computationally expensive. In some contexts, initialization vectors and keystreams operable to perform encryption operations are generated and stored in a repository, and later retrieved for use in performing encryption operations. Multiple devices in a distributed system can each generate and store a subset of a larger set of keystreams.1. A system comprising memory to store instructions that, as a result of execution by one or more processors, cause the system to:
provide a key to a plurality of devices; cause the plurality of devices to collectively generate a set of keystreams using the key and a plurality of initialization vectors, a first portion of the plurality of initialization vectors being reserved for use by a first device of the plurality of devices and a second portion of the plurality of initialization vectors being reserved for use by a second device of the plurality of devices; identify a keystream of the set of keystreams that is unused for performance of cryptographic operations; and cause the keystream to be used to perform a cryptographic operation. 2. The system of claim 1, wherein the instructions that, as result of execution, cause the system to cause the keystream to be used to perform the cryptographic operation cause the system to perform the cryptographic operation in response to a request submitted to the system. 3. The system of claim 1, the set of keystreams is generated using a block cipher mode of operation. 4. The system of claim 3, wherein block cipher mode of operation is Advanced Encryption Standard Counter with CBC-MAC (AES-CCM). 5. A computer-implemented method, comprising:
providing a key to a plurality of devices; causing the plurality of devices to collectively generate a set of keystreams using the key and a plurality of initialization vectors, a first portion of the plurality of initialization vectors being reserved for use by a first device of the plurality of devices and a second portion of the plurality of initialization vectors being reserved for use by a second device of the plurality of devices; identifying a keystream of the set of keystreams that is unused for performance of cryptographic operations; and causing the keystream to be used to perform a cryptographic operation. 6. The computer-implemented method of claim 5, wherein causing the keystream to be used to perform the cryptographic operation comprises performing the cryptographic operation on a cryptographic key of a set of cryptographic keys that is managed by a key management service. 7. The computer-implemented method of claim 5, wherein causing the keystream to be used to perform the cryptographic operation comprises encrypting a data object to produce an encrypted data object. 8. The computer-implemented method of claim 7, further comprising obtaining the data object using a second key, wherein the second key is different from the key. 9. The computer-implemented method of claim 5, wherein each device of the plurality of devices is a security module. 10. The computer-implemented method of claim 5, wherein causing the plurality of devices to collectively generate the set of keystreams includes causing each device of the plurality of devices to generate a set of initialization vectors unused by any other device in the plurality of devices for generating keystreams. 11. The computer-implemented method of claim 10, wherein:
causing the keystream to be used to perform the cryptographic operation results in a set of encrypted data objects; and the method further comprises causing the set of encrypted data objects to be stored outside of the device. 12. The computer-implemented method of claim 10, wherein the key is programmatically unexportable from each device of the plurality of devices. 13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, if executed by one or more processors of a computer system, cause the computer system to at least:
provide a key to a plurality of devices; cause the plurality of devices to collectively generate a set of keystreams using the key and a plurality of initialization vectors, a first portion of the plurality of initialization vectors being reserved for use by a first device of the plurality of devices and a second portion of the plurality of initialization vectors being reserved for use by a second device of the plurality of devices; and cause a keystream of the set of keystreams that is unused for performance of cryptographic operations to be used to perform a cryptographic operation. 14. The non-transitory computer-readable storage medium of claim 13, wherein the cryptographic operation utilizes a stream cipher. 15. The non-transitory computer-readable storage medium of claim 14, wherein the stream cipher uses authenticated encryption. 16. The non-transitory computer-readable storage medium of claim 13, wherein the instructions that cause the plurality of devices to collectively generate the set of keystreams, if executed, cause the computer system to generate the set of keystreams using information specific to the plurality of devices. 17. The non-transitory computer-readable storage medium of claim 16, wherein the initialization vectors are determinable using the information specific to the plurality of devices. 18. The non-transitory computer-readable storage medium of claim 13, wherein the instructions to cause the keystream to be used to perform the cryptographic operation include instructions to:
make available, to a device of the plurality of devices a first encrypted data object, wherein the first encrypted data object is encrypted using a second key accessible to the plurality of devices; and obtain a second encrypted data object, wherein the second encrypted data object is encrypted using the key and the keystream. 19. The non-transitory computer-readable storage medium of claim 18, wherein the data object is a cryptographic key. 20. The non-transitory computer-readable storage medium of claim 13, further comprising instructions that, if executed by the one or more processors, cause the computer system to store an indication that the keystream was used for the performance of the cryptographic operation. | 2,400 |
9,453 | 9,453 | 15,437,450 | 2,441 | The current document is directed to automated-application-release-management facilities that support aspect-oriented-programming-like insertion of plug-in-implemented advice into release pipelines. In a described implementation, advice is represented by entries in an advice set or aggregation. These entries encode rules, advice types, and references to advice-implementing plug-ins. During release-pipeline execution, calls to the advice-implementing plug-ins are inserted prior to and after tasks in workflows corresponding to the tasks that are then executed by a workflow-execution engine. Rules may include release-pipeline parameters and advice definitions may use wildcard characters and other elements of regular expression in pipeline, stage, and task names. | 1. An automated-application-release-management subsystem within a distributed computer system having multiple servers, data-storage devices, and one or more internal networks, the automated-application-release-management subsystem comprising:
a dashboard user interface; an automated-application-release-management controller that controls execution of release pipelines that each includes one or more stages that each includes one or more tasks; an interface to a workflow-execution engine; an artifact-storage-and-management subsystem; and advice entities that represent cross-cutting functionalities that are incorporated, by the automated-application-release-management controller, at particular points in one or more release pipelines for execution by the workflow-execution engine. 2. The automated-application-release-management subsystem of claim 1 that is further incorporated in a workflow-based distributed-computer-system-management system that additionally includes an infrastructure-management-administration subsystem and the workflow-execution engine. 3. The automated-application-release-management subsystem of claim 1 further including an advice set that stores entries that represent advice entities, the advice set implemented as one or more of:
one or more files;
one or more files and one or more associated indexes;
a database;
data structures stored in memory and/or mass-storage devices. 4. The automated-application-release-management subsystem of claim 3 wherein each advice-set entry includes a rule, a type, and a reference that is resolved to the location of a plug-in that implements advice logic. 5. The automated-application-release-management subsystem of claim 4 wherein the rule within an advice-set entry indicates one or more target tasks within one or more stages within one or more pipelines. 6. The automated-application-release-management subsystem of claim 5 wherein the type within the advice-set entry indicates whether a plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines before or after each target task. 7. The automated-application-release-management subsystem of claim 5 wherein the type within the advice-set entry further indicates whether the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines after each target task and called by the workflow execution engine when the target task does not successfully execute. 8. The automated-application-release-management subsystem of claim 4 wherein the rule within an advice-set entry indicates whether or not the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is called during execution of a pipeline by the workflow-execution engine. 9. The automated-application-release-management subsystem of claim 4 wherein the rule within an advice-set entry includes a logic expression that includes one or more pipeline parameters that include parameters input to and output by tasks. 10. The automated-application-release-management subsystem of claim 4 wherein the reference within an advice-set entry contains the location of a plug-in. 11. The automated-application-release-management subsystem of claim 4 wherein the reference within an advice-set entry contains the location of an advice-plug-in-framework entry that references a set of one or more plug-ins that represent alternative implementations of the advice logic; and wherein the reference resolves to a particular plug-in of the set of one or more plug-ins under control of one or more of:
one or more parameters,
one or more configuration files, and
a dashboard-user-interface dialogue. 12. A method that incorporates cross-cutting functionalities into release pipelines executed by an automated-application-release-management subsystem, operating within a distributed-computer system having multiple servers, data-storage devices, and one or more internal networks, modular, the method comprising:
storing advice entries that represent cross-cutting functionalities in an advice set; and incorporating, by an automated-application-release-management controller, cross-cutting functionalities at particular points in one or more release pipelines for execution by the workflow-execution engine using the advice set. 13. The method of claim 12 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
the automated-application-release-management controller;
an interface to the workflow-execution engine within the cloud-computing facility;
an artifact-storage-and-management subsystem;
an infrastructure-management-and-administration subsystem;
the advice set; and
the workflow-execution engine. 14. The method of claim 12 wherein the advice set implemented as one or more of:
one or more files;
one or more files and one or more associated indexes;
a database;
data structures stored in memory and/or mass-storage devices. 15. The method of claim 12 wherein each advice-set entry includes a rule, a type, and a reference that is resolved to the location of a plug-in that implements advice logic. 16. The method of claim 15 wherein the rule within an advice-set entry indicates one or more target tasks within one or more stages within one or more pipelines; wherein the type within the advice-set entry indicates whether a plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines before or after each target task; and wherein the type within the advice-set entry further indicates whether the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines after each target task and called by the workflow execution engine when the target task does not successfully execute. 17. The method of claim 12 wherein the rule within an advice-set entry indicates whether or not the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is called during execution of a pipeline by the workflow-execution engine. 18. The method of claim 4 wherein the rule within an advice-set entry includes a logic expression that includes one or more pipeline parameters that include parameters input to and output by tasks. 19. The method of claim 4 wherein the reference within an advice-set entry contains one of:
the location of a plug-in; and
the location of an advice-plug-in-framework entry that references a set of one or more plug-ins that represent alternative implementations of the advice logic. 20. Computer instructions, stored within one or more physical data-storage devices, that, when executed on one or more processors within a distributed computer system having multiple servers, data-storage devices, and one or more internal networks, control an automated-application-release-management subsystem having a dashboard user interface, an automated-application-release-management controller, an interface to the workflow-execution engine within the cloud-computing facility, an artifact-storage-and-management subsystem, an infrastructure-management-and-administration subsystem, an advice set, and a workflow-execution engine to:
store advice entries that represent cross-cutting functionalities in the advice set; and incorporate, by the automated-application-release-management controller, cross-cutting functionalities at particular points in one or more release pipelines for execution by the workflow-execution engine using the advice set. | The current document is directed to automated-application-release-management facilities that support aspect-oriented-programming-like insertion of plug-in-implemented advice into release pipelines. In a described implementation, advice is represented by entries in an advice set or aggregation. These entries encode rules, advice types, and references to advice-implementing plug-ins. During release-pipeline execution, calls to the advice-implementing plug-ins are inserted prior to and after tasks in workflows corresponding to the tasks that are then executed by a workflow-execution engine. Rules may include release-pipeline parameters and advice definitions may use wildcard characters and other elements of regular expression in pipeline, stage, and task names.1. An automated-application-release-management subsystem within a distributed computer system having multiple servers, data-storage devices, and one or more internal networks, the automated-application-release-management subsystem comprising:
a dashboard user interface; an automated-application-release-management controller that controls execution of release pipelines that each includes one or more stages that each includes one or more tasks; an interface to a workflow-execution engine; an artifact-storage-and-management subsystem; and advice entities that represent cross-cutting functionalities that are incorporated, by the automated-application-release-management controller, at particular points in one or more release pipelines for execution by the workflow-execution engine. 2. The automated-application-release-management subsystem of claim 1 that is further incorporated in a workflow-based distributed-computer-system-management system that additionally includes an infrastructure-management-administration subsystem and the workflow-execution engine. 3. The automated-application-release-management subsystem of claim 1 further including an advice set that stores entries that represent advice entities, the advice set implemented as one or more of:
one or more files;
one or more files and one or more associated indexes;
a database;
data structures stored in memory and/or mass-storage devices. 4. The automated-application-release-management subsystem of claim 3 wherein each advice-set entry includes a rule, a type, and a reference that is resolved to the location of a plug-in that implements advice logic. 5. The automated-application-release-management subsystem of claim 4 wherein the rule within an advice-set entry indicates one or more target tasks within one or more stages within one or more pipelines. 6. The automated-application-release-management subsystem of claim 5 wherein the type within the advice-set entry indicates whether a plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines before or after each target task. 7. The automated-application-release-management subsystem of claim 5 wherein the type within the advice-set entry further indicates whether the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines after each target task and called by the workflow execution engine when the target task does not successfully execute. 8. The automated-application-release-management subsystem of claim 4 wherein the rule within an advice-set entry indicates whether or not the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is called during execution of a pipeline by the workflow-execution engine. 9. The automated-application-release-management subsystem of claim 4 wherein the rule within an advice-set entry includes a logic expression that includes one or more pipeline parameters that include parameters input to and output by tasks. 10. The automated-application-release-management subsystem of claim 4 wherein the reference within an advice-set entry contains the location of a plug-in. 11. The automated-application-release-management subsystem of claim 4 wherein the reference within an advice-set entry contains the location of an advice-plug-in-framework entry that references a set of one or more plug-ins that represent alternative implementations of the advice logic; and wherein the reference resolves to a particular plug-in of the set of one or more plug-ins under control of one or more of:
one or more parameters,
one or more configuration files, and
a dashboard-user-interface dialogue. 12. A method that incorporates cross-cutting functionalities into release pipelines executed by an automated-application-release-management subsystem, operating within a distributed-computer system having multiple servers, data-storage devices, and one or more internal networks, modular, the method comprising:
storing advice entries that represent cross-cutting functionalities in an advice set; and incorporating, by an automated-application-release-management controller, cross-cutting functionalities at particular points in one or more release pipelines for execution by the workflow-execution engine using the advice set. 13. The method of claim 12 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
the automated-application-release-management controller;
an interface to the workflow-execution engine within the cloud-computing facility;
an artifact-storage-and-management subsystem;
an infrastructure-management-and-administration subsystem;
the advice set; and
the workflow-execution engine. 14. The method of claim 12 wherein the advice set implemented as one or more of:
one or more files;
one or more files and one or more associated indexes;
a database;
data structures stored in memory and/or mass-storage devices. 15. The method of claim 12 wherein each advice-set entry includes a rule, a type, and a reference that is resolved to the location of a plug-in that implements advice logic. 16. The method of claim 15 wherein the rule within an advice-set entry indicates one or more target tasks within one or more stages within one or more pipelines; wherein the type within the advice-set entry indicates whether a plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines before or after each target task; and wherein the type within the advice-set entry further indicates whether the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is incorporated at a point in the one or more release pipelines after each target task and called by the workflow execution engine when the target task does not successfully execute. 17. The method of claim 12 wherein the rule within an advice-set entry indicates whether or not the plug-in, the location of which is obtained by resolving the reference within the advice-set entry, is called during execution of a pipeline by the workflow-execution engine. 18. The method of claim 4 wherein the rule within an advice-set entry includes a logic expression that includes one or more pipeline parameters that include parameters input to and output by tasks. 19. The method of claim 4 wherein the reference within an advice-set entry contains one of:
the location of a plug-in; and
the location of an advice-plug-in-framework entry that references a set of one or more plug-ins that represent alternative implementations of the advice logic. 20. Computer instructions, stored within one or more physical data-storage devices, that, when executed on one or more processors within a distributed computer system having multiple servers, data-storage devices, and one or more internal networks, control an automated-application-release-management subsystem having a dashboard user interface, an automated-application-release-management controller, an interface to the workflow-execution engine within the cloud-computing facility, an artifact-storage-and-management subsystem, an infrastructure-management-and-administration subsystem, an advice set, and a workflow-execution engine to:
store advice entries that represent cross-cutting functionalities in the advice set; and incorporate, by the automated-application-release-management controller, cross-cutting functionalities at particular points in one or more release pipelines for execution by the workflow-execution engine using the advice set. | 2,400 |
9,454 | 9,454 | 14,452,804 | 2,425 | A lateral obstacle detection apparatus ( 1 ) for a motor vehicle ( 100 ), comprising:
at least a pair of stereo cameras ( 2, 3 ) for acquiring images; a unit ( 4 ) for processing the acquired images, a support ( 6 ) for the stereo cameras ( 2, 3 ), which has an elongated shape and extends prevalently along a pre-established direction (A) that is substantially perpendicular to a surface (P) on which the vehicle rests ( 100 ), the stereo cameras ( 2, 3 ) being mounted on the support ( 6 ) at different heights (h 1 , h 2 ) relative to the resting surface (P) and comprising coplanar sensors ( 5 ) arranged perpendicularly to the resting surface (P). | 1. Lateral obstacle detection apparatus for a motor vehicle, comprising:
at least one pair of stereo cameras for acquiring images; a unit for processing the acquired images, characterized in that it comprises a support for said stereo cameras, said support having an elongated shape and extending prevalently along a pre-established direction that is substantially perpendicular to a surface on which the vehicle rests, said stereo cameras being mounted on the support at different heights relative to said resting surface and comprising coplanar sensors arranged perpendicularly to the resting surface. 2. Detection apparatus according to claim 1, wherein the sensors of said cameras are substantially rectangular and oriented in such a way as to have the longer sides lying along a direction of forward travel of the vehicle on said resting surface. 3. Detection apparatus according to claim 1, wherein said sensors are of the CMOS or CCD type. 4. Detection apparatus according to claim 1, wherein said sensors acquire the images according to the global shutter technique. 5. Detection apparatus according to claim 1, wherein the height difference between said cameras is comprised between 100 mm and 500 mm. 6. Detection apparatus according to claim 1, wherein the processing unit is configured to perform a rectification, a distortion correction and a disparity calculation on the acquired images. 7. Motor vehicle comprising:
a lateral obstacle detection apparatus according to claim 1; a compartment for housing said support, said housing compartment being obtained in proximity to a side of the vehicle, said support being arranged in the housing compartment in such a way that said pre-established direction is substantially perpendicular to the surface on which the vehicle rests; a bodywork provided, on said side, with at least one through opening for access to said housing compartment. 8. Motor vehicle according to claim 7, wherein said support is rotatably pivoted on the bodywork so as to rotate around a rotation axis parallel to said pre-established direction in order to vary the overall orientation of the pair of stereo cameras. 9. Motor vehicle according to claim 7, wherein said at least through opening consists in a substantially rectangular cut made in the bodywork of the vehicle. 10. Motor vehicle according to claim 7, wherein said at least through opening is made between the fender of the front wheel and the front door. 11. Motor vehicle according to claim 7, wherein said at least a through opening is made in proximity to the rear wheel. 12. Motor vehicle according to claim 7, wherein said at least a through opening is made in a door. 13. Motor vehicle according to claim 7, wherein said at least a through opening is made in proximity to one of the lights. 14. Motor vehicle according to claim 7, wherein said bodywork presents a single recess obtained in correspondence to said through opening and housing said stereo cameras. 15. Motor vehicle according to claim 14, further comprising a grille removably applied on said through opening to mask it, said cameras being hanging-over mounted relative to the grille. 16. Motor vehicle according to claim 7, wherein said bodywork presents two through openings for access to said housing compartment, which are obtained on the same side of the vehicle, and two recesses obtained in correspondence to each of said through openings, each of said recesses housing one of the stereo cameras. 17. Motor vehicle according to claim 16, wherein each of said recesses is substantially shaped as a “drop” with a depth that decreases from the front zone to the rear zone of the vehicle. 18. Process for detecting lateral obstacles during the travel of a motor vehicle in a direction of forward travel on a resting surface, comprising the following steps:
arranging a pair of stereo cameras at different heights relative to the resting surface inside a housing compartment in proximity to a side of the vehicle itself; periodically acquiring frames of the lateral area of the vehicle by means of said stereo cameras; processing the acquired images to pinpoint the position of the lateral obstacles. | A lateral obstacle detection apparatus ( 1 ) for a motor vehicle ( 100 ), comprising:
at least a pair of stereo cameras ( 2, 3 ) for acquiring images; a unit ( 4 ) for processing the acquired images, a support ( 6 ) for the stereo cameras ( 2, 3 ), which has an elongated shape and extends prevalently along a pre-established direction (A) that is substantially perpendicular to a surface (P) on which the vehicle rests ( 100 ), the stereo cameras ( 2, 3 ) being mounted on the support ( 6 ) at different heights (h 1 , h 2 ) relative to the resting surface (P) and comprising coplanar sensors ( 5 ) arranged perpendicularly to the resting surface (P).1. Lateral obstacle detection apparatus for a motor vehicle, comprising:
at least one pair of stereo cameras for acquiring images; a unit for processing the acquired images, characterized in that it comprises a support for said stereo cameras, said support having an elongated shape and extending prevalently along a pre-established direction that is substantially perpendicular to a surface on which the vehicle rests, said stereo cameras being mounted on the support at different heights relative to said resting surface and comprising coplanar sensors arranged perpendicularly to the resting surface. 2. Detection apparatus according to claim 1, wherein the sensors of said cameras are substantially rectangular and oriented in such a way as to have the longer sides lying along a direction of forward travel of the vehicle on said resting surface. 3. Detection apparatus according to claim 1, wherein said sensors are of the CMOS or CCD type. 4. Detection apparatus according to claim 1, wherein said sensors acquire the images according to the global shutter technique. 5. Detection apparatus according to claim 1, wherein the height difference between said cameras is comprised between 100 mm and 500 mm. 6. Detection apparatus according to claim 1, wherein the processing unit is configured to perform a rectification, a distortion correction and a disparity calculation on the acquired images. 7. Motor vehicle comprising:
a lateral obstacle detection apparatus according to claim 1; a compartment for housing said support, said housing compartment being obtained in proximity to a side of the vehicle, said support being arranged in the housing compartment in such a way that said pre-established direction is substantially perpendicular to the surface on which the vehicle rests; a bodywork provided, on said side, with at least one through opening for access to said housing compartment. 8. Motor vehicle according to claim 7, wherein said support is rotatably pivoted on the bodywork so as to rotate around a rotation axis parallel to said pre-established direction in order to vary the overall orientation of the pair of stereo cameras. 9. Motor vehicle according to claim 7, wherein said at least through opening consists in a substantially rectangular cut made in the bodywork of the vehicle. 10. Motor vehicle according to claim 7, wherein said at least through opening is made between the fender of the front wheel and the front door. 11. Motor vehicle according to claim 7, wherein said at least a through opening is made in proximity to the rear wheel. 12. Motor vehicle according to claim 7, wherein said at least a through opening is made in a door. 13. Motor vehicle according to claim 7, wherein said at least a through opening is made in proximity to one of the lights. 14. Motor vehicle according to claim 7, wherein said bodywork presents a single recess obtained in correspondence to said through opening and housing said stereo cameras. 15. Motor vehicle according to claim 14, further comprising a grille removably applied on said through opening to mask it, said cameras being hanging-over mounted relative to the grille. 16. Motor vehicle according to claim 7, wherein said bodywork presents two through openings for access to said housing compartment, which are obtained on the same side of the vehicle, and two recesses obtained in correspondence to each of said through openings, each of said recesses housing one of the stereo cameras. 17. Motor vehicle according to claim 16, wherein each of said recesses is substantially shaped as a “drop” with a depth that decreases from the front zone to the rear zone of the vehicle. 18. Process for detecting lateral obstacles during the travel of a motor vehicle in a direction of forward travel on a resting surface, comprising the following steps:
arranging a pair of stereo cameras at different heights relative to the resting surface inside a housing compartment in proximity to a side of the vehicle itself; periodically acquiring frames of the lateral area of the vehicle by means of said stereo cameras; processing the acquired images to pinpoint the position of the lateral obstacles. | 2,400 |
9,455 | 9,455 | 14,923,153 | 2,423 | Systems and methods are disclosed for analyzing a fused sample of viewership data to determine a behavior profile of online viewers who watched and/or didn't watch certain TV advertisements, where the TV advertisements are aligned with campaign targeting characteristics desired by an advertiser/client working with a demand side platform. Then, a campaign targeting plan is developed for dividing an advertising budget between digital media and TV impressions. The digital media portion of the campaign profiles Media Properties (MPs) contained in a historical database from past digital advertising campaigns across multiple digital formats and screens, and aligns digital ad placement with MPs having desired targeting characteristics. An optimized apportionment is automatically produced between TV and digital media spending based on an advertiser/client's goals of duplicating or not duplicating viewership of an advertisement between TV and digital media, or alternately based on cost alone. Alternately, the apportionment can be guided interactively. | 1. A computerized method for planning an advertising campaign targeting both TV and online impressions, whereby one or more processors perform the computerized method, comprising:
receiving a fused data set of viewership data that includes TV viewing and digital media viewing of advertisements, and where for a plurality of viewers watching TV advertisements the fused data set includes digital media viewership data for those viewers; receiving a list of TV advertisements for an advertiser/client; analyzing the fused data set to:
for each of the listed TV advertisements, identify those viewers in the fused data set who are categorized as not watching the respective listed TV advertisement;
identify viewer characteristics of the viewers categorized as not watching the respective listed TV advertisement, and
produce a list of MPs visited by the viewers in the fused data set categorized as not watching the respective listed TV advertisement, and identify specific characteristics of those MPs;
receiving targeting criteria from the advertiser/client for a future campaign; and analyzing a historical database containing data from digital media advertising campaigns, and based on the received targeting criteria for the future campaign and the data from digital media advertising campaigns, producing a model for the future campaign that includes a proposed budget split between TV and digital media placement of advertisements. 2. The computerized method of claim 1 wherein the categorization of viewers not watching the listed TV advertisements includes viewers who did not watch the listed TV advertisements in the past. 3. The computerized method of claim 1 wherein the categorization of viewers not watching the listed TV advertisements includes one or both of viewers who did not watch the listed TV advertisements in the past or viewers who are projected to not watch the listed TV advertisements in the future. 4. The computerized method of claim 1 wherein the specific characteristics of the MPs in the list of MPs includes at least demographic characteristics. 5. The computerized method of claim 1 wherein the specific characteristics of the MPs in the list of MPs includes at least characteristics related to cost of purchasing impressions on each MP. 6. The computerized method of claim 1 wherein the specific characteristics of the MPs in the list of MPs includes at least reach characteristics. 7. The computerized method of claim 1 wherein the model for the future campaign is optimized for at least one of cost or reach. 8. The computerized method of claim 1 further comprising generating a target list of MPs visited by the viewers in the fused data set categorized as not watching the listed TV advertisements, and that are described in the historical database with respect to:
a demographic profile of each MP;
a historical cost of purchasing impressions on each MP; or
a historical reach of each MP. 9. The computerized method of claim 8 further comprising generating a combined target list for the future campaign by:
creating a combined list of TV demographic targets combined with the target list of MPs; and
sorting the combined list with respect to cost efficiency for on-target impressions. 10. The computerized method of claim 9 further comprising executing the future campaign by initially targeting advertising opportunities in the combined list that have a lowest cost for on-target impressions. 11. A computerized method for planning an advertising campaign targeting both TV and online impressions, whereby one or more processors perform the computerized method comprising:
receiving a fused data set of viewership data that includes TV viewing and digital media viewing of advertisements, and where for a plurality of viewers watching TV advertisements the fused data set includes digital media viewership data for those viewers; receiving a list of TV advertisements for an advertiser/client; analyzing the fused data set to:
for each of the listed TV advertisements, identify those viewers in the fused data set who are categorized as watching the respective listed TV advertisement;
identify viewer characteristics of the viewers categorized as watching the respective listed TV advertisement, and
produce a list of MPs visited by the viewers in the fused data set categorized as watching the respective listed TV advertisement, and identify specific characteristics of those MPs;
receiving targeting criteria from the advertiser/client for a future campaign; and analyzing a historical database containing data from digital media advertising campaigns, and based on the received targeting criteria for the future campaign and the data from digital media advertising campaigns, producing a model for the future campaign that includes a proposed budget split between TV and digital media placement of advertisements. 12. The computerized method of claim 11 wherein the categorization of viewers watching the listed TV advertisements includes viewers who watched the listed TV advertisements in the past. 13. The computerized method of claim 11 wherein the categorization of viewers watching the listed TV advertisements includes one or both of viewers who watched the listed TV advertisements in the past and viewers who are projected to watch the listed TV advertisements in the future. 14. The computerized method of claim 11 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements include at least demographic characteristics. 15. The computerized method of claim 11 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements include at least characteristics related to cost of purchasing impressions on each MP. 16. The computerized method of claim 11 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements include at least reach characteristics. 17. The computerized method of claim 11 wherein the model for the future campaign is optimized for at least one of cost and reach. 18. The computerized method of claim 11 further comprising generating a target list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements, and that are described in the historical database with respect to:
a demographic profile of each MP;
a historical cost of purchasing impressions on each MP; or
a historical reach of each MP. 19. The computerized method of claim 18 further comprising generating a combined target list for the future campaign by:
creating a combined list of TV demographic targets combined with the target list of MPs; and
sorting the combined list with respect to cost efficiency for on-target impressions. 20. The computerized method of claim 19 further comprising executing the future campaign by initially targeting advertising opportunities in the combined list that have a lowest cost for on-target impressions. 21. A computerized method for planning an advertising campaign targeting both TV and online impressions, whereby one or more processors perform the computerized method comprising:
receiving a fused data set of viewership data that includes TV viewing and digital media viewing of advertisements, and where for a plurality of viewers watching TV advertisements the fused data set includes digital media viewership data for those viewers; receiving a list of TV advertisements for an advertiser/client; analyzing the fused data set to:
for each of the listed TV advertisements, identify those viewers in the fused data set who are categorized as watching or not watching the respective listed TV advertisement;
identify viewer characteristics of the viewers categorized as watching or not watching the respective listed TV advertisement, and
produce a list of MPs visited by the viewers in the fused data set categorized as watching or not watching the respective listed TV advertisement, and identify specific characteristics of those MPs;
receiving targeting criteria from the advertiser/client for a future campaign; and analyzing a historical database containing data from digital media advertising campaigns, and based on the received targeting criteria for the future campaign and the data from digital media advertising campaigns, producing a model for the future campaign that includes a proposed budget split between TV and digital media placement of advertisements. 22. The computerized method of claim 21 wherein the categorization of viewers watching or not watching the listed TV advertisements includes viewers who watched or did not watch the listed TV advertisements in the past. 23. The computerized method of claim 21 wherein the categorization of viewers watching the listed TV advertisements includes one or both of viewers who watched or did not watch the listed TV advertisements in the past and viewers who are projected to watch or not watch the listed TV advertisements in the future. 24. The computerized method of claim 21 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set include at least demographic characteristics. 25. The computerized method of claim 21 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set include at least characteristics related to cost of purchasing impressions on each MP. 26. The computerized method of claim 21 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set include at least reach characteristics. 27. The computerized method of claim 21 wherein the model for the future campaign is optimized for at least one of cost and reach. 28. The computerized method of claim 21 further comprising generating a target list of MPs visited by the viewers in the fused data set categorized as watching or not watching the listed TV advertisements, and that are described in the historical database with respect to:
a demographic profile of each MP;
a historical cost of purchasing impressions on each MP; and
a historical reach of each MP. 29. The computerized method of claim 28 further comprising generating a combined target list for the future campaign by a computerized method further comprising:
creating a combined list of TV demographic targets combined with the target list of MPs; and
sorting the combined list with respect to cost efficiency for on-target impressions. 30. The computerized method of claim 29 further comprising executing the future campaign by initially targeting advertising opportunities in the combined list that have a lowest cost for on-target impressions. | Systems and methods are disclosed for analyzing a fused sample of viewership data to determine a behavior profile of online viewers who watched and/or didn't watch certain TV advertisements, where the TV advertisements are aligned with campaign targeting characteristics desired by an advertiser/client working with a demand side platform. Then, a campaign targeting plan is developed for dividing an advertising budget between digital media and TV impressions. The digital media portion of the campaign profiles Media Properties (MPs) contained in a historical database from past digital advertising campaigns across multiple digital formats and screens, and aligns digital ad placement with MPs having desired targeting characteristics. An optimized apportionment is automatically produced between TV and digital media spending based on an advertiser/client's goals of duplicating or not duplicating viewership of an advertisement between TV and digital media, or alternately based on cost alone. Alternately, the apportionment can be guided interactively.1. A computerized method for planning an advertising campaign targeting both TV and online impressions, whereby one or more processors perform the computerized method, comprising:
receiving a fused data set of viewership data that includes TV viewing and digital media viewing of advertisements, and where for a plurality of viewers watching TV advertisements the fused data set includes digital media viewership data for those viewers; receiving a list of TV advertisements for an advertiser/client; analyzing the fused data set to:
for each of the listed TV advertisements, identify those viewers in the fused data set who are categorized as not watching the respective listed TV advertisement;
identify viewer characteristics of the viewers categorized as not watching the respective listed TV advertisement, and
produce a list of MPs visited by the viewers in the fused data set categorized as not watching the respective listed TV advertisement, and identify specific characteristics of those MPs;
receiving targeting criteria from the advertiser/client for a future campaign; and analyzing a historical database containing data from digital media advertising campaigns, and based on the received targeting criteria for the future campaign and the data from digital media advertising campaigns, producing a model for the future campaign that includes a proposed budget split between TV and digital media placement of advertisements. 2. The computerized method of claim 1 wherein the categorization of viewers not watching the listed TV advertisements includes viewers who did not watch the listed TV advertisements in the past. 3. The computerized method of claim 1 wherein the categorization of viewers not watching the listed TV advertisements includes one or both of viewers who did not watch the listed TV advertisements in the past or viewers who are projected to not watch the listed TV advertisements in the future. 4. The computerized method of claim 1 wherein the specific characteristics of the MPs in the list of MPs includes at least demographic characteristics. 5. The computerized method of claim 1 wherein the specific characteristics of the MPs in the list of MPs includes at least characteristics related to cost of purchasing impressions on each MP. 6. The computerized method of claim 1 wherein the specific characteristics of the MPs in the list of MPs includes at least reach characteristics. 7. The computerized method of claim 1 wherein the model for the future campaign is optimized for at least one of cost or reach. 8. The computerized method of claim 1 further comprising generating a target list of MPs visited by the viewers in the fused data set categorized as not watching the listed TV advertisements, and that are described in the historical database with respect to:
a demographic profile of each MP;
a historical cost of purchasing impressions on each MP; or
a historical reach of each MP. 9. The computerized method of claim 8 further comprising generating a combined target list for the future campaign by:
creating a combined list of TV demographic targets combined with the target list of MPs; and
sorting the combined list with respect to cost efficiency for on-target impressions. 10. The computerized method of claim 9 further comprising executing the future campaign by initially targeting advertising opportunities in the combined list that have a lowest cost for on-target impressions. 11. A computerized method for planning an advertising campaign targeting both TV and online impressions, whereby one or more processors perform the computerized method comprising:
receiving a fused data set of viewership data that includes TV viewing and digital media viewing of advertisements, and where for a plurality of viewers watching TV advertisements the fused data set includes digital media viewership data for those viewers; receiving a list of TV advertisements for an advertiser/client; analyzing the fused data set to:
for each of the listed TV advertisements, identify those viewers in the fused data set who are categorized as watching the respective listed TV advertisement;
identify viewer characteristics of the viewers categorized as watching the respective listed TV advertisement, and
produce a list of MPs visited by the viewers in the fused data set categorized as watching the respective listed TV advertisement, and identify specific characteristics of those MPs;
receiving targeting criteria from the advertiser/client for a future campaign; and analyzing a historical database containing data from digital media advertising campaigns, and based on the received targeting criteria for the future campaign and the data from digital media advertising campaigns, producing a model for the future campaign that includes a proposed budget split between TV and digital media placement of advertisements. 12. The computerized method of claim 11 wherein the categorization of viewers watching the listed TV advertisements includes viewers who watched the listed TV advertisements in the past. 13. The computerized method of claim 11 wherein the categorization of viewers watching the listed TV advertisements includes one or both of viewers who watched the listed TV advertisements in the past and viewers who are projected to watch the listed TV advertisements in the future. 14. The computerized method of claim 11 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements include at least demographic characteristics. 15. The computerized method of claim 11 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements include at least characteristics related to cost of purchasing impressions on each MP. 16. The computerized method of claim 11 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements include at least reach characteristics. 17. The computerized method of claim 11 wherein the model for the future campaign is optimized for at least one of cost and reach. 18. The computerized method of claim 11 further comprising generating a target list of MPs visited by the viewers in the fused data set categorized as watching the listed TV advertisements, and that are described in the historical database with respect to:
a demographic profile of each MP;
a historical cost of purchasing impressions on each MP; or
a historical reach of each MP. 19. The computerized method of claim 18 further comprising generating a combined target list for the future campaign by:
creating a combined list of TV demographic targets combined with the target list of MPs; and
sorting the combined list with respect to cost efficiency for on-target impressions. 20. The computerized method of claim 19 further comprising executing the future campaign by initially targeting advertising opportunities in the combined list that have a lowest cost for on-target impressions. 21. A computerized method for planning an advertising campaign targeting both TV and online impressions, whereby one or more processors perform the computerized method comprising:
receiving a fused data set of viewership data that includes TV viewing and digital media viewing of advertisements, and where for a plurality of viewers watching TV advertisements the fused data set includes digital media viewership data for those viewers; receiving a list of TV advertisements for an advertiser/client; analyzing the fused data set to:
for each of the listed TV advertisements, identify those viewers in the fused data set who are categorized as watching or not watching the respective listed TV advertisement;
identify viewer characteristics of the viewers categorized as watching or not watching the respective listed TV advertisement, and
produce a list of MPs visited by the viewers in the fused data set categorized as watching or not watching the respective listed TV advertisement, and identify specific characteristics of those MPs;
receiving targeting criteria from the advertiser/client for a future campaign; and analyzing a historical database containing data from digital media advertising campaigns, and based on the received targeting criteria for the future campaign and the data from digital media advertising campaigns, producing a model for the future campaign that includes a proposed budget split between TV and digital media placement of advertisements. 22. The computerized method of claim 21 wherein the categorization of viewers watching or not watching the listed TV advertisements includes viewers who watched or did not watch the listed TV advertisements in the past. 23. The computerized method of claim 21 wherein the categorization of viewers watching the listed TV advertisements includes one or both of viewers who watched or did not watch the listed TV advertisements in the past and viewers who are projected to watch or not watch the listed TV advertisements in the future. 24. The computerized method of claim 21 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set include at least demographic characteristics. 25. The computerized method of claim 21 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set include at least characteristics related to cost of purchasing impressions on each MP. 26. The computerized method of claim 21 wherein the specific characteristics of the MPs in the list of MPs visited by the viewers in the fused data set include at least reach characteristics. 27. The computerized method of claim 21 wherein the model for the future campaign is optimized for at least one of cost and reach. 28. The computerized method of claim 21 further comprising generating a target list of MPs visited by the viewers in the fused data set categorized as watching or not watching the listed TV advertisements, and that are described in the historical database with respect to:
a demographic profile of each MP;
a historical cost of purchasing impressions on each MP; and
a historical reach of each MP. 29. The computerized method of claim 28 further comprising generating a combined target list for the future campaign by a computerized method further comprising:
creating a combined list of TV demographic targets combined with the target list of MPs; and
sorting the combined list with respect to cost efficiency for on-target impressions. 30. The computerized method of claim 29 further comprising executing the future campaign by initially targeting advertising opportunities in the combined list that have a lowest cost for on-target impressions. | 2,400 |
9,456 | 9,456 | 15,394,385 | 2,435 | Disclosed are systems, methods, and non-transitory computer-readable storage media for malware detection and content item recovery. For example, a content management system can receive information describing changes made to content items stored on a user device. The content management system can analyze the information to determine if the described changes are related to malicious software on the user device. When the changes are related to malicious software, the content management system can determine which content items are effected by the malicious software and/or determine when the malicious software first started making changes to the user device. The content management system can recover effected content items associated with the user device by replacing the effected versions of the content items with versions of the content items that existed immediately before the malicious software started making changes to the user device. | 1. A method comprising:
receiving, at a content management system from a client device, a change set including change entries describing changes to content items at a client device; storing, by the content management system, the received change set in a repository of change sets; comparing, by the content management system, each change entry in the change set to one or more malware detection rules; determining, by the content management system, that a threshold number of the change entries in the change set satisfies at least one of the malware detection rules; in response to determining that the threshold number of the change entries satisfies at least one of the malware detection rules, determining, by the content management system, that the client device likely has malicious software; and initiating a full scan of the stored change sets associated with the client device to confirm that the client device has malicious software. 2. The method of claim 1, further comprising:
automatically confirming, by the content management system, that the client device has malicious software during the full scan of the stored change sets associated with the client device; sending a notification to a client device indicating that the client device is infected with malicious software; receiving, by the content management system, instructions to suspend synchronization of content items between the content management system and the client device; and in response to receiving the instructions, suspending synchronization of content items between the content management system and the client device. 3. The method of claim 1, further comprising:
automatically determining, by the content management system, content items affected by the malicious software. 4. The method of claim 3, further comprising:
automatically determining, by the content management system, a start time corresponding to the first change entry associated with the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 5. The method of claim 4, wherein restoring the previous version of each content item affected by the malicious software includes:
automatically restoring, by the content management system, the previous version of each content item affected by the malicious software, the previous version corresponding to the latest version of the corresponding content item that existed immediately before the start time. 6. The method of claim 2, further comprising:
receiving, by the content management system, a message from the client device indicating that the malicious software is removed from the client device; and in response to receiving the message, resuming synchronization of content items between the content management system and the client device. 7. The method of claim 1, further comprising:
sending, by the content management system, a first message indicating that the client device is infected with malicious software; receiving, by the content management system, a second message indicating that the content management system should restore content items affected by the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 8. A non-transitory computer readable medium including one or more sequences of instructions that, when executed by one or more processors, cause the processors to perform operations comprising:
receiving, at a content management system from a client device, a change set including change entries describing changes to content items at a client device, where the client device is associated with a first user in a team of users of the content management system; storing, by the content management system, the received change set in a repository of change sets; comparing, by the content management system, each change entry in the change set to one or more malware detection rules, where the comparing is performed by a plurality of rule handlers, including a first rule handler for comparing each change set entry to a first malware detection rule and a second rule handler for comparing each change set entry to a second malware detection rule that is different than the first malware detection rule; determining, by the content management system, that a threshold number of the change entries in the change set satisfies at least one of the malware detection rules; in response to determining that the threshold number of the change entries satisfies at least one of the malware detection rules, determining, by the content management system, that the client device likely has malicious software; and initiating a full scan of the stored change sets associated with the client device to confirm that the client device has malicious software. 9. The non-transitory computer readable medium of claim 8, where the instructions cause the processors to perform operations comprising:
automatically confirming, by the content management system, that the client device has malicious software during the full scan of the stored change sets associated with the client device; and in response to confirming that the client device has malicious software, sending a message to the first user and an administrator user for the team of users indicating that the client device has malicious software; receiving a message indicating that the administrator user wishes to suspend synchronization of content items between the content management system and the client device; and in response to receiving the message, suspending synchronization of content items between the content management system and the client device. 10. The non-transitory computer readable medium of claim 8, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, content items affected by the malicious software. 11. The non-transitory computer readable medium of claim 10, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, a start time corresponding to the first change entry associated with the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 12. The non-transitory computer readable medium of claim 11, wherein the restoring is performed in response to receiving a request from an administrator user of the team of content management system users to restore the previous version of each content item affected by the malicious software. 13. The non-transitory computer readable medium of claim 9, where the instructions cause the processors to perform operations comprising:
receiving, by the content management system, a message from the administrator user indicating that the malicious software is removed from the client device; and in response to receiving the message, resuming synchronization of content items between the content management system and the client device. 14. The non-transitory computer readable medium of claim 8, where the instructions cause the processors to perform operations comprising:
sending, by the content management system, a first message indicating that the client device is infected with malicious software; receiving, by the content management system, a second message indicating that an administrator user of the team of users of content management system wishes to restore content items affected by the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 15. A content management system comprising:
one or more processors; and a non-transitory computer readable medium including one or more sequences of instructions that, when executed by one or more processors, cause the processors to perform operations comprising:
receiving, at the content management system from a client device, a change set including change entries describing changes to content items synchronized with a user account on the content management system, wherein the client device is authorized on the user account;
storing, by the content management system, the received change set in a repository of change sets;
comparing, by the content management system, each change entry in the change set to one or more malware detection rules;
determining, by the content management system, that a threshold number of the change entries in the change set satisfies at least one of the malware detection rules;
in response to determining that the threshold number of the change entries satisfies at least one of the malware detection rules, determining, by the content management system, that the client device likely has malicious software. 16. The content management system of claim 15, where the instructions cause the processors to perform operations comprising:
automatically confirming, by the content management system, that the client device has malicious software during the full scan of the stored change sets associated with the client device; and in response to confirming that the client device has malicious software, automatically suspending synchronization of content items between the content management system and the client device. 17. The content management system of claim 15, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, content items affected by the malicious software. 18. The content management system of claim 17, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, a start time corresponding to the first change entry associated with the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 19. The content management system of claim 18, where the instructions cause the processors to perform operations comprising:
in response to determining that the client device likely has malicious software, initiating a full scan of the stored change sets associated with the client device to confirm that the client device has malicious software. 20. The content management system of claim 16, where the instructions cause the processors to perform operations comprising:
receiving, by the content management system, a message associated with the user account indicating that the malicious software is removed from the client device; and in response to receiving the message, resuming synchronization of content items between the content management system and the client device. 21. The content management system of claim 15, where the instructions cause the processors to perform operations comprising:
sending, by the content management system, a first message to the client device indicating that the client device is infected with malicious software; receiving, by the content management system, a second message indicating that a user of the client device wishes to restore content items affected by the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. | Disclosed are systems, methods, and non-transitory computer-readable storage media for malware detection and content item recovery. For example, a content management system can receive information describing changes made to content items stored on a user device. The content management system can analyze the information to determine if the described changes are related to malicious software on the user device. When the changes are related to malicious software, the content management system can determine which content items are effected by the malicious software and/or determine when the malicious software first started making changes to the user device. The content management system can recover effected content items associated with the user device by replacing the effected versions of the content items with versions of the content items that existed immediately before the malicious software started making changes to the user device.1. A method comprising:
receiving, at a content management system from a client device, a change set including change entries describing changes to content items at a client device; storing, by the content management system, the received change set in a repository of change sets; comparing, by the content management system, each change entry in the change set to one or more malware detection rules; determining, by the content management system, that a threshold number of the change entries in the change set satisfies at least one of the malware detection rules; in response to determining that the threshold number of the change entries satisfies at least one of the malware detection rules, determining, by the content management system, that the client device likely has malicious software; and initiating a full scan of the stored change sets associated with the client device to confirm that the client device has malicious software. 2. The method of claim 1, further comprising:
automatically confirming, by the content management system, that the client device has malicious software during the full scan of the stored change sets associated with the client device; sending a notification to a client device indicating that the client device is infected with malicious software; receiving, by the content management system, instructions to suspend synchronization of content items between the content management system and the client device; and in response to receiving the instructions, suspending synchronization of content items between the content management system and the client device. 3. The method of claim 1, further comprising:
automatically determining, by the content management system, content items affected by the malicious software. 4. The method of claim 3, further comprising:
automatically determining, by the content management system, a start time corresponding to the first change entry associated with the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 5. The method of claim 4, wherein restoring the previous version of each content item affected by the malicious software includes:
automatically restoring, by the content management system, the previous version of each content item affected by the malicious software, the previous version corresponding to the latest version of the corresponding content item that existed immediately before the start time. 6. The method of claim 2, further comprising:
receiving, by the content management system, a message from the client device indicating that the malicious software is removed from the client device; and in response to receiving the message, resuming synchronization of content items between the content management system and the client device. 7. The method of claim 1, further comprising:
sending, by the content management system, a first message indicating that the client device is infected with malicious software; receiving, by the content management system, a second message indicating that the content management system should restore content items affected by the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 8. A non-transitory computer readable medium including one or more sequences of instructions that, when executed by one or more processors, cause the processors to perform operations comprising:
receiving, at a content management system from a client device, a change set including change entries describing changes to content items at a client device, where the client device is associated with a first user in a team of users of the content management system; storing, by the content management system, the received change set in a repository of change sets; comparing, by the content management system, each change entry in the change set to one or more malware detection rules, where the comparing is performed by a plurality of rule handlers, including a first rule handler for comparing each change set entry to a first malware detection rule and a second rule handler for comparing each change set entry to a second malware detection rule that is different than the first malware detection rule; determining, by the content management system, that a threshold number of the change entries in the change set satisfies at least one of the malware detection rules; in response to determining that the threshold number of the change entries satisfies at least one of the malware detection rules, determining, by the content management system, that the client device likely has malicious software; and initiating a full scan of the stored change sets associated with the client device to confirm that the client device has malicious software. 9. The non-transitory computer readable medium of claim 8, where the instructions cause the processors to perform operations comprising:
automatically confirming, by the content management system, that the client device has malicious software during the full scan of the stored change sets associated with the client device; and in response to confirming that the client device has malicious software, sending a message to the first user and an administrator user for the team of users indicating that the client device has malicious software; receiving a message indicating that the administrator user wishes to suspend synchronization of content items between the content management system and the client device; and in response to receiving the message, suspending synchronization of content items between the content management system and the client device. 10. The non-transitory computer readable medium of claim 8, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, content items affected by the malicious software. 11. The non-transitory computer readable medium of claim 10, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, a start time corresponding to the first change entry associated with the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 12. The non-transitory computer readable medium of claim 11, wherein the restoring is performed in response to receiving a request from an administrator user of the team of content management system users to restore the previous version of each content item affected by the malicious software. 13. The non-transitory computer readable medium of claim 9, where the instructions cause the processors to perform operations comprising:
receiving, by the content management system, a message from the administrator user indicating that the malicious software is removed from the client device; and in response to receiving the message, resuming synchronization of content items between the content management system and the client device. 14. The non-transitory computer readable medium of claim 8, where the instructions cause the processors to perform operations comprising:
sending, by the content management system, a first message indicating that the client device is infected with malicious software; receiving, by the content management system, a second message indicating that an administrator user of the team of users of content management system wishes to restore content items affected by the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 15. A content management system comprising:
one or more processors; and a non-transitory computer readable medium including one or more sequences of instructions that, when executed by one or more processors, cause the processors to perform operations comprising:
receiving, at the content management system from a client device, a change set including change entries describing changes to content items synchronized with a user account on the content management system, wherein the client device is authorized on the user account;
storing, by the content management system, the received change set in a repository of change sets;
comparing, by the content management system, each change entry in the change set to one or more malware detection rules;
determining, by the content management system, that a threshold number of the change entries in the change set satisfies at least one of the malware detection rules;
in response to determining that the threshold number of the change entries satisfies at least one of the malware detection rules, determining, by the content management system, that the client device likely has malicious software. 16. The content management system of claim 15, where the instructions cause the processors to perform operations comprising:
automatically confirming, by the content management system, that the client device has malicious software during the full scan of the stored change sets associated with the client device; and in response to confirming that the client device has malicious software, automatically suspending synchronization of content items between the content management system and the client device. 17. The content management system of claim 15, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, content items affected by the malicious software. 18. The content management system of claim 17, where the instructions cause the processors to perform operations comprising:
automatically determining, by the content management system, a start time corresponding to the first change entry associated with the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. 19. The content management system of claim 18, where the instructions cause the processors to perform operations comprising:
in response to determining that the client device likely has malicious software, initiating a full scan of the stored change sets associated with the client device to confirm that the client device has malicious software. 20. The content management system of claim 16, where the instructions cause the processors to perform operations comprising:
receiving, by the content management system, a message associated with the user account indicating that the malicious software is removed from the client device; and in response to receiving the message, resuming synchronization of content items between the content management system and the client device. 21. The content management system of claim 15, where the instructions cause the processors to perform operations comprising:
sending, by the content management system, a first message to the client device indicating that the client device is infected with malicious software; receiving, by the content management system, a second message indicating that a user of the client device wishes to restore content items affected by the malicious software; and restoring, by the content management system, a previous version of each content item affected by the malicious software, the previous version corresponding to a latest version of the corresponding content item that existed immediately before the start time. | 2,400 |
9,457 | 9,457 | 15,948,189 | 2,413 | A guard period for switching between uplink and downlink subframes is created by shortening an uplink subframe, i.e., by not transmitting during one or more symbol intervals at the beginning of the subframe interval. A grant message includes signaling indicating when a shortened subframe should be transmitted. An example method is implemented in a first wireless node configured to transmit data in transmit subframes occurring at defined subframe intervals and having a predetermined number of symbol intervals. This example method includes determining that a transmit subframe is to be shortened, relative to the predetermined number of symbol intervals and, in response to this determination, shortening transmission of the transmit subframe by not transmitting during a beginning portion of the subframe interval for the transmit subframe and transmitting during the remainder of the subframe interval. | 1. A method in a first wireless node configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the method comprising:
receiving, from a second wireless node, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, transmitting the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 2. The method of claim 1, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 3. The method claim 1, further comprising switching from reception mode to transmission mode during the one or more symbol intervals not used for transmission at the beginning of the subframe interval for the transmit subframe. 4. The method of claim 1, wherein the first wireless node is a User Equipment (UE). 5. The method of claim 1, wherein the second wireless node is a radio base station. 6. A method in a second wireless node configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the method comprising:
transmitting, to a first wireless node, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receiving a first subframe from the first wireless node in accordance with the grant message, during the subframe interval. 7. The method of claim 6, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 8. The method of claim 6, wherein the first wireless node is a User Equipment (UE). 9. The method of claim 6, wherein the second wireless node is a radio base station. 10. A first wireless node and a transmitter circuit respectively configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, and a processing circuit configured to control a receiver circuit and the transmitter circuit is further configured to:
receive, from a second wireless node, via the receiver circuit, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, control the transmitter circuit to transmit the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 11. The first wireless node of claim 10, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 12. The first wireless node of claim 10, wherein the processing circuit is configured to control the receiver circuit and transmitter circuit to switch from reception mode to transmission mode during the one or more symbol intervals not used for transmission at the beginning of the subframe interval for the transmit subframe. 13. The first wireless node of claim 10, wherein the first wireless node is a User Equipment (UE). 14. The first wireless node of claim 10, wherein the second wireless node is a radio base station. 15. A second wireless node, comprising a transmitter circuit and a receiver circuit respectively configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, and a processing circuit configured to control the receiver circuit and the transmitter circuit, wherein the processing circuit is further configured to:
transmit to a first wireless node, via the transmitter circuit, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receive a first subframe from the first wireless node, via the receiver circuit in accordance with the grant message, during the subframe interval. 16. The second wireless node of claim 15, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 17. The second wireless node of claim 15, wherein the first wireless node is a User Equipment (UE). 18. The second wireless node of claim 15, wherein the second wireless node is a radio base station. 19. A computer program for a first wireless node configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the computer program comprising computer program code that, when executed by the first wireless node, causes the first wireless node to perform the steps of:
receiving, from a second wireless node, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, transmitting the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 20. A computer program for a second wireless node configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the computer program comprising computer program code that, when executed by the second wireless node, causes the second wireless node to perform the steps of:
transmitting, to a first wireless node, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receiving a first subframe from the first wireless node in accordance with the grant message, during the subframe interval. 21. A non-transitory computer-readable medium having a computer program stored thereupon, the computer program comprising computer program code that, when executed by a first wireless node configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, causes the first wireless node to perform the steps of:
receiving, from a second wireless node, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, transmitting the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 22. A non-transitory computer-readable medium having a computer program stored thereupon, the computer program comprising computer program code that, when executed by a second wireless node configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, causes the second wireless node to perform the steps of:
transmitting, to a first wireless node, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receiving a first subframe from the first wireless node in accordance with the grant message, during the subframe interval. | A guard period for switching between uplink and downlink subframes is created by shortening an uplink subframe, i.e., by not transmitting during one or more symbol intervals at the beginning of the subframe interval. A grant message includes signaling indicating when a shortened subframe should be transmitted. An example method is implemented in a first wireless node configured to transmit data in transmit subframes occurring at defined subframe intervals and having a predetermined number of symbol intervals. This example method includes determining that a transmit subframe is to be shortened, relative to the predetermined number of symbol intervals and, in response to this determination, shortening transmission of the transmit subframe by not transmitting during a beginning portion of the subframe interval for the transmit subframe and transmitting during the remainder of the subframe interval.1. A method in a first wireless node configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the method comprising:
receiving, from a second wireless node, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, transmitting the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 2. The method of claim 1, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 3. The method claim 1, further comprising switching from reception mode to transmission mode during the one or more symbol intervals not used for transmission at the beginning of the subframe interval for the transmit subframe. 4. The method of claim 1, wherein the first wireless node is a User Equipment (UE). 5. The method of claim 1, wherein the second wireless node is a radio base station. 6. A method in a second wireless node configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the method comprising:
transmitting, to a first wireless node, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receiving a first subframe from the first wireless node in accordance with the grant message, during the subframe interval. 7. The method of claim 6, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 8. The method of claim 6, wherein the first wireless node is a User Equipment (UE). 9. The method of claim 6, wherein the second wireless node is a radio base station. 10. A first wireless node and a transmitter circuit respectively configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, and a processing circuit configured to control a receiver circuit and the transmitter circuit is further configured to:
receive, from a second wireless node, via the receiver circuit, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, control the transmitter circuit to transmit the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 11. The first wireless node of claim 10, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 12. The first wireless node of claim 10, wherein the processing circuit is configured to control the receiver circuit and transmitter circuit to switch from reception mode to transmission mode during the one or more symbol intervals not used for transmission at the beginning of the subframe interval for the transmit subframe. 13. The first wireless node of claim 10, wherein the first wireless node is a User Equipment (UE). 14. The first wireless node of claim 10, wherein the second wireless node is a radio base station. 15. A second wireless node, comprising a transmitter circuit and a receiver circuit respectively configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, and a processing circuit configured to control the receiver circuit and the transmitter circuit, wherein the processing circuit is further configured to:
transmit to a first wireless node, via the transmitter circuit, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receive a first subframe from the first wireless node, via the receiver circuit in accordance with the grant message, during the subframe interval. 16. The second wireless node of claim 15, wherein the information indicating that fewer symbol intervals will be utilized specifies a number of symbol intervals that are not utilized at the beginning of the subframe interval. 17. The second wireless node of claim 15, wherein the first wireless node is a User Equipment (UE). 18. The second wireless node of claim 15, wherein the second wireless node is a radio base station. 19. A computer program for a first wireless node configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the computer program comprising computer program code that, when executed by the first wireless node, causes the first wireless node to perform the steps of:
receiving, from a second wireless node, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, transmitting the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 20. A computer program for a second wireless node configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, the computer program comprising computer program code that, when executed by the second wireless node, causes the second wireless node to perform the steps of:
transmitting, to a first wireless node, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receiving a first subframe from the first wireless node in accordance with the grant message, during the subframe interval. 21. A non-transitory computer-readable medium having a computer program stored thereupon, the computer program comprising computer program code that, when executed by a first wireless node configured to receive and transmit data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, causes the first wireless node to perform the steps of:
receiving, from a second wireless node, a grant message indicating that the first wireless node is scheduled in a transmit subframe, the grant message containing information indicating that fewer symbol intervals will be utilized in the transmit subframe than in the normal subframe; and, in response to said information indicating that fewer symbol intervals will be utilized, transmitting the transmit subframe in accordance with the grant message by not transmitting in one or more symbol intervals at the beginning of a subframe interval for the transmit subframe and transmitting in symbol intervals of the remainder of the subframe interval. 22. A non-transitory computer-readable medium having a computer program stored thereupon, the computer program comprising computer program code that, when executed by a second wireless node configured to transmit and receive data in subframes of a Time Division Duplex system occurring at defined subframe intervals, wherein a predetermined number of symbol intervals is used in a normal subframe, causes the second wireless node to perform the steps of:
transmitting, to a first wireless node, a grant message indicating that the first wireless node is scheduled for transmission in a subframe during a subframe interval, the grant message containing information indicating that fewer symbol intervals will be utilized in the subframe transmitted by the first wireless node during the subframe interval than in the normal subframe by not transmitting in one or more symbol intervals at the beginning of the subframe interval; and receiving a first subframe from the first wireless node in accordance with the grant message, during the subframe interval. | 2,400 |
9,458 | 9,458 | 16,016,588 | 2,434 | A method and apparatus for handling security keys for individual bearers of the user equipment include dividing between a plurality of different sub-groups, a plurality of individual bearers, each sub-group having a different base value from which the security keys for the associated bearers are derived. When the security keys associated with the individual bearers of one particular sub-group are refreshed, the security keys of the individual bearers, which are not a part of the particular sub-group do not need to be refreshed. | 1. A method in a user equipment for handling security keys for individual bearers of the user equipment, the method comprising:
dividing between a plurality of different sub-groups, a plurality of individual bearers, each sub-group having a different base value from which the security keys for the associated bearers are derived; wherein, when the security keys associated with the individual bearers of one particular sub-group are refreshed, the security keys of the individual bearers, which are not a part of the particular sub-group do not need to be refreshed. 2. A method in accordance with claim 1, wherein the plurality of different sub-groups include bearers which distinguish between a type of information being conveyed by the bearer including control information and data information. 3. A method in accordance with claim 1, wherein the plurality of different sub-groups include bearers which distinguish between a type of connectivity between multiple networks which is supported by the bearer including a master cell group bearer supporting connectivity with a master cell, a secondary cell group bearer supporting connectivity with a secondary cell, and a split cell group bearer supporting connectivity with both the master cell and the secondary cell. 4. A method in accordance with claim 1, wherein the security keys of the individual bearers include a security key for supporting data encryption, and a security key for verifying integrity of the signaling. 5. A method in accordance with claim 1, wherein the security keys associated with each of the individual bearers are one of user plane keys or control plane keys. 6. A method in accordance with claim 1, wherein each of the different respective base values used with each of the different sub-groups are derived from a common source value. 7. A method in accordance with claim 1, wherein each of the individual bearers is associated with a different respective one of the plurality of different sub-groups. 8. A method in accordance with claim 1, wherein the plurality of different sub-groups include a sub-group for master cell group bearers, a sub-group for secondary cell group bearers, and a sub-group for split cell group bearers. 9. A method in accordance with claim 1, wherein the plurality of different sub-groups include a sub-group for master cell group bearers conveying control information, a sub-group for master cell group bearers conveying data information, a sub-group for secondary cell group bearers conveying control information, a sub-group for secondary cell group bearers conveying data information, a sub-group for split cell group bearers conveying control information, and a sub-group for split cell group bearers conveying data information. 10. A method in accordance with claim 1, wherein the plurality of different sub-groups include a sub-group for master cell group bearers and secondary cell group bearers, and a sub-group for split cell group bearers. 11. A method in accordance with claim 1 further comprising:
creating security keys for each of the plurality of individual bearers, based upon the base value of the sub-group to which the individual bearer is associated;
using the corresponding security keys in support of the conveyance of information between each of the individual bearers and one or more of multiple networks;
detecting the need for a refresh of the security keys relative to at least one of the individual bearers, which is associated with one of the plurality of different sub-groups; and
refreshing the security keys for each of the individual bearers associated with the one of the plurality of different sub-groups, wherein the security keys of the individual bearers, which are not part of the one of the plurality of different sub-groups are not refreshed. 12. A method in accordance with claim 11, wherein the conveyance of information between each of the individual bearers and the one or more of multiple networks includes a count value, which is used as an input for at least one of the ciphering and integrity protection relative to the security keys; and wherein detecting the need for a refresh of the security keys relative to at least one of the individual bearers includes detecting a count wrap-around. 13. A method in accordance with claim 12, wherein the count value associated with a particular bearer is associated with a bearer having an identity value, where the identity value can be used with the count value to distinguish between the different count values, which are each associated with a respective one of the bearers. 14. A method in accordance with claim 11, wherein detecting the need for a refresh of the security keys relative to at least one of the individual bearers includes detecting the need for a handover. 15. A user equipment having dual connectivity with at least a pair of communication networks, the user equipment comprising:
a controller that establishes a plurality of individual bearers and organizes them between a plurality of different sub-groups, each sub-group having a different base value from which security keys for the associated bearers are derived; wherein, when the security keys associated with the individual bearers of one particular sub-group are refreshed, the security keys of the individual bearers, which are not a part of the particular sub-group do not need to be refreshed. 16. A user equipment in accordance with claim 15, wherein the controller creates security keys for each of the plurality of individual bearers, based upon the base value of the sub-group to which the individual bearer is associated. 17. A user equipment in accordance with claim 16 further comprising a transceiver that uses the corresponding security keys in support of the conveyance of information between each of the individual bearers and one or more of multiple networks. 18. A user equipment in accordance with claim 17 wherein the transceiver conveys to at least one of the at least pair of communication networks parameter values used to create the security keys for each of the bearers. 19. A user equipment in accordance with claim 15, wherein the controller detects the need for a refresh of the security keys relative to at least one of the individual bearers, which is associated with one of the plurality of different sub-groups; and refreshes the security keys for each of the individual bearers associated with the one of the plurality of different sub-groups, wherein the security keys of the individual bearers, which are not part of the one of the plurality of different sub-groups are not refreshed. 20. A user equipment in accordance with claim 19, wherein as part of detecting the need for a refresh, the controller one or more of (a) detects a count wrap-around, where a respective count value is associated with information being conveyed between each of the individual bearers and the one or more multiple networks, or (b) detects the need for a handover. | A method and apparatus for handling security keys for individual bearers of the user equipment include dividing between a plurality of different sub-groups, a plurality of individual bearers, each sub-group having a different base value from which the security keys for the associated bearers are derived. When the security keys associated with the individual bearers of one particular sub-group are refreshed, the security keys of the individual bearers, which are not a part of the particular sub-group do not need to be refreshed.1. A method in a user equipment for handling security keys for individual bearers of the user equipment, the method comprising:
dividing between a plurality of different sub-groups, a plurality of individual bearers, each sub-group having a different base value from which the security keys for the associated bearers are derived; wherein, when the security keys associated with the individual bearers of one particular sub-group are refreshed, the security keys of the individual bearers, which are not a part of the particular sub-group do not need to be refreshed. 2. A method in accordance with claim 1, wherein the plurality of different sub-groups include bearers which distinguish between a type of information being conveyed by the bearer including control information and data information. 3. A method in accordance with claim 1, wherein the plurality of different sub-groups include bearers which distinguish between a type of connectivity between multiple networks which is supported by the bearer including a master cell group bearer supporting connectivity with a master cell, a secondary cell group bearer supporting connectivity with a secondary cell, and a split cell group bearer supporting connectivity with both the master cell and the secondary cell. 4. A method in accordance with claim 1, wherein the security keys of the individual bearers include a security key for supporting data encryption, and a security key for verifying integrity of the signaling. 5. A method in accordance with claim 1, wherein the security keys associated with each of the individual bearers are one of user plane keys or control plane keys. 6. A method in accordance with claim 1, wherein each of the different respective base values used with each of the different sub-groups are derived from a common source value. 7. A method in accordance with claim 1, wherein each of the individual bearers is associated with a different respective one of the plurality of different sub-groups. 8. A method in accordance with claim 1, wherein the plurality of different sub-groups include a sub-group for master cell group bearers, a sub-group for secondary cell group bearers, and a sub-group for split cell group bearers. 9. A method in accordance with claim 1, wherein the plurality of different sub-groups include a sub-group for master cell group bearers conveying control information, a sub-group for master cell group bearers conveying data information, a sub-group for secondary cell group bearers conveying control information, a sub-group for secondary cell group bearers conveying data information, a sub-group for split cell group bearers conveying control information, and a sub-group for split cell group bearers conveying data information. 10. A method in accordance with claim 1, wherein the plurality of different sub-groups include a sub-group for master cell group bearers and secondary cell group bearers, and a sub-group for split cell group bearers. 11. A method in accordance with claim 1 further comprising:
creating security keys for each of the plurality of individual bearers, based upon the base value of the sub-group to which the individual bearer is associated;
using the corresponding security keys in support of the conveyance of information between each of the individual bearers and one or more of multiple networks;
detecting the need for a refresh of the security keys relative to at least one of the individual bearers, which is associated with one of the plurality of different sub-groups; and
refreshing the security keys for each of the individual bearers associated with the one of the plurality of different sub-groups, wherein the security keys of the individual bearers, which are not part of the one of the plurality of different sub-groups are not refreshed. 12. A method in accordance with claim 11, wherein the conveyance of information between each of the individual bearers and the one or more of multiple networks includes a count value, which is used as an input for at least one of the ciphering and integrity protection relative to the security keys; and wherein detecting the need for a refresh of the security keys relative to at least one of the individual bearers includes detecting a count wrap-around. 13. A method in accordance with claim 12, wherein the count value associated with a particular bearer is associated with a bearer having an identity value, where the identity value can be used with the count value to distinguish between the different count values, which are each associated with a respective one of the bearers. 14. A method in accordance with claim 11, wherein detecting the need for a refresh of the security keys relative to at least one of the individual bearers includes detecting the need for a handover. 15. A user equipment having dual connectivity with at least a pair of communication networks, the user equipment comprising:
a controller that establishes a plurality of individual bearers and organizes them between a plurality of different sub-groups, each sub-group having a different base value from which security keys for the associated bearers are derived; wherein, when the security keys associated with the individual bearers of one particular sub-group are refreshed, the security keys of the individual bearers, which are not a part of the particular sub-group do not need to be refreshed. 16. A user equipment in accordance with claim 15, wherein the controller creates security keys for each of the plurality of individual bearers, based upon the base value of the sub-group to which the individual bearer is associated. 17. A user equipment in accordance with claim 16 further comprising a transceiver that uses the corresponding security keys in support of the conveyance of information between each of the individual bearers and one or more of multiple networks. 18. A user equipment in accordance with claim 17 wherein the transceiver conveys to at least one of the at least pair of communication networks parameter values used to create the security keys for each of the bearers. 19. A user equipment in accordance with claim 15, wherein the controller detects the need for a refresh of the security keys relative to at least one of the individual bearers, which is associated with one of the plurality of different sub-groups; and refreshes the security keys for each of the individual bearers associated with the one of the plurality of different sub-groups, wherein the security keys of the individual bearers, which are not part of the one of the plurality of different sub-groups are not refreshed. 20. A user equipment in accordance with claim 19, wherein as part of detecting the need for a refresh, the controller one or more of (a) detects a count wrap-around, where a respective count value is associated with information being conveyed between each of the individual bearers and the one or more multiple networks, or (b) detects the need for a handover. | 2,400 |
9,459 | 9,459 | 16,661,584 | 2,483 | A rearview display arrangement for a motor vehicle includes a rearview image sensor positioned to capture first images of a scene behind the motor vehicle. A rearview display screen has a display mode and a mirror mode, in the display mode, the rearview display screen receives video signals based on the captured first images and displays second images based on the video signals. In the mirror mode, the rearview display screen functions as a rearview mirror. An electronic processing apparatus is communicatively coupled to the rearview image sensor and to the rearview display screen. The electronic processing apparatus detects a fault in the captured first images or in the video signals, and, in response to the detecting, switches the rearview display screen from the display mode to the mirror mode. | 1. A rearview display arrangement for a motor vehicle, the arrangement comprising:
a rearview image sensor positioned to capture first images of a scene behind the motor vehicle; a rearview display screen having a display mode and a mirror mode, the rearview display screen being configured in the display mode to receive video signals based on the captured first images and display second images based on the video signals, the rearview display screen being configured in the mirror mode to function as a rearview mirror; and an electronic processing apparatus communicatively coupled to the rearview image sensor and to the rearview display screen, the electronic processing apparatus being configured to:
detect a fault in the captured first images or in the video signals; and
in response to the detecting, switch the rearview display screen from the display mode to the mirror mode. 2. The arrangement of claim 1 wherein the rearview image sensor comprises a camera. 3. The arrangement of claim 1 wherein the electronic processing apparatus includes an image signal processor and an image recognition processor communicatively coupled to the image signal processor. 4. The arrangement of claim 1 wherein the fault comprises the video signals not being transmitted. 5. The arrangement of claim 1 wherein the fault comprises the captured first images including an object blocking the scene behind the motor vehicle from the rearview image sensor. 6. The arrangement of claim 1 wherein the fault comprises the video signals including a number of errors exceeding a threshold number. 7. The arrangement of claim 1 further comprising a G sensor communicatively coupled to the electronic processing apparatus and configured to produce a G sensor signal indicative of forces exerted on the motor vehicle, the electronic processing apparatus being configured to check the captured first images and/or the video signals for a fault in response to the G sensor signal indicating a force exceeding a threshold level of force. 8. A rearview display method for a motor vehicle, the method comprising:
capturing first images of a scene behind the motor vehicle; providing a rearview display screen having a display mode and a mirror mode; in the display mode, using the rearview display screen to display second images dependent on video signals based on the captured first images; in the mirror mode, using the rearview display screen as a rearview mirror; detecting a fault in the captured first images or in the video signals; and in response to the detecting, switching the rearview display screen from the display mode to the mirror mode. 9. The method of claim 8 wherein the capturing is performed by a camera. 10. The method of claim 8 wherein the detecting is performed by an electronic processing apparatus including an image signal processor and an image recognition processor communicatively coupled to the image signal processor. 11. The method of claim 8 wherein the fault comprises the video signals not being transmitted. 12. The method of claim 8 wherein the fault comprises the captured first images including an object blocking the scene behind the motor vehicle. 13. The method of claim 8 wherein the fault comprises the video signals including a number of errors exceeding a threshold number. 14. The method of claim 8 further comprising:
producing a force signal indicative of forces exerted on the motor vehicle; and
in response to the force signal indicating a force exceeding a threshold level of force, checking the captured first images and/or the video signals for a fault. 15. A rearview display arrangement for a motor vehicle, the arrangement comprising:
a rearview image sensor positioned to capture first images of a scene behind the motor vehicle; a rearview display screen having a display mode and a mirror mode, the rearview display screen being configured in the display mode to receive video signals based on the captured first images and display second images based on the video signals, the rearview display screen being configured in the mirror mode to function as a rearview mirror; a G sensor configured to produce a G sensor signal indicative of forces exerted on the motor vehicle; and an electronic processing apparatus communicatively coupled to the rearview image sensor, to the rearview display screen, and to the G sensor, the electronic processing apparatus being configured to:
in response to the G sensor signal indicating a force exceeding a threshold level of force, detect a fault in the captured first images or in the video signals; and
in response to the detecting, switch the rearview display screen from the display mode to the mirror mode. 16. The arrangement of claim 15 wherein the rearview image sensor comprises a camera. 17. The arrangement of claim 15 wherein the electronic processing apparatus includes an image signal processor and an image recognition processor communicatively coupled to the image signal processor. 18. The arrangement of claim 15 wherein the fault comprises the video signals not being transmitted. 19. The arrangement of claim 15 wherein the fault comprises the captured first images including an object blocking the scene behind the motor vehicle from the rearview image sensor. 20. The arrangement of claim 15 wherein the fault comprises the video signals including a number of errors exceeding a threshold number. | A rearview display arrangement for a motor vehicle includes a rearview image sensor positioned to capture first images of a scene behind the motor vehicle. A rearview display screen has a display mode and a mirror mode, in the display mode, the rearview display screen receives video signals based on the captured first images and displays second images based on the video signals. In the mirror mode, the rearview display screen functions as a rearview mirror. An electronic processing apparatus is communicatively coupled to the rearview image sensor and to the rearview display screen. The electronic processing apparatus detects a fault in the captured first images or in the video signals, and, in response to the detecting, switches the rearview display screen from the display mode to the mirror mode.1. A rearview display arrangement for a motor vehicle, the arrangement comprising:
a rearview image sensor positioned to capture first images of a scene behind the motor vehicle; a rearview display screen having a display mode and a mirror mode, the rearview display screen being configured in the display mode to receive video signals based on the captured first images and display second images based on the video signals, the rearview display screen being configured in the mirror mode to function as a rearview mirror; and an electronic processing apparatus communicatively coupled to the rearview image sensor and to the rearview display screen, the electronic processing apparatus being configured to:
detect a fault in the captured first images or in the video signals; and
in response to the detecting, switch the rearview display screen from the display mode to the mirror mode. 2. The arrangement of claim 1 wherein the rearview image sensor comprises a camera. 3. The arrangement of claim 1 wherein the electronic processing apparatus includes an image signal processor and an image recognition processor communicatively coupled to the image signal processor. 4. The arrangement of claim 1 wherein the fault comprises the video signals not being transmitted. 5. The arrangement of claim 1 wherein the fault comprises the captured first images including an object blocking the scene behind the motor vehicle from the rearview image sensor. 6. The arrangement of claim 1 wherein the fault comprises the video signals including a number of errors exceeding a threshold number. 7. The arrangement of claim 1 further comprising a G sensor communicatively coupled to the electronic processing apparatus and configured to produce a G sensor signal indicative of forces exerted on the motor vehicle, the electronic processing apparatus being configured to check the captured first images and/or the video signals for a fault in response to the G sensor signal indicating a force exceeding a threshold level of force. 8. A rearview display method for a motor vehicle, the method comprising:
capturing first images of a scene behind the motor vehicle; providing a rearview display screen having a display mode and a mirror mode; in the display mode, using the rearview display screen to display second images dependent on video signals based on the captured first images; in the mirror mode, using the rearview display screen as a rearview mirror; detecting a fault in the captured first images or in the video signals; and in response to the detecting, switching the rearview display screen from the display mode to the mirror mode. 9. The method of claim 8 wherein the capturing is performed by a camera. 10. The method of claim 8 wherein the detecting is performed by an electronic processing apparatus including an image signal processor and an image recognition processor communicatively coupled to the image signal processor. 11. The method of claim 8 wherein the fault comprises the video signals not being transmitted. 12. The method of claim 8 wherein the fault comprises the captured first images including an object blocking the scene behind the motor vehicle. 13. The method of claim 8 wherein the fault comprises the video signals including a number of errors exceeding a threshold number. 14. The method of claim 8 further comprising:
producing a force signal indicative of forces exerted on the motor vehicle; and
in response to the force signal indicating a force exceeding a threshold level of force, checking the captured first images and/or the video signals for a fault. 15. A rearview display arrangement for a motor vehicle, the arrangement comprising:
a rearview image sensor positioned to capture first images of a scene behind the motor vehicle; a rearview display screen having a display mode and a mirror mode, the rearview display screen being configured in the display mode to receive video signals based on the captured first images and display second images based on the video signals, the rearview display screen being configured in the mirror mode to function as a rearview mirror; a G sensor configured to produce a G sensor signal indicative of forces exerted on the motor vehicle; and an electronic processing apparatus communicatively coupled to the rearview image sensor, to the rearview display screen, and to the G sensor, the electronic processing apparatus being configured to:
in response to the G sensor signal indicating a force exceeding a threshold level of force, detect a fault in the captured first images or in the video signals; and
in response to the detecting, switch the rearview display screen from the display mode to the mirror mode. 16. The arrangement of claim 15 wherein the rearview image sensor comprises a camera. 17. The arrangement of claim 15 wherein the electronic processing apparatus includes an image signal processor and an image recognition processor communicatively coupled to the image signal processor. 18. The arrangement of claim 15 wherein the fault comprises the video signals not being transmitted. 19. The arrangement of claim 15 wherein the fault comprises the captured first images including an object blocking the scene behind the motor vehicle from the rearview image sensor. 20. The arrangement of claim 15 wherein the fault comprises the video signals including a number of errors exceeding a threshold number. | 2,400 |
9,460 | 9,460 | 15,663,180 | 2,456 | A computer-implemented method can include receiving an indication of a template package to be imported in a sites cloud service and further determining whether there is a potential conflict in connection with the template package to be imported in the sites cloud service. The method can also include issuing a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service. | 1. A computer-implemented method, comprising:
receiving an indication of a template package to be imported in a sites cloud service; determining whether there is a potential conflict in connection with the template package to be imported in the sites cloud service; and responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service, issuing a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service. 2. The computer-implemented method of claim 1, further comprising providing a user with at least one option for resolving the potential conflict. 3. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package has a name that is the same as a name of an already-existing template, theme, or component in the sites cloud service. 4. The computer-implemented method of claim 3, further comprising:
renaming the template, theme, or component; and importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 5. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package has a globally unique identifier (GUID) that is the same as a GUID of an already-existing template, theme, or component in the sites cloud service. 6. The computer-implemented method of claim 5, further comprising importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 7. The computer-implemented method of claim 6, further comprising determining whether there is a permission for the importing, wherein the importing is based on a determination that the permission exists. 8. The computer-implemented method of claim 5, further comprising replacing the already-existing template, theme, or component with the template, theme, or component of the template package. 9. The computer-implemented method of claim 8, further comprising presenting to a user an option for the replacing, wherein the replacing is based on an indication received from the user responsive to the option presented to the user. 10. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package has a name and a globally unique identifier (GUID) that are the same as a name and GUID of an already-existing template, theme, or component in the sites cloud service. 11. The computer-implemented method of claim 10, further comprising renaming and importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 12. The computer-implemented method of claim 11, further comprising determining whether there is a permission for the importing, wherein the renaming importing are based on a determination that the permission exists. 13. The computer-implemented method of claim 10, further comprising replacing the already-existing template, theme, or component with the template, theme, or component of the template package. 14. The computer-implemented method of claim 13, further comprising presenting to a user an option for the replacing, wherein the replacing is based on an indication received from the user responsive to the option presented to the user. 15. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package may have been deleted in the sites cloud service. 16. The computer-implemented method of claim 15, further comprising importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 17. The computer-implemented method of claim 15, further comprising restoring the deleted template, theme, or component. 18. One or more tangible, non-transitory computer-readable media containing computer-executable instructions that, when executed by a processor, cause the processor to perform a method comprising:
receiving an indication of a template package to be imported in a sites cloud service; determining whether there is a potential conflict in connection with the template package to be imported in the sites cloud service; and responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service, issuing a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service. 19. The one or more tangible, non-transitory computer-readable media of claim 18, the method further comprising providing a user with at least one option for resolving the potential conflict. 20. A system, comprising:
a display device; and a processor configured to:
receive an indication of a template package to be imported in a sites cloud service;
determine whether there is a potential conflict in connection with the template package to be imported in the sites cloud service; and
responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service, cause the display device to visually present to a user a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service. | A computer-implemented method can include receiving an indication of a template package to be imported in a sites cloud service and further determining whether there is a potential conflict in connection with the template package to be imported in the sites cloud service. The method can also include issuing a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service.1. A computer-implemented method, comprising:
receiving an indication of a template package to be imported in a sites cloud service; determining whether there is a potential conflict in connection with the template package to be imported in the sites cloud service; and responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service, issuing a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service. 2. The computer-implemented method of claim 1, further comprising providing a user with at least one option for resolving the potential conflict. 3. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package has a name that is the same as a name of an already-existing template, theme, or component in the sites cloud service. 4. The computer-implemented method of claim 3, further comprising:
renaming the template, theme, or component; and importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 5. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package has a globally unique identifier (GUID) that is the same as a GUID of an already-existing template, theme, or component in the sites cloud service. 6. The computer-implemented method of claim 5, further comprising importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 7. The computer-implemented method of claim 6, further comprising determining whether there is a permission for the importing, wherein the importing is based on a determination that the permission exists. 8. The computer-implemented method of claim 5, further comprising replacing the already-existing template, theme, or component with the template, theme, or component of the template package. 9. The computer-implemented method of claim 8, further comprising presenting to a user an option for the replacing, wherein the replacing is based on an indication received from the user responsive to the option presented to the user. 10. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package has a name and a globally unique identifier (GUID) that are the same as a name and GUID of an already-existing template, theme, or component in the sites cloud service. 11. The computer-implemented method of claim 10, further comprising renaming and importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 12. The computer-implemented method of claim 11, further comprising determining whether there is a permission for the importing, wherein the renaming importing are based on a determination that the permission exists. 13. The computer-implemented method of claim 10, further comprising replacing the already-existing template, theme, or component with the template, theme, or component of the template package. 14. The computer-implemented method of claim 13, further comprising presenting to a user an option for the replacing, wherein the replacing is based on an indication received from the user responsive to the option presented to the user. 15. The computer-implemented method of claim 1, wherein determining whether there is a potential conflict includes determining that a template, theme, or component of the template package may have been deleted in the sites cloud service. 16. The computer-implemented method of claim 15, further comprising importing the template, theme, or component as a new template, theme, or component in the sites cloud service. 17. The computer-implemented method of claim 15, further comprising restoring the deleted template, theme, or component. 18. One or more tangible, non-transitory computer-readable media containing computer-executable instructions that, when executed by a processor, cause the processor to perform a method comprising:
receiving an indication of a template package to be imported in a sites cloud service; determining whether there is a potential conflict in connection with the template package to be imported in the sites cloud service; and responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service, issuing a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service. 19. The one or more tangible, non-transitory computer-readable media of claim 18, the method further comprising providing a user with at least one option for resolving the potential conflict. 20. A system, comprising:
a display device; and a processor configured to:
receive an indication of a template package to be imported in a sites cloud service;
determine whether there is a potential conflict in connection with the template package to be imported in the sites cloud service; and
responsive to an indication that there is a potential conflict in connection with the template package to be imported in the sites cloud service, cause the display device to visually present to a user a notification concerning the potential conflict in connection with the template package to be imported in the sites cloud service. | 2,400 |
9,461 | 9,461 | 12,538,076 | 2,483 | A computer-implemented system and method are described for encoding video. For example, a method according to one embodiment comprises: selecting a tile size for subdividing each image in a sequence of images based on a specified type of encoding algorithm to be used for encoding the tiles, wherein M tiles are encoded for each image, each tile being encoded according to a first encoding format or a second encoding format, each tile having a designated tile location within each image; specifying a rotating pattern to be used for encoding the tiles over a sequence of N images, the rotating pattern comprising encoding only certain tiles of each image using the first encoding format, and rotating the tile locations selected for the first encoding format over the N images to ensure that all M tiles have been encoded according to the first encoding format across the N images; and encoding the sequence of N images using the rotating pattern. | 1. A computer-implemented method for encoding video comprising:
selecting a tile size for subdividing each image in a sequence of images based on a specified type of encoding algorithm to be used for encoding the tiles, wherein M tiles are encoded for each image, each tile being encoded according to a first encoding format or a second encoding format, each tile having a designated tile location within each image; specifying a rotating pattern to be used for encoding the tiles over a sequence of N images, the rotating pattern comprising encoding only certain tiles of each image using the first encoding format, and rotating the tile locations selected for the first encoding format over the N images to ensure that all M tiles have been encoded according to the first encoding format across the N images; and encoding the sequence of N images using the rotating pattern. | A computer-implemented system and method are described for encoding video. For example, a method according to one embodiment comprises: selecting a tile size for subdividing each image in a sequence of images based on a specified type of encoding algorithm to be used for encoding the tiles, wherein M tiles are encoded for each image, each tile being encoded according to a first encoding format or a second encoding format, each tile having a designated tile location within each image; specifying a rotating pattern to be used for encoding the tiles over a sequence of N images, the rotating pattern comprising encoding only certain tiles of each image using the first encoding format, and rotating the tile locations selected for the first encoding format over the N images to ensure that all M tiles have been encoded according to the first encoding format across the N images; and encoding the sequence of N images using the rotating pattern.1. A computer-implemented method for encoding video comprising:
selecting a tile size for subdividing each image in a sequence of images based on a specified type of encoding algorithm to be used for encoding the tiles, wherein M tiles are encoded for each image, each tile being encoded according to a first encoding format or a second encoding format, each tile having a designated tile location within each image; specifying a rotating pattern to be used for encoding the tiles over a sequence of N images, the rotating pattern comprising encoding only certain tiles of each image using the first encoding format, and rotating the tile locations selected for the first encoding format over the N images to ensure that all M tiles have been encoded according to the first encoding format across the N images; and encoding the sequence of N images using the rotating pattern. | 2,400 |
9,462 | 9,462 | 15,737,411 | 2,473 | The claimed interface extension device is based on a network device (DCC) having at least one previously unoccupied digital data output (OUT), to which an interface extension module (IOE) having at least one supply voltage input (S) and having a plurality of digital interfaces is coupled in the claimed manner. In this way, the supply voltage input (S) of the interface extension module (IOE) is interconnected with the digital data output (OUT) of the network device (DCC), so that in event of an error, the interface extension module (IOE) and all the digital interfaces thereof can be switched off. In addition, by measuring the sum current flowing through the outputs of the interface extension module, the load diagnosis capacity of the network configuration can be extended to the interface extension device. The claimed interconnection of the supply voltage input (S) of the interface extension module with the digital data output (OUT) of the network configuration has the advantage of also implementing a fail-safe behavior for conventional interface extension modules. | 1. An interface expansion device for a network device, the interface expansion device comprising:
at least one digital data output; and an interface expansion module, the interface expansion module having at least one supply voltage input and a plurality of expansion interfaces, wherein the at least one supply voltage input of the interface expansion module is interconnected with a digital data output of the network device, such that in the event of a fault, the interface expansion module with all expansion interfaces of the plurality of expansion interfaces are disconnected. 2. The interface expansion device of claim 1, further comprising:
a load diagnosis device that is associated with the data output of the network device, the load diagnosis device configured to measure a summation current of all partial currents of the plurality of expansion interfaces of the interface expansion module that flow via the at least one digital data output of the network device. 3. A method for operating an interface expansion device for a network device, the interface expansion device comprising at least one digital data output, the interface expansion device further comprising an interface expansion module, the interface expansion module comprising at least one supply voltage input and a plurality of expansion interfaces, at least one supply voltage input of the interface expansion module being interconnected with a digital data output of the at least one digital data output of the network device, the method comprising
disconnecting the interface expansion module with all expansion interfaces of the plurality of expansion interface in the event of a fault. 4. The method of claim 3, further comprising:
measuring, by a load diagnosis device that is associated with the digital data output, a summation current of all partial currents of the plurality of expansion interfaces that flow via the digital data output of the network device. 5. The method of claim 4, wherein the fault event is detected if no change in the summation current is measured when switching at least one outgoing expansion interface of the interface expansion module. 6. The method of claimed wherein the fault event is detected if the summation current measured by the load diagnosis device does not correspond to an expected summation current of all partial currents that flow via the digital data output of the network device. 7. The method of claim 4, wherein the fault event is detected if the summation current measured by the load diagnosis device does not correspond to an expected summation current of all partial currents that flow via the digital data output of the network device. | The claimed interface extension device is based on a network device (DCC) having at least one previously unoccupied digital data output (OUT), to which an interface extension module (IOE) having at least one supply voltage input (S) and having a plurality of digital interfaces is coupled in the claimed manner. In this way, the supply voltage input (S) of the interface extension module (IOE) is interconnected with the digital data output (OUT) of the network device (DCC), so that in event of an error, the interface extension module (IOE) and all the digital interfaces thereof can be switched off. In addition, by measuring the sum current flowing through the outputs of the interface extension module, the load diagnosis capacity of the network configuration can be extended to the interface extension device. The claimed interconnection of the supply voltage input (S) of the interface extension module with the digital data output (OUT) of the network configuration has the advantage of also implementing a fail-safe behavior for conventional interface extension modules.1. An interface expansion device for a network device, the interface expansion device comprising:
at least one digital data output; and an interface expansion module, the interface expansion module having at least one supply voltage input and a plurality of expansion interfaces, wherein the at least one supply voltage input of the interface expansion module is interconnected with a digital data output of the network device, such that in the event of a fault, the interface expansion module with all expansion interfaces of the plurality of expansion interfaces are disconnected. 2. The interface expansion device of claim 1, further comprising:
a load diagnosis device that is associated with the data output of the network device, the load diagnosis device configured to measure a summation current of all partial currents of the plurality of expansion interfaces of the interface expansion module that flow via the at least one digital data output of the network device. 3. A method for operating an interface expansion device for a network device, the interface expansion device comprising at least one digital data output, the interface expansion device further comprising an interface expansion module, the interface expansion module comprising at least one supply voltage input and a plurality of expansion interfaces, at least one supply voltage input of the interface expansion module being interconnected with a digital data output of the at least one digital data output of the network device, the method comprising
disconnecting the interface expansion module with all expansion interfaces of the plurality of expansion interface in the event of a fault. 4. The method of claim 3, further comprising:
measuring, by a load diagnosis device that is associated with the digital data output, a summation current of all partial currents of the plurality of expansion interfaces that flow via the digital data output of the network device. 5. The method of claim 4, wherein the fault event is detected if no change in the summation current is measured when switching at least one outgoing expansion interface of the interface expansion module. 6. The method of claimed wherein the fault event is detected if the summation current measured by the load diagnosis device does not correspond to an expected summation current of all partial currents that flow via the digital data output of the network device. 7. The method of claim 4, wherein the fault event is detected if the summation current measured by the load diagnosis device does not correspond to an expected summation current of all partial currents that flow via the digital data output of the network device. | 2,400 |
9,463 | 9,463 | 13,659,472 | 2,454 | Processing for an Instant Messaging IM system includes obtaining contents of an IM session, identifying participants of the IM session, extracting, using a central processing unit, keywords of the IM session from the contents, and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. | 1. A method for an Instant Messaging IM system, comprising:
obtaining contents of an IM session; identifying participants of the IM session; extracting, using a central processing unit, keywords of the IM session from the contents; and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. 2. The method of claim 1, further comprising:
obtaining access permissions of the IM session; and associating the access permissions of the IM session with the corresponding IM session. 3. The method of claim 1, further comprising:
clustering IM sessions, wherein each IM session cluster comprises at least one IM session and the contents of the at least one IM session have a related topic. 4. The method of claim 3, wherein for at least one IM session cluster:
extracting keywords of the IM session cluster; taking the participants of at least one IM session included in the IM session cluster as participants of the IM session cluster. 5. The method of claim 4, wherein extracting keywords of the IM session cluster comprises:
taking the keywords of at least one IM session included in the IM session cluster as keywords of the IM session cluster. 6. The method of claim 4, wherein for at least one IM session cluster:
associating the keywords of the IM session cluster, the participants of the IM session cluster with the IM session cluster. 7. The method of claim 3, wherein for at least one IM session cluster:
obtaining access permissions of the IM session cluster; associating the access permissions of the IM session cluster with the IM session cluster. 8. The method of claim 1, further comprising:
visually outputting the association between the keywords of the IM session, the participants of the IM session and the corresponding IM session. 9. The method of claim 6, further comprising:
visually outputting the association between the keywords of the IM session cluster, the participants of the IM session cluster and the corresponding IM session cluster. 10. The method of claim 1, wherein:
the participants of the IM session come from a social network. 11. A system for an Instant Messaging (IM) system, comprising:
a central processing unit programmed to initiate executable operations comprising: obtaining contents of an IM session; identifying participants of the IM session; extracting keywords of the IM session from the contents; and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. 12. The system of claim 11, wherein the central processing unit is further programmed to initiate executable operations comprising:
obtaining access permissions of the IM session; and associating the access permissions of the IM session with the corresponding IM session. 13. The system of claim 11, wherein the central processing unit is further programmed to initiate executable operations comprising:
clustering IM sessions, wherein each IM session cluster comprises at least one IM session and the contents of the at least one IM session have a related topic. 14. The system of claim 13, wherein for at least one IM session cluster the central processing unit is further programmed to initiate executable operations comprising:
extracting keywords of the IM session cluster; taking the participants of at least one IM session included in the IM session cluster as participants of the IM session cluster. 15. The system of claim 14, wherein extracting keywords of the IM session cluster comprises:
taking the keywords of at least one IM session included in the IM session cluster as keywords of the IM session cluster. 16. The system of claim 14, wherein for at least one IM session cluster the central processing unit is further programmed to initiate executable operations comprising:
associating the keywords of the IM session cluster, the participants of the IM session cluster with the IM session cluster. 17. The system of claim 13, wherein for at least one IM session cluster the central processing unit is further programmed to initiate executable operations comprising:
obtaining access permissions of the IM session cluster; associating the access permissions of the IM session cluster with the IM session cluster. 18. The system of claim 11, wherein the central processing unit is further programmed to initiate executable operations comprising:
visually outputting the association between the keywords of the IM session, the participants of the IM session and the corresponding IM session. 19. The system of claim 16, wherein the central processing unit is further programmed to initiate executable operations comprising:
visually outputting the association between the keywords of the IM session cluster, the participants of the IM session cluster and the corresponding IM session cluster. 20. The system of claim 11, wherein:
the participants of the IM session come from a social network. 21. A computer program product for an Instant Messaging (IM) system, the computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a central processing unit to perform a method comprising:
obtaining contents of an IM session; identifying participants of the IM session; extracting keywords of the IM session from the contents; and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. 22. The computer program product of claim 21, wherein the method further comprises:
obtaining access permissions of the IM session; and associating the access permissions of the IM session with the corresponding IM session. 23. The computer program product of claim 21, wherein the method further comprises:
clustering IM sessions, wherein each IM session cluster comprises at least one IM session and the contents of the at least one IM session have a related topic. 24. The computer program product of claim 23, wherein for at least one IM session cluster the method further comprises:
extracting keywords of the IM session cluster; taking the participants of at least one IM session included in the IM session cluster as participants of the IM session cluster. 25. The computer program product of claim 24, wherein extracting keywords of the IM session cluster comprises:
taking the keywords of at least one IM session included in the IM session cluster as keywords of the IM session cluster. | Processing for an Instant Messaging IM system includes obtaining contents of an IM session, identifying participants of the IM session, extracting, using a central processing unit, keywords of the IM session from the contents, and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session.1. A method for an Instant Messaging IM system, comprising:
obtaining contents of an IM session; identifying participants of the IM session; extracting, using a central processing unit, keywords of the IM session from the contents; and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. 2. The method of claim 1, further comprising:
obtaining access permissions of the IM session; and associating the access permissions of the IM session with the corresponding IM session. 3. The method of claim 1, further comprising:
clustering IM sessions, wherein each IM session cluster comprises at least one IM session and the contents of the at least one IM session have a related topic. 4. The method of claim 3, wherein for at least one IM session cluster:
extracting keywords of the IM session cluster; taking the participants of at least one IM session included in the IM session cluster as participants of the IM session cluster. 5. The method of claim 4, wherein extracting keywords of the IM session cluster comprises:
taking the keywords of at least one IM session included in the IM session cluster as keywords of the IM session cluster. 6. The method of claim 4, wherein for at least one IM session cluster:
associating the keywords of the IM session cluster, the participants of the IM session cluster with the IM session cluster. 7. The method of claim 3, wherein for at least one IM session cluster:
obtaining access permissions of the IM session cluster; associating the access permissions of the IM session cluster with the IM session cluster. 8. The method of claim 1, further comprising:
visually outputting the association between the keywords of the IM session, the participants of the IM session and the corresponding IM session. 9. The method of claim 6, further comprising:
visually outputting the association between the keywords of the IM session cluster, the participants of the IM session cluster and the corresponding IM session cluster. 10. The method of claim 1, wherein:
the participants of the IM session come from a social network. 11. A system for an Instant Messaging (IM) system, comprising:
a central processing unit programmed to initiate executable operations comprising: obtaining contents of an IM session; identifying participants of the IM session; extracting keywords of the IM session from the contents; and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. 12. The system of claim 11, wherein the central processing unit is further programmed to initiate executable operations comprising:
obtaining access permissions of the IM session; and associating the access permissions of the IM session with the corresponding IM session. 13. The system of claim 11, wherein the central processing unit is further programmed to initiate executable operations comprising:
clustering IM sessions, wherein each IM session cluster comprises at least one IM session and the contents of the at least one IM session have a related topic. 14. The system of claim 13, wherein for at least one IM session cluster the central processing unit is further programmed to initiate executable operations comprising:
extracting keywords of the IM session cluster; taking the participants of at least one IM session included in the IM session cluster as participants of the IM session cluster. 15. The system of claim 14, wherein extracting keywords of the IM session cluster comprises:
taking the keywords of at least one IM session included in the IM session cluster as keywords of the IM session cluster. 16. The system of claim 14, wherein for at least one IM session cluster the central processing unit is further programmed to initiate executable operations comprising:
associating the keywords of the IM session cluster, the participants of the IM session cluster with the IM session cluster. 17. The system of claim 13, wherein for at least one IM session cluster the central processing unit is further programmed to initiate executable operations comprising:
obtaining access permissions of the IM session cluster; associating the access permissions of the IM session cluster with the IM session cluster. 18. The system of claim 11, wherein the central processing unit is further programmed to initiate executable operations comprising:
visually outputting the association between the keywords of the IM session, the participants of the IM session and the corresponding IM session. 19. The system of claim 16, wherein the central processing unit is further programmed to initiate executable operations comprising:
visually outputting the association between the keywords of the IM session cluster, the participants of the IM session cluster and the corresponding IM session cluster. 20. The system of claim 11, wherein:
the participants of the IM session come from a social network. 21. A computer program product for an Instant Messaging (IM) system, the computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a central processing unit to perform a method comprising:
obtaining contents of an IM session; identifying participants of the IM session; extracting keywords of the IM session from the contents; and associating the keywords of the IM session, the participants of the IM session with the corresponding IM session. 22. The computer program product of claim 21, wherein the method further comprises:
obtaining access permissions of the IM session; and associating the access permissions of the IM session with the corresponding IM session. 23. The computer program product of claim 21, wherein the method further comprises:
clustering IM sessions, wherein each IM session cluster comprises at least one IM session and the contents of the at least one IM session have a related topic. 24. The computer program product of claim 23, wherein for at least one IM session cluster the method further comprises:
extracting keywords of the IM session cluster; taking the participants of at least one IM session included in the IM session cluster as participants of the IM session cluster. 25. The computer program product of claim 24, wherein extracting keywords of the IM session cluster comprises:
taking the keywords of at least one IM session included in the IM session cluster as keywords of the IM session cluster. | 2,400 |
9,464 | 9,464 | 16,299,426 | 2,424 | Disclosed are various embodiments for processing verbal queries relative to video content. A verbal query that is associated with a portion of video content is received. The verbal query specifies a relative frame location. An action is performed based at least in part on the portion of the video content at the relative frame location. | 1. A system, comprising:
at least one computing device; and instructions executable in the at least one computing device, wherein when executed the instructions cause the at least one computing device to at least:
receive a verbal query associated with a portion of video content;
determine a region in a video frame expressed in relative terms within the verbal query; and
perform an action based at least in part on the portion of the video content at the region. 2. The system of claim 1, wherein the action comprises identifying an item depicted in the portion of the video content at the region. 3. The system of claim 1, wherein the action comprises presenting information about an item discussed in the portion of the video content. 4. The system of claim 1, wherein the action comprises presenting information about an item depicted in the portion of the video content at the region. 5. The system of claim 1, wherein the action comprises presenting information about the portion of the video content at the region. 6. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
identify an ambiguity in the relative terms of the verbal query; cause a grid to be rendered as an overlay on top of the video content, the grid containing a plurality of cells; and receive a verbal confirmation identifying one of the plurality of cells. 7. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
determine that an ambiguity exists in the verbal query; cause a follow-up question to be presented; and receive a verbal response to the follow-up question. 8. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
identify a plurality of items that appear during the portion of the video content; cause a plurality of indicia corresponding to individual ones of the plurality of items to be rendered as an overlay on top of the video content via a display; and wherein the region specified by the verbal query is an identification of a particular indicium of the plurality of indicia. 9. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
cause a grid to be rendered as an overlay on top of the video content via a display, the grid containing a plurality of cells; and wherein the region specified by the verbal query is an identification of a particular cell of the plurality of cells. 10. A method, comprising:
receiving, by at least one computing device, a verbal query associated with a user account, the verbal query specifying a region of a video frame expressed in relative terms; identifying, by the at least one computing device, a portion of video content that is currently being presented via the user account; and performing, by the at least one computing device, an action based at least in part on the portion of the video content at the region. 11. The method of claim 10, wherein the action comprises identifying an item depicted in the portion of the video content at the region. 12. The method of claim 10, wherein the action comprises causing a speech synthesizer to announce information regarding the portion of the video content at the region via an audio device. 13. The method of claim 10, wherein the action comprises causing a graphical overlay with information regarding the portion of the video content at the region to be rendered on top of the video content via a display. 14. The method of claim 10, further comprising determining, by the at least one computing device, the region of the video frame expressed in the verbal query by natural language processing. 15. The method of claim 10, further comprising:
determining, by the at least one computing device, that an ambiguity exists in the verbal query; causing, by the at least one computing device, a follow-up question to be presented; receiving, by the at least one computing device, a verbal response to the follow-up question; and determining, by the at least one computing device, the region based at least in part on the verbal response to the follow up question. 16. The method of claim 10, further comprising:
identifying, by the at least one computing device, a plurality of items that appear during the portion of the video content; causing, by the at least one computing device, a plurality of indicia corresponding to individual ones of the plurality of items to be rendered as an overlay on top of the video content via a display; and wherein the region specified by the verbal query is an identification of a particular indicium of the plurality of indicia. 17. The method of claim 10, further comprising:
causing, by the at least one computing device, a grid to be rendered as an overlay on top of the video content via a display, the grid containing a plurality of cells; and wherein the region specified by the verbal query is an identification of a particular cell of the plurality of cells. 18. A non-transitory computer-readable medium embodying a program executable in at least one computing device, wherein when executed the program causes the at least one computing device to at least:
receive a verbal query associated with a user account; perform natural language processing on the verbal query to determine a region of a video frame expressed in relative terms in the verbal query; identify a portion of video content that is currently being presented via a display associated with the user account; and perform an action relative to the portion of the video content at the region. 19. The non-transitory computer-readable medium of claim 18, wherein the action comprises identifying a cast member appearing in the portion of the video content at the region. 20. The non-transitory computer-readable medium of claim 18, wherein the action comprises identifying an item depicted in the portion of the video content at the region. | Disclosed are various embodiments for processing verbal queries relative to video content. A verbal query that is associated with a portion of video content is received. The verbal query specifies a relative frame location. An action is performed based at least in part on the portion of the video content at the relative frame location.1. A system, comprising:
at least one computing device; and instructions executable in the at least one computing device, wherein when executed the instructions cause the at least one computing device to at least:
receive a verbal query associated with a portion of video content;
determine a region in a video frame expressed in relative terms within the verbal query; and
perform an action based at least in part on the portion of the video content at the region. 2. The system of claim 1, wherein the action comprises identifying an item depicted in the portion of the video content at the region. 3. The system of claim 1, wherein the action comprises presenting information about an item discussed in the portion of the video content. 4. The system of claim 1, wherein the action comprises presenting information about an item depicted in the portion of the video content at the region. 5. The system of claim 1, wherein the action comprises presenting information about the portion of the video content at the region. 6. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
identify an ambiguity in the relative terms of the verbal query; cause a grid to be rendered as an overlay on top of the video content, the grid containing a plurality of cells; and receive a verbal confirmation identifying one of the plurality of cells. 7. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
determine that an ambiguity exists in the verbal query; cause a follow-up question to be presented; and receive a verbal response to the follow-up question. 8. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
identify a plurality of items that appear during the portion of the video content; cause a plurality of indicia corresponding to individual ones of the plurality of items to be rendered as an overlay on top of the video content via a display; and wherein the region specified by the verbal query is an identification of a particular indicium of the plurality of indicia. 9. The system of claim 1, wherein when executed the instructions further cause the at least one computing device to at least:
cause a grid to be rendered as an overlay on top of the video content via a display, the grid containing a plurality of cells; and wherein the region specified by the verbal query is an identification of a particular cell of the plurality of cells. 10. A method, comprising:
receiving, by at least one computing device, a verbal query associated with a user account, the verbal query specifying a region of a video frame expressed in relative terms; identifying, by the at least one computing device, a portion of video content that is currently being presented via the user account; and performing, by the at least one computing device, an action based at least in part on the portion of the video content at the region. 11. The method of claim 10, wherein the action comprises identifying an item depicted in the portion of the video content at the region. 12. The method of claim 10, wherein the action comprises causing a speech synthesizer to announce information regarding the portion of the video content at the region via an audio device. 13. The method of claim 10, wherein the action comprises causing a graphical overlay with information regarding the portion of the video content at the region to be rendered on top of the video content via a display. 14. The method of claim 10, further comprising determining, by the at least one computing device, the region of the video frame expressed in the verbal query by natural language processing. 15. The method of claim 10, further comprising:
determining, by the at least one computing device, that an ambiguity exists in the verbal query; causing, by the at least one computing device, a follow-up question to be presented; receiving, by the at least one computing device, a verbal response to the follow-up question; and determining, by the at least one computing device, the region based at least in part on the verbal response to the follow up question. 16. The method of claim 10, further comprising:
identifying, by the at least one computing device, a plurality of items that appear during the portion of the video content; causing, by the at least one computing device, a plurality of indicia corresponding to individual ones of the plurality of items to be rendered as an overlay on top of the video content via a display; and wherein the region specified by the verbal query is an identification of a particular indicium of the plurality of indicia. 17. The method of claim 10, further comprising:
causing, by the at least one computing device, a grid to be rendered as an overlay on top of the video content via a display, the grid containing a plurality of cells; and wherein the region specified by the verbal query is an identification of a particular cell of the plurality of cells. 18. A non-transitory computer-readable medium embodying a program executable in at least one computing device, wherein when executed the program causes the at least one computing device to at least:
receive a verbal query associated with a user account; perform natural language processing on the verbal query to determine a region of a video frame expressed in relative terms in the verbal query; identify a portion of video content that is currently being presented via a display associated with the user account; and perform an action relative to the portion of the video content at the region. 19. The non-transitory computer-readable medium of claim 18, wherein the action comprises identifying a cast member appearing in the portion of the video content at the region. 20. The non-transitory computer-readable medium of claim 18, wherein the action comprises identifying an item depicted in the portion of the video content at the region. | 2,400 |
9,465 | 9,465 | 14,781,301 | 2,456 | For computing nodes having a first programmable and comprising a first node and a second node, an update of the first node from the first programmable to a second programmable across an external network is initiated. In response to the update being interrupted, the first programmable is automatically reinstated on the first node by retrieving the first programmable from the second node across an internal network. The second node is automatically updated to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. | 1. A method comprising:
for computing nodes having a first programmable, the computing nodes comprising a first node and a second node, initiating an update of the first node from the first programmable to a second programmable across an external network; automatically reinstating the first programmable on the first node by retrieving the first programmable from the second node across an internal network in response to the update being interrupted; and automatically updating the second node to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. 2. The method of claim 1 further comprising automatically re-initiating the updating of the second node to the second programmable from the first node across the internal network in response to a prior updating of the second node being interrupted. 3. The method of claim 1, wherein the first programmable comprises first program instructions for a node processing unit and where the second programmable comprises second program instructions for the node processing unit. 4. The method of claim 3, wherein the first program instructions comprise a first flash image of program instructions and the second program instructions comprise a second flash image of program instructions. 5. The method of claim 3, wherein the first node comprises a first management processor and first memory and wherein the second node comprises a second management processor and second memory. 6. The method of claim 5, wherein the first management processor and the second management processor collectively carry out management functions for a set of servers, the first management processor carrying out a first portion of the management functions for the set of servers following the first program instructions or the second program instructions and the second management processor caring out a second portion of the management functions different than the first portion of the management functions for the set of servers following the first program instructions or the second program instructions. 7. The method of claim 1, wherein the first programmable that is updated with the second programmable is selected from a group of programmables consisting of: firmware, certificate path development library/programmatic agreements library CPLD/PAL images, field replaceable unit (FRU) data, parameters, settings, program instructions, and files. 8. An apparatus comprising:
a non-transient computer-readable medium containing computer-readable code to direct a processing unit to: initiate an update of the first node from the first programmable to a second programmable across an external network; automatically reinstate the first programmable on a first node by retrieving the first programmable from a second node across an internal network in response to the update being interrupted; and automatically update the second node to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. 9. The apparatus of claim 8, wherein the computer-readable code is configured to direct the processing unit to automatically re-initiate the updating of the second node to the second programmable from the first node across the internal network in response to a prior updating of the second node being interrupted. 10. An apparatus comprising:
computing nodes, each of the computing nodes connected to one another by an internal network and comprising a processor and a memory storing a first programmable and an interruption recovery module, wherein the interruption recovery module comprises program instructions to direct the processor to: initiate an update of a first node of the computing nodes from the first programmable to a second programmable across an external network; automatically reinstate the first programmable on the first node by retrieving the first programmable from a second node of the computing nodes across the internal network in response to the update being interrupted; and automatically update the second node to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. 11. The apparatus of claim 10, wherein the interruption recovery module is further configured to re-initiate the updating of the second node to the second programmable from the first node across the internal network in response to a prior updating of the second node being interrupted. 12. The apparatus of claim 10 further comprising servers, wherein the computing nodes are configured to manage operation of the servers using either the first programmable or the second programmable. 13. The apparatus of claim 12, wherein the first programmable comprises a first firmware and wherein the second programmable comprises a second firmware. 14. The apparatus of claim 12, wherein the first node comprise a first management processor and where the second node comprises a second management processor, wherein the first management processor and the second management processor collectively carry out management functions for the servers, the first management processor carrying out a first portion of the management functions for the set of servers following the first program instructions or the second program instructions and the second management processor caring out a second portion of the management functions different than the first portion of the management functions for the set of servers following the first program instructions or the second program instructions. 15. The method of claim 10, wherein the first programmable that is updated with the second programmable is selected from a group of programmables consisting of: firmware, certificate path development library/programmatic agreements library CPLD/PAL images, field replaceable unit (FRU) data, libraries/dynamic link libraries (DLLs), executable-linkable files (ELF), digital certificates and chain of trust information, asset information, operating system components and drivers, scripts and applets, parameters, settings, program instructions, and files. | For computing nodes having a first programmable and comprising a first node and a second node, an update of the first node from the first programmable to a second programmable across an external network is initiated. In response to the update being interrupted, the first programmable is automatically reinstated on the first node by retrieving the first programmable from the second node across an internal network. The second node is automatically updated to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable.1. A method comprising:
for computing nodes having a first programmable, the computing nodes comprising a first node and a second node, initiating an update of the first node from the first programmable to a second programmable across an external network; automatically reinstating the first programmable on the first node by retrieving the first programmable from the second node across an internal network in response to the update being interrupted; and automatically updating the second node to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. 2. The method of claim 1 further comprising automatically re-initiating the updating of the second node to the second programmable from the first node across the internal network in response to a prior updating of the second node being interrupted. 3. The method of claim 1, wherein the first programmable comprises first program instructions for a node processing unit and where the second programmable comprises second program instructions for the node processing unit. 4. The method of claim 3, wherein the first program instructions comprise a first flash image of program instructions and the second program instructions comprise a second flash image of program instructions. 5. The method of claim 3, wherein the first node comprises a first management processor and first memory and wherein the second node comprises a second management processor and second memory. 6. The method of claim 5, wherein the first management processor and the second management processor collectively carry out management functions for a set of servers, the first management processor carrying out a first portion of the management functions for the set of servers following the first program instructions or the second program instructions and the second management processor caring out a second portion of the management functions different than the first portion of the management functions for the set of servers following the first program instructions or the second program instructions. 7. The method of claim 1, wherein the first programmable that is updated with the second programmable is selected from a group of programmables consisting of: firmware, certificate path development library/programmatic agreements library CPLD/PAL images, field replaceable unit (FRU) data, parameters, settings, program instructions, and files. 8. An apparatus comprising:
a non-transient computer-readable medium containing computer-readable code to direct a processing unit to: initiate an update of the first node from the first programmable to a second programmable across an external network; automatically reinstate the first programmable on a first node by retrieving the first programmable from a second node across an internal network in response to the update being interrupted; and automatically update the second node to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. 9. The apparatus of claim 8, wherein the computer-readable code is configured to direct the processing unit to automatically re-initiate the updating of the second node to the second programmable from the first node across the internal network in response to a prior updating of the second node being interrupted. 10. An apparatus comprising:
computing nodes, each of the computing nodes connected to one another by an internal network and comprising a processor and a memory storing a first programmable and an interruption recovery module, wherein the interruption recovery module comprises program instructions to direct the processor to: initiate an update of a first node of the computing nodes from the first programmable to a second programmable across an external network; automatically reinstate the first programmable on the first node by retrieving the first programmable from a second node of the computing nodes across the internal network in response to the update being interrupted; and automatically update the second node to the second programmable by retrieving the second programmable from the first node across the internal network in response to completion of the update of the first node to the second programmable. 11. The apparatus of claim 10, wherein the interruption recovery module is further configured to re-initiate the updating of the second node to the second programmable from the first node across the internal network in response to a prior updating of the second node being interrupted. 12. The apparatus of claim 10 further comprising servers, wherein the computing nodes are configured to manage operation of the servers using either the first programmable or the second programmable. 13. The apparatus of claim 12, wherein the first programmable comprises a first firmware and wherein the second programmable comprises a second firmware. 14. The apparatus of claim 12, wherein the first node comprise a first management processor and where the second node comprises a second management processor, wherein the first management processor and the second management processor collectively carry out management functions for the servers, the first management processor carrying out a first portion of the management functions for the set of servers following the first program instructions or the second program instructions and the second management processor caring out a second portion of the management functions different than the first portion of the management functions for the set of servers following the first program instructions or the second program instructions. 15. The method of claim 10, wherein the first programmable that is updated with the second programmable is selected from a group of programmables consisting of: firmware, certificate path development library/programmatic agreements library CPLD/PAL images, field replaceable unit (FRU) data, libraries/dynamic link libraries (DLLs), executable-linkable files (ELF), digital certificates and chain of trust information, asset information, operating system components and drivers, scripts and applets, parameters, settings, program instructions, and files. | 2,400 |
9,466 | 9,466 | 14,550,885 | 2,459 | A network analytics controller is established in a network. The network includes a plurality of nodes. A plurality of network analytics agents is established; each agent at a node of the network. Network analytics configuration parameters, including a network analytics scope, are received at the networks analytics controller. A task is assigned to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node. The assigned task is performed at each agent assigned a task. The networks analytics controller receives the results of each performed task, and aggregates the received results. | 1. A method comprising:
establishing a network analytics controller in a network, the network comprising a plurality of nodes; establishing a plurality of network analytics agents, each agent at a node of the network; receiving, at the network analytics controller, network analytics configuration parameters including a network analytics scope; assigning, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node; performing, at each agent assigned a task, the assign task; receiving, at the networks analytics controller, results of each performed task; aggregating, at the networks analytics controller, the received results. 2. The method of claim 1, wherein establishing a network analytics controller in a network comprises:
establishing a front end operative to expose an interface over the network allowing a user to provide network analytics configuration parameters; establishing a monitor operative to monitor network nodes and determine node that fall within the network analytics scope; establishing a deployment manager operative to assign one or more tasks to an agent at each network node determined to be within the network analytics scope; and establishing a collector operative to receive results from tasked agents and process the results according to the network analytics configuration parameters. 3. The method of claim 2, wherein establishing a plurality of agents, each agent deployed at a node of the network in communication with the controller, comprises:
establishing a node manager operative to communicate with the network analytics controller to discover, register, and deploy tasks assigned to the agent; establishing a data source handler operative to configure data sources at the node to collect data called for by the deployed tasks; and establishing a network aggregator operative to preprocess and forward collected data to the network analytics controller as results. 4. The method of claim 3, wherein performing, at each agent assigned a task, the assign task comprises:
discovering, registering, and deploying, by the node manager of the agent, the tasks assigned to the agent; configuring, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task; collecting, by the data source handler of the agent, data from each source as configured; and forwarding, by an aggregator of the agent, the collected data to the network analytics controller. 5. The method of claim 4, wherein configuring, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task, comprises configuring at least one probe to generate test traffic. 6. The method of claim 1, wherein assigning, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, comprises dynamically adjusting the network analysis scope in accordance with the configuration parameters and the received results of each performed task 7. The method of claim 1, wherein establishing a network analytics controller comprises establishing the networks analytics controller in a software-defined network controller framework. 8. Logic encoded on one or more tangible media for execution and when executed operable to:
receive, at a network analytics controller, network analytics configuration parameters including a network analytics scope; assign, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node; perform, at each agent assigned a task, the assign task; receive, at the networks analytics controller, results of each performed task; and aggregate, at the networks analytics controller, the received results. 9. The logic of claim 8, wherein the logic of the network analytics controller comprises logic operable to:
establish a front end operative to expose an interface over the network allowing a user to provide network analytics configuration parameters; establish a monitor operative to monitor network nodes and determine node that fall within the network analytics scope; establish a deployment manager operative to assign one or more tasks to an agent at each network node determined to be within the network analytics scope; and establish a collector operative to receive results from tasked agents and process the results according to the network analytics configuration parameters. 10. The logic of claim 8, wherein logic operable to perform, at each agent assigned a task, the assign task comprises logic operable to:
discover, register, and deploy the tasks assigned to the agent; configure at least one data source at the node to collect data called for the deployed task; collect data from each source as configured; and forward the collected data to the network analytics controller. 11. The logic of claim 10, wherein logic operable to configure, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task, comprises logic operable to configure at least one probe to generate test traffic. 12. The logic of claim 8, wherein logic operable to assign, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, comprises logic operable to dynamically adjust the network analysis scope in accordance with the configuration parameters and the received results of each performed task 13. The logic of claim 8, wherein logic operable to establish a network analytics controller comprises logic operable to establish the networks analytics controller in a software-defined network controller framework. 14. A system comprising:
a storage device; and a processor communicatively coupled to the storage device, wherein the processor executes application code instructions that are stored in the storage device to cause the system to: establish a network analytics controller in a network; establish a plurality of network analytics agents, each agent at a node of the network; receive, at a network analytics controller, network analytics configuration parameters including a network analytics scope; assign, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node; perform, at each agent assigned a task, the assign task; receive, at the networks analytics controller, results of each performed task; aggregate, at the networks analytics controller, the received results. 15. The system of claim 14, wherein establishing a network analytics controller in a network comprises:
establishing a front end operative to expose an interface over the network allowing a user to provide network analytics configuration parameters; establishing a monitor operative to monitor network nodes and determine node that fall within the network analytics scope; establishing a deployment manager operative to assign one or more tasks to an agent at each network node determined to fall within the network analytics scope; and establishing a collector operative to receive results from tasked agents and process the results according to the network analytics configuration analytics. 16. The system of claim 15, wherein establishing a plurality of agents, each agent deployed at a node of the network in communication with the controller, comprises:
establishing a node manager operative to communicate with the controller to discover, register, and deploy tasks assigned to the agent; establishing a data source handler operative to configure data sources at the node to collect data called for by the deployed tasks; and establishing a network aggregator operative to preprocess and forward collected data to the controller as results. 17. The system of claim 16, wherein performing, at each agent assigned a task, the assign task comprises:
discovering, registering, and deploying, by the node manager of the agent, the tasks assigned to the agent; configuring, by the data source handler of the agent, at least one data source at the node to collect data called for the deployed task; collecting, by the data source handler of the agent, data from each source as configured; and forwarding, by an aggregator of the agent, the collected data to the network analytics controller. 18. The method of claim 15, wherein configuring, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task, comprises configuring at least one probe to generate test traffic. 19. The method of claim 14, wherein assigning, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, comprises dynamically adjusting the network analysis scope in accordance with the configuration parameters and the received results of each performed task 20. The method of claim 14, wherein establishing a network analytics controller comprises establishing the networks analytics controller in a software-defined network controller framework. | A network analytics controller is established in a network. The network includes a plurality of nodes. A plurality of network analytics agents is established; each agent at a node of the network. Network analytics configuration parameters, including a network analytics scope, are received at the networks analytics controller. A task is assigned to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node. The assigned task is performed at each agent assigned a task. The networks analytics controller receives the results of each performed task, and aggregates the received results.1. A method comprising:
establishing a network analytics controller in a network, the network comprising a plurality of nodes; establishing a plurality of network analytics agents, each agent at a node of the network; receiving, at the network analytics controller, network analytics configuration parameters including a network analytics scope; assigning, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node; performing, at each agent assigned a task, the assign task; receiving, at the networks analytics controller, results of each performed task; aggregating, at the networks analytics controller, the received results. 2. The method of claim 1, wherein establishing a network analytics controller in a network comprises:
establishing a front end operative to expose an interface over the network allowing a user to provide network analytics configuration parameters; establishing a monitor operative to monitor network nodes and determine node that fall within the network analytics scope; establishing a deployment manager operative to assign one or more tasks to an agent at each network node determined to be within the network analytics scope; and establishing a collector operative to receive results from tasked agents and process the results according to the network analytics configuration parameters. 3. The method of claim 2, wherein establishing a plurality of agents, each agent deployed at a node of the network in communication with the controller, comprises:
establishing a node manager operative to communicate with the network analytics controller to discover, register, and deploy tasks assigned to the agent; establishing a data source handler operative to configure data sources at the node to collect data called for by the deployed tasks; and establishing a network aggregator operative to preprocess and forward collected data to the network analytics controller as results. 4. The method of claim 3, wherein performing, at each agent assigned a task, the assign task comprises:
discovering, registering, and deploying, by the node manager of the agent, the tasks assigned to the agent; configuring, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task; collecting, by the data source handler of the agent, data from each source as configured; and forwarding, by an aggregator of the agent, the collected data to the network analytics controller. 5. The method of claim 4, wherein configuring, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task, comprises configuring at least one probe to generate test traffic. 6. The method of claim 1, wherein assigning, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, comprises dynamically adjusting the network analysis scope in accordance with the configuration parameters and the received results of each performed task 7. The method of claim 1, wherein establishing a network analytics controller comprises establishing the networks analytics controller in a software-defined network controller framework. 8. Logic encoded on one or more tangible media for execution and when executed operable to:
receive, at a network analytics controller, network analytics configuration parameters including a network analytics scope; assign, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node; perform, at each agent assigned a task, the assign task; receive, at the networks analytics controller, results of each performed task; and aggregate, at the networks analytics controller, the received results. 9. The logic of claim 8, wherein the logic of the network analytics controller comprises logic operable to:
establish a front end operative to expose an interface over the network allowing a user to provide network analytics configuration parameters; establish a monitor operative to monitor network nodes and determine node that fall within the network analytics scope; establish a deployment manager operative to assign one or more tasks to an agent at each network node determined to be within the network analytics scope; and establish a collector operative to receive results from tasked agents and process the results according to the network analytics configuration parameters. 10. The logic of claim 8, wherein logic operable to perform, at each agent assigned a task, the assign task comprises logic operable to:
discover, register, and deploy the tasks assigned to the agent; configure at least one data source at the node to collect data called for the deployed task; collect data from each source as configured; and forward the collected data to the network analytics controller. 11. The logic of claim 10, wherein logic operable to configure, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task, comprises logic operable to configure at least one probe to generate test traffic. 12. The logic of claim 8, wherein logic operable to assign, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, comprises logic operable to dynamically adjust the network analysis scope in accordance with the configuration parameters and the received results of each performed task 13. The logic of claim 8, wherein logic operable to establish a network analytics controller comprises logic operable to establish the networks analytics controller in a software-defined network controller framework. 14. A system comprising:
a storage device; and a processor communicatively coupled to the storage device, wherein the processor executes application code instructions that are stored in the storage device to cause the system to: establish a network analytics controller in a network; establish a plurality of network analytics agents, each agent at a node of the network; receive, at a network analytics controller, network analytics configuration parameters including a network analytics scope; assign, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, the task comprising that portion of the network analytics specified in the network analytics configuration parameters relevant to the corresponding node; perform, at each agent assigned a task, the assign task; receive, at the networks analytics controller, results of each performed task; aggregate, at the networks analytics controller, the received results. 15. The system of claim 14, wherein establishing a network analytics controller in a network comprises:
establishing a front end operative to expose an interface over the network allowing a user to provide network analytics configuration parameters; establishing a monitor operative to monitor network nodes and determine node that fall within the network analytics scope; establishing a deployment manager operative to assign one or more tasks to an agent at each network node determined to fall within the network analytics scope; and establishing a collector operative to receive results from tasked agents and process the results according to the network analytics configuration analytics. 16. The system of claim 15, wherein establishing a plurality of agents, each agent deployed at a node of the network in communication with the controller, comprises:
establishing a node manager operative to communicate with the controller to discover, register, and deploy tasks assigned to the agent; establishing a data source handler operative to configure data sources at the node to collect data called for by the deployed tasks; and establishing a network aggregator operative to preprocess and forward collected data to the controller as results. 17. The system of claim 16, wherein performing, at each agent assigned a task, the assign task comprises:
discovering, registering, and deploying, by the node manager of the agent, the tasks assigned to the agent; configuring, by the data source handler of the agent, at least one data source at the node to collect data called for the deployed task; collecting, by the data source handler of the agent, data from each source as configured; and forwarding, by an aggregator of the agent, the collected data to the network analytics controller. 18. The method of claim 15, wherein configuring, by the data source handler of the agent, at least one data source at the node to collect data called for by the deployed task, comprises configuring at least one probe to generate test traffic. 19. The method of claim 14, wherein assigning, from the network analytics controller, a task to each agent at a node determined to be within the network analytics scope, comprises dynamically adjusting the network analysis scope in accordance with the configuration parameters and the received results of each performed task 20. The method of claim 14, wherein establishing a network analytics controller comprises establishing the networks analytics controller in a software-defined network controller framework. | 2,400 |
9,467 | 9,467 | 15,194,423 | 2,436 | User profiles of applications installed in a user environment, which may be compromised by malware, are managed to protect against such malware gaining access to sensitive data that may be contained in the user profiles. The method includes the steps of detecting, by a management agent of a user environment, a launch of an application within the user environment, verifying, by a filter driver, an identity of the application against a stored profile of the application, and responsive to determining that the identity of the application matches the stored profile of the application, importing, by the management agent, an encrypted user profile from a remote storage to local storage, decrypting, by the filter driver, the encrypted user profile, and providing the decrypted user profile to the application. | 1. A method of managing a user profile, comprising:
detecting, by a management agent of a user environment, a launch of an application within the user environment; verifying, by a filter driver, an identity of the application against a stored profile of the application; and responsive to determining that the identity of the application matches the stored profile of the application, importing, by the management agent, an encrypted user profile from a remote storage to local storage, decrypting, by the filter driver, the encrypted user profile, and providing the decrypted user profile to the application. 2. The method of claim 1, wherein verifying an identity of the application comprises:
computing a hash value for the application; comparing the computed hash value with a stored hash value associated with the application; and confirming that the identity of the application is verified if the computed hash value matches the stored hash value. 3. The method of claim 1, wherein verifying an identity of the application comprises:
retrieving certificate data associated with the application; comparing the retrieved certificate data with a stored certificate data associated with the application; and confirming that the identity of the application is verified if the retrieved certificate data matches the stored certificate data. 4. The method of claim 1, wherein the stored profile of the application is created by a method comprising:
computing a hash value of the application; capturing certificate data for the application; capturing a user profile directory path associated with the application; and storing the hash value, the certificate data, and the user profile directory path. 5. The method of claim 1, further comprising:
detecting, by the management agent, an update to a user profile for an application; encrypting, by the filter driver, the user profile; and writing, by a file system driver, the encrypted user profile to local storage. 6. The method of claim 5, further comprising:
upon detecting a closing of the application or a shutdown, copying, by the management agent, the encrypted user profile to remote storage. 7. A non-transitory computer readable medium comprising instructions for causing a computing device to perform a method of managing a user profile, said method comprising the steps of:
detecting, by a management agent of a user environment, a launch of an application within the user environment; verifying, by a filter driver, an identity of the application against a stored profile of the application; and responsive to determining that the identity of the application matches the stored profile of the application, importing, by the management agent, an encrypted user profile from a remote storage to local storage, decrypting, by the filter driver, the encrypted user profile, and providing the decrypted user profile to the application. 8. The method of claim 7, wherein the step of verifying an identity of the application comprises:
computing a hash value for the application; comparing the computed hash value with a stored hash value associated with the application; and confirming that the identity of the application is verified if the computed hash value matches the stored hash value. 9. The method of claim 7, wherein the step of verifying an identity of the application comprises:
retrieving certificate data associated with the application; comparing the retrieved certificate data with a stored certificate data associated with the application; and confirming that the identity of the application is verified if the retrieved certificate data matches the stored certificate data. 10. The method of claim 7, wherein the stored profile of the application is created by a method comprising:
computing a hash value of the application; capturing certificate data for the application; capturing a user profile directory path associated with the application; and storing the hash value, the certificate data, and the user profile directory path. 11. The method of claim 7, wherein the method further comprises the steps of:
detecting, by the management agent, an update to a user profile for an application; encrypting, by the filter driver, the user profile; and writing, by a file system driver, the encrypted user profile to local storage. 12. The method of claim 11, wherein the method further comprises the step of
upon detecting a closing of the application or a shutdown, copying, by the management agent, the encrypted user profile to remote storage. 13. A computer system comprising a processor, memory, and local storage, and connected to a remote storage over a network, wherein the processor is programmed with:
a management agent of a user environment that detects a launch of an application within the user environment; and a filter driver that verifies an identity of the application against a stored profile of the application, wherein, responsive to determining that the identity of the application matches the stored profile of the application, the management agent imports an encrypted user profile from a remote storage to local storage, and the filter driver decrypts the encrypted user profile and provides the decrypted user profile to the application. 14. The computer system of claim 13, wherein the filer driver verifies an identity of the application by:
computing a hash value for the application; comparing the computed hash value with a stored hash value associated with the application; and confirming that the identity of the application is verified if the computed hash value matches the stored hash value. 15. The computer system of claim 13, wherein the filer driver verifies an identity of the application by:
retrieving certificate data associated with the application; comparing the retrieved certificate data with a stored certificate data associated with the application; and confirming that the identity of the application is verified if the retrieved certificate data matches the stored certificate data. 16. The computer system of claim 13, wherein the stored profile of the application is created by:
computing a hash value of the application; capturing certificate data for the application; capturing a user profile directory path associated with the application; and storing the hash value, the certificate data, and the user profile directory path. 17. The computer system of claim 13, wherein
the management agent is further programmed to detect an update to a user profile for an application, the filter driver is further programmed to encrypt the user profile; and the processor is further programmed with a file system driver that writes the encrypted user profile to local storage. 18. The computer system of claim 17, wherein
upon detecting a closing of the application or a shutdown, the management agent copies the encrypted user profile to remote storage. | User profiles of applications installed in a user environment, which may be compromised by malware, are managed to protect against such malware gaining access to sensitive data that may be contained in the user profiles. The method includes the steps of detecting, by a management agent of a user environment, a launch of an application within the user environment, verifying, by a filter driver, an identity of the application against a stored profile of the application, and responsive to determining that the identity of the application matches the stored profile of the application, importing, by the management agent, an encrypted user profile from a remote storage to local storage, decrypting, by the filter driver, the encrypted user profile, and providing the decrypted user profile to the application.1. A method of managing a user profile, comprising:
detecting, by a management agent of a user environment, a launch of an application within the user environment; verifying, by a filter driver, an identity of the application against a stored profile of the application; and responsive to determining that the identity of the application matches the stored profile of the application, importing, by the management agent, an encrypted user profile from a remote storage to local storage, decrypting, by the filter driver, the encrypted user profile, and providing the decrypted user profile to the application. 2. The method of claim 1, wherein verifying an identity of the application comprises:
computing a hash value for the application; comparing the computed hash value with a stored hash value associated with the application; and confirming that the identity of the application is verified if the computed hash value matches the stored hash value. 3. The method of claim 1, wherein verifying an identity of the application comprises:
retrieving certificate data associated with the application; comparing the retrieved certificate data with a stored certificate data associated with the application; and confirming that the identity of the application is verified if the retrieved certificate data matches the stored certificate data. 4. The method of claim 1, wherein the stored profile of the application is created by a method comprising:
computing a hash value of the application; capturing certificate data for the application; capturing a user profile directory path associated with the application; and storing the hash value, the certificate data, and the user profile directory path. 5. The method of claim 1, further comprising:
detecting, by the management agent, an update to a user profile for an application; encrypting, by the filter driver, the user profile; and writing, by a file system driver, the encrypted user profile to local storage. 6. The method of claim 5, further comprising:
upon detecting a closing of the application or a shutdown, copying, by the management agent, the encrypted user profile to remote storage. 7. A non-transitory computer readable medium comprising instructions for causing a computing device to perform a method of managing a user profile, said method comprising the steps of:
detecting, by a management agent of a user environment, a launch of an application within the user environment; verifying, by a filter driver, an identity of the application against a stored profile of the application; and responsive to determining that the identity of the application matches the stored profile of the application, importing, by the management agent, an encrypted user profile from a remote storage to local storage, decrypting, by the filter driver, the encrypted user profile, and providing the decrypted user profile to the application. 8. The method of claim 7, wherein the step of verifying an identity of the application comprises:
computing a hash value for the application; comparing the computed hash value with a stored hash value associated with the application; and confirming that the identity of the application is verified if the computed hash value matches the stored hash value. 9. The method of claim 7, wherein the step of verifying an identity of the application comprises:
retrieving certificate data associated with the application; comparing the retrieved certificate data with a stored certificate data associated with the application; and confirming that the identity of the application is verified if the retrieved certificate data matches the stored certificate data. 10. The method of claim 7, wherein the stored profile of the application is created by a method comprising:
computing a hash value of the application; capturing certificate data for the application; capturing a user profile directory path associated with the application; and storing the hash value, the certificate data, and the user profile directory path. 11. The method of claim 7, wherein the method further comprises the steps of:
detecting, by the management agent, an update to a user profile for an application; encrypting, by the filter driver, the user profile; and writing, by a file system driver, the encrypted user profile to local storage. 12. The method of claim 11, wherein the method further comprises the step of
upon detecting a closing of the application or a shutdown, copying, by the management agent, the encrypted user profile to remote storage. 13. A computer system comprising a processor, memory, and local storage, and connected to a remote storage over a network, wherein the processor is programmed with:
a management agent of a user environment that detects a launch of an application within the user environment; and a filter driver that verifies an identity of the application against a stored profile of the application, wherein, responsive to determining that the identity of the application matches the stored profile of the application, the management agent imports an encrypted user profile from a remote storage to local storage, and the filter driver decrypts the encrypted user profile and provides the decrypted user profile to the application. 14. The computer system of claim 13, wherein the filer driver verifies an identity of the application by:
computing a hash value for the application; comparing the computed hash value with a stored hash value associated with the application; and confirming that the identity of the application is verified if the computed hash value matches the stored hash value. 15. The computer system of claim 13, wherein the filer driver verifies an identity of the application by:
retrieving certificate data associated with the application; comparing the retrieved certificate data with a stored certificate data associated with the application; and confirming that the identity of the application is verified if the retrieved certificate data matches the stored certificate data. 16. The computer system of claim 13, wherein the stored profile of the application is created by:
computing a hash value of the application; capturing certificate data for the application; capturing a user profile directory path associated with the application; and storing the hash value, the certificate data, and the user profile directory path. 17. The computer system of claim 13, wherein
the management agent is further programmed to detect an update to a user profile for an application, the filter driver is further programmed to encrypt the user profile; and the processor is further programmed with a file system driver that writes the encrypted user profile to local storage. 18. The computer system of claim 17, wherein
upon detecting a closing of the application or a shutdown, the management agent copies the encrypted user profile to remote storage. | 2,400 |
9,468 | 9,468 | 12,767,870 | 2,482 | An interactive user interface, such as a remote terminal user interface, is compressed prior to transmission to a video client. The compression may be performed independently of any other video that may be simultaneously transmitted to the video client. At the client side, two compressed video streams (remote user interface and video content) may be decompressed independently of each other. In some cases, technology already existing in some client devices, such as picture-in-picture (PiP) capability, may be leveraged to decompress the received compressed remote user interface without needing to modify the hardware of those client devices. | 1. A method, comprising:
receiving first data representing compressed video content; receiving second data representing a compressed interactive user interface; decompressing the compressed video content; decompressing the compressed interactive user interface separately from the compressed video content; and generating a video signal that includes both the decompressed video content and the decompressed interactive user interface. 2. The method of claim 1, wherein generating comprises generating the video signal such that the decompressed interactive user interface is overlaid on the decompressed video content. 3. The method of claim 1, wherein generating comprises generating the video signal such that the decompressed interactive user interface is displayed simultaneously with the decompressed video content. 4. The method of claim 1, wherein generating comprises generating a first plurality of video frames interleaved with a second plurality of video frames, wherein the first plurality of video frames comprises the decompressed interactive user interface but not the decompressed video content, and the second plurality of video frames comprises the decompressed video content but not the decompressed interactive user interface. 5. The method of claim 1, wherein the compressed video content is compressed using non-lossy compression and the compressed interactive user interface is compressed using lossy compression. 6. The method of claim 1, further comprising receiving user input, wherein generating comprises generating the video signal such that a location of the decompressed interactive user interface in a video frame is based upon the user input. 7. The method of claim 6, wherein the location is not represented by either of the received first and second data. 8. The method of claim 1, wherein the interactive user interface comprises graphics. 9. An apparatus, comprising:
a network interface configured to receive from a network first data representing a compressed interactive user interface and second data representing video content; a decoder configured to decompress the compressed interactive user interface and to decompress the compressed video content; and a combiner configured to generate a video signal combining the decompressed interactive user interface with the decompressed video content. 10. The apparatus of claim 9, wherein the decoder comprises:
a first decoder configured to decompress the compressed interactive user interface; and a second decoder configured to decompress the video content. 11. The apparatus of claim 9, wherein the combiner is configured to generate the video signal such that the decompressed interactive user interface is displayed simultaneously with the decompressed video content. 12. The apparatus of claim 9, wherein the combiner is configured to generate a first plurality of video frames interleaved with a second plurality of video frames, wherein the first plurality of video frames comprises the decompressed interactive user interface but not the decompressed video content, and the second plurality of video frames comprises the decompressed video content but not the decompressed interactive user interface. 13. The apparatus of claim 9, wherein the compressed video content is compressed using non-lossy compression and the compressed interactive user interface is compressed using lossy compression. 14. The apparatus of claim 9, wherein the apparatus is further configured to receive a user input, and wherein the combiner is configured to generate the video signal such that a location of the decompressed interactive user interface in a video frame is based upon the user input. 15. A method, comprising:
receiving first data representing video content; generating second data representing an interactive user interface; compressing the interactive user interface; and sending third data representing the video content and fourth data representing the compressed interactive user interface. 16. The method of claim 15, wherein compressing comprises compressing the interactive user interface using MPEG-4 compression. 17. The method of claim 15, wherein sending comprises sending the third and fourth data to a network, wherein the method further comprises receiving fifth data from the network, and wherein generating comprises generating the second data such that the interactive user interface depends on the fifth data. 18. The method of claim 15, wherein the video content is compressed video content. 19. An apparatus, comprising:
a program tuner configured to receive first data representing video content; a processor configured to generate second data representing an interactive user interface; a compressor configured to compress the interactive user interface; and a network interface configured to send third data representing the video content and fourth data representing the compressed interactive user interface. 20. The apparatus of claim 19, wherein the network interface is configured to send the third and fourth data to a network, and wherein the network interface is configured to receive fifth data from the network, and wherein the processor is configured such that the interactive user interface depends on the fifth data. | An interactive user interface, such as a remote terminal user interface, is compressed prior to transmission to a video client. The compression may be performed independently of any other video that may be simultaneously transmitted to the video client. At the client side, two compressed video streams (remote user interface and video content) may be decompressed independently of each other. In some cases, technology already existing in some client devices, such as picture-in-picture (PiP) capability, may be leveraged to decompress the received compressed remote user interface without needing to modify the hardware of those client devices.1. A method, comprising:
receiving first data representing compressed video content; receiving second data representing a compressed interactive user interface; decompressing the compressed video content; decompressing the compressed interactive user interface separately from the compressed video content; and generating a video signal that includes both the decompressed video content and the decompressed interactive user interface. 2. The method of claim 1, wherein generating comprises generating the video signal such that the decompressed interactive user interface is overlaid on the decompressed video content. 3. The method of claim 1, wherein generating comprises generating the video signal such that the decompressed interactive user interface is displayed simultaneously with the decompressed video content. 4. The method of claim 1, wherein generating comprises generating a first plurality of video frames interleaved with a second plurality of video frames, wherein the first plurality of video frames comprises the decompressed interactive user interface but not the decompressed video content, and the second plurality of video frames comprises the decompressed video content but not the decompressed interactive user interface. 5. The method of claim 1, wherein the compressed video content is compressed using non-lossy compression and the compressed interactive user interface is compressed using lossy compression. 6. The method of claim 1, further comprising receiving user input, wherein generating comprises generating the video signal such that a location of the decompressed interactive user interface in a video frame is based upon the user input. 7. The method of claim 6, wherein the location is not represented by either of the received first and second data. 8. The method of claim 1, wherein the interactive user interface comprises graphics. 9. An apparatus, comprising:
a network interface configured to receive from a network first data representing a compressed interactive user interface and second data representing video content; a decoder configured to decompress the compressed interactive user interface and to decompress the compressed video content; and a combiner configured to generate a video signal combining the decompressed interactive user interface with the decompressed video content. 10. The apparatus of claim 9, wherein the decoder comprises:
a first decoder configured to decompress the compressed interactive user interface; and a second decoder configured to decompress the video content. 11. The apparatus of claim 9, wherein the combiner is configured to generate the video signal such that the decompressed interactive user interface is displayed simultaneously with the decompressed video content. 12. The apparatus of claim 9, wherein the combiner is configured to generate a first plurality of video frames interleaved with a second plurality of video frames, wherein the first plurality of video frames comprises the decompressed interactive user interface but not the decompressed video content, and the second plurality of video frames comprises the decompressed video content but not the decompressed interactive user interface. 13. The apparatus of claim 9, wherein the compressed video content is compressed using non-lossy compression and the compressed interactive user interface is compressed using lossy compression. 14. The apparatus of claim 9, wherein the apparatus is further configured to receive a user input, and wherein the combiner is configured to generate the video signal such that a location of the decompressed interactive user interface in a video frame is based upon the user input. 15. A method, comprising:
receiving first data representing video content; generating second data representing an interactive user interface; compressing the interactive user interface; and sending third data representing the video content and fourth data representing the compressed interactive user interface. 16. The method of claim 15, wherein compressing comprises compressing the interactive user interface using MPEG-4 compression. 17. The method of claim 15, wherein sending comprises sending the third and fourth data to a network, wherein the method further comprises receiving fifth data from the network, and wherein generating comprises generating the second data such that the interactive user interface depends on the fifth data. 18. The method of claim 15, wherein the video content is compressed video content. 19. An apparatus, comprising:
a program tuner configured to receive first data representing video content; a processor configured to generate second data representing an interactive user interface; a compressor configured to compress the interactive user interface; and a network interface configured to send third data representing the video content and fourth data representing the compressed interactive user interface. 20. The apparatus of claim 19, wherein the network interface is configured to send the third and fourth data to a network, and wherein the network interface is configured to receive fifth data from the network, and wherein the processor is configured such that the interactive user interface depends on the fifth data. | 2,400 |
9,469 | 9,469 | 15,386,917 | 2,486 | A system and method for displaying an image of an object of interest located at an incident scene. The method includes receiving, from the image capture device, a first video stream of the incident scene, and displaying the video stream. The method includes receiving an input indicating a pixel location in the video stream, and detecting the object of interest in the video stream based on the pixel location. The method includes determining an object class, an object identifier, and metadata for the object of interest. The metadata includes the object class, an object location, an incident identifier corresponding to the incident scene, and a time stamp. The method includes receiving an annotation input for the object of interest, and associating the annotation input and the metadata with the object identifier. The method includes storing, in a memory, the object of interest, the annotation input, and the metadata. | 1. A system for displaying an image of an object of interest located at an incident scene, the system comprising:
an image capture device; a display; a memory; and an electronic processor coupled to the image capture device, the display, and the memory, and configured to
receive, from the image capture device, a first video stream of the incident scene;
display the first video stream on the display;
receive an input indicating a pixel location in the first video stream;
detect the object of interest in the first video stream based on the pixel location;
determine an object class for the object of interest;
determine an object identifier for the object of interest;
determine metadata for the object of interest including the object class, an object location, an incident identifier corresponding to the incident scene, and a time stamp;
receive an annotation input for the object of interest;
associate the annotation input and the metadata with the object identifier; and
store, in the memory, the object of interest, the annotation input, and the metadata. 2. The system of claim 1, wherein the electronic processor is further configured to
receive, from the image capture device, a second video stream of the incident scene; display the second video stream on the display; detect the object of interest in the second video stream; retrieve, from the memory, the annotation input and the metadata based on the incident identifier and the object identifier; and display the annotation input and the metadata for the object of interest. 3. The system of claim 1, wherein the electronic processor is further configured to
detect the object of interest in the first video stream using an object classifier; and determine the object class using the object classifier. 4. The system of claim 1, wherein the electronic processor is further configured to
capture a second video stream of the incident scene; retrieve, from the memory, the object of interest based on the incident identifier; superimpose, on the second video stream, based on the object location, the object of interest to create a superimposed video stream of the incident scene; receive a second input selecting an annotation indicator in the superimposed video stream; retrieve the annotation input and the metadata based on the second input; and display the annotation input and the metadata for the object of interest. 5. The system of claim 4, wherein the metadata includes a current location for the object of interest. 6. The system of claim 1, wherein the electronic processor is further configured to
capture a second video stream of the incident scene; display the second video stream on the display; locate, in the second video stream, the object of interest; determine the object identifier based on the object of interest; retrieve, from the memory, the annotation input and the metadata based on the object identifier; display the annotation input and the metadata for the object of interest; identify a visual change in the object of interest; and highlight, on the object of interest, the visual change. 7. The system of claim 6, wherein the electronic processor is further configured to
display, on the display, a timeline based on the incident scene and the time stamp; receive a second input selecting a selected time on the timeline; and update the object of interest, the annotation input, and the metadata based on the selected time. 8. The system of claim 1, wherein the electronic processor is further configured to
receive a second input selecting the object of interest; and in response to the second input, display an executable menu based on at least one selected from a group consisting of the incident identifier, the object identifier, and the metadata; wherein the executable menu performs one of entering an edit mode and displaying detailed annotations. 9. The system of claim 1, wherein the electronic processor is further configured to
receive an input corresponding to a first location at the incident scene; receive an input corresponding to a second location at the incident scene; determine a line of sight based on the first location and the second location; determine a distance between the first location and the second location; and display, on the display, the line of sight and the distance. 10. The system of claim 1, wherein the display is a head-mounted display. 11. A method for displaying an image of an object of interest located at an incident scene on a display of a device, the method comprising:
receiving, from an image capture device, a first video stream of the incident scene; displaying the first video stream on the display; receiving an input indicating a pixel location in the first video stream; detecting the object of interest in the first video stream based on the pixel location; determining an object class for the object of interest; determining an object identifier for the object of interest; determining metadata for the object of interest including the object class, an object location, an incident identifier corresponding to the incident scene, and a time stamp; receiving an annotation input for the object of interest; associating the annotation input and the metadata with the object identifier; and storing, in a memory, the object of interest, the annotation input, and the metadata. 12. The method of claim 11, further comprising
receiving, from the image capture device, a second video stream of the incident scene; displaying the second video stream on the display; detecting the object of interest in the second video stream; retrieving, from the memory, the annotation input and the metadata based on the incident identifier and the object identifier; and displaying the annotation input and the metadata for the object of interest. 13. The method of claim 12, wherein
detecting the object of interest includes detecting the object of interest using an object classifier; and determining an object class for the object of interest includes determining an object class using the object classifier. 14. The method of claim 11, wherein receiving an annotation input for the object of interest includes receiving at least one of a text-based annotation and an audio annotation. 15. The method of claim 11, further comprising:
capturing a second video stream of the incident scene; retrieving, from the memory, the object of interest based on the incident identifier; superimposing, on the second video stream, based on the object location, the object of interest to create a superimposed video stream of the incident scene; receiving a second input selecting an annotation indicator in the superimposed video stream; retrieving the annotation input and the metadata based on the second input; and displaying the annotation input and the metadata for the object of interest. 16. The method of claim 15, wherein displaying the metadata for the object of interest includes displaying a current location for the object of interest. 17. The method of claim 11, further comprising:
capturing a second video stream of the incident scene; displaying the second video stream on the display; locating, in the second video stream, the object of interest; determining the object identifier based on the object of interest; retrieving, from the memory, the annotation input and the metadata based on the object identifier; displaying the annotation input and the metadata for the object of interest; identifying a visual change in the object of interest; and highlighting, on the object of interest, the visual change. 18. The method of claim 17, further comprising:
displaying, on the display, a timeline based on the incident scene and the time stamp; receiving a second input selecting a selected time on the timeline; and updating the object of interest, the annotation input, and the metadata based on the selected time. 19. The method of claim 11, further comprising:
receiving a second input selecting the object of interest; and in response to the second input, displaying an executable menu based on at least one selected from a group consisting of the incident identifier, the object identifier, and the metadata; wherein the executable menu performs one of entering an edit mode and displaying detailed annotations. 20. The method of claim 11, further comprising:
receiving an input corresponding to a first location at the incident scene; receiving an input corresponding to a second location at the incident scene; determining a line of sight based on the first location and the second location; determining a distance between the first location and the second location; and displaying, on the display, the line of sight and the distance. | A system and method for displaying an image of an object of interest located at an incident scene. The method includes receiving, from the image capture device, a first video stream of the incident scene, and displaying the video stream. The method includes receiving an input indicating a pixel location in the video stream, and detecting the object of interest in the video stream based on the pixel location. The method includes determining an object class, an object identifier, and metadata for the object of interest. The metadata includes the object class, an object location, an incident identifier corresponding to the incident scene, and a time stamp. The method includes receiving an annotation input for the object of interest, and associating the annotation input and the metadata with the object identifier. The method includes storing, in a memory, the object of interest, the annotation input, and the metadata.1. A system for displaying an image of an object of interest located at an incident scene, the system comprising:
an image capture device; a display; a memory; and an electronic processor coupled to the image capture device, the display, and the memory, and configured to
receive, from the image capture device, a first video stream of the incident scene;
display the first video stream on the display;
receive an input indicating a pixel location in the first video stream;
detect the object of interest in the first video stream based on the pixel location;
determine an object class for the object of interest;
determine an object identifier for the object of interest;
determine metadata for the object of interest including the object class, an object location, an incident identifier corresponding to the incident scene, and a time stamp;
receive an annotation input for the object of interest;
associate the annotation input and the metadata with the object identifier; and
store, in the memory, the object of interest, the annotation input, and the metadata. 2. The system of claim 1, wherein the electronic processor is further configured to
receive, from the image capture device, a second video stream of the incident scene; display the second video stream on the display; detect the object of interest in the second video stream; retrieve, from the memory, the annotation input and the metadata based on the incident identifier and the object identifier; and display the annotation input and the metadata for the object of interest. 3. The system of claim 1, wherein the electronic processor is further configured to
detect the object of interest in the first video stream using an object classifier; and determine the object class using the object classifier. 4. The system of claim 1, wherein the electronic processor is further configured to
capture a second video stream of the incident scene; retrieve, from the memory, the object of interest based on the incident identifier; superimpose, on the second video stream, based on the object location, the object of interest to create a superimposed video stream of the incident scene; receive a second input selecting an annotation indicator in the superimposed video stream; retrieve the annotation input and the metadata based on the second input; and display the annotation input and the metadata for the object of interest. 5. The system of claim 4, wherein the metadata includes a current location for the object of interest. 6. The system of claim 1, wherein the electronic processor is further configured to
capture a second video stream of the incident scene; display the second video stream on the display; locate, in the second video stream, the object of interest; determine the object identifier based on the object of interest; retrieve, from the memory, the annotation input and the metadata based on the object identifier; display the annotation input and the metadata for the object of interest; identify a visual change in the object of interest; and highlight, on the object of interest, the visual change. 7. The system of claim 6, wherein the electronic processor is further configured to
display, on the display, a timeline based on the incident scene and the time stamp; receive a second input selecting a selected time on the timeline; and update the object of interest, the annotation input, and the metadata based on the selected time. 8. The system of claim 1, wherein the electronic processor is further configured to
receive a second input selecting the object of interest; and in response to the second input, display an executable menu based on at least one selected from a group consisting of the incident identifier, the object identifier, and the metadata; wherein the executable menu performs one of entering an edit mode and displaying detailed annotations. 9. The system of claim 1, wherein the electronic processor is further configured to
receive an input corresponding to a first location at the incident scene; receive an input corresponding to a second location at the incident scene; determine a line of sight based on the first location and the second location; determine a distance between the first location and the second location; and display, on the display, the line of sight and the distance. 10. The system of claim 1, wherein the display is a head-mounted display. 11. A method for displaying an image of an object of interest located at an incident scene on a display of a device, the method comprising:
receiving, from an image capture device, a first video stream of the incident scene; displaying the first video stream on the display; receiving an input indicating a pixel location in the first video stream; detecting the object of interest in the first video stream based on the pixel location; determining an object class for the object of interest; determining an object identifier for the object of interest; determining metadata for the object of interest including the object class, an object location, an incident identifier corresponding to the incident scene, and a time stamp; receiving an annotation input for the object of interest; associating the annotation input and the metadata with the object identifier; and storing, in a memory, the object of interest, the annotation input, and the metadata. 12. The method of claim 11, further comprising
receiving, from the image capture device, a second video stream of the incident scene; displaying the second video stream on the display; detecting the object of interest in the second video stream; retrieving, from the memory, the annotation input and the metadata based on the incident identifier and the object identifier; and displaying the annotation input and the metadata for the object of interest. 13. The method of claim 12, wherein
detecting the object of interest includes detecting the object of interest using an object classifier; and determining an object class for the object of interest includes determining an object class using the object classifier. 14. The method of claim 11, wherein receiving an annotation input for the object of interest includes receiving at least one of a text-based annotation and an audio annotation. 15. The method of claim 11, further comprising:
capturing a second video stream of the incident scene; retrieving, from the memory, the object of interest based on the incident identifier; superimposing, on the second video stream, based on the object location, the object of interest to create a superimposed video stream of the incident scene; receiving a second input selecting an annotation indicator in the superimposed video stream; retrieving the annotation input and the metadata based on the second input; and displaying the annotation input and the metadata for the object of interest. 16. The method of claim 15, wherein displaying the metadata for the object of interest includes displaying a current location for the object of interest. 17. The method of claim 11, further comprising:
capturing a second video stream of the incident scene; displaying the second video stream on the display; locating, in the second video stream, the object of interest; determining the object identifier based on the object of interest; retrieving, from the memory, the annotation input and the metadata based on the object identifier; displaying the annotation input and the metadata for the object of interest; identifying a visual change in the object of interest; and highlighting, on the object of interest, the visual change. 18. The method of claim 17, further comprising:
displaying, on the display, a timeline based on the incident scene and the time stamp; receiving a second input selecting a selected time on the timeline; and updating the object of interest, the annotation input, and the metadata based on the selected time. 19. The method of claim 11, further comprising:
receiving a second input selecting the object of interest; and in response to the second input, displaying an executable menu based on at least one selected from a group consisting of the incident identifier, the object identifier, and the metadata; wherein the executable menu performs one of entering an edit mode and displaying detailed annotations. 20. The method of claim 11, further comprising:
receiving an input corresponding to a first location at the incident scene; receiving an input corresponding to a second location at the incident scene; determining a line of sight based on the first location and the second location; determining a distance between the first location and the second location; and displaying, on the display, the line of sight and the distance. | 2,400 |
9,470 | 9,470 | 14,848,302 | 2,441 | A system and method of communication traffic management on a portable communication device having a computer processor and a network connection to a computer server for transmitting or receiving data with the processor over a network is provided. The method includes: identifying, by a traffic manager application running on the processor, a first application running on the processor and delivering first data to or from the server over the network; intercepting, by the traffic manager application, electronic traffic of the first data to or from the first application or to or from the server; and controlling, by the traffic manager application, a rate of delivery of the first data to or from the first application. The system includes the portable communication device and a nonvolatile storage device coupled to the processor and storing instructions that, when executed by the processor, cause the processor to execute the steps of the method. | 1. A method of communication traffic management on a portable communication device having a computer processor and a network connection to a computer server for transmitting or receiving data with the processor over a network, the method comprising:
identifying, by a traffic manager application running on the processor, a first application running on the processor and delivering first data to or from the server over the network; intercepting, by the traffic manager application, electronic traffic of the first data to or from the first application; and controlling, by the traffic manager application, a rate of delivery of the first data to or from the first application or to or from the server. 2. The method of claim 1, wherein the controlling of the rate of delivery of the first data comprises throttling a present speed of the network as perceived by the first application to a first data rate less than the present speed of the network. 3. The method of claim 2, wherein the electronic traffic of the first data comprises data being transmitted using a secure protocol for Hypertext Transfer Protocol (HTTPS). 4. The method of claim 1, wherein the controlling of the rate of delivery of the first data comprises throttling the rate of delivery of the first data to or from the server to a first data rate less than a present speed of the network. 5. The method of claim 1, wherein the electronic traffic of the first data comprises an adaptive bitrate stream. 6. The method of claim 1, wherein the electronic traffic of the first data comprises a progressive stream. 7. The method of claim 1, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions as controlled by a manifest; and the controlling of the rate of delivery of the first data comprises editing the manifest to hide or remove those of the data rates that exceed a first data rate. 8. The method of claim 1, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions; and the controlling of the rate of delivery of the first data comprises failing or blocking access to those of the data rates that exceed a first data rate. 9. The method of claim 1, further comprising:
identifying, by the traffic manager application, a second application running on the processor and delivering second data to or from the server over the network; intercepting, by the traffic manager application, electronic traffic of the second data to or from the second application; and controlling, by the traffic manager application, a rate of delivery of the second data to or from the second application or to or from the server. 10. The method of claim 9, wherein the controlling of the rates of delivery of the first and second data comprises concurrently limiting the rates of delivery of the first and second data so that the rate of delivery of the first data exceeds the rate of delivery of the second data. 11. The method of claim 1, wherein the intercepting of the electronic traffic comprises using an internal proxy running on the processor. 12. The method of claim 1, wherein the intercepting of the electronic traffic comprises using a virtual private network (VPN) interface on the processor. 13. The method of claim 1, wherein the intercepting of the electronic traffic comprises running a modified said first application on the processor, the modified first application being configured to request the intercepting of the electronic traffic. 14. A system for communication traffic management, the system comprising:
a portable communication device having a computer processor and a network connection to a computer server for transmitting or receiving data with the processor over a network; and a nonvolatile storage device coupled to the processor and storing instructions that, when executed by the processor, cause the processor to:
identify a first application running on the processor and delivering first data to or from the server over the network;
intercept electronic traffic of the first data to or from the first application; and
control a rate of delivery of the first data to or from the first application or to or from the server. 15. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by throttling a present speed of the network as perceived by the first application to a first data rate less than the present speed of the network. 16. The system of claim 15, wherein the electronic traffic of the first data comprises data being transmitted using a secure protocol for Hypertext Transfer Protocol (HTTPS). 17. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by throttling the rate of delivery of the first data to or from the server to a first data rate less than a present speed of the network. 18. The system of claim 14, wherein the electronic traffic of the first data comprises an adaptive bitrate stream. 19. The system of claim 14, wherein the electronic traffic of the first data comprises a progressive stream. 20. The system of claim 14, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions as controlled by a manifest; and the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by editing the manifest to hide or remove those of the data rates that exceed a first data rate. 21. The system of claim 14, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions; and the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by failing or blocking access to those of the data rates that exceed a first data rate. 22. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to:
identify a second application running on the processor and delivering second data to or from the server over the network; intercept electronic traffic of the second data to or from the second application; and control a rate of delivery of the second data to or from the second application or to or from the server. 23. The system of claim 22, wherein the instructions, when executed by the processor, further cause the processor to control the rates of delivery of the first and second data by concurrently limiting the rates of delivery of the first and second data so that the rate of delivery of the first data exceeds the rate of delivery of the second data. 24. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to intercept the electronic traffic by using an internal proxy running on the processor. 25. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to intercept the electronic traffic by using a virtual private network (VPN) interface on the processor. 26. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to intercept the electronic traffic by running a modified said first application on the processor, the modified first application being configured to request the intercepting of the electronic traffic. | A system and method of communication traffic management on a portable communication device having a computer processor and a network connection to a computer server for transmitting or receiving data with the processor over a network is provided. The method includes: identifying, by a traffic manager application running on the processor, a first application running on the processor and delivering first data to or from the server over the network; intercepting, by the traffic manager application, electronic traffic of the first data to or from the first application or to or from the server; and controlling, by the traffic manager application, a rate of delivery of the first data to or from the first application. The system includes the portable communication device and a nonvolatile storage device coupled to the processor and storing instructions that, when executed by the processor, cause the processor to execute the steps of the method.1. A method of communication traffic management on a portable communication device having a computer processor and a network connection to a computer server for transmitting or receiving data with the processor over a network, the method comprising:
identifying, by a traffic manager application running on the processor, a first application running on the processor and delivering first data to or from the server over the network; intercepting, by the traffic manager application, electronic traffic of the first data to or from the first application; and controlling, by the traffic manager application, a rate of delivery of the first data to or from the first application or to or from the server. 2. The method of claim 1, wherein the controlling of the rate of delivery of the first data comprises throttling a present speed of the network as perceived by the first application to a first data rate less than the present speed of the network. 3. The method of claim 2, wherein the electronic traffic of the first data comprises data being transmitted using a secure protocol for Hypertext Transfer Protocol (HTTPS). 4. The method of claim 1, wherein the controlling of the rate of delivery of the first data comprises throttling the rate of delivery of the first data to or from the server to a first data rate less than a present speed of the network. 5. The method of claim 1, wherein the electronic traffic of the first data comprises an adaptive bitrate stream. 6. The method of claim 1, wherein the electronic traffic of the first data comprises a progressive stream. 7. The method of claim 1, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions as controlled by a manifest; and the controlling of the rate of delivery of the first data comprises editing the manifest to hide or remove those of the data rates that exceed a first data rate. 8. The method of claim 1, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions; and the controlling of the rate of delivery of the first data comprises failing or blocking access to those of the data rates that exceed a first data rate. 9. The method of claim 1, further comprising:
identifying, by the traffic manager application, a second application running on the processor and delivering second data to or from the server over the network; intercepting, by the traffic manager application, electronic traffic of the second data to or from the second application; and controlling, by the traffic manager application, a rate of delivery of the second data to or from the second application or to or from the server. 10. The method of claim 9, wherein the controlling of the rates of delivery of the first and second data comprises concurrently limiting the rates of delivery of the first and second data so that the rate of delivery of the first data exceeds the rate of delivery of the second data. 11. The method of claim 1, wherein the intercepting of the electronic traffic comprises using an internal proxy running on the processor. 12. The method of claim 1, wherein the intercepting of the electronic traffic comprises using a virtual private network (VPN) interface on the processor. 13. The method of claim 1, wherein the intercepting of the electronic traffic comprises running a modified said first application on the processor, the modified first application being configured to request the intercepting of the electronic traffic. 14. A system for communication traffic management, the system comprising:
a portable communication device having a computer processor and a network connection to a computer server for transmitting or receiving data with the processor over a network; and a nonvolatile storage device coupled to the processor and storing instructions that, when executed by the processor, cause the processor to:
identify a first application running on the processor and delivering first data to or from the server over the network;
intercept electronic traffic of the first data to or from the first application; and
control a rate of delivery of the first data to or from the first application or to or from the server. 15. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by throttling a present speed of the network as perceived by the first application to a first data rate less than the present speed of the network. 16. The system of claim 15, wherein the electronic traffic of the first data comprises data being transmitted using a secure protocol for Hypertext Transfer Protocol (HTTPS). 17. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by throttling the rate of delivery of the first data to or from the server to a first data rate less than a present speed of the network. 18. The system of claim 14, wherein the electronic traffic of the first data comprises an adaptive bitrate stream. 19. The system of claim 14, wherein the electronic traffic of the first data comprises a progressive stream. 20. The system of claim 14, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions as controlled by a manifest; and the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by editing the manifest to hide or remove those of the data rates that exceed a first data rate. 21. The system of claim 14, wherein
the first application is capable of supporting a plurality of data rates having different corresponding resolutions; and the instructions, when executed by the processor, further cause the processor to control the rate of delivery of the first data by failing or blocking access to those of the data rates that exceed a first data rate. 22. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to:
identify a second application running on the processor and delivering second data to or from the server over the network; intercept electronic traffic of the second data to or from the second application; and control a rate of delivery of the second data to or from the second application or to or from the server. 23. The system of claim 22, wherein the instructions, when executed by the processor, further cause the processor to control the rates of delivery of the first and second data by concurrently limiting the rates of delivery of the first and second data so that the rate of delivery of the first data exceeds the rate of delivery of the second data. 24. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to intercept the electronic traffic by using an internal proxy running on the processor. 25. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to intercept the electronic traffic by using a virtual private network (VPN) interface on the processor. 26. The system of claim 14, wherein the instructions, when executed by the processor, further cause the processor to intercept the electronic traffic by running a modified said first application on the processor, the modified first application being configured to request the intercepting of the electronic traffic. | 2,400 |
9,471 | 9,471 | 14,668,472 | 2,466 | A control channel detection method and user equipment are disclosed. The control channel detection method includes: determining, by a user equipment, a control channel search interval according to a control channel resource set and/or a control channel type; and performing control channel detection in the search interval, where the control channel resource set includes at least one physical resource block. In embodiments of the present invention, the UE can determine an E-PDCCH search interval according to the control channel resource set and/or the control channel type, thereby implementing control channel detection of the UE. In this way, a solution is provided for the scenario in which multiple control channel resource sets are configured by a network side for the UE. | 1. A control channel detection method, comprising:
determining, by a user equipment, a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, wherein the determining a control channel search interval comprises:
determining a control channel set that comprises the control channel search interval,
determining the number of control channel candidates of the control channel search interval in each control channel set,
determining a search start point of control channels, and
determining a search interval according to a relationship between the search start point, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
performing control channel detection in the search interval. 2. The method according to claim 1, wherein determining a control channel set that comprises the control channel search interval comprises:
determining a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 3. The method according to claim 1, wherein determining a search start point of control channels comprises:
determining an initial value of a recursive function for generating the search start point of control channels; and determining the search start point according to the initial value of the recursive function of the search start point and the recursive function. 4. The method according to claim 3, wherein, in different control channel resource sets, initial values of recursive functions for generating the search start point of control channels are the same. 5. The method according to claim 3, wherein, in different control channel resource sets, the recursive function for determining the search start point is the same. 6. The method according to claim 3, wherein, in different control channel resource sets, the recursive function for determining the search start point is different. 7. The method according to claim 6, wherein the recursive function comprises a second characteristic parameter, and a different control channel resource set corresponds to a different second characteristic parameter. 8. The method according to claim 7, wherein the recursive function for determining the search start point in the jth control channel resource set is:
Y k,j=(C′(j)Y k-1,j)mod D,j=0,1 . . . K(c)−1
where k(c) is the total number of control channel resource sets, C′(j) is the second characteristic parameter. 9. The method according to claim 7, wherein the second characteristic parameter is one of the following:
an index of a first PRB pair among PRB pairs in the control channel resource set; a parameter notified through dynamic signaling or higher-layer signaling; a sequence number index of a physical resource block set; and an offset value relative to a specified control channel resource set. 10. The method according to claim 1, wherein, indifferent control channel types, the control channel set that comprises the control channel search interval is determined in different manners. 11. The method according to claim 10, wherein, in different control channel types, the number of control channel candidates of the control channel search interval in each control channel set is determined in different manners. 12. The method according to claim 10, wherein different control channel types are attributable to any one of the following groups:
control channels of a normal subframe and control channels of a multimedia broadcast multicast service single-frequency network subframe; semi-statically scheduled control channels and dynamically scheduled control channels; control channels detected in a common search interval and control channels detected in a UE-specific search interval; control channels of uplink scheduling signaling and control channels of downlink scheduling signaling; control channels of centralized transmission and control channels of discrete transmission; control channels of different DCI; control channels of subframes of different cyclic prefixes; control channels of different special subframe types; control channels transmitted in physical resource pairs (PRB pairs) with different numbers of available resource elements (REs); control channels transmitted by control channel elements that comprise different numbers of resource element groups; and control channels of different carriers. 13. A control channel transmission method, comprising:
determining, by a base station, a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, and wherein determining a control channel search interval comprises:
determining a control channel set that comprises the control channel search interval,
determining the number of control channel candidates of the control channel search interval in each control channel set,
determining a search start point of control channels, and
determining a search interval according to a relationship between the search start point, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
mapping an enhanced control channel to the search interval and sending the search interval; 14. The method according to claim 13, wherein determining a control channel set that comprises the control channel search interval comprises:
determining a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 15. The method according to claim 13, wherein determining a search start point of control channels comprises:
determining an initial value of a recursive function for generating the search start point of control channels; and determining the search start point according to the initial value of the recursive function of the search start point and the recursive function. 16. The method according to claim 15, wherein, in different control channel resource sets, initial values of recursive functions for generating the search start point of control channels are the same. 17. The method according to claim 15, wherein, in different control channel resource sets, the recursive function for determining the search start point is the same. 18. The method according to claim 15, wherein, in different control channel resource sets, the recursive function for determining the search start point is different. 19. The method according to claim 18, wherein the recursive function comprises a second characteristic parameter, and a different control channel resource set corresponds to a different second characteristic parameter. 20. The method according to claim 19, wherein the recursive function for determining the search start point in the jth control channel resource set is:
Y k,j=(C′(j)Y k-1,j)mod D,j=0,1 . . . K(c)−1
where k(c) is the total number of control channel resource sets, C′(j) is the second characteristic parameter. 21. The method according to claim 19, wherein the second characteristic parameter is one of the following:
an index of a first PRB pair among PRB pairs in the control channel resource set; a parameter notified through dynamic signaling or higher-layer signaling; a sequence number index of a physical resource block set; and an offset value relative to a specified control channel resource set. 22. The method according to claim 13, wherein, in different control channel types, the control channel set that comprises the control channel search interval is determined in different manners. 23. The method according to claim 13, wherein, in different control channel types, the number of control channel candidates of the control channel search interval in each control channel set is determined in different manners. 24. The method according to claim 22, wherein different control channel types are attributable to any one of the following groups:
control channels of a normal subframe and control channels of a multimedia broadcast multicast service single-frequency network subframe; semi-statically scheduled control channels and dynamically scheduled control channels; control channels detected in a common search interval and control channels detected in a UE-specific search interval; control channels of uplink scheduling signaling and control channels of downlink scheduling signaling; control channels of centralized transmission and control channels of discrete transmission; control channels of different DCI; control channels of subframes of different cyclic prefixes; control channels of different special subframe types; control channels transmitted in physical resource pairs (PRB pairs) with different numbers of available resource elements (REs); control channels transmitted by control channel elements that comprise different numbers of resource element groups; and control channels of different carriers. 25. A user equipment, comprising:
a determining unit, configured to determine a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, and wherein the determining unit comprises:
a set determining subunit, configured to determine a control channel set that comprises the control channel search interval,
a number determining subunit, configured to determine the number of control channel candidates of the control channel search interval in each control channel set,
a start point determining subunit, configured to determine a search start point of control channels, and
an interval determining subunit, configured to determine a search interval according to a relationship between the search start point determined by the start point determining subunit, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
a detecting unit, configured to perform control channel detection in the search interval determined by the determining unit. 26. The user equipment according to claim 25, wherein the set determining subunit is configured to determine a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 27. The user equipment according to claim 25, wherein the start point determining subunit comprises:
an initial value determining subunit, configured to determine an initial value of the recursive function for generating the search start point of control channels; and a start point calculating subunit, configured to determine the search start point according to the initial value of the recursive function of the search start point and the recursive function. 28. A base station, comprising:
a determining module, configured to determine a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, and wherein the determining module comprises:
a set determining submodule, configured to determine a control channel set that comprises the control channel search interval,
a number determining submodule, configured to determine the number of control channel candidates of the control channel search interval in each control channel set,
a start point determining submodule, configured to determine a search start point of control channels, and
an interval determining submodule, configured to determine a search interval according to a relationship between the search start point determined by the start point determining submodule, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
a transmission module, configured to map an enhanced control channel to the search interval determined by the determining module and send the search interval. 29. The base station according to claim 28, wherein the set determining submodule is configured to determine a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 30. The base station according to claim 28, wherein the start point determining submodule comprises:
an initial value determining submodule, configured to determine an initial value of the recursive function for generating the search start point of control channels; and a start point calculating submodule, configured to determine the search start point according to the initial value of the recursive function of the search start point and the recursive function. | A control channel detection method and user equipment are disclosed. The control channel detection method includes: determining, by a user equipment, a control channel search interval according to a control channel resource set and/or a control channel type; and performing control channel detection in the search interval, where the control channel resource set includes at least one physical resource block. In embodiments of the present invention, the UE can determine an E-PDCCH search interval according to the control channel resource set and/or the control channel type, thereby implementing control channel detection of the UE. In this way, a solution is provided for the scenario in which multiple control channel resource sets are configured by a network side for the UE.1. A control channel detection method, comprising:
determining, by a user equipment, a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, wherein the determining a control channel search interval comprises:
determining a control channel set that comprises the control channel search interval,
determining the number of control channel candidates of the control channel search interval in each control channel set,
determining a search start point of control channels, and
determining a search interval according to a relationship between the search start point, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
performing control channel detection in the search interval. 2. The method according to claim 1, wherein determining a control channel set that comprises the control channel search interval comprises:
determining a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 3. The method according to claim 1, wherein determining a search start point of control channels comprises:
determining an initial value of a recursive function for generating the search start point of control channels; and determining the search start point according to the initial value of the recursive function of the search start point and the recursive function. 4. The method according to claim 3, wherein, in different control channel resource sets, initial values of recursive functions for generating the search start point of control channels are the same. 5. The method according to claim 3, wherein, in different control channel resource sets, the recursive function for determining the search start point is the same. 6. The method according to claim 3, wherein, in different control channel resource sets, the recursive function for determining the search start point is different. 7. The method according to claim 6, wherein the recursive function comprises a second characteristic parameter, and a different control channel resource set corresponds to a different second characteristic parameter. 8. The method according to claim 7, wherein the recursive function for determining the search start point in the jth control channel resource set is:
Y k,j=(C′(j)Y k-1,j)mod D,j=0,1 . . . K(c)−1
where k(c) is the total number of control channel resource sets, C′(j) is the second characteristic parameter. 9. The method according to claim 7, wherein the second characteristic parameter is one of the following:
an index of a first PRB pair among PRB pairs in the control channel resource set; a parameter notified through dynamic signaling or higher-layer signaling; a sequence number index of a physical resource block set; and an offset value relative to a specified control channel resource set. 10. The method according to claim 1, wherein, indifferent control channel types, the control channel set that comprises the control channel search interval is determined in different manners. 11. The method according to claim 10, wherein, in different control channel types, the number of control channel candidates of the control channel search interval in each control channel set is determined in different manners. 12. The method according to claim 10, wherein different control channel types are attributable to any one of the following groups:
control channels of a normal subframe and control channels of a multimedia broadcast multicast service single-frequency network subframe; semi-statically scheduled control channels and dynamically scheduled control channels; control channels detected in a common search interval and control channels detected in a UE-specific search interval; control channels of uplink scheduling signaling and control channels of downlink scheduling signaling; control channels of centralized transmission and control channels of discrete transmission; control channels of different DCI; control channels of subframes of different cyclic prefixes; control channels of different special subframe types; control channels transmitted in physical resource pairs (PRB pairs) with different numbers of available resource elements (REs); control channels transmitted by control channel elements that comprise different numbers of resource element groups; and control channels of different carriers. 13. A control channel transmission method, comprising:
determining, by a base station, a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, and wherein determining a control channel search interval comprises:
determining a control channel set that comprises the control channel search interval,
determining the number of control channel candidates of the control channel search interval in each control channel set,
determining a search start point of control channels, and
determining a search interval according to a relationship between the search start point, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
mapping an enhanced control channel to the search interval and sending the search interval; 14. The method according to claim 13, wherein determining a control channel set that comprises the control channel search interval comprises:
determining a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 15. The method according to claim 13, wherein determining a search start point of control channels comprises:
determining an initial value of a recursive function for generating the search start point of control channels; and determining the search start point according to the initial value of the recursive function of the search start point and the recursive function. 16. The method according to claim 15, wherein, in different control channel resource sets, initial values of recursive functions for generating the search start point of control channels are the same. 17. The method according to claim 15, wherein, in different control channel resource sets, the recursive function for determining the search start point is the same. 18. The method according to claim 15, wherein, in different control channel resource sets, the recursive function for determining the search start point is different. 19. The method according to claim 18, wherein the recursive function comprises a second characteristic parameter, and a different control channel resource set corresponds to a different second characteristic parameter. 20. The method according to claim 19, wherein the recursive function for determining the search start point in the jth control channel resource set is:
Y k,j=(C′(j)Y k-1,j)mod D,j=0,1 . . . K(c)−1
where k(c) is the total number of control channel resource sets, C′(j) is the second characteristic parameter. 21. The method according to claim 19, wherein the second characteristic parameter is one of the following:
an index of a first PRB pair among PRB pairs in the control channel resource set; a parameter notified through dynamic signaling or higher-layer signaling; a sequence number index of a physical resource block set; and an offset value relative to a specified control channel resource set. 22. The method according to claim 13, wherein, in different control channel types, the control channel set that comprises the control channel search interval is determined in different manners. 23. The method according to claim 13, wherein, in different control channel types, the number of control channel candidates of the control channel search interval in each control channel set is determined in different manners. 24. The method according to claim 22, wherein different control channel types are attributable to any one of the following groups:
control channels of a normal subframe and control channels of a multimedia broadcast multicast service single-frequency network subframe; semi-statically scheduled control channels and dynamically scheduled control channels; control channels detected in a common search interval and control channels detected in a UE-specific search interval; control channels of uplink scheduling signaling and control channels of downlink scheduling signaling; control channels of centralized transmission and control channels of discrete transmission; control channels of different DCI; control channels of subframes of different cyclic prefixes; control channels of different special subframe types; control channels transmitted in physical resource pairs (PRB pairs) with different numbers of available resource elements (REs); control channels transmitted by control channel elements that comprise different numbers of resource element groups; and control channels of different carriers. 25. A user equipment, comprising:
a determining unit, configured to determine a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, and wherein the determining unit comprises:
a set determining subunit, configured to determine a control channel set that comprises the control channel search interval,
a number determining subunit, configured to determine the number of control channel candidates of the control channel search interval in each control channel set,
a start point determining subunit, configured to determine a search start point of control channels, and
an interval determining subunit, configured to determine a search interval according to a relationship between the search start point determined by the start point determining subunit, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
a detecting unit, configured to perform control channel detection in the search interval determined by the determining unit. 26. The user equipment according to claim 25, wherein the set determining subunit is configured to determine a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 27. The user equipment according to claim 25, wherein the start point determining subunit comprises:
an initial value determining subunit, configured to determine an initial value of the recursive function for generating the search start point of control channels; and a start point calculating subunit, configured to determine the search start point according to the initial value of the recursive function of the search start point and the recursive function. 28. A base station, comprising:
a determining module, configured to determine a control channel search interval according to a control channel resource set and/or a control channel type, wherein the control channel resource set comprises at least one physical resource block, and wherein the determining module comprises:
a set determining submodule, configured to determine a control channel set that comprises the control channel search interval,
a number determining submodule, configured to determine the number of control channel candidates of the control channel search interval in each control channel set,
a start point determining submodule, configured to determine a search start point of control channels, and
an interval determining submodule, configured to determine a search interval according to a relationship between the search start point determined by the start point determining submodule, an aggregation level of control channels, and the number of control channel candidates under the aggregation level; and
a transmission module, configured to map an enhanced control channel to the search interval determined by the determining module and send the search interval. 29. The base station according to claim 28, wherein the set determining submodule is configured to determine a control channel resource set that comprises the control channel search interval according to a carrier and/or a radio network temporary identifier and/or a subframe number. 30. The base station according to claim 28, wherein the start point determining submodule comprises:
an initial value determining submodule, configured to determine an initial value of the recursive function for generating the search start point of control channels; and a start point calculating submodule, configured to determine the search start point according to the initial value of the recursive function of the search start point and the recursive function. | 2,400 |
9,472 | 9,472 | 15,555,880 | 2,477 | The present disclosure provides a method for transmitting hybrid automatic repeat-request acknowledgement (HARQ-ACK) feedback information in an enhanced carrier aggregation system. A user equipment (UE) determines the number of HARQ-ACK feedback information bits that the UE needs to transmit in an uplink subframe, and determines the number of uplink control information (UCI) bits to be transmitted in the uplink subframe based on the number of the HARQ-ACK feedback information bits, the number of channel state information (CSI) bits, and the number of scheduling request (SR) bits that need to be transmitted in the uplink subframe, and transmitting the UCI according to the PUCCH format and the resource for transmission of PUCCH determined. With the present disclosure, UCI information may be transmitted using different formats in different PUCCH formats. | 1. A method for transmitting hybrid automatic repeat-request acknowledgement (HARQ-ACK) feedback information in an enhanced carrier aggregation system, comprising:
determining, by a user equipment (UE), the number of HARQ-ACK feedback information bits that need to be transmitted in an uplink subframe; determining, by the UE, the number of uplink control information (UCI) bits to be transmitted in the uplink subframe based on the number of the HARQ-ACK feedback information bits, the number of channel state information (CSI) bits, and the number of scheduling request (SR) bits that need to be transmitted in the uplink subframe; and determining, by the UE, a physical uplink control channel (PUCCH) format and a resource for transmission of PUCCH to transmit UCI based on the number of the UCI bits to be transmitted in the uplink subframe, and transmitting the UCI according to the PUCCH format and the resource for transmission of PUCCH determined. 2. The method of claim 1, wherein determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI based on the number of the UCI bits to be transmitted in the uplink subframe comprises:
in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer M, determining that the PUCCH format to transmit the UCI is a PUCCH format 3, and the resource for transmission of PUCCH is one of a set of resources with the PUCCH format 3 configured for the UE; and in response to determining that the number of the UCI bits is larger than the preset positive integer M, determining that the PUCCH format to transmit the UCI is a PUCCH format X, and the resource for transmission of PUCCH is one of a set of resources with the PUCCH format X configured for the UE; wherein the PUCCH format X is a PUCCH format customized for transmission of HARQ-ACK feedback information, wherein the UE is not configured with periodic CSI transmission, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: in response to determining that the UE does not have a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by a HARQ-ACK resource indicator (ARI) in the uplink subframe, using a PUCCH format 1A/1B to transmit the UCI on a resource with the PUCCH format 1A/1B; and in response to determining that the UE has the resource with the PUCCH format 3 and the resource with the PUCCH format X indicated by the ARI in the uplink subframe, and in response to determining that the number of the UCI bits of the UE is smaller than or equal to a preset positive integer m, using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; or in response to determining that the number of the UCI bits of the UE is larger than m, using the PUCCH format X to transmit the UCI on the resource with the PUCCH format X; wherein the PUCCH format X is a PUCCH format different from the PUCCH format 3. 3. The method of claim 1, wherein the UE is configured with a periodic CSI transmission, without a SR transmission, and the UE does not have a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by an ARI in the uplink subframe, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises:
in the uplink subframe, in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer m, in response to determining that the number of periodic CSI bits is smaller than or equal to a preset positive integer n′, then using a PUCCH format 2/2A/2B to transmit the UCI on a resource with the PUCCH format 2/2A/2B; and in response to determining that the number of the periodic CSI bits is larger than n′ where n′ is 11, then using the PUCCH format 3 to transmit the UCI on the resource of the PUCCH format 3; or in response to determining that the periodic CSI transmission is configured only for one serving cell, or that a periodic CSI transmission with one CSI process is configured for one serving cell, then using the PUCCH format 2/2A/2B to transmit the UCI on the resource with the PUCCH format 2/2A/2B; and in response to determining that the periodic CSI transmission is configured for more than one serving cell, or that the periodic CSI transmission with one CSI process is configured for more than one serving cell, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; or in the uplink subframe, in response to determining that the number of the UCI bits is larger than m, using a PUCCH format Y to transmit the UCI on a resource with the PUCCH format Y; wherein the PUCCH format Y is a customized PUCCH format different from the PUCCH format 3 and the PUCCH format 2/2A/2B, wherein the UE is configured with a periodic CSI transmission and a SR transmission, and the UE does not have a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by an ARI in the uplink subframe, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: in the uplink subframe, in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer m, in response to determining that the number of periodic CSI bits is smaller than or equal to a preset positive integer n′, then not transmitting periodic CSI, but using a PUCCH format 1A/1B to transmit HARQ-ACK and SR information contained in the UCI on a resource with the PUCCH format 1A/1B; or in response to determining that the number of the periodic CSI bits is larger than n′, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; or in response to determining that a sum of the number of the periodic CSI bits and the number of the SR bits is smaller than or equal to n′, then using a PUCCH format 2/2A/2B to transmit the UCI on a resource with the PUCCH format 2/2A/2B; and in response to determining that the sum of the number of the periodic CSI bits and the number of the SR bits is larger than n′, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; in the uplink subframe, in response to determining that the number of the UCI bits is larger than m, using a PUCCH format Y to transmit the UCI on a resource with the PUCCH format Y; wherein the PUCCH format Y is a PUCCH format different from the PUCCH format 3 and the PUCCH format 2/2A/2B. 4. The method of claim 1, wherein the UE is configured with a periodic CSI transmission and/or a SR transmission, and the UE has a resource with a PUCCH format 3 and a resource with a PUCCH format X indicated by an ARI in the uplink subframe, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises:
in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer m, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; and in response to determining that the number of the UCI bits is larger than m, then using the PUCCH format X to transmit the UCI on the resource with the PUCCH format X; or in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer n′, then using a PUCCH format 2/2A/2B to transmit the UCI on a resource with the PUCCH format 2/2A/2B; and in response to determining that the number of the UCI bits is larger than n′ and is smaller than or equal to m, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; and in response to determining that the number of the UCI bits is larger than m, then using the PUCCH format X to transmit the UCI on the resource with the PUCCH format X; wherein the PUCCH format X is a customized PUCCH format different from the PUCCH format 3, wherein the uplink subframe is configured with a resource with a PUCCH format Y, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: the UE only using one of a resource with a PUCCH format 3/PUCCH format X and the resource with the PUCCH format Y to transmit information contained in the UCI, and using the PUCCH format Y and the corresponding resource with the PUCCH format Y to transmit the UCI in priority; wherein “/” represents “or”. 5. The method of claim 7, wherein using the PUCCH format Y and the corresponding resource with the PUCCH format Y to transmit the UCI in priority comprises:
in response to determining that the number of the UCI bits is smaller than or equal to L, then determining that the PUCCH format to transmit the UCI is the PUCCH format Y, and the resource for transmission of PUCCH is the resource with the PUCCH format Y configured for the UE; or in response to determining that the number of the UCI bits is larger than L, then determining that the PUCCH format to transmit the UCI is a PUCCH format by which the largest number of bits that are borne is the largest among the PUCCH format 3/PUCCH format X and the PUCCH format Y, and the resource for transmission of PUCCH is a resource corresponding to the determined PUCCH format; and in response to determining that the largest numbers of bits that are borne by the PUCCH format 3/PUCCH format X and the PUCCH format Y are same, then determining that the PUCCH format to transmit the UCI is the PUCCH format Y, and the resource for transmission of PUCCH is the resource with the PUCCH format Y configured for the UE; in response to determining that the largest number of bits that are borne by the determined PUCCH format is smaller than the number of the UCI bits, then dropping all CSI information from the UCI, or dropping a part of CSI information from the UCI until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the determined PUCCH format, and using the determined PUCCH format and the resource corresponding to the determined PUCCH format to transmit UCI with the part of CSI information being dropped; wherein the PUCCH format Y is a PUCCH format used for transmission of periodic CSI information, and L is the largest number of bits that are borne by the PUCCH format Y, and the PUCCH format X is a customized PUCCH format transmission of HARQ-ACK feedback information, wherein in response to determining that the number of the UCI bits is smaller than or equal to the largest one among the largest numbers of bits that are borne by a PUCCH format 3/a PUCCH format X for transmission of HARQ-ACK feedback information and the PUCCH format 3/a PUCCH format Y for transmission of CSI, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: the UE selecting a PUCCH format by which the largest number of bits that are borne is the smallest from PUCCH formats that are enough to bear the UCI bits among the PUCCH format 3/PUCCH format X for transmission of HARQ-ACK feedback information and the PUCCH format 3/PUCCH format Y for transmission of CSI to transmit the UCI. 6. The method of claim 1, wherein the UE is configured with a resource with a PUCCH format 1/1a/1b for transmission of HARQ-ACK/SR feedback information and is not configured with a resource with a PUCCH format 3 or PUCCH format X indicated by an ARI, and then in response to determining that the UE is configured with transmission of one or more periodic CSIs in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises:
using a PUCCH resource for transmission of multiple periodic CSIs configured for the UE to transmit the UCI, wherein the UE is configured with a resource with a PUCCH format 1/1a/1b for transmission of HARQ-ACK/SR information, and is not configured with a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by an ARI in the uplink subframe, then in response to determining that the UE is configured with a periodic CSI transmission in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH comprises: in response to determining that only HARQ-ACK feedback information of a scheduled physical downlink shared channel (PDSCH) where a downlink assignment index (DAI) is equal to 1 and/or a semi-persistent scheduling (SPS) downlink transmission of a primary cell (Pcell) need to be transmitted, and that no SR transmission is configured in the uplink subframe, using a resource with a PUCCH format 2a/2b for transmission of periodic CSI configured for the UE to transmit the UCI; and in response to determining that there is not the resource with the PUCCH format 3 or the resource with the PUCCH format X indicated by the ARI in the uplink subframe, and the uplink subframe is configured with the SR transmission, then using the resource with the PUCCH format 1/1a/1b to transmit HARQ-ACK/SR information, and not transmitting periodic CSI; and in response to determining that the UE is configured with multiple periodic CSI transmissions in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: using a PUCCH resource for transmission of multiple periodic CSIs configured for the UE to transmit the UCI. 7. The method of claim 6, wherein using the PUCCH resource for transmission of multiple periodic CSIs configured for the UE to transmit the UCI comprises:
in response to determining that there are two PUCCH resources for transmission of multiple periodic CSIs configured for the UE, selecting one of the two PUCCH resources to transmit the UCI according to the number of the UCI bits; wherein a method for selecting one of the two PUCCH resources comprises: in response to determining that the largest numbers of bits that are transmitted by the two PUCCH resources are both larger than the number of the UCI bits, then selecting a PUCCH resource of which the largest number of bits is larger from the two PUCCH resources; in response to determining that the largest number of bits that are borne by the selected PUCCH resource is smaller than the number of the UCI bits, the UE dropping all periodic CSI information, or dropping a part of periodic CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the selected PUCCH format, and using the selected PUCCH resource to transmit UCI with the all or part of periodic CSI information being dropped; and/or in response to determining that there is one PUCCH resource for transmission of multiple periodic CSIs configured for the UE, and in response to determining that the largest number of bits that are borne by the one PUCCH resource is smaller than the number of the UCI bits, then the UE dropping all periodic CSI information, or dropping a part of CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the one PUCCH format, and using the one PUCCH resource to transmit UCI with the all or part of periodic CSI information being dropped. 8. The method of claim 1, wherein the UE has a resource with a PUCCH format 3 or a resource with a PUCCH format X for transmission of HARQ-ACK/SR information indicated by an ARI in the uplink subframe, and
in response to determining that the UE is configured with transmission of one periodic CSI in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: using the resource with the PUCCH format 3 or the resource with the PUCCH format X for transmission of HARQ-ACK/SR information indicated by the ARI to transmit the UCI; or in response to determining that the UE is configured with transmission of multiple periodic CSIs in the uplink subframe, selecting a PUCCH resource from PUCCH resources with candidate PUCCH formats to transmit the UCI; wherein the candidate PUCCH formats comprise: the PUCCH format 3/PUCCH format X for transmission of HARQ-ACK feedback information configured for the UE and one or more PUCCH resources for transmission of multiple periodic CSIs configured for the UE different from a PUCCH format 2. 9. The method of claim 1, wherein the UE has a resource with a PUCCH format 3 or a resource with a PUCCH format X for transmission of HARQ-ACK/SR information indicated by an ARI in the uplink subframe, then
in response to determining that the UE is configured with transmission of one or more periodic CSIs in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: selecting a PUCCH resource from PUCCH resources with candidate PUCCH formats according to the number of the UCI bits to transmit the UCI; wherein the candidate PUCCH formats comprise: the resource with the PUCCH format 3/the resource with the PUCCH format X for transmission of HARQ-ACK feedback information configured for the UE and one or more PUCCH resources for transmission of multiple periodic CSIs configured for the UE different from a PUCCH format 2. 10. The method of claim 8, wherein the method for selecting the PUCCH resource comprises:
in response to determining that the number of the UCI bits is smaller than or equal to the largest one of the largest numbers of bits that are borne by the respective candidate PUCCH resources, the UE selecting PUCCH resources with PUCCH formats that are enough to bear the number of the UCI bits from the PUCCH resources with the candidate PUCCH formats, and selecting a PUCCH resource with a PUCCH format by which the largest number of bits that are borne is the smallest from the selected PUCCH resources with the PUCCH formats to transmit the UCI; and in response to determining that there are two PUCCH resources with PUCCH formats selected, in which one is a configured new PUCCH resource for transmission of multiple periodic CSIs, and the other is a PUCCH resource for transmission of HARQ-ACK/SR information indicated by the ARI, then using the PUCCH resource indicated by the ARI or the PUCCH resource for transmission of multiple periodic CSIs; and in response to determining that the number of the UCI bits that need to be transmitted in the uplink subframe is larger than the largest one of the largest numbers of bits that are borne by the candidate PUCCH formats, the UE selecting a PUCCH resource with a PUCCH format by which the largest number of bits that are borne is the largest from the PUCCH resources with the candidate PUCCH formats; and in response to determining that the largest number of bits that are borne by the selected PUCCH resource is smaller than the number of the UCI bits, then the UE dropping all periodic CSI information, or dropping a part of periodic CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the selected PUCCH format, and using the selected PUCCH resource to transmit UCI with the all periodic CSI information or part of CSI information being dropped; and in response to determining that there are two PUCCH resources with PUCCH formats selected, in which one is the configured PUCCH resource for transmission of multiple periodic CSIs, and the other is the PUCCH resource for transmission of HARQ-ACK/SR information indicated by the ARI, then the UE using the PUCCH resource indicated by the ARI or the PUCCH resource for transmission of multiple periodic CSIs to transmit the UCI. 11. The method of claim 1, wherein UE has a resource with a PUCCH format 3 or a resource with a PUCCH format X for transmission of HARQ-ACK/SR information indicated by an ARI in the uplink subframe, then
in response to determining that the UE is only configured with transmission of one or more periodic CSIs, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: transmitting the UCI using the resource with the PUCCH format 3 or the resource with the PUCCH format X for transmission of HARQ-ACK/SR information indicated by the ARI to transmit the UCI, 12. The method of claim 8, wherein using the resource with the PUCCH format 3 or the resource with the PUCCH format X for transmission of HARQ-ACK/SR information indicated by the ARI to transmit the UCI comprises:
in response to determining that the number of UCI bits of all serving cells to be transmitted in the uplink subframe is smaller than or equal to a preset positive integer M, using the PUCCH format 3 to transmit the UCI bits, and the ARI in a (e)PDCCH for PDSCH scheduling indicating a PUCCH resource from a set of PUCCH resources with the PUCCH format 3 configured for the UE by higher layer signaling; in response to determining that the number of the UCI bits of all the serving cells to be transmitted in the uplink subframe is larger than M, using the PUCCH format X to transmit the UCI bits, and the ARI in the (e)PDCCH for PDSCH scheduling indicating a PUCCH resource from a set of PUCCH resources with the PUCCH format X configured for the UE by higher layer signaling; in response to determining that the largest number of bits that are transmitted by the PUCCH resource indicated by the ARI is larger than the number of the UCI bits, then using the PUCCH resource indicated by the ARI to transmit the UCI; or otherwise, the UE dropping all periodic CSI information, or dropping a part of periodic CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the PUCCH resource indicated by the ARI, using the PUCCH resource indicated by the ARI to transmit UCI with the all or part of periodic CSI information being dropped. 13. The method of any of claim 1, wherein determining the number of the HARQ-ACK feedback information bits to be transmitted in the uplink subframe comprises:
for a serving cell with a downlink reference uplink downlink configuration being frequency division duplex (FDD), in response to determining that a transmission mode configured for the serving cell is single-input multiple-output (SIMO), determining the number of HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is 1 bit, and in response to determining that the transmission mode configured for the serving cell is multiple-input multiple-output (MIMO), then determining the number of the HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is 2 bits; for a serving cell with a downlink reference uplink downlink configuration being time division duplex (TDD), in response to determining that a transmission mode of the serving cell is SIMO, determining that the number of HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is N bits, and in response to determining that the transmission mode configured for the serving cell is MIMO, determine that the number of the HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is 2N bits; summing the number of HARQ-ACK feedback information bits of all serving cells of the UE to be transmitted in the uplink subframe to obtain the number of the HARQ-ACK feedback information bits to be sent in the uplink subframe; or calculating the number of the HARQ-ACK feedback information bits to be transmitted in the uplink subframe according to received PDCCHs/EPDCCHs; wherein N is a HARQ-ACK bundling window size. 14. The method of any of claim 1, wherein determining the number of the UCI bits to be transmitted in the uplink subframe comprises:
in response to determining that a spatially bundling operation is not allowed for the HARQ-ACK feedback information to be transmitted, summing the number of HARQ-ACK feedback information bits, the number of CSI bits, and the number of SR bits of all serving cells configured for the UE to obtain a sum, and using the sum as the number of the UCI bits; or in response to determining that the spatially bundling operation is allowed for the HARQ-ACK feedback information to be transmitted, summing the number of the HARQ-ACK feedback information bits, the number of the CSI bits, and the number of the SR bits of all the serving cells configured for the UE to obtain the sum, and in response to determining that the sum is smaller than or equal to a preset positive integer M′, then using the sum as the number of the UCI bits; and in response to determining that the sum is larger than the preset positive integer M′, then spatially bundling the HARQ-ACK feedback information to be transmitted, and using the number of HARQ-ACK feedback information bits spatially bundled as the number of HARQ-ACK feedback information bits updated, and summing the number of the HARQ-ACK feedback information bits updated, the number of the CSI bits, and the number of the SR bits to obtain a sum, and using the sum as the number of the UCI bits. 15. An apparatus for transmitting HARQ-ACK feedback information in an enhanced carrier aggregation system, comprising a bit number determination unit, a resource determination unit, and a transmission unit; wherein
the bit number determination unit is to determine the number of HARQ-ACK feedback information bits that need to be transmitted by an UE in an uplink subframe; and determine the number of UCI bits to be transmitted in the uplink subframe based on the number of the HARQ-ACK feedback information bits, the number of CSI bits, and the number of SR bits that need to be transmitted in the uplink subframe; the resource determination unit is to determine a PUCCH format and a resource for transmission of PUCCH according to the number of the UCI bits determined by the bit number determination unit; and the transmission unit is to transmit UCI according to the PUCCH format and the resource for transmission of PUCCH determined by the resource determination unit. | The present disclosure provides a method for transmitting hybrid automatic repeat-request acknowledgement (HARQ-ACK) feedback information in an enhanced carrier aggregation system. A user equipment (UE) determines the number of HARQ-ACK feedback information bits that the UE needs to transmit in an uplink subframe, and determines the number of uplink control information (UCI) bits to be transmitted in the uplink subframe based on the number of the HARQ-ACK feedback information bits, the number of channel state information (CSI) bits, and the number of scheduling request (SR) bits that need to be transmitted in the uplink subframe, and transmitting the UCI according to the PUCCH format and the resource for transmission of PUCCH determined. With the present disclosure, UCI information may be transmitted using different formats in different PUCCH formats.1. A method for transmitting hybrid automatic repeat-request acknowledgement (HARQ-ACK) feedback information in an enhanced carrier aggregation system, comprising:
determining, by a user equipment (UE), the number of HARQ-ACK feedback information bits that need to be transmitted in an uplink subframe; determining, by the UE, the number of uplink control information (UCI) bits to be transmitted in the uplink subframe based on the number of the HARQ-ACK feedback information bits, the number of channel state information (CSI) bits, and the number of scheduling request (SR) bits that need to be transmitted in the uplink subframe; and determining, by the UE, a physical uplink control channel (PUCCH) format and a resource for transmission of PUCCH to transmit UCI based on the number of the UCI bits to be transmitted in the uplink subframe, and transmitting the UCI according to the PUCCH format and the resource for transmission of PUCCH determined. 2. The method of claim 1, wherein determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI based on the number of the UCI bits to be transmitted in the uplink subframe comprises:
in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer M, determining that the PUCCH format to transmit the UCI is a PUCCH format 3, and the resource for transmission of PUCCH is one of a set of resources with the PUCCH format 3 configured for the UE; and in response to determining that the number of the UCI bits is larger than the preset positive integer M, determining that the PUCCH format to transmit the UCI is a PUCCH format X, and the resource for transmission of PUCCH is one of a set of resources with the PUCCH format X configured for the UE; wherein the PUCCH format X is a PUCCH format customized for transmission of HARQ-ACK feedback information, wherein the UE is not configured with periodic CSI transmission, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: in response to determining that the UE does not have a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by a HARQ-ACK resource indicator (ARI) in the uplink subframe, using a PUCCH format 1A/1B to transmit the UCI on a resource with the PUCCH format 1A/1B; and in response to determining that the UE has the resource with the PUCCH format 3 and the resource with the PUCCH format X indicated by the ARI in the uplink subframe, and in response to determining that the number of the UCI bits of the UE is smaller than or equal to a preset positive integer m, using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; or in response to determining that the number of the UCI bits of the UE is larger than m, using the PUCCH format X to transmit the UCI on the resource with the PUCCH format X; wherein the PUCCH format X is a PUCCH format different from the PUCCH format 3. 3. The method of claim 1, wherein the UE is configured with a periodic CSI transmission, without a SR transmission, and the UE does not have a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by an ARI in the uplink subframe, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises:
in the uplink subframe, in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer m, in response to determining that the number of periodic CSI bits is smaller than or equal to a preset positive integer n′, then using a PUCCH format 2/2A/2B to transmit the UCI on a resource with the PUCCH format 2/2A/2B; and in response to determining that the number of the periodic CSI bits is larger than n′ where n′ is 11, then using the PUCCH format 3 to transmit the UCI on the resource of the PUCCH format 3; or in response to determining that the periodic CSI transmission is configured only for one serving cell, or that a periodic CSI transmission with one CSI process is configured for one serving cell, then using the PUCCH format 2/2A/2B to transmit the UCI on the resource with the PUCCH format 2/2A/2B; and in response to determining that the periodic CSI transmission is configured for more than one serving cell, or that the periodic CSI transmission with one CSI process is configured for more than one serving cell, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; or in the uplink subframe, in response to determining that the number of the UCI bits is larger than m, using a PUCCH format Y to transmit the UCI on a resource with the PUCCH format Y; wherein the PUCCH format Y is a customized PUCCH format different from the PUCCH format 3 and the PUCCH format 2/2A/2B, wherein the UE is configured with a periodic CSI transmission and a SR transmission, and the UE does not have a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by an ARI in the uplink subframe, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: in the uplink subframe, in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer m, in response to determining that the number of periodic CSI bits is smaller than or equal to a preset positive integer n′, then not transmitting periodic CSI, but using a PUCCH format 1A/1B to transmit HARQ-ACK and SR information contained in the UCI on a resource with the PUCCH format 1A/1B; or in response to determining that the number of the periodic CSI bits is larger than n′, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; or in response to determining that a sum of the number of the periodic CSI bits and the number of the SR bits is smaller than or equal to n′, then using a PUCCH format 2/2A/2B to transmit the UCI on a resource with the PUCCH format 2/2A/2B; and in response to determining that the sum of the number of the periodic CSI bits and the number of the SR bits is larger than n′, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; in the uplink subframe, in response to determining that the number of the UCI bits is larger than m, using a PUCCH format Y to transmit the UCI on a resource with the PUCCH format Y; wherein the PUCCH format Y is a PUCCH format different from the PUCCH format 3 and the PUCCH format 2/2A/2B. 4. The method of claim 1, wherein the UE is configured with a periodic CSI transmission and/or a SR transmission, and the UE has a resource with a PUCCH format 3 and a resource with a PUCCH format X indicated by an ARI in the uplink subframe, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises:
in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer m, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; and in response to determining that the number of the UCI bits is larger than m, then using the PUCCH format X to transmit the UCI on the resource with the PUCCH format X; or in response to determining that the number of the UCI bits is smaller than or equal to a preset positive integer n′, then using a PUCCH format 2/2A/2B to transmit the UCI on a resource with the PUCCH format 2/2A/2B; and in response to determining that the number of the UCI bits is larger than n′ and is smaller than or equal to m, then using the PUCCH format 3 to transmit the UCI on the resource with the PUCCH format 3; and in response to determining that the number of the UCI bits is larger than m, then using the PUCCH format X to transmit the UCI on the resource with the PUCCH format X; wherein the PUCCH format X is a customized PUCCH format different from the PUCCH format 3, wherein the uplink subframe is configured with a resource with a PUCCH format Y, and determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: the UE only using one of a resource with a PUCCH format 3/PUCCH format X and the resource with the PUCCH format Y to transmit information contained in the UCI, and using the PUCCH format Y and the corresponding resource with the PUCCH format Y to transmit the UCI in priority; wherein “/” represents “or”. 5. The method of claim 7, wherein using the PUCCH format Y and the corresponding resource with the PUCCH format Y to transmit the UCI in priority comprises:
in response to determining that the number of the UCI bits is smaller than or equal to L, then determining that the PUCCH format to transmit the UCI is the PUCCH format Y, and the resource for transmission of PUCCH is the resource with the PUCCH format Y configured for the UE; or in response to determining that the number of the UCI bits is larger than L, then determining that the PUCCH format to transmit the UCI is a PUCCH format by which the largest number of bits that are borne is the largest among the PUCCH format 3/PUCCH format X and the PUCCH format Y, and the resource for transmission of PUCCH is a resource corresponding to the determined PUCCH format; and in response to determining that the largest numbers of bits that are borne by the PUCCH format 3/PUCCH format X and the PUCCH format Y are same, then determining that the PUCCH format to transmit the UCI is the PUCCH format Y, and the resource for transmission of PUCCH is the resource with the PUCCH format Y configured for the UE; in response to determining that the largest number of bits that are borne by the determined PUCCH format is smaller than the number of the UCI bits, then dropping all CSI information from the UCI, or dropping a part of CSI information from the UCI until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the determined PUCCH format, and using the determined PUCCH format and the resource corresponding to the determined PUCCH format to transmit UCI with the part of CSI information being dropped; wherein the PUCCH format Y is a PUCCH format used for transmission of periodic CSI information, and L is the largest number of bits that are borne by the PUCCH format Y, and the PUCCH format X is a customized PUCCH format transmission of HARQ-ACK feedback information, wherein in response to determining that the number of the UCI bits is smaller than or equal to the largest one among the largest numbers of bits that are borne by a PUCCH format 3/a PUCCH format X for transmission of HARQ-ACK feedback information and the PUCCH format 3/a PUCCH format Y for transmission of CSI, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: the UE selecting a PUCCH format by which the largest number of bits that are borne is the smallest from PUCCH formats that are enough to bear the UCI bits among the PUCCH format 3/PUCCH format X for transmission of HARQ-ACK feedback information and the PUCCH format 3/PUCCH format Y for transmission of CSI to transmit the UCI. 6. The method of claim 1, wherein the UE is configured with a resource with a PUCCH format 1/1a/1b for transmission of HARQ-ACK/SR feedback information and is not configured with a resource with a PUCCH format 3 or PUCCH format X indicated by an ARI, and then in response to determining that the UE is configured with transmission of one or more periodic CSIs in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises:
using a PUCCH resource for transmission of multiple periodic CSIs configured for the UE to transmit the UCI, wherein the UE is configured with a resource with a PUCCH format 1/1a/1b for transmission of HARQ-ACK/SR information, and is not configured with a resource with a PUCCH format 3 or a resource with a PUCCH format X indicated by an ARI in the uplink subframe, then in response to determining that the UE is configured with a periodic CSI transmission in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH comprises: in response to determining that only HARQ-ACK feedback information of a scheduled physical downlink shared channel (PDSCH) where a downlink assignment index (DAI) is equal to 1 and/or a semi-persistent scheduling (SPS) downlink transmission of a primary cell (Pcell) need to be transmitted, and that no SR transmission is configured in the uplink subframe, using a resource with a PUCCH format 2a/2b for transmission of periodic CSI configured for the UE to transmit the UCI; and in response to determining that there is not the resource with the PUCCH format 3 or the resource with the PUCCH format X indicated by the ARI in the uplink subframe, and the uplink subframe is configured with the SR transmission, then using the resource with the PUCCH format 1/1a/1b to transmit HARQ-ACK/SR information, and not transmitting periodic CSI; and in response to determining that the UE is configured with multiple periodic CSI transmissions in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: using a PUCCH resource for transmission of multiple periodic CSIs configured for the UE to transmit the UCI. 7. The method of claim 6, wherein using the PUCCH resource for transmission of multiple periodic CSIs configured for the UE to transmit the UCI comprises:
in response to determining that there are two PUCCH resources for transmission of multiple periodic CSIs configured for the UE, selecting one of the two PUCCH resources to transmit the UCI according to the number of the UCI bits; wherein a method for selecting one of the two PUCCH resources comprises: in response to determining that the largest numbers of bits that are transmitted by the two PUCCH resources are both larger than the number of the UCI bits, then selecting a PUCCH resource of which the largest number of bits is larger from the two PUCCH resources; in response to determining that the largest number of bits that are borne by the selected PUCCH resource is smaller than the number of the UCI bits, the UE dropping all periodic CSI information, or dropping a part of periodic CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the selected PUCCH format, and using the selected PUCCH resource to transmit UCI with the all or part of periodic CSI information being dropped; and/or in response to determining that there is one PUCCH resource for transmission of multiple periodic CSIs configured for the UE, and in response to determining that the largest number of bits that are borne by the one PUCCH resource is smaller than the number of the UCI bits, then the UE dropping all periodic CSI information, or dropping a part of CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the one PUCCH format, and using the one PUCCH resource to transmit UCI with the all or part of periodic CSI information being dropped. 8. The method of claim 1, wherein the UE has a resource with a PUCCH format 3 or a resource with a PUCCH format X for transmission of HARQ-ACK/SR information indicated by an ARI in the uplink subframe, and
in response to determining that the UE is configured with transmission of one periodic CSI in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: using the resource with the PUCCH format 3 or the resource with the PUCCH format X for transmission of HARQ-ACK/SR information indicated by the ARI to transmit the UCI; or in response to determining that the UE is configured with transmission of multiple periodic CSIs in the uplink subframe, selecting a PUCCH resource from PUCCH resources with candidate PUCCH formats to transmit the UCI; wherein the candidate PUCCH formats comprise: the PUCCH format 3/PUCCH format X for transmission of HARQ-ACK feedback information configured for the UE and one or more PUCCH resources for transmission of multiple periodic CSIs configured for the UE different from a PUCCH format 2. 9. The method of claim 1, wherein the UE has a resource with a PUCCH format 3 or a resource with a PUCCH format X for transmission of HARQ-ACK/SR information indicated by an ARI in the uplink subframe, then
in response to determining that the UE is configured with transmission of one or more periodic CSIs in the uplink subframe, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: selecting a PUCCH resource from PUCCH resources with candidate PUCCH formats according to the number of the UCI bits to transmit the UCI; wherein the candidate PUCCH formats comprise: the resource with the PUCCH format 3/the resource with the PUCCH format X for transmission of HARQ-ACK feedback information configured for the UE and one or more PUCCH resources for transmission of multiple periodic CSIs configured for the UE different from a PUCCH format 2. 10. The method of claim 8, wherein the method for selecting the PUCCH resource comprises:
in response to determining that the number of the UCI bits is smaller than or equal to the largest one of the largest numbers of bits that are borne by the respective candidate PUCCH resources, the UE selecting PUCCH resources with PUCCH formats that are enough to bear the number of the UCI bits from the PUCCH resources with the candidate PUCCH formats, and selecting a PUCCH resource with a PUCCH format by which the largest number of bits that are borne is the smallest from the selected PUCCH resources with the PUCCH formats to transmit the UCI; and in response to determining that there are two PUCCH resources with PUCCH formats selected, in which one is a configured new PUCCH resource for transmission of multiple periodic CSIs, and the other is a PUCCH resource for transmission of HARQ-ACK/SR information indicated by the ARI, then using the PUCCH resource indicated by the ARI or the PUCCH resource for transmission of multiple periodic CSIs; and in response to determining that the number of the UCI bits that need to be transmitted in the uplink subframe is larger than the largest one of the largest numbers of bits that are borne by the candidate PUCCH formats, the UE selecting a PUCCH resource with a PUCCH format by which the largest number of bits that are borne is the largest from the PUCCH resources with the candidate PUCCH formats; and in response to determining that the largest number of bits that are borne by the selected PUCCH resource is smaller than the number of the UCI bits, then the UE dropping all periodic CSI information, or dropping a part of periodic CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the selected PUCCH format, and using the selected PUCCH resource to transmit UCI with the all periodic CSI information or part of CSI information being dropped; and in response to determining that there are two PUCCH resources with PUCCH formats selected, in which one is the configured PUCCH resource for transmission of multiple periodic CSIs, and the other is the PUCCH resource for transmission of HARQ-ACK/SR information indicated by the ARI, then the UE using the PUCCH resource indicated by the ARI or the PUCCH resource for transmission of multiple periodic CSIs to transmit the UCI. 11. The method of claim 1, wherein UE has a resource with a PUCCH format 3 or a resource with a PUCCH format X for transmission of HARQ-ACK/SR information indicated by an ARI in the uplink subframe, then
in response to determining that the UE is only configured with transmission of one or more periodic CSIs, determining the PUCCH format and the resource for transmission of PUCCH to transmit the UCI comprises: transmitting the UCI using the resource with the PUCCH format 3 or the resource with the PUCCH format X for transmission of HARQ-ACK/SR information indicated by the ARI to transmit the UCI, 12. The method of claim 8, wherein using the resource with the PUCCH format 3 or the resource with the PUCCH format X for transmission of HARQ-ACK/SR information indicated by the ARI to transmit the UCI comprises:
in response to determining that the number of UCI bits of all serving cells to be transmitted in the uplink subframe is smaller than or equal to a preset positive integer M, using the PUCCH format 3 to transmit the UCI bits, and the ARI in a (e)PDCCH for PDSCH scheduling indicating a PUCCH resource from a set of PUCCH resources with the PUCCH format 3 configured for the UE by higher layer signaling; in response to determining that the number of the UCI bits of all the serving cells to be transmitted in the uplink subframe is larger than M, using the PUCCH format X to transmit the UCI bits, and the ARI in the (e)PDCCH for PDSCH scheduling indicating a PUCCH resource from a set of PUCCH resources with the PUCCH format X configured for the UE by higher layer signaling; in response to determining that the largest number of bits that are transmitted by the PUCCH resource indicated by the ARI is larger than the number of the UCI bits, then using the PUCCH resource indicated by the ARI to transmit the UCI; or otherwise, the UE dropping all periodic CSI information, or dropping a part of periodic CSI information until the number of remaining UCI bits is smaller than or equal to the largest number of bits that are borne by the PUCCH resource indicated by the ARI, using the PUCCH resource indicated by the ARI to transmit UCI with the all or part of periodic CSI information being dropped. 13. The method of any of claim 1, wherein determining the number of the HARQ-ACK feedback information bits to be transmitted in the uplink subframe comprises:
for a serving cell with a downlink reference uplink downlink configuration being frequency division duplex (FDD), in response to determining that a transmission mode configured for the serving cell is single-input multiple-output (SIMO), determining the number of HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is 1 bit, and in response to determining that the transmission mode configured for the serving cell is multiple-input multiple-output (MIMO), then determining the number of the HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is 2 bits; for a serving cell with a downlink reference uplink downlink configuration being time division duplex (TDD), in response to determining that a transmission mode of the serving cell is SIMO, determining that the number of HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is N bits, and in response to determining that the transmission mode configured for the serving cell is MIMO, determine that the number of the HARQ-ACK bits of the serving cell to be transmitted in the uplink subframe is 2N bits; summing the number of HARQ-ACK feedback information bits of all serving cells of the UE to be transmitted in the uplink subframe to obtain the number of the HARQ-ACK feedback information bits to be sent in the uplink subframe; or calculating the number of the HARQ-ACK feedback information bits to be transmitted in the uplink subframe according to received PDCCHs/EPDCCHs; wherein N is a HARQ-ACK bundling window size. 14. The method of any of claim 1, wherein determining the number of the UCI bits to be transmitted in the uplink subframe comprises:
in response to determining that a spatially bundling operation is not allowed for the HARQ-ACK feedback information to be transmitted, summing the number of HARQ-ACK feedback information bits, the number of CSI bits, and the number of SR bits of all serving cells configured for the UE to obtain a sum, and using the sum as the number of the UCI bits; or in response to determining that the spatially bundling operation is allowed for the HARQ-ACK feedback information to be transmitted, summing the number of the HARQ-ACK feedback information bits, the number of the CSI bits, and the number of the SR bits of all the serving cells configured for the UE to obtain the sum, and in response to determining that the sum is smaller than or equal to a preset positive integer M′, then using the sum as the number of the UCI bits; and in response to determining that the sum is larger than the preset positive integer M′, then spatially bundling the HARQ-ACK feedback information to be transmitted, and using the number of HARQ-ACK feedback information bits spatially bundled as the number of HARQ-ACK feedback information bits updated, and summing the number of the HARQ-ACK feedback information bits updated, the number of the CSI bits, and the number of the SR bits to obtain a sum, and using the sum as the number of the UCI bits. 15. An apparatus for transmitting HARQ-ACK feedback information in an enhanced carrier aggregation system, comprising a bit number determination unit, a resource determination unit, and a transmission unit; wherein
the bit number determination unit is to determine the number of HARQ-ACK feedback information bits that need to be transmitted by an UE in an uplink subframe; and determine the number of UCI bits to be transmitted in the uplink subframe based on the number of the HARQ-ACK feedback information bits, the number of CSI bits, and the number of SR bits that need to be transmitted in the uplink subframe; the resource determination unit is to determine a PUCCH format and a resource for transmission of PUCCH according to the number of the UCI bits determined by the bit number determination unit; and the transmission unit is to transmit UCI according to the PUCCH format and the resource for transmission of PUCCH determined by the resource determination unit. | 2,400 |
9,473 | 9,473 | 16,082,246 | 2,413 | There are provided mechanisms for sharing channels in a wireless communications system among wireless devices that use a plurality of different access technologies. First and second wireless devices are operable to share a channel in the wireless communication system with each other. The first wireless device is operable to provide an indication to the second wireless device that the first wireless device is using a first access technology to access the channel. The second wireless device is operable to receive the indication and determine, based on the indication, that the first wireless device is using a first access technology to access the channel. Accordingly, the second wireless device can determine, based on compatibility of its access technology with that of the first wireless device, whether to refrain from using the channel or to share the channel. | 1. A method for sharing a channel in a wireless communications system among wireless devices that use a plurality of different access technologies, the method comprising:
accessing, by a wireless device, the channel; determining that an access technology used to access the channel is a first one of the plurality of different access technologies; and at least partially in response to the determination, indicating to one or more other wireless devices that the first access technology is used to access the channel. 2. The method of claim 1, wherein the use of the first access technology is indicated to the one or more other wireless devices using a service advertisement signal that is broadcast to advertise use of the channel to the one or more other wireless devices. 3. The method of claim 2, wherein the service advertisement signal is broadcast periodically. 4. The method of claim 2, wherein the use of the first access technology is indicated to the one or more other wireless devices by at least one predetermined signal parameter of the service advertisement signal, the at least one predetermined signal parameter being recognizable by the one or more other wireless devices as indicating use of the first access technology. 5. The method of claim 2, wherein the at least one predetermined signal parameter is at least one of:
a periodicity of the service advertisement signal; and a predetermined sequence used to generate the service advertisement signal. 6. The method of claim 1, wherein the channel is accessed by the wireless devices for one or more Intelligent Transport Systems (ITS) services. 7. The method of claim 1, wherein the plurality of different access technologies includes IEEE-based and 3GPP-based technologies. 8. The method of claim 1, wherein certain services for which the channel is accessed are designated as primary services to be prioritized over certain other services in the network, the method further comprising:
determining that a service for which the channel is accessed is designated as a primary service, wherein indicating to the one or more other wireless devices that the first access technology is used to access the channel includes indicating that the service is designated as a primary service. 9. A method for sharing a channel in a wireless communications system among wireless devices that use different access technologies, the method comprising:
monitoring, at a first wireless device, a channel for an indication that the channel is accessed by a second wireless device; and receiving the indication that the channel is accessed by a second wireless device and determining, based on the indication, that the second wireless device is using a first access technology to access the channel. 10. The method of claim 9, wherein a service advertisement signal provides the indication that the channel is accessed by a second wireless device, the service advertisement signal being broadcast to advertise use of the channel to at least the first wireless device, and
wherein at least one predetermined signal parameter of the service advertisement signal indicates to the first wireless device that the second wireless device is using the first access technology. 11. The method of claim 9, wherein the first wireless device is using a second access technology to attempt to access the channel, the method further comprising:
at least partially in response to the determination that the second wireless device is using the first access technology, refraining from using the channel. 12. The method of claim 11, further comprising: monitoring another channel for an indication that the another channel is accessed by a third wireless device;
receiving the indication that the another channel is accessed by the third wireless device and determining, based on the indication, that the third wireless device is using the second access technology to access the another channel; and at least partially in response to the determination that the third wireless device is using the second access technology, sharing the another channel with the third wireless device. 13. The method of claim 9, wherein the first wireless device is using a second access technology to attempt to access the channel, the method further comprising:
at least partially in response to the determination that the second wireless device is using the first access technology, signaling to the second wireless device an instruction to refrain from using the channel to facilitate use of the channel by the first wireless device. 14. The method of claim 9, wherein certain services for which the channel is accessed are designated as primary services to be prioritized over other certain services in the network and further wherein the first wireless device is attempting to use the channel for a non-primary service, the method further comprising:
further determining, based on the indication that the channel is accessed by a second wireless device, that the second wireless device is using the channel for a service that is designated as a primary service; and at least partially in response to the determination that the second wireless device is using the channel for a primary service, refraining from using the channel. 15. The method of claim 9, wherein certain services for which the channel is accessed are designated as primary services to be prioritized over other certain services in the network and further wherein the first wireless device is attempting to use the channel for a primary service and is using a second access technology to attempt to access the channel, the method further comprising:
further determining, based on the indication that the channel is accessed by a second wireless device, that the second wireless device is using the channel for a service that is designated as a primary service; at least partially in response to the determination that the second wireless device is using the channel for a primary service, refraining from using the channel. 16. A wireless device operable to share a channel in a wireless communications system with one or more other wireless devices that use a plurality of different access technologies, the wireless device comprising:
at least one transceiver; at least one processor; and
memory comprising instructions executable by the at least one processor whereby the wireless device is operable to:
access the channel;
determine that an access technology used to access the channel is a first one of the plurality of different access technologies; and
at least partially in response to the determination, indicate to one or more other wireless devices that the first access technology is used to access the channel. 17. (canceled) 18. A wireless device operable to share a channel in a wireless communications system with one or more other wireless devices that use a plurality of different access technologies, the wireless device comprising:
at least one transceiver; at least one processor; and memory comprising instructions executable by the at least one processor whereby the wireless device is operable to:
monitor a channel for an indication that the channel is accessed by another wireless device; and
receive the indication that the channel is accessed by another wireless device and determine, based on the indication, that the another wireless device is using a first access technology to access the channel. 19-23. (canceled) | There are provided mechanisms for sharing channels in a wireless communications system among wireless devices that use a plurality of different access technologies. First and second wireless devices are operable to share a channel in the wireless communication system with each other. The first wireless device is operable to provide an indication to the second wireless device that the first wireless device is using a first access technology to access the channel. The second wireless device is operable to receive the indication and determine, based on the indication, that the first wireless device is using a first access technology to access the channel. Accordingly, the second wireless device can determine, based on compatibility of its access technology with that of the first wireless device, whether to refrain from using the channel or to share the channel.1. A method for sharing a channel in a wireless communications system among wireless devices that use a plurality of different access technologies, the method comprising:
accessing, by a wireless device, the channel; determining that an access technology used to access the channel is a first one of the plurality of different access technologies; and at least partially in response to the determination, indicating to one or more other wireless devices that the first access technology is used to access the channel. 2. The method of claim 1, wherein the use of the first access technology is indicated to the one or more other wireless devices using a service advertisement signal that is broadcast to advertise use of the channel to the one or more other wireless devices. 3. The method of claim 2, wherein the service advertisement signal is broadcast periodically. 4. The method of claim 2, wherein the use of the first access technology is indicated to the one or more other wireless devices by at least one predetermined signal parameter of the service advertisement signal, the at least one predetermined signal parameter being recognizable by the one or more other wireless devices as indicating use of the first access technology. 5. The method of claim 2, wherein the at least one predetermined signal parameter is at least one of:
a periodicity of the service advertisement signal; and a predetermined sequence used to generate the service advertisement signal. 6. The method of claim 1, wherein the channel is accessed by the wireless devices for one or more Intelligent Transport Systems (ITS) services. 7. The method of claim 1, wherein the plurality of different access technologies includes IEEE-based and 3GPP-based technologies. 8. The method of claim 1, wherein certain services for which the channel is accessed are designated as primary services to be prioritized over certain other services in the network, the method further comprising:
determining that a service for which the channel is accessed is designated as a primary service, wherein indicating to the one or more other wireless devices that the first access technology is used to access the channel includes indicating that the service is designated as a primary service. 9. A method for sharing a channel in a wireless communications system among wireless devices that use different access technologies, the method comprising:
monitoring, at a first wireless device, a channel for an indication that the channel is accessed by a second wireless device; and receiving the indication that the channel is accessed by a second wireless device and determining, based on the indication, that the second wireless device is using a first access technology to access the channel. 10. The method of claim 9, wherein a service advertisement signal provides the indication that the channel is accessed by a second wireless device, the service advertisement signal being broadcast to advertise use of the channel to at least the first wireless device, and
wherein at least one predetermined signal parameter of the service advertisement signal indicates to the first wireless device that the second wireless device is using the first access technology. 11. The method of claim 9, wherein the first wireless device is using a second access technology to attempt to access the channel, the method further comprising:
at least partially in response to the determination that the second wireless device is using the first access technology, refraining from using the channel. 12. The method of claim 11, further comprising: monitoring another channel for an indication that the another channel is accessed by a third wireless device;
receiving the indication that the another channel is accessed by the third wireless device and determining, based on the indication, that the third wireless device is using the second access technology to access the another channel; and at least partially in response to the determination that the third wireless device is using the second access technology, sharing the another channel with the third wireless device. 13. The method of claim 9, wherein the first wireless device is using a second access technology to attempt to access the channel, the method further comprising:
at least partially in response to the determination that the second wireless device is using the first access technology, signaling to the second wireless device an instruction to refrain from using the channel to facilitate use of the channel by the first wireless device. 14. The method of claim 9, wherein certain services for which the channel is accessed are designated as primary services to be prioritized over other certain services in the network and further wherein the first wireless device is attempting to use the channel for a non-primary service, the method further comprising:
further determining, based on the indication that the channel is accessed by a second wireless device, that the second wireless device is using the channel for a service that is designated as a primary service; and at least partially in response to the determination that the second wireless device is using the channel for a primary service, refraining from using the channel. 15. The method of claim 9, wherein certain services for which the channel is accessed are designated as primary services to be prioritized over other certain services in the network and further wherein the first wireless device is attempting to use the channel for a primary service and is using a second access technology to attempt to access the channel, the method further comprising:
further determining, based on the indication that the channel is accessed by a second wireless device, that the second wireless device is using the channel for a service that is designated as a primary service; at least partially in response to the determination that the second wireless device is using the channel for a primary service, refraining from using the channel. 16. A wireless device operable to share a channel in a wireless communications system with one or more other wireless devices that use a plurality of different access technologies, the wireless device comprising:
at least one transceiver; at least one processor; and
memory comprising instructions executable by the at least one processor whereby the wireless device is operable to:
access the channel;
determine that an access technology used to access the channel is a first one of the plurality of different access technologies; and
at least partially in response to the determination, indicate to one or more other wireless devices that the first access technology is used to access the channel. 17. (canceled) 18. A wireless device operable to share a channel in a wireless communications system with one or more other wireless devices that use a plurality of different access technologies, the wireless device comprising:
at least one transceiver; at least one processor; and memory comprising instructions executable by the at least one processor whereby the wireless device is operable to:
monitor a channel for an indication that the channel is accessed by another wireless device; and
receive the indication that the channel is accessed by another wireless device and determine, based on the indication, that the another wireless device is using a first access technology to access the channel. 19-23. (canceled) | 2,400 |
9,474 | 9,474 | 15,384,386 | 2,487 | Disclosed are various embodiments for a streaming video application. The application downloads, decodes, and renders video frame data at different frame rates. Based on the differences between these frame rates, the downloading frame rate is adjusted to minimize performance degradation. | 1. A non-transitory computer-readable medium having stored thereon a set of instructions, which if performed by a processor causes the processor to at least:
receive video frame data from a network at a first frame rate; decode the video frame data at a second frame rate, wherein the decoded video frame data is rendered on a display on a computing device; and causing the first frame rate to be adjusted based at least in part on at least one of: a difference between the first frame rate and the second frame rate, a utilization rate of a storage buffer to store the received video frame data, an amount of data stored in the storage buffer, or a determination of whether altering the first frame rate will result in a performance increase. 2. The non-transitory computer-readable medium of claim 1, wherein if performed the set of instructions further causes the processor to at least determine whether the amount of data stored in the storage buffer exceeds a maximum threshold. 3. The non-transitory computer-readable medium of claim 1, wherein the first frame rate is adjusted by a percentage of the difference between the first frame rate and a rendering frame rate. 4. The non-transitory computer-readable medium of claim 1, wherein if performed the set of instructions further causes the processor to at least perform the determination of whether altering the first frame rate will result in the performance increase by determining from performance history data that an increase in performance occurred in response to adjusting the first frame rate by a particular amount. 5. The non-transitory computer-readable medium of claim 4, wherein the performance history data is generated by:
determining that the first frame rate has been adjusted to a subsequent download frame rate; storing a first difference between the subsequent download frame rate and the second frame rate relative to a prior download frame rate; and storing a second difference between the subsequent download frame rate and the second frame rate relative to the subsequent download frame rate. 6. The non-transitory computer-readable medium of claim 1, wherein the video frame data is rendered on the display on the computing device at a third frame rate, and wherein determining to adjust the first frame rate by the amount is further based at least in part on a difference between the first frame rate and the third frame rate. 7. A system, comprising:
one or more processors; and memory to store a set of instructions that, if performed, cause the one or more processors to at least:
receive video stream data from a network at a first frame rate;
decode the video stream data from a storage buffer into a stream of video frames at a second frame rate, the video stream data being rendered on a display; and
determine whether to modify the first frame rate based at least in part on an amount of data stored in a storage buffer and a difference between the first frame rate and the second frame rate. 8. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least calculate a proposed downloading frame rate based at least in part on the difference between the first frame rate and the second frame rate. 9. The system of claim 8, wherein the set of instructions if performed further causes the one or more processors to at least:
estimate that the proposed downloading frame rate will increase performance based at least in part on performance history data; and set the first frame rate to the proposed downloading frame rate. 10. The system of claim 7, wherein determining whether to modify the first frame rate is further based at least in part on the difference between the first frame rate and the second frame rate exceeding a maximum threshold. 11. The system of claim 7, wherein determining whether to modify the first frame rate comprises increasing the first frame rate in response to the difference between the first frame rate and the second frame rate being below a first minimum threshold and the amount of data stored in the storage buffer being below a second minimum threshold. 12. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least render the video stream data at a third frame rate, and wherein determining whether to modify the first frame rate is further based at least in part on a difference between the first frame rate and the third frame rate. 13. The system of claim 12, wherein the set of instructions if performed further causes the one or more processors to at least:
store, when the first frame rate is modified, a first attribute expressing the difference between the first frame rate and the second frame rate; and store, when the first frame rate is modified, a second attribute expressing the difference between the first frame rate and the third frame rate. 14. The system of claim 13, wherein storing the first attribute or the second attribute comprises storing a weighted average of a respective first attribute or a respective second attribute and a previously stored version of the respective first attribute or the respective second attribute. 15. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least increase or decrease the first frame rate by a particular increment. 16. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least calculate a proposed downloading frame rate based at least in part on performance history data. 17. A method, comprising:
receiving, by one or more processors, video stream data from a network at a first frame rate; decoding, by the one or more processors, the video stream data at a second frame rate from a storage buffer, wherein the video stream data is rendered on a display; calculating, by the one or more processors, a difference between the first frame rate and the second frame rate; and determining, by the one or more processors, whether to adjust the first frame rate based at least in part on one or more of: the difference, an amount of data stored in the storage buffer, or a determination of whether altering the first frame rate will result in a performance increase. 18. The method of claim 17, further comprising increasing the first frame rate in response to the difference between the first frame rate and the second frame rate being below a first minimum threshold and the amount of data stored in the storage buffer being below a second minimum threshold. 19. The method of claim 17, further comprising decreasing the first frame rate in response to the amount of data stored in the storage buffer exceeding a maximum threshold. 20. The method of claim 17, further comprising determining that a proposed downloading frame rate will increase performance based at least in part on a previous usage of the proposed downloading rate. | Disclosed are various embodiments for a streaming video application. The application downloads, decodes, and renders video frame data at different frame rates. Based on the differences between these frame rates, the downloading frame rate is adjusted to minimize performance degradation.1. A non-transitory computer-readable medium having stored thereon a set of instructions, which if performed by a processor causes the processor to at least:
receive video frame data from a network at a first frame rate; decode the video frame data at a second frame rate, wherein the decoded video frame data is rendered on a display on a computing device; and causing the first frame rate to be adjusted based at least in part on at least one of: a difference between the first frame rate and the second frame rate, a utilization rate of a storage buffer to store the received video frame data, an amount of data stored in the storage buffer, or a determination of whether altering the first frame rate will result in a performance increase. 2. The non-transitory computer-readable medium of claim 1, wherein if performed the set of instructions further causes the processor to at least determine whether the amount of data stored in the storage buffer exceeds a maximum threshold. 3. The non-transitory computer-readable medium of claim 1, wherein the first frame rate is adjusted by a percentage of the difference between the first frame rate and a rendering frame rate. 4. The non-transitory computer-readable medium of claim 1, wherein if performed the set of instructions further causes the processor to at least perform the determination of whether altering the first frame rate will result in the performance increase by determining from performance history data that an increase in performance occurred in response to adjusting the first frame rate by a particular amount. 5. The non-transitory computer-readable medium of claim 4, wherein the performance history data is generated by:
determining that the first frame rate has been adjusted to a subsequent download frame rate; storing a first difference between the subsequent download frame rate and the second frame rate relative to a prior download frame rate; and storing a second difference between the subsequent download frame rate and the second frame rate relative to the subsequent download frame rate. 6. The non-transitory computer-readable medium of claim 1, wherein the video frame data is rendered on the display on the computing device at a third frame rate, and wherein determining to adjust the first frame rate by the amount is further based at least in part on a difference between the first frame rate and the third frame rate. 7. A system, comprising:
one or more processors; and memory to store a set of instructions that, if performed, cause the one or more processors to at least:
receive video stream data from a network at a first frame rate;
decode the video stream data from a storage buffer into a stream of video frames at a second frame rate, the video stream data being rendered on a display; and
determine whether to modify the first frame rate based at least in part on an amount of data stored in a storage buffer and a difference between the first frame rate and the second frame rate. 8. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least calculate a proposed downloading frame rate based at least in part on the difference between the first frame rate and the second frame rate. 9. The system of claim 8, wherein the set of instructions if performed further causes the one or more processors to at least:
estimate that the proposed downloading frame rate will increase performance based at least in part on performance history data; and set the first frame rate to the proposed downloading frame rate. 10. The system of claim 7, wherein determining whether to modify the first frame rate is further based at least in part on the difference between the first frame rate and the second frame rate exceeding a maximum threshold. 11. The system of claim 7, wherein determining whether to modify the first frame rate comprises increasing the first frame rate in response to the difference between the first frame rate and the second frame rate being below a first minimum threshold and the amount of data stored in the storage buffer being below a second minimum threshold. 12. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least render the video stream data at a third frame rate, and wherein determining whether to modify the first frame rate is further based at least in part on a difference between the first frame rate and the third frame rate. 13. The system of claim 12, wherein the set of instructions if performed further causes the one or more processors to at least:
store, when the first frame rate is modified, a first attribute expressing the difference between the first frame rate and the second frame rate; and store, when the first frame rate is modified, a second attribute expressing the difference between the first frame rate and the third frame rate. 14. The system of claim 13, wherein storing the first attribute or the second attribute comprises storing a weighted average of a respective first attribute or a respective second attribute and a previously stored version of the respective first attribute or the respective second attribute. 15. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least increase or decrease the first frame rate by a particular increment. 16. The system of claim 7, wherein the set of instructions if performed further causes the one or more processors to at least calculate a proposed downloading frame rate based at least in part on performance history data. 17. A method, comprising:
receiving, by one or more processors, video stream data from a network at a first frame rate; decoding, by the one or more processors, the video stream data at a second frame rate from a storage buffer, wherein the video stream data is rendered on a display; calculating, by the one or more processors, a difference between the first frame rate and the second frame rate; and determining, by the one or more processors, whether to adjust the first frame rate based at least in part on one or more of: the difference, an amount of data stored in the storage buffer, or a determination of whether altering the first frame rate will result in a performance increase. 18. The method of claim 17, further comprising increasing the first frame rate in response to the difference between the first frame rate and the second frame rate being below a first minimum threshold and the amount of data stored in the storage buffer being below a second minimum threshold. 19. The method of claim 17, further comprising decreasing the first frame rate in response to the amount of data stored in the storage buffer exceeding a maximum threshold. 20. The method of claim 17, further comprising determining that a proposed downloading frame rate will increase performance based at least in part on a previous usage of the proposed downloading rate. | 2,400 |
9,475 | 9,475 | 15,994,174 | 2,488 | The invention pertains to a device for monitoring the travel envelope of a vehicle, which comprises at least six cameras arranged on the vehicle for monitoring the environment and one calculating apparatus, wherein the cameras are formed by wide-angle cameras with an effective field of vision of at least 165° and are arranged to provide one or more stereoscopic fields of vision. | 1. A device for monitoring the travel envelope of a vehicle comprising at least six cameras arranged on the vehicle for monitoring the environment and one calculating apparatus, wherein the cameras are formed by wide-angle cameras with an effective field of vision of at least 165°, wherein
two cameras are arranged on the front side of the vehicle at a given spacing such that the camera axis of the respective camera is angled to the outside at a respective given angle relative to the vehicle longitudinal axis;
two cameras are arranged on the rear side of the vehicle at a given spacing such that the camera axis of the respective camera is angled to the outside at a respective given angle relative to the vehicle longitudinal axis;
just one camera is arranged on each side of the vehicle such that the camera axis of the respective camera is arranged parallel to the vehicle transverse axis;
the two front-side cameras form a front-side stereoscopic field of vision;
the two rear-side cameras form a rear-side stereoscopic field of vision;
the left side camera with the front side left camera form a left side front stereo area, and the right side camera with the front side right camera form a right side front stereo area;
the left side camera with the rear side left camera form a left side rear stereo area, and the right side camera with the rear side right camera form a right side rear stereo area;
the left side camera forms a side left mono area, and
the right side camera forms a side right mono area; and
the image data from the cameras are compiled in the calculating apparatus such that at least eight fields of vision are formed. 2. The device according to claim 1, wherein at least a part of the at least eight fields of vision are subjected to object recognition in an object recognition apparatus to recognize static and dynamic objects. 3. The device according to claim 2, wherein the fields of vision in which object recognition is carried out by the object recognition apparatus is a function of the speed and/or the steering angle of the vehicle. 4. The device according to claim 1, wherein the object recognition apparatus checks whether recognized static or dynamic objects are located in the travel envelope of the vehicle. 5. The device according to claim 4, wherein the device has an output apparatus that outputs the recognized static or dynamic objects in the travel envelope on a display and/or assistance system. 6. The device according to claim 1, wherein the angles of the front side and rear side cameras are within a range of 10° to 30° relative to the longitudinal vehicle axis. 7. The device according to claim 6, wherein the angles of the front side and rear side cameras are identical relative to the longitudinal vehicle axis. 8. The device according to claim 7, wherein the angles of the front side and rear side cameras are each 15° to the outside relative to the longitudinal vehicle axis. | The invention pertains to a device for monitoring the travel envelope of a vehicle, which comprises at least six cameras arranged on the vehicle for monitoring the environment and one calculating apparatus, wherein the cameras are formed by wide-angle cameras with an effective field of vision of at least 165° and are arranged to provide one or more stereoscopic fields of vision.1. A device for monitoring the travel envelope of a vehicle comprising at least six cameras arranged on the vehicle for monitoring the environment and one calculating apparatus, wherein the cameras are formed by wide-angle cameras with an effective field of vision of at least 165°, wherein
two cameras are arranged on the front side of the vehicle at a given spacing such that the camera axis of the respective camera is angled to the outside at a respective given angle relative to the vehicle longitudinal axis;
two cameras are arranged on the rear side of the vehicle at a given spacing such that the camera axis of the respective camera is angled to the outside at a respective given angle relative to the vehicle longitudinal axis;
just one camera is arranged on each side of the vehicle such that the camera axis of the respective camera is arranged parallel to the vehicle transverse axis;
the two front-side cameras form a front-side stereoscopic field of vision;
the two rear-side cameras form a rear-side stereoscopic field of vision;
the left side camera with the front side left camera form a left side front stereo area, and the right side camera with the front side right camera form a right side front stereo area;
the left side camera with the rear side left camera form a left side rear stereo area, and the right side camera with the rear side right camera form a right side rear stereo area;
the left side camera forms a side left mono area, and
the right side camera forms a side right mono area; and
the image data from the cameras are compiled in the calculating apparatus such that at least eight fields of vision are formed. 2. The device according to claim 1, wherein at least a part of the at least eight fields of vision are subjected to object recognition in an object recognition apparatus to recognize static and dynamic objects. 3. The device according to claim 2, wherein the fields of vision in which object recognition is carried out by the object recognition apparatus is a function of the speed and/or the steering angle of the vehicle. 4. The device according to claim 1, wherein the object recognition apparatus checks whether recognized static or dynamic objects are located in the travel envelope of the vehicle. 5. The device according to claim 4, wherein the device has an output apparatus that outputs the recognized static or dynamic objects in the travel envelope on a display and/or assistance system. 6. The device according to claim 1, wherein the angles of the front side and rear side cameras are within a range of 10° to 30° relative to the longitudinal vehicle axis. 7. The device according to claim 6, wherein the angles of the front side and rear side cameras are identical relative to the longitudinal vehicle axis. 8. The device according to claim 7, wherein the angles of the front side and rear side cameras are each 15° to the outside relative to the longitudinal vehicle axis. | 2,400 |
9,476 | 9,476 | 16,163,204 | 2,454 | A computing system includes a database and a discovery application that initiates discovery of software applications within a managed network by probing the computing devices for applications in stalled thereon. The discovery application executes discovery patterns in an attempt to classify a discovered application and determines that the discovered application is unclassified after executing the discovery patterns. In response to determining that the discovered application is unclassified, the discovery application (i) generates a configuration item representing the discovered application without classification and (ii) selects a characteristic file containing attributes of the discovered application. The discovery application provides the characteristic file to a machine learning (ML) classifier trained using a plurality of characteristic files. The discovery application receives, from the ML classifier, a classification of the discovered application, modifies the configuration item to include the classification of the discovered application, and stores, in the database, the configuration item as modified. | 1. A computing system comprising:
a database disposed within a computational instance of a remote network management platform, wherein the computational instance is associated with a managed network, wherein the managed network comprises software applications installed on computing devices; and a discovery application configured to: initiate discovery of the software applications within the managed network by probing the computing devices for applications configured to execute thereon; execute one or more predetermined discovery patterns in an attempt to classify a discovered application of the software applications; determine that the discovered application is unclassified after executing the one or more predetermined discovery patterns; in response to determining that the discovered application is unclassified, (i) generate a configuration item representing the discovered application without classification and (ii) select, from within a directory corresponding to the discovered application, a characteristic file containing attributes of the discovered application; provide the characteristic file to a machine learning (ML) classifier, wherein the ML classifier has been trained using a plurality of characteristic files corresponding to different software applications to classify the different software applications among a plurality of predetermined categories; receive, from the ML classifier, a classification of the discovered application; modify the configuration item to include the classification of the discovered application; and store, in the database, the configuration item as modified. 2. The computing system of claim 1, wherein the discovery application is configured to select the characteristic file by:
searching the directory corresponding to the discovered application for files of a predetermined type. 3. The computing system of claim 1, wherein the discovery application is configured to select the characteristic file by:
searching the directory corresponding to the discovered application for files named according to one or more predetermined patterns. 4. The computing system of claim 1, wherein the discovery application is further configured to:
select the ML classifier from a plurality of candidate ML classifiers based on the attributes of the discovered application contained in the characteristic file. 5. The computing system of claim 1, wherein the plurality of predetermined categories represent different types of software applications. 6. The computing system of claim 1, wherein the plurality of predetermined categories represent different versions of the discovered application. 7. The computing system of claim 1, wherein the characteristic file is a configuration file of the discovered application that defines a plurality of parameters according to which the discovered application is configured to operate. 8. The computing system of claim 1, wherein the discovery application is configured to determine that the discovered application is unclassified after executing the one or more predetermined discovery patterns by:
determining additional attributes of the discovered application based on at least one of (i) one or more files within the directory corresponding to the discovered application or (ii) parameters of one or more executing software processes corresponding to the discovered application; and determining, based on the additional attributes, that a discovery pattern corresponding to the discovered application is not specified by the one or more predetermined discovery patterns. 9. The computing system of claim 1, wherein the ML classifier is configured to generate a confidence metric associated with the classification of the discovered application, and wherein the discovery application is configured to modify the configuration item to include the classification of the discovered application by:
receiving, from the ML classifier, the confidence metric associated with the classification of the discovered application; and determining that the confidence metric exceeds a threshold confidence value, wherein the configuration item is modified based on the confidence metric exceeding the threshold confidence value. 10. The computing system of claim 1, wherein the discovered application is a web container executing on a server device within the managed network, wherein the web container is configured to execute therein web applications each configured to provide dynamic web content by way of a corresponding servlet, wherein the characteristic file comprises a plurality of application files corresponding to the web applications, and wherein the ML classifier is configured to classify the web container based on the plurality of application files. 11. The computing system of claim 1, wherein data used to train the ML classifier indicates, for each respective software application of the different software applications, a mapping between a respective predetermined category of the plurality of predetermined categories and a respective characteristic file, wherein a portion of the data is obtained from a plurality of different managed networks associated with the remote network management platform. 12. The computing system of claim 1, wherein the ML classifier has been further trained using a plurality of commands used to invoke execution of the different software applications to classify the different software applications among the plurality of predetermined categories, and wherein the discovery application is further configured to:
determine a command used to invoke execution of the discovered application based on one or more executing software processes corresponding to the discovered application; provide the command to the ML classifier; and receive, from the ML classifier, the classification of the discovered application, wherein the classification is additionally based on the command. 13. The computing system of claim 1, wherein the discovery application is configured to select the characteristic file by:
transmitting, to a computing device on which the discovered application is executing, a command configured to cause the computing device to identify software processes executing on the computing device; receiving, from the computing device, first data indicating the software processes executing on the computing device; identifying, based on the first data, the discovered application; transmitting, to the computing device, one or more additional commands configured to cause the computing device to (i) identify the directory corresponding to the discovered application and (ii) one or more files contained in the directory; and receiving, from the computing device, second data indicating (i) the directory and (ii) the one or more files, wherein the characteristic file is selected based on the second data. 14. A method comprising:
initiating, by a computing system associated with a remote network management platform that is associated with a managed network, discovery of software applications within the managed network by probing computing devices within the managed network for applications installed thereon; executing, by the computing system, one or more predetermined discovery patterns in an attempt to classify a discovered application of the software applications; determining, by the computing system, that the discovered application is unclassified after executing the one or more predetermined discovery patterns; in response to determining that the discovered application is unclassified, (i) generating, by the computing system, a configuration item representing the discovered application without classification and (ii) selecting, by the computing system and from within a directory corresponding to the discovered application, a characteristic file containing attributes of the discovered application; providing, by the computing system, the characteristic file to a machine learning (ML) classifier, wherein the ML classifier has been trained using a plurality of characteristic files corresponding to different software applications to classify software applications among a plurality of predetermined categories; receiving, by the computing system and from the ML classifier, a classification of the discovered application; modifying, by the computing system, the configuration item to include the classification of the discovered application; and storing, in a database disposed within the remote network management platform, the configuration item as modified. 15. The method of claim 14, wherein the characteristic file is a configuration file of the discovered application that defines a plurality of parameters according to which the discovered application is configured to operate. 16. The method of claim 14, wherein determining that the discovered application is unclassified using the one or more predetermined discovery patterns comprises:
determining additional attributes of the discovered application based on at least one of (i) one or more files within the directory corresponding to the discovered application or (ii) parameters of one or more executing software processes corresponding to the discovered application; and determining, based on the additional attributes, that a discovery pattern corresponding to the discovered application is not specified by the one or more predetermined discovery patterns. 17. The method of claim 14, wherein data used to train the ML classifier indicates, for each respective software application of the different software applications, a mapping between a respective predetermined category of the plurality of predetermined categories and a respective characteristic file, wherein a portion of the data is obtained from a plurality of different managed networks associated with the remote network management platform. 18. The method of claim 14, wherein the ML classifier has been further trained using a plurality of commands used to invoke execution of the different software applications to classify the different software applications among the plurality of predetermined categories, and wherein the method further comprises:
determining a command used to invoke execution of the discovered application based on one or more executing software processes corresponding to the discovered application; providing the command to the ML classifier; and receiving, from the ML classifier, the classification of the discovered application, wherein the classification is additionally based on the command. 19. An article of manufacture including a non-transitory computer-readable medium, having stored thereon program instructions that, upon execution by a computing system, cause the computing system to perform operations comprising:
initiating discovery of software applications within a managed network that is associated with a remote network management platform by probing computing devices within the managed network for applications installed thereon; executing one or more predetermined discovery patterns in an attempt to classify a discovered application of the software applications; determining that the discovered application is unclassified after executing the one or more predetermined discovery patterns; in response to determining that the discovered application is unclassified, (i) generating a configuration item representing the discovered application without classification and (ii) selecting, from within a directory corresponding to the discovered application, a characteristic file containing attributes of the discovered application; providing the characteristic file to a machine learning (ML) classifier, wherein the ML classifier has been trained using a plurality of characteristic files corresponding to different software applications to classify software applications among a plurality of predetermined categories; receiving, from the ML classifier, a classification of the discovered application; modifying the configuration item to include the classification of the discovered application; and storing, in a database disposed within the remote network management platform, the configuration item as modified. 20. The article of manufacture of claim 19, wherein the ML classifier has been further trained using a plurality of commands used to invoke execution of the different software applications to classify the different software applications among the plurality of predetermined categories, and wherein the operations further comprise:
determining a command used to invoke execution of the discovered application based on one or more executing software processes corresponding to the discovered application; providing the command to the ML classifier; and receiving, from the ML classifier, the classification of the discovered application, wherein the classification is additionally based on the command. | A computing system includes a database and a discovery application that initiates discovery of software applications within a managed network by probing the computing devices for applications in stalled thereon. The discovery application executes discovery patterns in an attempt to classify a discovered application and determines that the discovered application is unclassified after executing the discovery patterns. In response to determining that the discovered application is unclassified, the discovery application (i) generates a configuration item representing the discovered application without classification and (ii) selects a characteristic file containing attributes of the discovered application. The discovery application provides the characteristic file to a machine learning (ML) classifier trained using a plurality of characteristic files. The discovery application receives, from the ML classifier, a classification of the discovered application, modifies the configuration item to include the classification of the discovered application, and stores, in the database, the configuration item as modified.1. A computing system comprising:
a database disposed within a computational instance of a remote network management platform, wherein the computational instance is associated with a managed network, wherein the managed network comprises software applications installed on computing devices; and a discovery application configured to: initiate discovery of the software applications within the managed network by probing the computing devices for applications configured to execute thereon; execute one or more predetermined discovery patterns in an attempt to classify a discovered application of the software applications; determine that the discovered application is unclassified after executing the one or more predetermined discovery patterns; in response to determining that the discovered application is unclassified, (i) generate a configuration item representing the discovered application without classification and (ii) select, from within a directory corresponding to the discovered application, a characteristic file containing attributes of the discovered application; provide the characteristic file to a machine learning (ML) classifier, wherein the ML classifier has been trained using a plurality of characteristic files corresponding to different software applications to classify the different software applications among a plurality of predetermined categories; receive, from the ML classifier, a classification of the discovered application; modify the configuration item to include the classification of the discovered application; and store, in the database, the configuration item as modified. 2. The computing system of claim 1, wherein the discovery application is configured to select the characteristic file by:
searching the directory corresponding to the discovered application for files of a predetermined type. 3. The computing system of claim 1, wherein the discovery application is configured to select the characteristic file by:
searching the directory corresponding to the discovered application for files named according to one or more predetermined patterns. 4. The computing system of claim 1, wherein the discovery application is further configured to:
select the ML classifier from a plurality of candidate ML classifiers based on the attributes of the discovered application contained in the characteristic file. 5. The computing system of claim 1, wherein the plurality of predetermined categories represent different types of software applications. 6. The computing system of claim 1, wherein the plurality of predetermined categories represent different versions of the discovered application. 7. The computing system of claim 1, wherein the characteristic file is a configuration file of the discovered application that defines a plurality of parameters according to which the discovered application is configured to operate. 8. The computing system of claim 1, wherein the discovery application is configured to determine that the discovered application is unclassified after executing the one or more predetermined discovery patterns by:
determining additional attributes of the discovered application based on at least one of (i) one or more files within the directory corresponding to the discovered application or (ii) parameters of one or more executing software processes corresponding to the discovered application; and determining, based on the additional attributes, that a discovery pattern corresponding to the discovered application is not specified by the one or more predetermined discovery patterns. 9. The computing system of claim 1, wherein the ML classifier is configured to generate a confidence metric associated with the classification of the discovered application, and wherein the discovery application is configured to modify the configuration item to include the classification of the discovered application by:
receiving, from the ML classifier, the confidence metric associated with the classification of the discovered application; and determining that the confidence metric exceeds a threshold confidence value, wherein the configuration item is modified based on the confidence metric exceeding the threshold confidence value. 10. The computing system of claim 1, wherein the discovered application is a web container executing on a server device within the managed network, wherein the web container is configured to execute therein web applications each configured to provide dynamic web content by way of a corresponding servlet, wherein the characteristic file comprises a plurality of application files corresponding to the web applications, and wherein the ML classifier is configured to classify the web container based on the plurality of application files. 11. The computing system of claim 1, wherein data used to train the ML classifier indicates, for each respective software application of the different software applications, a mapping between a respective predetermined category of the plurality of predetermined categories and a respective characteristic file, wherein a portion of the data is obtained from a plurality of different managed networks associated with the remote network management platform. 12. The computing system of claim 1, wherein the ML classifier has been further trained using a plurality of commands used to invoke execution of the different software applications to classify the different software applications among the plurality of predetermined categories, and wherein the discovery application is further configured to:
determine a command used to invoke execution of the discovered application based on one or more executing software processes corresponding to the discovered application; provide the command to the ML classifier; and receive, from the ML classifier, the classification of the discovered application, wherein the classification is additionally based on the command. 13. The computing system of claim 1, wherein the discovery application is configured to select the characteristic file by:
transmitting, to a computing device on which the discovered application is executing, a command configured to cause the computing device to identify software processes executing on the computing device; receiving, from the computing device, first data indicating the software processes executing on the computing device; identifying, based on the first data, the discovered application; transmitting, to the computing device, one or more additional commands configured to cause the computing device to (i) identify the directory corresponding to the discovered application and (ii) one or more files contained in the directory; and receiving, from the computing device, second data indicating (i) the directory and (ii) the one or more files, wherein the characteristic file is selected based on the second data. 14. A method comprising:
initiating, by a computing system associated with a remote network management platform that is associated with a managed network, discovery of software applications within the managed network by probing computing devices within the managed network for applications installed thereon; executing, by the computing system, one or more predetermined discovery patterns in an attempt to classify a discovered application of the software applications; determining, by the computing system, that the discovered application is unclassified after executing the one or more predetermined discovery patterns; in response to determining that the discovered application is unclassified, (i) generating, by the computing system, a configuration item representing the discovered application without classification and (ii) selecting, by the computing system and from within a directory corresponding to the discovered application, a characteristic file containing attributes of the discovered application; providing, by the computing system, the characteristic file to a machine learning (ML) classifier, wherein the ML classifier has been trained using a plurality of characteristic files corresponding to different software applications to classify software applications among a plurality of predetermined categories; receiving, by the computing system and from the ML classifier, a classification of the discovered application; modifying, by the computing system, the configuration item to include the classification of the discovered application; and storing, in a database disposed within the remote network management platform, the configuration item as modified. 15. The method of claim 14, wherein the characteristic file is a configuration file of the discovered application that defines a plurality of parameters according to which the discovered application is configured to operate. 16. The method of claim 14, wherein determining that the discovered application is unclassified using the one or more predetermined discovery patterns comprises:
determining additional attributes of the discovered application based on at least one of (i) one or more files within the directory corresponding to the discovered application or (ii) parameters of one or more executing software processes corresponding to the discovered application; and determining, based on the additional attributes, that a discovery pattern corresponding to the discovered application is not specified by the one or more predetermined discovery patterns. 17. The method of claim 14, wherein data used to train the ML classifier indicates, for each respective software application of the different software applications, a mapping between a respective predetermined category of the plurality of predetermined categories and a respective characteristic file, wherein a portion of the data is obtained from a plurality of different managed networks associated with the remote network management platform. 18. The method of claim 14, wherein the ML classifier has been further trained using a plurality of commands used to invoke execution of the different software applications to classify the different software applications among the plurality of predetermined categories, and wherein the method further comprises:
determining a command used to invoke execution of the discovered application based on one or more executing software processes corresponding to the discovered application; providing the command to the ML classifier; and receiving, from the ML classifier, the classification of the discovered application, wherein the classification is additionally based on the command. 19. An article of manufacture including a non-transitory computer-readable medium, having stored thereon program instructions that, upon execution by a computing system, cause the computing system to perform operations comprising:
initiating discovery of software applications within a managed network that is associated with a remote network management platform by probing computing devices within the managed network for applications installed thereon; executing one or more predetermined discovery patterns in an attempt to classify a discovered application of the software applications; determining that the discovered application is unclassified after executing the one or more predetermined discovery patterns; in response to determining that the discovered application is unclassified, (i) generating a configuration item representing the discovered application without classification and (ii) selecting, from within a directory corresponding to the discovered application, a characteristic file containing attributes of the discovered application; providing the characteristic file to a machine learning (ML) classifier, wherein the ML classifier has been trained using a plurality of characteristic files corresponding to different software applications to classify software applications among a plurality of predetermined categories; receiving, from the ML classifier, a classification of the discovered application; modifying the configuration item to include the classification of the discovered application; and storing, in a database disposed within the remote network management platform, the configuration item as modified. 20. The article of manufacture of claim 19, wherein the ML classifier has been further trained using a plurality of commands used to invoke execution of the different software applications to classify the different software applications among the plurality of predetermined categories, and wherein the operations further comprise:
determining a command used to invoke execution of the discovered application based on one or more executing software processes corresponding to the discovered application; providing the command to the ML classifier; and receiving, from the ML classifier, the classification of the discovered application, wherein the classification is additionally based on the command. | 2,400 |
9,477 | 9,477 | 16,311,426 | 2,422 | An array of backlights in a television receiver are controlled through zone backlight metadata to enable better and more artistic control over the backlights. In one embodiment, the zone backlight metadata is sent to a digital receiver in a data channel as part of a digital television signal. In another embodiment, zone backlight metadata is received at the digital television receiver from the internet in coordination with video content. In another embodiment, zone backlight metadata is sent as information on a Blu-Ray disc to control backlights in coordination with the disc's contents. | 1. A method for conveying zone backlight metadata, comprising:
deriving zone backlight metadata associated with video content; and, sending said derived zone backlight metadata for controlling backlights to a television receiver. 2. The method of claim 1, wherein sending said derived zone backlight metadata comprises inserting the derived zone backlight metadata in a digital television signal. 3. The method of claim 1, wherein deriving zone backlight metadata comprises an offline process. 4. An apparatus for conveying zone backlight metadata, comprising:
a processor to derive zone backlight metadata associated with video content; and, a multiplexer to send zone backlight metadata to control backlights to a television receiver. 5. The apparatus of claim 4, wherein said multiplexer inserts the derived zone backlight metadata in a digital television signal. 6. The apparatus of claim 4, wherein said processor derives zone backlight metadata using an offline process. 7. A method for controlling backlights, comprising:
receiving zone backlight metadata associated with video content; and, controlling backlights in a television receiver using said received zone backlight metadata. 8. The method of claim 7, wherein said received zone backlight metadata is metadata in a digital television signal. 9. An apparatus for controlling backlights, comprising:
a receiver of zone backlight metadata associated with video content; and, a controller of backlights in a television receiver that uses said received zone backlight metadata. 10. The apparatus of claim 9, wherein said receiver gets said zone backlight metadata as metadata in a digital television signal. 11. A non-transitory computer readable storage medium having stored thereon instructions for controlling backlights in a television receiver. 12. A non-transitory computer readable storage medium having stored thereon a bitstream for controlling backlights in a television receiver. | An array of backlights in a television receiver are controlled through zone backlight metadata to enable better and more artistic control over the backlights. In one embodiment, the zone backlight metadata is sent to a digital receiver in a data channel as part of a digital television signal. In another embodiment, zone backlight metadata is received at the digital television receiver from the internet in coordination with video content. In another embodiment, zone backlight metadata is sent as information on a Blu-Ray disc to control backlights in coordination with the disc's contents.1. A method for conveying zone backlight metadata, comprising:
deriving zone backlight metadata associated with video content; and, sending said derived zone backlight metadata for controlling backlights to a television receiver. 2. The method of claim 1, wherein sending said derived zone backlight metadata comprises inserting the derived zone backlight metadata in a digital television signal. 3. The method of claim 1, wherein deriving zone backlight metadata comprises an offline process. 4. An apparatus for conveying zone backlight metadata, comprising:
a processor to derive zone backlight metadata associated with video content; and, a multiplexer to send zone backlight metadata to control backlights to a television receiver. 5. The apparatus of claim 4, wherein said multiplexer inserts the derived zone backlight metadata in a digital television signal. 6. The apparatus of claim 4, wherein said processor derives zone backlight metadata using an offline process. 7. A method for controlling backlights, comprising:
receiving zone backlight metadata associated with video content; and, controlling backlights in a television receiver using said received zone backlight metadata. 8. The method of claim 7, wherein said received zone backlight metadata is metadata in a digital television signal. 9. An apparatus for controlling backlights, comprising:
a receiver of zone backlight metadata associated with video content; and, a controller of backlights in a television receiver that uses said received zone backlight metadata. 10. The apparatus of claim 9, wherein said receiver gets said zone backlight metadata as metadata in a digital television signal. 11. A non-transitory computer readable storage medium having stored thereon instructions for controlling backlights in a television receiver. 12. A non-transitory computer readable storage medium having stored thereon a bitstream for controlling backlights in a television receiver. | 2,400 |
9,478 | 9,478 | 16,012,935 | 2,467 | An interface circuit in a device, e.g., an access point, may perform link adaptation. During operation, the interface circuit may provide a wake-up frame, e.g., a LP-WUR packet, associated with a channel in a band of frequencies, where the wake-up frame is intended for a wake-up radio in a recipient device. Then, the interface circuit may receive, from the recipient device, feedback information associated with a second channel in a second band of frequencies, where the feedback information is associated with a main radio in the recipient device. Based at least in part on the feedback information, the interface circuit may estimate one or more communication metrics associated with the channel in the band of frequencies. Moreover, based at least in part on the one or more communication metrics, the interface circuit may determine a data rate for use in communication via the channel in the band of frequencies. | 1. An electronic device, comprising:
a node configured to communicatively couple to an antenna; and an interface circuit, communicatively coupled to the node, configured to communicate with a recipient electronic device, and configured to:
provide, to the node, a wake-up frame associated with a channel in a band of frequencies, wherein the wake-up frame is intended for a wake-up radio in the recipient electronic device;
receive, from the node, feedback information associated with a second channel in a second band of frequencies, wherein the feedback information is associated with a main radio in the recipient electronic device;
estimate, based at least in part on the feedback information, one or more communication metrics associated with the channel in the band of frequencies; and
determine, based at least in part on the one or more communication metrics, a data rate for use in communication via the channel in the band of frequencies. 2. The electronic device of claim 1, wherein the electronic device comprises an access point. 3. The electronic device of claim 1, wherein the wake-up frame comprises a Low Power Wake Up Radio (LP-WUR) packet. 4. The electronic device of claim 1, wherein the feedback information comprises, at least in part, one or more second communication metrics associated with the channel in the band of frequencies; and
wherein the interface circuit is configured to determine the data rate based at least in part on the one or more second communication metrics. 5. The electronic device of claim 1, wherein the feedback information comprises one or more of: a received signal strength at the wake-up radio associated with the channel in the band of frequencies; a link margin associated with the channel in the band of frequencies; a pathloss associated with the channel in the band of frequencies; or a transmit power of the main radio in the recipient electronic device associated with the second channel in the second band of frequencies. 6. The electronic device of claim 1, wherein the channel in the band of frequencies and the second channel in the second band of frequencies are different. 7. The electronic device of claim 1, wherein, when the interface circuit does not receive the feedback information within a time interval of providing the wake-up frame, the interface circuit is configured to reduce the data rate for use in communication via the channel in the band of frequencies. 8. The electronic device of claim 1, wherein the interface circuit determines the data rate based at least in part on a predefined list of data rates as a function of at least one of the one or more communication metrics. 9. The electronic device of claim 8, wherein the predefined list comprises data rates as a function of signal-to-noise ratios associated with the channel in the band of frequencies. 10. The electronic device of claim 1, wherein the one or more communication metrics comprise at least one of: a signal-to-noise ratio associated with the channel in the band of frequencies, the received signal strength at the recipient electronic device associated with the channel in the band of frequencies, or pathloss associated with the channel in the band of frequencies. 11. A recipient electronic device, comprising:
a node configured to communicatively couple to an antenna; and an interface circuit, communicatively coupled to the node, configured to communicate with an electronic device, wherein the interface circuit comprises a wake-up radio and a main radio, and wherein the wake-up radio is configured to:
receive, from the node, a wake-up frame associated with a channel in a band of frequencies, wherein the wake-up frame is associated with the electronic device; and
provide, to the main radio, a wake-up signal that transitions the main radio from a low-power mode to a higher-power mode based at least in part on the wake-up frame; and
wherein the main radio is configured to:
provide feedback information intended for the electronic device, wherein the feedback information is associated with a second channel in a second band of frequencies. 12. The recipient electronic device of claim 11, wherein the electronic device comprises an access point. 13. The recipient electronic device of claim 11, wherein the wake-up frame comprises a Low Power Wake Up Radio (LP-WUR) packet. 14. The recipient electronic device of claim 11, wherein the wake-up frame is compatible with an IEEE 802.11 communication protocol. 15. The recipient electronic device of claim 11, wherein the feedback information comprises, at least in part, one or more communication metrics associated with the channel in the band of frequencies. 16. The recipient electronic device of claim 15, wherein, prior to providing the feedback information, the interface circuit is configured to determine the one or more communication metrics. 17. The recipient electronic device of claim 11, wherein the feedback information comprises one or more of: a received signal strength at the wake-up radio associated with the channel in the band of frequencies; a link margin associated with the channel in the band of frequencies; a pathloss associated with the channel in the band of frequencies; or a transmit power of the main radio in the recipient electronic device associated with the second channel in the second band of frequencies. 18. The recipient electronic device of claim 11, wherein the channel in the band of frequencies and the second channel in the second band of frequencies are different. 19. A method for providing feedback information, comprising:
by a recipient electronic device: receiving, using a wake-up radio in the recipient electronic device, a wake-up frame associated with a channel in a band of frequencies, wherein the wake-up frame is associated with an electronic device; providing, to a main radio in the recipient electronic device, a wake-up signal that transitions the main radio from a low-power mode to a higher-power mode based at least in part on the wake-up frame; and providing, to the main radio, the feedback information intended for the electronic device, wherein the feedback information is associated with a second channel in a second band of frequencies. 20. The method of claim 19, wherein the feedback information comprises, at least in part, one or more communication metrics associated with the channel in the band of frequencies. | An interface circuit in a device, e.g., an access point, may perform link adaptation. During operation, the interface circuit may provide a wake-up frame, e.g., a LP-WUR packet, associated with a channel in a band of frequencies, where the wake-up frame is intended for a wake-up radio in a recipient device. Then, the interface circuit may receive, from the recipient device, feedback information associated with a second channel in a second band of frequencies, where the feedback information is associated with a main radio in the recipient device. Based at least in part on the feedback information, the interface circuit may estimate one or more communication metrics associated with the channel in the band of frequencies. Moreover, based at least in part on the one or more communication metrics, the interface circuit may determine a data rate for use in communication via the channel in the band of frequencies.1. An electronic device, comprising:
a node configured to communicatively couple to an antenna; and an interface circuit, communicatively coupled to the node, configured to communicate with a recipient electronic device, and configured to:
provide, to the node, a wake-up frame associated with a channel in a band of frequencies, wherein the wake-up frame is intended for a wake-up radio in the recipient electronic device;
receive, from the node, feedback information associated with a second channel in a second band of frequencies, wherein the feedback information is associated with a main radio in the recipient electronic device;
estimate, based at least in part on the feedback information, one or more communication metrics associated with the channel in the band of frequencies; and
determine, based at least in part on the one or more communication metrics, a data rate for use in communication via the channel in the band of frequencies. 2. The electronic device of claim 1, wherein the electronic device comprises an access point. 3. The electronic device of claim 1, wherein the wake-up frame comprises a Low Power Wake Up Radio (LP-WUR) packet. 4. The electronic device of claim 1, wherein the feedback information comprises, at least in part, one or more second communication metrics associated with the channel in the band of frequencies; and
wherein the interface circuit is configured to determine the data rate based at least in part on the one or more second communication metrics. 5. The electronic device of claim 1, wherein the feedback information comprises one or more of: a received signal strength at the wake-up radio associated with the channel in the band of frequencies; a link margin associated with the channel in the band of frequencies; a pathloss associated with the channel in the band of frequencies; or a transmit power of the main radio in the recipient electronic device associated with the second channel in the second band of frequencies. 6. The electronic device of claim 1, wherein the channel in the band of frequencies and the second channel in the second band of frequencies are different. 7. The electronic device of claim 1, wherein, when the interface circuit does not receive the feedback information within a time interval of providing the wake-up frame, the interface circuit is configured to reduce the data rate for use in communication via the channel in the band of frequencies. 8. The electronic device of claim 1, wherein the interface circuit determines the data rate based at least in part on a predefined list of data rates as a function of at least one of the one or more communication metrics. 9. The electronic device of claim 8, wherein the predefined list comprises data rates as a function of signal-to-noise ratios associated with the channel in the band of frequencies. 10. The electronic device of claim 1, wherein the one or more communication metrics comprise at least one of: a signal-to-noise ratio associated with the channel in the band of frequencies, the received signal strength at the recipient electronic device associated with the channel in the band of frequencies, or pathloss associated with the channel in the band of frequencies. 11. A recipient electronic device, comprising:
a node configured to communicatively couple to an antenna; and an interface circuit, communicatively coupled to the node, configured to communicate with an electronic device, wherein the interface circuit comprises a wake-up radio and a main radio, and wherein the wake-up radio is configured to:
receive, from the node, a wake-up frame associated with a channel in a band of frequencies, wherein the wake-up frame is associated with the electronic device; and
provide, to the main radio, a wake-up signal that transitions the main radio from a low-power mode to a higher-power mode based at least in part on the wake-up frame; and
wherein the main radio is configured to:
provide feedback information intended for the electronic device, wherein the feedback information is associated with a second channel in a second band of frequencies. 12. The recipient electronic device of claim 11, wherein the electronic device comprises an access point. 13. The recipient electronic device of claim 11, wherein the wake-up frame comprises a Low Power Wake Up Radio (LP-WUR) packet. 14. The recipient electronic device of claim 11, wherein the wake-up frame is compatible with an IEEE 802.11 communication protocol. 15. The recipient electronic device of claim 11, wherein the feedback information comprises, at least in part, one or more communication metrics associated with the channel in the band of frequencies. 16. The recipient electronic device of claim 15, wherein, prior to providing the feedback information, the interface circuit is configured to determine the one or more communication metrics. 17. The recipient electronic device of claim 11, wherein the feedback information comprises one or more of: a received signal strength at the wake-up radio associated with the channel in the band of frequencies; a link margin associated with the channel in the band of frequencies; a pathloss associated with the channel in the band of frequencies; or a transmit power of the main radio in the recipient electronic device associated with the second channel in the second band of frequencies. 18. The recipient electronic device of claim 11, wherein the channel in the band of frequencies and the second channel in the second band of frequencies are different. 19. A method for providing feedback information, comprising:
by a recipient electronic device: receiving, using a wake-up radio in the recipient electronic device, a wake-up frame associated with a channel in a band of frequencies, wherein the wake-up frame is associated with an electronic device; providing, to a main radio in the recipient electronic device, a wake-up signal that transitions the main radio from a low-power mode to a higher-power mode based at least in part on the wake-up frame; and providing, to the main radio, the feedback information intended for the electronic device, wherein the feedback information is associated with a second channel in a second band of frequencies. 20. The method of claim 19, wherein the feedback information comprises, at least in part, one or more communication metrics associated with the channel in the band of frequencies. | 2,400 |
9,479 | 9,479 | 15,676,668 | 2,487 | A method or apparatus of configuring a multi-channel coding device for use as a single-channel coding device is provided. The multi-channel coding device reconfigured as a single-channel coding device performs encoding or decoding of the pixels for a first color channel while substituting the pixels of a second color channel with predetermined (e.g., fixed) values. The reconfigured coding device may output reconstructed pixels of the first color channel but not reconstructed pixels of the second color channel. | 1. A method comprising:
receiving a single-channel mode flag for configuring a video encoder that encodes a multi-channel image having at least first and second color channels; when the single-channel mode flag indicates a first mode:
configuring the video encoder to receive first and second sets of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and the received second set of pixels for the second color channel; and
when the single-channel mode flag indicates a second mode:
configuring the video encoder to receive the first set of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and a set of predetermined values for the second color channel. 2. The method of claim 1, wherein the first color channel is a luminance channel and the second color channel is a chrominance channel. 3. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises assigning a plurality of pixels of the second color channel to a same fixed value. 4. The method of claim 1, wherein the received first and second sets of pixels are pixels of a source image, the first set of pixels belonging to a first color channel of the source image and the second set of pixels belonging to a second color channel of the source image, wherein the set of predetermined values is provided by the video encoder independent of the source image. 5. The method of claim 1, further comprising:
when the single-channel mode flag indicates the first mode:
configuring the video encoder to output reconstruct pixels of the first and second color channels; and
when the single-channel mode flag indicates the second mode:
configuring the video encoder not to output data for the second color channel; or
configuring the video encoder to output a fixed value for the second color channel. 6. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises using the set of predetermined values as transform coefficients of the second color channel. 7. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises using the set of predetermined values as quantized data of the second color channel. 8. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises injecting the set of predetermined values into a bitstream as entropy encoded data. 9. An electronic apparatus comprising:
a video encoder capable of encoding a multi-channel image having at least first and second color channels; a selection circuit capable of:
receiving a single-channel mode flag;
when the single-channel mode flag indicates a first mode:
configuring the video encoder to receive first and second sets of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and the received second set of pixels for the second color channel;
when the single-channel mode flag indicates a second mode:
configuring the video encoder to receive the first set of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and a set of predetermined values for the second color channel. 10. The electronic apparatus of claim 9, wherein the first set of pixels and the second set of pixels are pixels of a source image, the first set of pixels belonging to a first color channel of the source image and the second set of pixels belonging to a second color channel of the source image, wherein the set of predetermined values is provided by a logic element in the video encoder independent of the source image. 11. The electronic circuit of claim 9, wherein when the single-channel mode flag indicates the second mode, the video encoder is configured not to output data for the second color channel. 12. The electronic circuit of claim 9, wherein when the single-channel mode flag indicates the second mode, the video encoder is configured to output a fixed value for the second color channel. 13. A method comprising:
receiving a bitstream comprising an encoded multi-channel image having at least first and second color channels; identifying, based on content of the bitstream, a single-channel mode flag for configuring a video decoder capable of decoding the multi-channel image; when the single-channel mode flag indicates a first mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first and second color channels and to output the decoded pixels; and
when the single-channel mode flag indicates a second mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first color channel and to output the decoded pixels of the first color channel. 14. The method of claim 13, wherein the single-channel mode flag is a syntax element in the bitstream. 15. The method of claim 13, wherein identifying the sing-channel mode flag comprises detecting a block of pixels in the multi-channel image having a set of specified values. 16. The method of claim 13 further comprising identifying encoded data for the second color channel and discarding the identified encoded data for the second color channel. 17. The method of claim 13, wherein pixels for the second color channel are not decoded pixels based on content of the bitstream. 18. An electronic apparatus comprising:
a video decoder capable of decoding a bitstream comprising an encoded multi-channel image having at least first and second color channels; a selection circuit capable of: identifying, based on content of the bitstream, a single-channel mode flag for configuring the video decoder capable of decoding the multi-channel image; when the single-channel mode flag indicates a first mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first and second color channels and to output the decoded pixels of the first and second color channels;
when the single-channel mode flag indicates a second mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first color channel and to output the decoded pixels of the first color channel. | A method or apparatus of configuring a multi-channel coding device for use as a single-channel coding device is provided. The multi-channel coding device reconfigured as a single-channel coding device performs encoding or decoding of the pixels for a first color channel while substituting the pixels of a second color channel with predetermined (e.g., fixed) values. The reconfigured coding device may output reconstructed pixels of the first color channel but not reconstructed pixels of the second color channel.1. A method comprising:
receiving a single-channel mode flag for configuring a video encoder that encodes a multi-channel image having at least first and second color channels; when the single-channel mode flag indicates a first mode:
configuring the video encoder to receive first and second sets of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and the received second set of pixels for the second color channel; and
when the single-channel mode flag indicates a second mode:
configuring the video encoder to receive the first set of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and a set of predetermined values for the second color channel. 2. The method of claim 1, wherein the first color channel is a luminance channel and the second color channel is a chrominance channel. 3. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises assigning a plurality of pixels of the second color channel to a same fixed value. 4. The method of claim 1, wherein the received first and second sets of pixels are pixels of a source image, the first set of pixels belonging to a first color channel of the source image and the second set of pixels belonging to a second color channel of the source image, wherein the set of predetermined values is provided by the video encoder independent of the source image. 5. The method of claim 1, further comprising:
when the single-channel mode flag indicates the first mode:
configuring the video encoder to output reconstruct pixels of the first and second color channels; and
when the single-channel mode flag indicates the second mode:
configuring the video encoder not to output data for the second color channel; or
configuring the video encoder to output a fixed value for the second color channel. 6. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises using the set of predetermined values as transform coefficients of the second color channel. 7. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises using the set of predetermined values as quantized data of the second color channel. 8. The method of claim 1, wherein encoding the multi-channel image based on the set of predetermined values for the second color channel comprises injecting the set of predetermined values into a bitstream as entropy encoded data. 9. An electronic apparatus comprising:
a video encoder capable of encoding a multi-channel image having at least first and second color channels; a selection circuit capable of:
receiving a single-channel mode flag;
when the single-channel mode flag indicates a first mode:
configuring the video encoder to receive first and second sets of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and the received second set of pixels for the second color channel;
when the single-channel mode flag indicates a second mode:
configuring the video encoder to receive the first set of pixels and to encode the multi-channel image based on the received first set of pixels for the first color channel and a set of predetermined values for the second color channel. 10. The electronic apparatus of claim 9, wherein the first set of pixels and the second set of pixels are pixels of a source image, the first set of pixels belonging to a first color channel of the source image and the second set of pixels belonging to a second color channel of the source image, wherein the set of predetermined values is provided by a logic element in the video encoder independent of the source image. 11. The electronic circuit of claim 9, wherein when the single-channel mode flag indicates the second mode, the video encoder is configured not to output data for the second color channel. 12. The electronic circuit of claim 9, wherein when the single-channel mode flag indicates the second mode, the video encoder is configured to output a fixed value for the second color channel. 13. A method comprising:
receiving a bitstream comprising an encoded multi-channel image having at least first and second color channels; identifying, based on content of the bitstream, a single-channel mode flag for configuring a video decoder capable of decoding the multi-channel image; when the single-channel mode flag indicates a first mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first and second color channels and to output the decoded pixels; and
when the single-channel mode flag indicates a second mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first color channel and to output the decoded pixels of the first color channel. 14. The method of claim 13, wherein the single-channel mode flag is a syntax element in the bitstream. 15. The method of claim 13, wherein identifying the sing-channel mode flag comprises detecting a block of pixels in the multi-channel image having a set of specified values. 16. The method of claim 13 further comprising identifying encoded data for the second color channel and discarding the identified encoded data for the second color channel. 17. The method of claim 13, wherein pixels for the second color channel are not decoded pixels based on content of the bitstream. 18. An electronic apparatus comprising:
a video decoder capable of decoding a bitstream comprising an encoded multi-channel image having at least first and second color channels; a selection circuit capable of: identifying, based on content of the bitstream, a single-channel mode flag for configuring the video decoder capable of decoding the multi-channel image; when the single-channel mode flag indicates a first mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first and second color channels and to output the decoded pixels of the first and second color channels;
when the single-channel mode flag indicates a second mode:
configuring the video decoder to decode the multi-channel image to generate pixels of the first color channel and to output the decoded pixels of the first color channel. | 2,400 |
9,480 | 9,480 | 15,273,594 | 2,439 | Systems and methods for determining a user's presence on a network of an enterprise are provided. Traffic is collected to a network from devices and, over a period of time, login and logoff information from a user is determined from the collected network traffic. Network sessions are determined from a user's login and logoff information and timetable is generated specific to the user that contains the network sessions. The time table identifies when the user was active and when the user was not active based on the login and logoff information and, therefore, present at a particular location over a period of time. | 1. A method for determining a user's presence on a network, comprising:
collecting traffic to a network from a device; determining, over a period of time, login and logoff information of a user of the device from the collected network traffic; determining a plurality of network sessions from the login and logoff information of the user of the device; generating a timetable specific to the user that contains the plurality of network sessions logins, wherein the timetable identifies when the user was active and when the user was not active based on the login and logoff information; and utilizing the timetable to determine that the user of the device was present at a particular location at a particular time. 2. The method of claim 1 wherein collecting traffic to the network is performed in an on-premises environment and comprises collecting tunneled traffic. 3. The method of claim 1 further comprising detecting an arrival or departure time based on the login and logoff information. 4. The method of claim 3 further comprising determining the likelihood that the user logged into the user's device at one location in view of receiving login information that the user logged into the same device at another location. 5. The method of claim 1 further comprising identifying when the user is actively on the network based on login information. 6. The method of claim 1 further comprising identifying when the user is actively on the network upon authenticating each login of the login information utilizing an authentication protocol. 7. The method of claim 6 wherein utilizing an authentication protocol comprises utilizing at least one of an authentication protocol selected from the group consisting of:
NT LAN Manager (NTLM);
Kerberos;
Lightweight Directory Access Protocol (LDAP); and
Network Time Protocol (NTP). 8. The method of claim 6 further comprising determining if each login is a remote login, an interactive login or a login associated with a service upon authenticating each login of the login information utilizing an authentication protocol. 9. The method of claim 1 further comprising authenticating the collected traffic via different authentication protocols and then correlating authentication packets via the different authentication protocols in order to determine the collected traffic came from the same device. 10. The method of claim 1 further comprising identifying when the user is not actively on the network by utilizing an authentication protocol. 11. The method of claim 1 further comprising identifying types of logins within the login information to determine whether the user is actively on the network. 12. The method of claim 1 wherein determining the login information comprises determining at least one login that is other than an interactive login requiring the user to enter credentials and, as a result, determining that the user is not actively on the network. 13. The method of claim 1 wherein the period of time corresponds with multiple days. 14. The method of claim 13 wherein determining a plurality of network sessions comprises determining a plurality of network sessions over multiple days. 15. The method of claim 1 further comprising utilizing the timetable to determine that the user of the device was present at another particular location at another particular time. 16. A system for detecting a user's presence in an enterprise network comprised of a plurality of locations to which devices may access the network, comprising:
a gateway, operable to accept communications from the devices accessing the network; a domain controller, in communication with the gateway, operable to authenticate devices seeking to access the network; and a monitor, in communication with the domain controller, operable to aggregate connection information from the devices accessing the network and to collect traffic to the network from devices, and wherein to detect presence the monitor is operable to:
determine, over a period of time, login and logoff information of a user of a device from the collected network traffic;
determine a plurality of network sessions from the login and logoff information of the user of the device;
generate a timetable specific to the user that contains the plurality of network sessions logins, wherein the timetable identifies when the user was active and when the user was not active based on the login and logoff information; and
utilize the timetable to determine that the user of the device was present at a particular location at a particular time. 17. The system of claim 16 further comprising the monitor configured to identify when the user is actively on the network upon authenticating each login of the login information utilizing an authentication protocol. 18. The system of claim 16 wherein the domain controller is operable to authenticate the collected traffic via different authentication protocols and then correlate authentication packets via the different authentication protocols in order to determine the collected traffic came from the same device. 19. The system of claim 16 further comprising the monitor operable to identify types of logins within the login information to determine whether the user is actively on the network. 20. A computer-readable storage medium including instructions for detecting presence of a user, which when executed by a processor are operable to:
passively collecting traffic to a network from a device; determining, over a period of time, login and logoff information of a user of the device from the collected network traffic; identifying when the user is actively on the network upon authenticating each login of the login information utilizing an authentication protocol; identifying types of logins within the login information to determine whether the user is actively on the network; determining a plurality of network sessions from the login and logoff information of the user of the device; generating a timetable specific to the user that contains the plurality of network sessions logins, wherein the timetable identifies when the user was active and when the user was not active based on the login and logoff information; and utilizing the timetable to determine that the user of the device was present at a particular location at a particular time and was present at another particular location at another particular time. | Systems and methods for determining a user's presence on a network of an enterprise are provided. Traffic is collected to a network from devices and, over a period of time, login and logoff information from a user is determined from the collected network traffic. Network sessions are determined from a user's login and logoff information and timetable is generated specific to the user that contains the network sessions. The time table identifies when the user was active and when the user was not active based on the login and logoff information and, therefore, present at a particular location over a period of time.1. A method for determining a user's presence on a network, comprising:
collecting traffic to a network from a device; determining, over a period of time, login and logoff information of a user of the device from the collected network traffic; determining a plurality of network sessions from the login and logoff information of the user of the device; generating a timetable specific to the user that contains the plurality of network sessions logins, wherein the timetable identifies when the user was active and when the user was not active based on the login and logoff information; and utilizing the timetable to determine that the user of the device was present at a particular location at a particular time. 2. The method of claim 1 wherein collecting traffic to the network is performed in an on-premises environment and comprises collecting tunneled traffic. 3. The method of claim 1 further comprising detecting an arrival or departure time based on the login and logoff information. 4. The method of claim 3 further comprising determining the likelihood that the user logged into the user's device at one location in view of receiving login information that the user logged into the same device at another location. 5. The method of claim 1 further comprising identifying when the user is actively on the network based on login information. 6. The method of claim 1 further comprising identifying when the user is actively on the network upon authenticating each login of the login information utilizing an authentication protocol. 7. The method of claim 6 wherein utilizing an authentication protocol comprises utilizing at least one of an authentication protocol selected from the group consisting of:
NT LAN Manager (NTLM);
Kerberos;
Lightweight Directory Access Protocol (LDAP); and
Network Time Protocol (NTP). 8. The method of claim 6 further comprising determining if each login is a remote login, an interactive login or a login associated with a service upon authenticating each login of the login information utilizing an authentication protocol. 9. The method of claim 1 further comprising authenticating the collected traffic via different authentication protocols and then correlating authentication packets via the different authentication protocols in order to determine the collected traffic came from the same device. 10. The method of claim 1 further comprising identifying when the user is not actively on the network by utilizing an authentication protocol. 11. The method of claim 1 further comprising identifying types of logins within the login information to determine whether the user is actively on the network. 12. The method of claim 1 wherein determining the login information comprises determining at least one login that is other than an interactive login requiring the user to enter credentials and, as a result, determining that the user is not actively on the network. 13. The method of claim 1 wherein the period of time corresponds with multiple days. 14. The method of claim 13 wherein determining a plurality of network sessions comprises determining a plurality of network sessions over multiple days. 15. The method of claim 1 further comprising utilizing the timetable to determine that the user of the device was present at another particular location at another particular time. 16. A system for detecting a user's presence in an enterprise network comprised of a plurality of locations to which devices may access the network, comprising:
a gateway, operable to accept communications from the devices accessing the network; a domain controller, in communication with the gateway, operable to authenticate devices seeking to access the network; and a monitor, in communication with the domain controller, operable to aggregate connection information from the devices accessing the network and to collect traffic to the network from devices, and wherein to detect presence the monitor is operable to:
determine, over a period of time, login and logoff information of a user of a device from the collected network traffic;
determine a plurality of network sessions from the login and logoff information of the user of the device;
generate a timetable specific to the user that contains the plurality of network sessions logins, wherein the timetable identifies when the user was active and when the user was not active based on the login and logoff information; and
utilize the timetable to determine that the user of the device was present at a particular location at a particular time. 17. The system of claim 16 further comprising the monitor configured to identify when the user is actively on the network upon authenticating each login of the login information utilizing an authentication protocol. 18. The system of claim 16 wherein the domain controller is operable to authenticate the collected traffic via different authentication protocols and then correlate authentication packets via the different authentication protocols in order to determine the collected traffic came from the same device. 19. The system of claim 16 further comprising the monitor operable to identify types of logins within the login information to determine whether the user is actively on the network. 20. A computer-readable storage medium including instructions for detecting presence of a user, which when executed by a processor are operable to:
passively collecting traffic to a network from a device; determining, over a period of time, login and logoff information of a user of the device from the collected network traffic; identifying when the user is actively on the network upon authenticating each login of the login information utilizing an authentication protocol; identifying types of logins within the login information to determine whether the user is actively on the network; determining a plurality of network sessions from the login and logoff information of the user of the device; generating a timetable specific to the user that contains the plurality of network sessions logins, wherein the timetable identifies when the user was active and when the user was not active based on the login and logoff information; and utilizing the timetable to determine that the user of the device was present at a particular location at a particular time and was present at another particular location at another particular time. | 2,400 |
9,481 | 9,481 | 15,392,382 | 2,473 | Wireless communication networks may use various techniques, including those that use multiple-access techniques such as multi-user multiple-input multiple-output (MU-MIMO) techniques. In some embodiments, the use of a MU-MIMO setup frame may give a destination STA a chance to select a best antenna weight vector (AWV) based on previous antenna training. In particular, the use of an AWVgroupID may be used to identify a group of one or more STAs that can be the destination STAs of the MU-MIMO setup frame. | 1. A wireless communications device having a processor and a memory, the processor and memory adapted to:
encode a multiple-input multiple-output (MIMO) setup frame that includes multiple group identifiers, each group identifier associated with multiple station (STA) address identifiers, each of the multiple STA address identifiers associated with an antenna weight vector (AWV) for directional reception; and transmit the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers. 2. The wireless communications device of claim 1, further adapted to append a bitmap to each group identifier to indicate which of the multiple STA address identifiers to associate with each group identifier. 3. The wireless communications device of claim 1, further adapted to enable determination of the AWVs by performing beamforming training with the STAs prior to said encoding and transmitting. 4. The wireless communications device of claim 1, further adapted to transmit a MIMO frame to the multiple STAs subsequent to said transmitting the MIMO setup frame. 5. The wireless communications device of claim 1, further comprising an antenna array. 6. A computer-readable non-transitory storage medium that contains instructions, which when executed by one or more processors result in performing operations comprising:
encoding a multiple-input multiple-output (MIMO) setup frame that includes multiple group identifiers, each group identifier associated with multiple station (STA) address identifiers, each of the multiple STA address identifiers associated with an antenna weight vector (AWV); and transmitting the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers. 7. The medium of claim 6, wherein the operations further comprise appending a bitmap to each group identifier to indicate which of the multiple STA address identifiers to associate with each group identifier. 8. The medium of claim 6, wherein the operations further comprise transmitting a MIMO frame to the multiple STAs subsequent to said transmitting the MIMO setup frame. 9. The medium of claim 6, wherein the operations further comprise enabling determination the AWVs by performing beamforming training with the STAs prior to said encoding and transmitting. 10. A wireless communications device comprising a processor and a memory, the processor and memory adapted to:
encode a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers; encode the MIMO setup frame with multiple antenna weight vectors (AWV), each AWV associated with one of the STA address identifiers; and transmit the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers; wherein each AWV represents directional receive parameters for the associated STA to use during communication of a subsequent MIMO frame. 11. The wireless communications device of claim 10, further adapted to transmit, subsequent to said transmitting the MIMO setup frame, the MIMO frame to the STAs identified by the STA address identifiers. 12. The wireless communications device of claim 10, further adapted to:
perform beamforming training with the multiple STAs prior to said encoding the MIMO setup frame to permit deriving the AWVs. 13. The wireless communications device of claim 10, further comprising an antenna array. 14. A computer-readable non-transitory storage medium that contains instructions, which when executed by one or more processors result in performing operations comprising:
encoding a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers; encoding the MIMO setup frame with multiple antenna weight vectors (AWV), each AWV associated with one of the STA address identifiers; and transmitting the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers; wherein each AWV represents directional receive parameters for the associated STA during the MIMO frame. 15. The medium of claim 14, wherein the operations further comprise transmitting, subsequent to transmitting the MIMO setup frame, a MIMO frame to the STAs identified by the STA address identifiers. 16. The medium of claim 14, further comprising performing beamforming training with the multiple STAs prior to said encoding the MIMO setup frame to permit deriving the AWVs. 17. A wireless communications device having a processor and a memory, the processor and memory adapted to:
receive a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers and multiple antenna weight vectors (AWVs), each of the STA address identifiers being associated with one of the AWVs; determine that one of the STA address identifiers is a particular STA address identifier that identifies the wireless communications device; and receive, subsequent to said receiving the MIMO setup frame, a MIMO frame using an AWV associated with the particular STAs address identifier; wherein the AWV associated with the particular STA address identifier represents directional receive parameters for the wireless communications device. 18. The wireless communications device of claim 17, further comprising an antenna array. 19. A computer-readable non-transitory storage medium that contains instructions, which when executed by one or more processors result in performing operations comprising:
receiving a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers and multiple antenna weight vectors (AWVs), each of the STA address identifiers being associated with one of the AWVs; determining that one of the STA address identifiers is a particular STA address identifier that identifies the wireless communications device; and receiving, subsequent to said receiving the MIMO setup frame, a MIMO frame using an AWV associated with the particular STAs address identifier; wherein the AWV associated with the particular STA address identifier represents directional receive parameters for the wireless communications device. 20. The medium of claim 19, wherein the operations further comprise performing beamforming training to derive the AWV associated with the wireless communications device, prior to said receiving the MIMO setup frame. | Wireless communication networks may use various techniques, including those that use multiple-access techniques such as multi-user multiple-input multiple-output (MU-MIMO) techniques. In some embodiments, the use of a MU-MIMO setup frame may give a destination STA a chance to select a best antenna weight vector (AWV) based on previous antenna training. In particular, the use of an AWVgroupID may be used to identify a group of one or more STAs that can be the destination STAs of the MU-MIMO setup frame.1. A wireless communications device having a processor and a memory, the processor and memory adapted to:
encode a multiple-input multiple-output (MIMO) setup frame that includes multiple group identifiers, each group identifier associated with multiple station (STA) address identifiers, each of the multiple STA address identifiers associated with an antenna weight vector (AWV) for directional reception; and transmit the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers. 2. The wireless communications device of claim 1, further adapted to append a bitmap to each group identifier to indicate which of the multiple STA address identifiers to associate with each group identifier. 3. The wireless communications device of claim 1, further adapted to enable determination of the AWVs by performing beamforming training with the STAs prior to said encoding and transmitting. 4. The wireless communications device of claim 1, further adapted to transmit a MIMO frame to the multiple STAs subsequent to said transmitting the MIMO setup frame. 5. The wireless communications device of claim 1, further comprising an antenna array. 6. A computer-readable non-transitory storage medium that contains instructions, which when executed by one or more processors result in performing operations comprising:
encoding a multiple-input multiple-output (MIMO) setup frame that includes multiple group identifiers, each group identifier associated with multiple station (STA) address identifiers, each of the multiple STA address identifiers associated with an antenna weight vector (AWV); and transmitting the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers. 7. The medium of claim 6, wherein the operations further comprise appending a bitmap to each group identifier to indicate which of the multiple STA address identifiers to associate with each group identifier. 8. The medium of claim 6, wherein the operations further comprise transmitting a MIMO frame to the multiple STAs subsequent to said transmitting the MIMO setup frame. 9. The medium of claim 6, wherein the operations further comprise enabling determination the AWVs by performing beamforming training with the STAs prior to said encoding and transmitting. 10. A wireless communications device comprising a processor and a memory, the processor and memory adapted to:
encode a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers; encode the MIMO setup frame with multiple antenna weight vectors (AWV), each AWV associated with one of the STA address identifiers; and transmit the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers; wherein each AWV represents directional receive parameters for the associated STA to use during communication of a subsequent MIMO frame. 11. The wireless communications device of claim 10, further adapted to transmit, subsequent to said transmitting the MIMO setup frame, the MIMO frame to the STAs identified by the STA address identifiers. 12. The wireless communications device of claim 10, further adapted to:
perform beamforming training with the multiple STAs prior to said encoding the MIMO setup frame to permit deriving the AWVs. 13. The wireless communications device of claim 10, further comprising an antenna array. 14. A computer-readable non-transitory storage medium that contains instructions, which when executed by one or more processors result in performing operations comprising:
encoding a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers; encoding the MIMO setup frame with multiple antenna weight vectors (AWV), each AWV associated with one of the STA address identifiers; and transmitting the MIMO setup frame to multiple STAs associated with the multiple STA address identifiers; wherein each AWV represents directional receive parameters for the associated STA during the MIMO frame. 15. The medium of claim 14, wherein the operations further comprise transmitting, subsequent to transmitting the MIMO setup frame, a MIMO frame to the STAs identified by the STA address identifiers. 16. The medium of claim 14, further comprising performing beamforming training with the multiple STAs prior to said encoding the MIMO setup frame to permit deriving the AWVs. 17. A wireless communications device having a processor and a memory, the processor and memory adapted to:
receive a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers and multiple antenna weight vectors (AWVs), each of the STA address identifiers being associated with one of the AWVs; determine that one of the STA address identifiers is a particular STA address identifier that identifies the wireless communications device; and receive, subsequent to said receiving the MIMO setup frame, a MIMO frame using an AWV associated with the particular STAs address identifier; wherein the AWV associated with the particular STA address identifier represents directional receive parameters for the wireless communications device. 18. The wireless communications device of claim 17, further comprising an antenna array. 19. A computer-readable non-transitory storage medium that contains instructions, which when executed by one or more processors result in performing operations comprising:
receiving a multiple-input multiple-output (MIMO) setup frame that includes multiple station (STA) address identifiers and multiple antenna weight vectors (AWVs), each of the STA address identifiers being associated with one of the AWVs; determining that one of the STA address identifiers is a particular STA address identifier that identifies the wireless communications device; and receiving, subsequent to said receiving the MIMO setup frame, a MIMO frame using an AWV associated with the particular STAs address identifier; wherein the AWV associated with the particular STA address identifier represents directional receive parameters for the wireless communications device. 20. The medium of claim 19, wherein the operations further comprise performing beamforming training to derive the AWV associated with the wireless communications device, prior to said receiving the MIMO setup frame. | 2,400 |
9,482 | 9,482 | 16,165,730 | 2,439 | Embodiments described herein leverage web cookies to carry messages across cloud application communications, wherein the messages are between entities that are not part of the cloud application itself. For example, in embodiments, a proxy server is interconnected between a client computer that is executing a front-end component of an application and an application server that is executing a back-end component of the application. The proxy server intercepts a request from the front-end component that is intended for the back-end component and generates a response thereto t that includes a command to create a web cookie at the client computer, wherein the web cookie includes data to be utilized by a custom code component of the client computer. The proxy server may further cause the custom code component to be injected into the front-end component of the application for execution by the client computer. | 1. A system, comprising:
a proxy server interconnected between a client computer and an application server, the client computer executing a front-end component of an application and the application server executing a back-end component of the application, the proxy server being configured to:
cause a custom code component to be injected into the front-end component of the application;
intercept a request sent from the front-end component of the application and intended for the back-end component of the application; and
generate a response to the request that includes a command to create a cookie at the client computer, the cookie including data to be utilized by the custom code component. 2. The system of claim 1, wherein the front-end component of the application comprises a web page displayed by a web browser executing on the client computer. 3. The system of claim 1, wherein the proxy server is configured to cause the custom code component to be injected into the front-end component of the application by:
appending code to the web page. 4. The system of claim 3, wherein the proxy server is configured to append the code to the web page in response to determining that a main web page of the application is being loaded. 5. The system of claim 1, wherein the request comprises a Hypertext Transfer Protocol (HTTP) request and the response comprises an HTTP response. 6. The system of claim 1, wherein the proxy server is configured to generate the response by:
creating a response; or modifying a response received from the application back-end component. 7. The system of claim 1, wherein the proxy server is further configured to determine that the request comprises an action that should be blocked and to generate the response based on the determination. 8. The system of claim 7, wherein the data to be utilized by the custom code component comprises a message to be displayed by the custom code component that concerns the action that should be blocked. 9. The system of claim 1, wherein the data to be utilized by the custom code component comprises one or more of:
information to be displayed by the custom code component; actions to be performed by the custom code component; or instructions to be executed by the custom code component. 10. A system, comprising:
a client computer interconnected to an application server via a proxy server, the client computer executing a front-end component of an application and the application server executing a back-end component of the application, the client computer being configured to:
receive a custom code component from the proxy server; and
inject the custom code component into the front-end component of the application;
the front-end component of the application being configured to:
generate a request intended for the back-end component of the application;
send the request to the proxy server;
receive a response to the request from the proxy server, the response including a command to create a cookie that was created by the proxy server; and
create the cookie on the client computer based on the command; and
the custom code component being configured to utilize data that is included in the cookie. 11. The system of claim 10, wherein the custom code component is further configured to periodically determine if a new cookie has been received. 12. The system of claim 10, wherein the front-end component of the application comprises a web page displayed by a web browser executing on the client computer. 13. The system of claim 12, wherein the custom code component comprises code that is appended to the web page. 14. The system of claim 10, wherein the request comprises a Hypertext Transfer Protocol (HTTP) request and the response comprises an HTTP response. 15. The system of claim 10, wherein the custom code component is configured to utilize the data that is included in the cookie by performing one or more of:
displaying information included in the cookie; performing actions specified in the cookie; or executing instructions included in the cookie. 16. A method performed by a computing device that is interconnected between a client computer that is executing a front-end component of an application and an application server that is executing a back-end component of the application, comprising:
causing a custom code component to be injected into the front-end component of an application; intercepting a request sent from the front-end component of the application and intended for the back-end component of the application; and generating a response to the request that includes a command to create a cookie at the client computer, the cookie including data to be utilized by the custom code component. 17. The method of claim 16, wherein the request comprises a Hypertext Transfer Protocol (HTTP) request and the response comprises an HTTP response. 18. The method of claim 16, wherein generating the response to the request further comprises:
creating a response; or modifying a response received from the application back-end component. 19. The method of claim 16, further comprising:
determining that the request comprises an action that should be blocked and generating the response based on the determination. 20. The system of claim 19, wherein the data to be consumed by the custom code component comprises a message to be displayed by the custom code component that concerns the action that should be blocked. | Embodiments described herein leverage web cookies to carry messages across cloud application communications, wherein the messages are between entities that are not part of the cloud application itself. For example, in embodiments, a proxy server is interconnected between a client computer that is executing a front-end component of an application and an application server that is executing a back-end component of the application. The proxy server intercepts a request from the front-end component that is intended for the back-end component and generates a response thereto t that includes a command to create a web cookie at the client computer, wherein the web cookie includes data to be utilized by a custom code component of the client computer. The proxy server may further cause the custom code component to be injected into the front-end component of the application for execution by the client computer.1. A system, comprising:
a proxy server interconnected between a client computer and an application server, the client computer executing a front-end component of an application and the application server executing a back-end component of the application, the proxy server being configured to:
cause a custom code component to be injected into the front-end component of the application;
intercept a request sent from the front-end component of the application and intended for the back-end component of the application; and
generate a response to the request that includes a command to create a cookie at the client computer, the cookie including data to be utilized by the custom code component. 2. The system of claim 1, wherein the front-end component of the application comprises a web page displayed by a web browser executing on the client computer. 3. The system of claim 1, wherein the proxy server is configured to cause the custom code component to be injected into the front-end component of the application by:
appending code to the web page. 4. The system of claim 3, wherein the proxy server is configured to append the code to the web page in response to determining that a main web page of the application is being loaded. 5. The system of claim 1, wherein the request comprises a Hypertext Transfer Protocol (HTTP) request and the response comprises an HTTP response. 6. The system of claim 1, wherein the proxy server is configured to generate the response by:
creating a response; or modifying a response received from the application back-end component. 7. The system of claim 1, wherein the proxy server is further configured to determine that the request comprises an action that should be blocked and to generate the response based on the determination. 8. The system of claim 7, wherein the data to be utilized by the custom code component comprises a message to be displayed by the custom code component that concerns the action that should be blocked. 9. The system of claim 1, wherein the data to be utilized by the custom code component comprises one or more of:
information to be displayed by the custom code component; actions to be performed by the custom code component; or instructions to be executed by the custom code component. 10. A system, comprising:
a client computer interconnected to an application server via a proxy server, the client computer executing a front-end component of an application and the application server executing a back-end component of the application, the client computer being configured to:
receive a custom code component from the proxy server; and
inject the custom code component into the front-end component of the application;
the front-end component of the application being configured to:
generate a request intended for the back-end component of the application;
send the request to the proxy server;
receive a response to the request from the proxy server, the response including a command to create a cookie that was created by the proxy server; and
create the cookie on the client computer based on the command; and
the custom code component being configured to utilize data that is included in the cookie. 11. The system of claim 10, wherein the custom code component is further configured to periodically determine if a new cookie has been received. 12. The system of claim 10, wherein the front-end component of the application comprises a web page displayed by a web browser executing on the client computer. 13. The system of claim 12, wherein the custom code component comprises code that is appended to the web page. 14. The system of claim 10, wherein the request comprises a Hypertext Transfer Protocol (HTTP) request and the response comprises an HTTP response. 15. The system of claim 10, wherein the custom code component is configured to utilize the data that is included in the cookie by performing one or more of:
displaying information included in the cookie; performing actions specified in the cookie; or executing instructions included in the cookie. 16. A method performed by a computing device that is interconnected between a client computer that is executing a front-end component of an application and an application server that is executing a back-end component of the application, comprising:
causing a custom code component to be injected into the front-end component of an application; intercepting a request sent from the front-end component of the application and intended for the back-end component of the application; and generating a response to the request that includes a command to create a cookie at the client computer, the cookie including data to be utilized by the custom code component. 17. The method of claim 16, wherein the request comprises a Hypertext Transfer Protocol (HTTP) request and the response comprises an HTTP response. 18. The method of claim 16, wherein generating the response to the request further comprises:
creating a response; or modifying a response received from the application back-end component. 19. The method of claim 16, further comprising:
determining that the request comprises an action that should be blocked and generating the response based on the determination. 20. The system of claim 19, wherein the data to be consumed by the custom code component comprises a message to be displayed by the custom code component that concerns the action that should be blocked. | 2,400 |
9,483 | 9,483 | 15,666,771 | 2,439 | Disclosed in some examples are systems, methods, and machine readable mediums for identifying insider threats by determining file system element activity models that correlate to undesirable behavior and then utilizing the determined model to detect insider threats. Events involving file system elements of a client computing device (e.g., a network endpoint) may be monitored by a file system element monitoring application on the client computing device. The values of these signals are aggregated across all events of the same type that have occurred within a predetermined time window (e.g., an hour) for a particular client computing device. Each time an aggregated signal has a value over the threshold, an anomaly is recorded. Anomaly counts for each signal are then calculated as the aggregate number of anomalies for a particular signal over a second time period, the span of which is determined by the generation of first anomaly to the close of an alert by the network monitor. The anomaly counts for the signals are then weighted and summed to produce a risk score. | 1. A method for detecting electronic threats, the method comprising:
receiving a signal associated with a file system element event from a computing device endpoint, the signal describing a characteristic of the file system element event; summing a value of the signal with a value of a second signal to create a summed signal, the signal and the second signal comprising a same type of signal, the signal and the second signal both received within a first predetermined period of time; identifying a threshold for the value of the summed signal; determining that the value of the summed signal exceeds the threshold, and in response, triggering a first anomaly of a first type; calculating a count of a number of anomalies of the first type; calculating a risk score based upon the count and a second count corresponding to a second anomaly of a second type, the first and second anomalies occurring within a second predetermined period of time, the risk score quantifying a calculated risk that the computing device endpoint is a threat; and sending the risk score to a second computing device. 2. The method of claim 1, wherein calculating the risk score based upon the count and the second count comprises:
multiplying the count by a first weight to produce a first weighted anomaly count; multiplying the second count by a second weight to produce a second weighted anomaly count; and adding anomaly count to the second weighted anomaly count to calculate the risk score. 3. The method of claim 2, wherein the first and second weights are calculated by a machine learning algorithm. 4. The method of claim 3, wherein the machine learning algorithm is a regression algorithm trained using historical anomaly counts labelled manually. 5. The method of claim 3, further comprising:
receiving feedback from the second computing device, the feedback indicating whether there is a threat, and in response, adjusting the weights based upon the feedback. 6. The method of claim 1, wherein the threshold for the value of the summed signal is based upon a time during which the signal was generated. 7. The method of claim 1, wherein identifying the threshold comprises determining the threshold based upon context information of the computing device endpoint. 8. A system for detecting electronic threats, the system comprising:
a processor; a memory communicatively coupled to the processor and comprising instructions, which cause the processor to perform operations comprising:
receiving a signal associated with a file system element event from a computing device endpoint, the signal describing a characteristic of the file system element event;
summing a value of the signal with a value of a second signal to create a summed signal, the signal and the second signal comprising a same type of signal, the signal and the second signal both received within a first predetermined period of time;
identifying a threshold for the value of the summed signal;
determining that the value of the summed signal exceeds the threshold, and in response, triggering a first anomaly of a first type;
calculating a count of a number of anomalies of the first type;
calculating a risk score based upon the count and a second count corresponding to a second anomaly of a second type, the first and second anomalies occurring within a second predetermined period of time, the risk score quantifying a calculated risk that the computing device endpoint is a threat; and
sending the risk score to a second computing device. 9. The system of claim 8, wherein the operations of calculating the risk score based upon the count and the second count comprises:
multiplying the count by a first weight to produce a first weighted anomaly count; multiplying the second count by a second weight to produce a second weighted anomaly count; and adding the first weighted anomaly count to the second weighted anomaly count to calculate the risk score. 10. The system of claim 9, wherein the first and second weights are calculated by a machine learning algorithm. 11. The system of claim 10, wherein the machine learning algorithm is a regression algorithm trained using historical anomaly counts labelled manually. 12. The system of claim 10, wherein the operations further comprise:
receiving feedback from the second computing device, the feedback indicating whether there is a threat, and in response, adjusting the weights based upon the feedback. 13. The system of claim 8, wherein the threshold for the value of the summed signal is based upon a time during which the signal was generated. 14. The system of claim 8, wherein identifying the threshold comprises determining the threshold based upon context information of the computing device endpoint. 15. A non-transitory machine readable medium comprising instructions, which when executed by a machine, causes the machine to perform operations comprising:
receiving a signal associated with a file system element event from a computing device endpoint, the signal describing a characteristic of the file system element event; summing a value of the signal with a value of a second signal to create a summed signal, the signal and the second signal comprising a same type of signal, the signal and the second signal both received within a first predetermined period of time; identifying a threshold for the value of the summed signal; determining that the value of the summed signal exceeds the threshold, and in response, triggering a first anomaly of a first type; calculating a count of a number of anomalies of the first type; calculating a risk score based upon the count and a second count corresponding to a second anomaly of a second type, the first and second anomalies occurring within a second predetermined period of time, the risk score quantifying a calculated risk that the computing device endpoint is a threat; and sending the risk score to a second computing device. 16. The machine readable medium of claim 15, wherein the operations of calculating the risk score based upon the count and the second count comprises:
multiplying the count by a first weight to produce a first weighted anomaly count; multiplying the second count by a second weight to produce a second weighted anomaly count; and adding the first weighted anomaly count o the second weighted anomaly count to calculate the risk score. 17. The machine readable medium of claim 16, wherein the first and second weights are calculated by a machine learning algorithm. 18. The machine readable medium of claim 17, wherein the machine learning algorithm is a regression algorithm trained using historical anomaly counts labelled manually. 19. The machine readable medium of claim 17, wherein the operations further comprise:
receiving feedback from the second computing device, the feedback indicating whether there is a threat, and in response, adjusting the weights based upon the feedback. 20. The machine readable medium of claim 15, wherein the threshold for the value of the summed signal is based upon a time during which the signal was generated. 21. The machine readable medium of claim 15, wherein identifying the threshold comprises determining the threshold based upon context information of the computing device endpoint. | Disclosed in some examples are systems, methods, and machine readable mediums for identifying insider threats by determining file system element activity models that correlate to undesirable behavior and then utilizing the determined model to detect insider threats. Events involving file system elements of a client computing device (e.g., a network endpoint) may be monitored by a file system element monitoring application on the client computing device. The values of these signals are aggregated across all events of the same type that have occurred within a predetermined time window (e.g., an hour) for a particular client computing device. Each time an aggregated signal has a value over the threshold, an anomaly is recorded. Anomaly counts for each signal are then calculated as the aggregate number of anomalies for a particular signal over a second time period, the span of which is determined by the generation of first anomaly to the close of an alert by the network monitor. The anomaly counts for the signals are then weighted and summed to produce a risk score.1. A method for detecting electronic threats, the method comprising:
receiving a signal associated with a file system element event from a computing device endpoint, the signal describing a characteristic of the file system element event; summing a value of the signal with a value of a second signal to create a summed signal, the signal and the second signal comprising a same type of signal, the signal and the second signal both received within a first predetermined period of time; identifying a threshold for the value of the summed signal; determining that the value of the summed signal exceeds the threshold, and in response, triggering a first anomaly of a first type; calculating a count of a number of anomalies of the first type; calculating a risk score based upon the count and a second count corresponding to a second anomaly of a second type, the first and second anomalies occurring within a second predetermined period of time, the risk score quantifying a calculated risk that the computing device endpoint is a threat; and sending the risk score to a second computing device. 2. The method of claim 1, wherein calculating the risk score based upon the count and the second count comprises:
multiplying the count by a first weight to produce a first weighted anomaly count; multiplying the second count by a second weight to produce a second weighted anomaly count; and adding anomaly count to the second weighted anomaly count to calculate the risk score. 3. The method of claim 2, wherein the first and second weights are calculated by a machine learning algorithm. 4. The method of claim 3, wherein the machine learning algorithm is a regression algorithm trained using historical anomaly counts labelled manually. 5. The method of claim 3, further comprising:
receiving feedback from the second computing device, the feedback indicating whether there is a threat, and in response, adjusting the weights based upon the feedback. 6. The method of claim 1, wherein the threshold for the value of the summed signal is based upon a time during which the signal was generated. 7. The method of claim 1, wherein identifying the threshold comprises determining the threshold based upon context information of the computing device endpoint. 8. A system for detecting electronic threats, the system comprising:
a processor; a memory communicatively coupled to the processor and comprising instructions, which cause the processor to perform operations comprising:
receiving a signal associated with a file system element event from a computing device endpoint, the signal describing a characteristic of the file system element event;
summing a value of the signal with a value of a second signal to create a summed signal, the signal and the second signal comprising a same type of signal, the signal and the second signal both received within a first predetermined period of time;
identifying a threshold for the value of the summed signal;
determining that the value of the summed signal exceeds the threshold, and in response, triggering a first anomaly of a first type;
calculating a count of a number of anomalies of the first type;
calculating a risk score based upon the count and a second count corresponding to a second anomaly of a second type, the first and second anomalies occurring within a second predetermined period of time, the risk score quantifying a calculated risk that the computing device endpoint is a threat; and
sending the risk score to a second computing device. 9. The system of claim 8, wherein the operations of calculating the risk score based upon the count and the second count comprises:
multiplying the count by a first weight to produce a first weighted anomaly count; multiplying the second count by a second weight to produce a second weighted anomaly count; and adding the first weighted anomaly count to the second weighted anomaly count to calculate the risk score. 10. The system of claim 9, wherein the first and second weights are calculated by a machine learning algorithm. 11. The system of claim 10, wherein the machine learning algorithm is a regression algorithm trained using historical anomaly counts labelled manually. 12. The system of claim 10, wherein the operations further comprise:
receiving feedback from the second computing device, the feedback indicating whether there is a threat, and in response, adjusting the weights based upon the feedback. 13. The system of claim 8, wherein the threshold for the value of the summed signal is based upon a time during which the signal was generated. 14. The system of claim 8, wherein identifying the threshold comprises determining the threshold based upon context information of the computing device endpoint. 15. A non-transitory machine readable medium comprising instructions, which when executed by a machine, causes the machine to perform operations comprising:
receiving a signal associated with a file system element event from a computing device endpoint, the signal describing a characteristic of the file system element event; summing a value of the signal with a value of a second signal to create a summed signal, the signal and the second signal comprising a same type of signal, the signal and the second signal both received within a first predetermined period of time; identifying a threshold for the value of the summed signal; determining that the value of the summed signal exceeds the threshold, and in response, triggering a first anomaly of a first type; calculating a count of a number of anomalies of the first type; calculating a risk score based upon the count and a second count corresponding to a second anomaly of a second type, the first and second anomalies occurring within a second predetermined period of time, the risk score quantifying a calculated risk that the computing device endpoint is a threat; and sending the risk score to a second computing device. 16. The machine readable medium of claim 15, wherein the operations of calculating the risk score based upon the count and the second count comprises:
multiplying the count by a first weight to produce a first weighted anomaly count; multiplying the second count by a second weight to produce a second weighted anomaly count; and adding the first weighted anomaly count o the second weighted anomaly count to calculate the risk score. 17. The machine readable medium of claim 16, wherein the first and second weights are calculated by a machine learning algorithm. 18. The machine readable medium of claim 17, wherein the machine learning algorithm is a regression algorithm trained using historical anomaly counts labelled manually. 19. The machine readable medium of claim 17, wherein the operations further comprise:
receiving feedback from the second computing device, the feedback indicating whether there is a threat, and in response, adjusting the weights based upon the feedback. 20. The machine readable medium of claim 15, wherein the threshold for the value of the summed signal is based upon a time during which the signal was generated. 21. The machine readable medium of claim 15, wherein identifying the threshold comprises determining the threshold based upon context information of the computing device endpoint. | 2,400 |
9,484 | 9,484 | 15,817,815 | 2,482 | The present invention is directed to a method of integrating information, including real-time information, into a virtual thematic environment using a computer system, including accessing the stored information from a database or downloading the real-time information from a source external to the thematic environment; inserting the real-time information into the thematic environment; and displaying the information to a user within the thematic environment. In one embodiment, the computer system is connected to a holographic projection system such that the images from the thematic environment can be projected as holographic projections. The computer system includes an interactive software application platform having at least one thematic/publishing logic module which contains thematic environment rules; at least one digital content library module which provides content management on the thematic environment; and at least one quantum imaging environment (QIE) module which interprets content such that the content is manipulated and accessed by any device. | 1.-28. (canceled) 29. A method of initiating a virtual thematic application, the method comprising:
receiving a request from a user at an electronic device, to initiate a virtual thematic application that is accessible at said electronic device; initiating said virtual thematic application at said electronic device; and providing a display with said electronic device, such that said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and visually rendered on said display; inserting data into said display from a computer memory accessed by the electronic device, on said geographic area and said plurality of virtual locations, such that said plurality of virtual locations correspondingly change as said user moves in said real-world locations by use of a GPS device in said electronic device; and receiving inputted information into said electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display. 30. A system, comprising:
a primary electronic device configured to access a virtual thematic application, said primary electronic device configured to initiate said virtual thematic application in response to a user request; a display provided with said electronic device, wherein said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and which are visually rendered on said display; and a GPS device disposed within said electronic device, said GPS device which is configured to insert data into said display from a computer memory, to change said plurality of virtual locations on said display as said electronic device moves in said corresponding real-world locations in said geographic area; wherein said computer memory, which is accessed by said electronic device, receives inputted information into said electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display. 31. A computer system which automatically integrates content into an electronic device, comprising:
at least one memory having at least one program which comprises the steps of:
receiving a request from a user at the electronic device, to initiate a virtual thematic application that is accessible at the electronic device;
initiating said virtual thematic application at the electronic device; and
providing a display with the electronic device, such that said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and visually rendered on said display;
inserting data into said display from a computer memory accessed by the electronic device, on said geographic area and said plurality of virtual locations, such that said plurality of virtual locations correspondingly change as said user moves in said real-world locations by use of a GPS device in the electronic device; and
receiving inputted information into the electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display; and
at least one processor configured to run the program. 32. A non-transitory, computer-readable medium containing executable code which automatically integrates content into an electronic device, comprising:
receiving a request from a user at the electronic device, to initiate a virtual thematic application that is accessible at the electronic device; initiating said virtual thematic application at the electronic device; and providing a display with the electronic device, such that said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and visually rendered on said display; inserting data into said display from a computer memory accessed by the electronic device, on said geographic area and said plurality of virtual locations, such that said plurality of virtual locations correspondingly change as said user moves in said real-world locations by use of a GPS device in the electronic device; and receiving inputted information into the electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display. 33. The method of claim 29, further comprising:
exposing said user to company branding during execution of said virtual thematic application. 34. The method of claim 29, further comprising:
providing real-time dynamic weather data for said geographic area in said virtual thematic application. 35. The method of claim 29, wherein a plurality of other users is present in said virtual thematic application. 36. The method of claim 29, further comprising:
cross-indexing said user to a character profile, representing said user or other users, which tracks decisions of said user or other users during said virtual thematic application. 37. The method of claim 36, wherein said character profile includes non-identifying demographic data. 37. The method of claim 29, wherein geographic data on said plurality of virtual locations includes data on said real-world locations. 38. The method of claim 29, further comprising:
evaluating user actions in order to generate an event for said user in said virtual thematic application. 39. The method of claim 29, wherein said electronic device is a cell phone. 40. The method of claim 29, further comprising:
providing audio and video data to said user in said virtual thematic application. 41. The method of claim 29, further comprising:
storing game benefit data for said user on said electronic device. 42. The method of claim 29, further comprising:
storing external game benefits on a database at a second electronic device accessed over a computerized network. | The present invention is directed to a method of integrating information, including real-time information, into a virtual thematic environment using a computer system, including accessing the stored information from a database or downloading the real-time information from a source external to the thematic environment; inserting the real-time information into the thematic environment; and displaying the information to a user within the thematic environment. In one embodiment, the computer system is connected to a holographic projection system such that the images from the thematic environment can be projected as holographic projections. The computer system includes an interactive software application platform having at least one thematic/publishing logic module which contains thematic environment rules; at least one digital content library module which provides content management on the thematic environment; and at least one quantum imaging environment (QIE) module which interprets content such that the content is manipulated and accessed by any device.1.-28. (canceled) 29. A method of initiating a virtual thematic application, the method comprising:
receiving a request from a user at an electronic device, to initiate a virtual thematic application that is accessible at said electronic device; initiating said virtual thematic application at said electronic device; and providing a display with said electronic device, such that said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and visually rendered on said display; inserting data into said display from a computer memory accessed by the electronic device, on said geographic area and said plurality of virtual locations, such that said plurality of virtual locations correspondingly change as said user moves in said real-world locations by use of a GPS device in said electronic device; and receiving inputted information into said electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display. 30. A system, comprising:
a primary electronic device configured to access a virtual thematic application, said primary electronic device configured to initiate said virtual thematic application in response to a user request; a display provided with said electronic device, wherein said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and which are visually rendered on said display; and a GPS device disposed within said electronic device, said GPS device which is configured to insert data into said display from a computer memory, to change said plurality of virtual locations on said display as said electronic device moves in said corresponding real-world locations in said geographic area; wherein said computer memory, which is accessed by said electronic device, receives inputted information into said electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display. 31. A computer system which automatically integrates content into an electronic device, comprising:
at least one memory having at least one program which comprises the steps of:
receiving a request from a user at the electronic device, to initiate a virtual thematic application that is accessible at the electronic device;
initiating said virtual thematic application at the electronic device; and
providing a display with the electronic device, such that said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and visually rendered on said display;
inserting data into said display from a computer memory accessed by the electronic device, on said geographic area and said plurality of virtual locations, such that said plurality of virtual locations correspondingly change as said user moves in said real-world locations by use of a GPS device in the electronic device; and
receiving inputted information into the electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display; and
at least one processor configured to run the program. 32. A non-transitory, computer-readable medium containing executable code which automatically integrates content into an electronic device, comprising:
receiving a request from a user at the electronic device, to initiate a virtual thematic application that is accessible at the electronic device; initiating said virtual thematic application at the electronic device; and providing a display with the electronic device, such that said user is presented with a plurality of virtual locations representative of real-world locations in a geographic area and visually rendered on said display; inserting data into said display from a computer memory accessed by the electronic device, on said geographic area and said plurality of virtual locations, such that said plurality of virtual locations correspondingly change as said user moves in said real-world locations by use of a GPS device in the electronic device; and receiving inputted information into the electronic device, from said user, on items retrieved from said plurality of virtual locations in said geographic area and which are shown on said display. 33. The method of claim 29, further comprising:
exposing said user to company branding during execution of said virtual thematic application. 34. The method of claim 29, further comprising:
providing real-time dynamic weather data for said geographic area in said virtual thematic application. 35. The method of claim 29, wherein a plurality of other users is present in said virtual thematic application. 36. The method of claim 29, further comprising:
cross-indexing said user to a character profile, representing said user or other users, which tracks decisions of said user or other users during said virtual thematic application. 37. The method of claim 36, wherein said character profile includes non-identifying demographic data. 37. The method of claim 29, wherein geographic data on said plurality of virtual locations includes data on said real-world locations. 38. The method of claim 29, further comprising:
evaluating user actions in order to generate an event for said user in said virtual thematic application. 39. The method of claim 29, wherein said electronic device is a cell phone. 40. The method of claim 29, further comprising:
providing audio and video data to said user in said virtual thematic application. 41. The method of claim 29, further comprising:
storing game benefit data for said user on said electronic device. 42. The method of claim 29, further comprising:
storing external game benefits on a database at a second electronic device accessed over a computerized network. | 2,400 |
9,485 | 9,485 | 16,347,313 | 2,469 | The invention refers to a transfer of a User Equipment, UE, context within a secondary network from a secondary network node ( 110 A) to a new secondary network node ( 110 B), wherein the UE ( 105 ) is served by a master network node ( 120 ) and the secondary network node ( 110 A), the method comprising: the UE receiving a first message ( 1202 ) indicative measurement configuration constructed by the secondary network node ( 110 A); the UE performing, based on the measurement configuration, measurements of potential candidates for anew secondary network node ( 110 B); and the UE sending a second message ( 1203 ) comprising a measurement report indicative of the measurements of potential candidates for the new secondary node. The invention further relates to a secondary network node adapted to perform the method steps of initiating sending a first message ( 1202 ) indicative of a secondary network node measurement configuration to the UE ( 105 ); and receiving a second message ( 1203 ) comprising a measurement report indicative of the measurements of potential candidates for a new secondary node from the UE ( 105 ). | 1. A method for a-transfer of a User Equipment, UE, context within a secondary network from a secondary network node to a new secondary network node, wherein the UE is served by a master network node and the secondary network node, the method comprising:
the UE receiving a first message indicative of a measurement configuration constructed by the secondary network node; the UE performing, based on the received measurement configuration, measurements of potential candidates for a new secondary network node; and the UE sending a second message comprising a measurement report indicative of the measurements of potential candidates for the new secondary node. 2. The method of claim 1, wherein the first message is received from the master network node, the first message comprising the received measurement configuration. 3. The method of claim 1, wherein the received measurement configuration is indicative of suitable inter-frequencies to measure, and wherein the UE performs a corresponding measurement. 4. The method of anyone of claim 1, wherein the first message is generated by an RRC entity within the secondary node. 5. The method of claim 1, wherein the UE receives the measurement configuration in form of a RRC packet data unit, PDU. 6. The method of anyone of claim 1, wherein the second message is sent to the master network node. 7. The method of anyone of claim 1, wherein the UE generates the second message comprising the measurement report in a container to be forwarded to the secondary network. 8. (canceled) 9. The method of claim 1, wherein in response to a decision of the secondary network of transferring the context from the source secondary network node to the target secondary network node, the UE receives a third message comprising a connection reconfiguration message. 10. The method of claim 1, wherein the UE transmits a fourth message comprising a connection reconfiguration complete confirmation in response to the third message. 11. (canceled) 12. The method of claim 9, wherein the third message is received from the master network node. 13. The method of claim 9, wherein the third message comprises a secondary node configuration generated by the target secondary network node. 14. The method of claim 9, wherein the fourth message is transmitted to the master network node. 15. The method of claim 1, wherein transmitting the fourth message initiates sending a fifth message comprising a connection reconfiguration complete information from the master network node to the new secondary network node. 16.-18. (canceled) 19. A User Equipment, UE configured for supporting a transfer of a UE context within a secondary network from a secondary network node to a new secondary network node, wherein the UE is served by a master network node and the secondary network node, the UE comprising a transmitter; a receiver; a memory; and a data processing system comprising one or more processors, said memory comprising instructions executable by said one or more processors, wherein the UE is operative to:
receive a first message indicative of a measurement configuration constructed by the secondary network node; perform based on the received measurement configuration, measurements of potential candidates for a new secondary network node; and send a second message comprising a measurement report indicative of the measurements of potential candidates for the new secondary node. 20. (canceled) 21. The UE of claim 19, wherein the UE is configured to perform a measurement of suitable inter-frequencies. 22.-23. (canceled) 24. The UE of claim 19, wherein the second message is sent to the master network node. 25. The UE claim 19, wherein the UE generates the second message comprising the measurement report in a container to be forwarded to the secondary network. 26. (canceled) 27. The UE of claim 19, further being configured to:
receive a third message comprising a connection reconfiguration, and transmit a fourth message comprising a Connection Reconfiguration Complete confirmation. 28. (canceled) 29. The UE of claim 27, wherein the third message is received from the master network node. 30.-32. (canceled) 33. A method for a-transfer of a User Equipment, UE, context within a secondary network from a secondary network node to a new secondary network node, wherein the UE is served by a master network node and the secondary network node, the method comprising the following steps performed by the secondary network node:
initiating sending a first message indicative of a secondary network node measurement configuration to the UE; and receiving a second message comprising a measurement report indicative of the measurements of potential candidates for a new secondary node from the UE. 34. (canceled) 35. The method of claim 33, wherein the first message is transmitted to the master network node to be forwarded to the UE. 36. The method of claim 33, wherein the measurement configuration is indicative of suitable inter-frequencies to be measured by the UE. 37. (canceled) 38. The method of claim 33, wherein the second message is received from the master network node, the second message comprising the measurement report of the UE. 39. The method of claim 33, comprising retrieving the measurement report from a container comprised by the second message. 40.-45. (canceled) 46. A network node, configured for providing a transfer of a UE context within a secondary network to a target secondary network node, wherein the UE is served by a master network node and the network node, the network node comprising a transmitter; a receiver; a memory; and a data processing system comprising one or more processors, said memory comprising instructions executable by said one or more processors, wherein the network node is operative to:
initiate sending a first message indicative of a secondary network node measurement configuration to the UE; and receive a second message comprising a measurement report indicative of the measurements of potential candidates for a new secondary node from the UE. 47.-57. (canceled) | The invention refers to a transfer of a User Equipment, UE, context within a secondary network from a secondary network node ( 110 A) to a new secondary network node ( 110 B), wherein the UE ( 105 ) is served by a master network node ( 120 ) and the secondary network node ( 110 A), the method comprising: the UE receiving a first message ( 1202 ) indicative measurement configuration constructed by the secondary network node ( 110 A); the UE performing, based on the measurement configuration, measurements of potential candidates for anew secondary network node ( 110 B); and the UE sending a second message ( 1203 ) comprising a measurement report indicative of the measurements of potential candidates for the new secondary node. The invention further relates to a secondary network node adapted to perform the method steps of initiating sending a first message ( 1202 ) indicative of a secondary network node measurement configuration to the UE ( 105 ); and receiving a second message ( 1203 ) comprising a measurement report indicative of the measurements of potential candidates for a new secondary node from the UE ( 105 ).1. A method for a-transfer of a User Equipment, UE, context within a secondary network from a secondary network node to a new secondary network node, wherein the UE is served by a master network node and the secondary network node, the method comprising:
the UE receiving a first message indicative of a measurement configuration constructed by the secondary network node; the UE performing, based on the received measurement configuration, measurements of potential candidates for a new secondary network node; and the UE sending a second message comprising a measurement report indicative of the measurements of potential candidates for the new secondary node. 2. The method of claim 1, wherein the first message is received from the master network node, the first message comprising the received measurement configuration. 3. The method of claim 1, wherein the received measurement configuration is indicative of suitable inter-frequencies to measure, and wherein the UE performs a corresponding measurement. 4. The method of anyone of claim 1, wherein the first message is generated by an RRC entity within the secondary node. 5. The method of claim 1, wherein the UE receives the measurement configuration in form of a RRC packet data unit, PDU. 6. The method of anyone of claim 1, wherein the second message is sent to the master network node. 7. The method of anyone of claim 1, wherein the UE generates the second message comprising the measurement report in a container to be forwarded to the secondary network. 8. (canceled) 9. The method of claim 1, wherein in response to a decision of the secondary network of transferring the context from the source secondary network node to the target secondary network node, the UE receives a third message comprising a connection reconfiguration message. 10. The method of claim 1, wherein the UE transmits a fourth message comprising a connection reconfiguration complete confirmation in response to the third message. 11. (canceled) 12. The method of claim 9, wherein the third message is received from the master network node. 13. The method of claim 9, wherein the third message comprises a secondary node configuration generated by the target secondary network node. 14. The method of claim 9, wherein the fourth message is transmitted to the master network node. 15. The method of claim 1, wherein transmitting the fourth message initiates sending a fifth message comprising a connection reconfiguration complete information from the master network node to the new secondary network node. 16.-18. (canceled) 19. A User Equipment, UE configured for supporting a transfer of a UE context within a secondary network from a secondary network node to a new secondary network node, wherein the UE is served by a master network node and the secondary network node, the UE comprising a transmitter; a receiver; a memory; and a data processing system comprising one or more processors, said memory comprising instructions executable by said one or more processors, wherein the UE is operative to:
receive a first message indicative of a measurement configuration constructed by the secondary network node; perform based on the received measurement configuration, measurements of potential candidates for a new secondary network node; and send a second message comprising a measurement report indicative of the measurements of potential candidates for the new secondary node. 20. (canceled) 21. The UE of claim 19, wherein the UE is configured to perform a measurement of suitable inter-frequencies. 22.-23. (canceled) 24. The UE of claim 19, wherein the second message is sent to the master network node. 25. The UE claim 19, wherein the UE generates the second message comprising the measurement report in a container to be forwarded to the secondary network. 26. (canceled) 27. The UE of claim 19, further being configured to:
receive a third message comprising a connection reconfiguration, and transmit a fourth message comprising a Connection Reconfiguration Complete confirmation. 28. (canceled) 29. The UE of claim 27, wherein the third message is received from the master network node. 30.-32. (canceled) 33. A method for a-transfer of a User Equipment, UE, context within a secondary network from a secondary network node to a new secondary network node, wherein the UE is served by a master network node and the secondary network node, the method comprising the following steps performed by the secondary network node:
initiating sending a first message indicative of a secondary network node measurement configuration to the UE; and receiving a second message comprising a measurement report indicative of the measurements of potential candidates for a new secondary node from the UE. 34. (canceled) 35. The method of claim 33, wherein the first message is transmitted to the master network node to be forwarded to the UE. 36. The method of claim 33, wherein the measurement configuration is indicative of suitable inter-frequencies to be measured by the UE. 37. (canceled) 38. The method of claim 33, wherein the second message is received from the master network node, the second message comprising the measurement report of the UE. 39. The method of claim 33, comprising retrieving the measurement report from a container comprised by the second message. 40.-45. (canceled) 46. A network node, configured for providing a transfer of a UE context within a secondary network to a target secondary network node, wherein the UE is served by a master network node and the network node, the network node comprising a transmitter; a receiver; a memory; and a data processing system comprising one or more processors, said memory comprising instructions executable by said one or more processors, wherein the network node is operative to:
initiate sending a first message indicative of a secondary network node measurement configuration to the UE; and receive a second message comprising a measurement report indicative of the measurements of potential candidates for a new secondary node from the UE. 47.-57. (canceled) | 2,400 |
9,486 | 9,486 | 15,764,442 | 2,467 | Various communication systems may benefit from efficient communications. For example, low latency long term evolution (LTE) systems may benefit from a short physical uplink shared channel (PUSCH) arrangement. A method may include operating a user equipment to follow a shortened transmission time interval. The shortened transmission time interval can be an integer number, L, of symbols in length. The method can also include sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval. | 1-22. (canceled) 23. A method, comprising:
operating a user equipment to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or adapting a bandwidth of a shortened physical uplink shared channel in accordance with the shortened transmission time interval, wherein the adapting comprises, for the user equipment, using a different amount of bandwidth under different circumstances. 24. The method of claim 23, further comprising:
receiving a dynamic indication to drop at least one demodulation reference signal from a transmission; and dropping the at least one demodulation reference signal based on the indication. 25. The method of claim 23, further comprising:
dropping at least one demodulation reference signal based on rules. 26. The method of claim 25, wherein the rules are known in advance by the user equipment and are configured to the user equipment by a network, specification, or manufacturer. 27. The method of claim 25, further comprising:
receiving a dynamic indication to operate in conjunction with or in supplement to the rules. 28. A method, comprising:
operating an access node to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of receiving a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or receiving a shortened physical uplink shared channel, wherein the receiving comprises adapting a bandwidth on which the shortened physical uplink shared channel is received in accordance with the shortened transmission time interval, wherein the adapting comprises, for the access node, allocating a different amount of bandwidth under different circumstances. 29. The method of claim 28, further comprising:
sending a dynamic indication for a user equipment to drop at least one demodulation reference signal from a transmission. 30. The method of claim 28, further comprising:
sending a configuration of a rule on dropping at least one demodulation reference signal from a transmission for a user equipment. 31. The method of claim 30, further comprising:
sending a dynamic indication to operate in conjunction with or in supplement to the dropping rule. 32. The method of claim 29, wherein the sending the dynamic indication is based on a decision by a scheduler to reduce reference signal overhead. 33. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to operate a user equipment to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and perform at least one of sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or adapting a bandwidth of a shortened physical uplink shared channel in accordance with the shortened transmission time interval, wherein the adapting comprises, for the user equipment, using a different amount of bandwidth under different circumstances. 34. The apparatus of claim 33, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
receive a dynamic indication to drop at least one demodulation reference signal from a transmission; and drop the at least one demodulation reference signal based on the indication. 35. The apparatus of claim 33, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
drop at least one demodulation reference signal based on rules. 36. The apparatus of claim 35, wherein the rules are known in advance by the user equipment and are configured to the user equipment by a network, specification, or manufacturer. 37. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
receive a dynamic indication to operate in conjunction with or in supplement to the rules. 38. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to operate an access node to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and perform at least one of receiving a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or receiving a shortened physical uplink shared channel, wherein the receiving comprises adapting a bandwidth on which the shortened physical uplink shared channel is received in accordance with the shortened transmission time interval, wherein the adapting comprises, for the access node, allocating a different amount of bandwidth under different circumstances. 39. The apparatus of claim 38, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
send a dynamic indication for a user equipment to drop at least one demodulation reference signal from a transmission. 40. The apparatus of claim 38, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
send a configuration of a rule on dropping at least one demodulation reference signal from a transmission for a user equipment. 41. The apparatus of claim 40, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
send a dynamic indication to operate in conjunction with or in supplement to the dropping rule. 42. The apparatus of claim 39, wherein the dynamic indication is sent based on a decision by a scheduler to reduce reference signal overhead. 43. A non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the following:
operating a user equipment to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or adapting a bandwidth of a shortened physical uplink shared channel in accordance with the shortened transmission time interval, wherein the adapting comprises, for the user equipment, using a different amount of bandwidth under different circumstances. 44. A non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the following:
operating an access node to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of receiving a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or receiving a shortened physical uplink shared channel, wherein the receiving comprises adapting a bandwidth on which the shortened physical uplink shared channel is received in accordance with the shortened transmission time interval, wherein the adapting comprises, for the access node, allocating a different amount of bandwidth under different circumstances. | Various communication systems may benefit from efficient communications. For example, low latency long term evolution (LTE) systems may benefit from a short physical uplink shared channel (PUSCH) arrangement. A method may include operating a user equipment to follow a shortened transmission time interval. The shortened transmission time interval can be an integer number, L, of symbols in length. The method can also include sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval.1-22. (canceled) 23. A method, comprising:
operating a user equipment to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or adapting a bandwidth of a shortened physical uplink shared channel in accordance with the shortened transmission time interval, wherein the adapting comprises, for the user equipment, using a different amount of bandwidth under different circumstances. 24. The method of claim 23, further comprising:
receiving a dynamic indication to drop at least one demodulation reference signal from a transmission; and dropping the at least one demodulation reference signal based on the indication. 25. The method of claim 23, further comprising:
dropping at least one demodulation reference signal based on rules. 26. The method of claim 25, wherein the rules are known in advance by the user equipment and are configured to the user equipment by a network, specification, or manufacturer. 27. The method of claim 25, further comprising:
receiving a dynamic indication to operate in conjunction with or in supplement to the rules. 28. A method, comprising:
operating an access node to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of receiving a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or receiving a shortened physical uplink shared channel, wherein the receiving comprises adapting a bandwidth on which the shortened physical uplink shared channel is received in accordance with the shortened transmission time interval, wherein the adapting comprises, for the access node, allocating a different amount of bandwidth under different circumstances. 29. The method of claim 28, further comprising:
sending a dynamic indication for a user equipment to drop at least one demodulation reference signal from a transmission. 30. The method of claim 28, further comprising:
sending a configuration of a rule on dropping at least one demodulation reference signal from a transmission for a user equipment. 31. The method of claim 30, further comprising:
sending a dynamic indication to operate in conjunction with or in supplement to the dropping rule. 32. The method of claim 29, wherein the sending the dynamic indication is based on a decision by a scheduler to reduce reference signal overhead. 33. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to operate a user equipment to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and perform at least one of sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or adapting a bandwidth of a shortened physical uplink shared channel in accordance with the shortened transmission time interval, wherein the adapting comprises, for the user equipment, using a different amount of bandwidth under different circumstances. 34. The apparatus of claim 33, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
receive a dynamic indication to drop at least one demodulation reference signal from a transmission; and drop the at least one demodulation reference signal based on the indication. 35. The apparatus of claim 33, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
drop at least one demodulation reference signal based on rules. 36. The apparatus of claim 35, wherein the rules are known in advance by the user equipment and are configured to the user equipment by a network, specification, or manufacturer. 37. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
receive a dynamic indication to operate in conjunction with or in supplement to the rules. 38. An apparatus, comprising:
at least one processor; and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to operate an access node to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and perform at least one of receiving a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or receiving a shortened physical uplink shared channel, wherein the receiving comprises adapting a bandwidth on which the shortened physical uplink shared channel is received in accordance with the shortened transmission time interval, wherein the adapting comprises, for the access node, allocating a different amount of bandwidth under different circumstances. 39. The apparatus of claim 38, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
send a dynamic indication for a user equipment to drop at least one demodulation reference signal from a transmission. 40. The apparatus of claim 38, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
send a configuration of a rule on dropping at least one demodulation reference signal from a transmission for a user equipment. 41. The apparatus of claim 40, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus further to:
send a dynamic indication to operate in conjunction with or in supplement to the dropping rule. 42. The apparatus of claim 39, wherein the dynamic indication is sent based on a decision by a scheduler to reduce reference signal overhead. 43. A non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the following:
operating a user equipment to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of sending a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or adapting a bandwidth of a shortened physical uplink shared channel in accordance with the shortened transmission time interval, wherein the adapting comprises, for the user equipment, using a different amount of bandwidth under different circumstances. 44. A non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the following:
operating an access node to follow a shortened transmission time interval, wherein the shortened transmission time interval is an integer number, L, of symbols in length; and at least one of receiving a demodulation reference signal in at least a first symbol of the L symbols of the shortened transmission time interval; or receiving a shortened physical uplink shared channel, wherein the receiving comprises adapting a bandwidth on which the shortened physical uplink shared channel is received in accordance with the shortened transmission time interval, wherein the adapting comprises, for the access node, allocating a different amount of bandwidth under different circumstances. | 2,400 |
9,487 | 9,487 | 15,768,415 | 2,416 | A method in a user equipment for attaching the user equipment to a mobile communications network comprises receiving a list of network slice identities, wherein a network slice identity identifies a portion of the mobile communications network that serves as a logical network to a set of user equipment (step 201). A network slice is selected based on one or more criteria (step 203). A network slice attachment request is sent to a network node (step 205), for requesting attachment of the user equipment to the selected network slice of the mobile communications network. | 1. A method in a user equipment for attaching the user equipment to a mobile communications network, the method comprising:
receiving a list of network slice identities, wherein a network slice identity identifies a portion of the mobile communications network that serves as a logical network for a set of user equipment; selecting a network slice based on one or more criteria; and sending a network slice attachment request to a network node, for requesting attachment of the user equipment to the selected network slice of the mobile communications network. 2. The method of claim 1, wherein the step of receiving further comprises receiving network slice capabilities tags associated with respective network slice identities, wherein a network slice capability tag relates to the functional capabilities of the associated portion of the mobile communications network. 3. The method of claim 1, wherein the step of selecting is based on one or more criteria including:
a user preference; a network slice type preferred by a mobile network operator, MNO, for a particular service or application to be used by the user equipment; a network slice type preferred by a mobile network operator, MNO, for one or more services or applications to which the user equipment is subscribed; a network slice type preferred by a mobile virtual network operator, MVNO, for a particular service or application to be used by the user equipment; a network slice type preferred by a mobile virtual network operator, MVNO, for one or more services or applications to which the user equipment is subscribed; or a degree of correlation between the capabilities of an application or service to be used by the user equipment and the capabilities of the network slice of the network. 4. The method of claim 3, wherein a network slice type relates to a service type, user equipment type, or a business criteria. 5. The method of claim 1, wherein step of selecting a network slice comprises selecting a network slice using an anchoring application running on the user equipment. 6. The method of claim 5, wherein the anchoring application is preloaded onto the user equipment, or loaded onto the user equipment by a user of the user equipment. 7. The method of claim 6, further comprising the step of pre-registering the user equipment with a network node using the anchoring application, to inform the network node that the user equipment wishes to receive a list of network slice identities. 8. The method of claim 1, further comprising the step of performing an authentication procedure through the selected network slice. 9. The method of claim 1, further comprising the step of routing traffic through the selected network slice. 10. The method of claim 1, further comprising the step of attaching one or more other applications or services to the selected network slice. 11. The method of claim 10, wherein attaching one or more other applications or services to the network slice comprises associating a secondary network slice with the initially selected network slice. 12. The method of claim 1, wherein the list of network slice identities is received from a network node. 13. The method of claim 1, wherein each portion of the mobile communications network forming a network slice comprises all the required network resources which together form a logical network to serve a defined business purpose or customer. 14. A method in a network node for attaching a user equipment to a mobile communications network, the method comprising:
advertising a list of network slice identities, wherein each network slice identity identifies a portion of the mobile communications network that can serve as a logical network for a set of user equipment; receiving a network slice attachment request from a user equipment, requesting attachment of the user equipment to a selected network slice of the mobile communications network; and if attachment to the network slice is granted; informing the user equipment of an initial access point where the user equipment can make an initial attachment directly to the network. 15. The method of claim 14 wherein, prior to the step of receiving a network slice attachment request, the method comprises:
receiving a request from a user equipment to register with a mobile network operator, MNO, or virtual mobile network operator, MVNO; and
assigning a global unique user equipment identity, GUID, to the user equipment, and a default network slice identity of a network slice that the user equipment can use. 16. The method of claim 14 wherein prior to the step of advertising a list of network slice identities, the method comprises:
retrieving from a database a list of network slices available in the mobile communications network, and the corresponding network slice identities of the available network instances. 17. The method of claim 14, further comprising the steps of:
obtaining a temporary identity relating to the user equipment, and an authentication access point to be used by the user equipment for initial access to the mobile communications network; and sending the temporary identity and authentication access point to the user equipment. 18-19. (canceled) 20. A user equipment for attaching to a mobile communications network, the user equipment comprising:
a processor; and a memory, said memory containing instructions executable by said processor, wherein said user equipment is operative to: receive a list of network slice identities, wherein a network slice identity identifies a portion of the mobile communications network that serves as a logical network for a set of user equipment; select a network slice based on one or more criteria; and send a network slice attachment request to a network node, for requesting attachment of the user equipment to the selected network slice of the mobile communications network. 21. A network node for attaching a user equipment to a mobile communications network, the network node comprising:
a processor; and a memory, said memory containing instructions executable by said processor, wherein said network node is operative to: advertise a list of network slice identities, wherein each network slice identity identifies a portion of the mobile communications network that can serve as a logical network for a set of user equipment; receive a network slice attachment request from a user equipment, requesting attachment of the user equipment to a selected network slice of the mobile communications network; and if attachment to the network slice is granted; inform the user equipment of an initial access point where the user equipment can make an initial attachment directly to the network. | A method in a user equipment for attaching the user equipment to a mobile communications network comprises receiving a list of network slice identities, wherein a network slice identity identifies a portion of the mobile communications network that serves as a logical network to a set of user equipment (step 201). A network slice is selected based on one or more criteria (step 203). A network slice attachment request is sent to a network node (step 205), for requesting attachment of the user equipment to the selected network slice of the mobile communications network.1. A method in a user equipment for attaching the user equipment to a mobile communications network, the method comprising:
receiving a list of network slice identities, wherein a network slice identity identifies a portion of the mobile communications network that serves as a logical network for a set of user equipment; selecting a network slice based on one or more criteria; and sending a network slice attachment request to a network node, for requesting attachment of the user equipment to the selected network slice of the mobile communications network. 2. The method of claim 1, wherein the step of receiving further comprises receiving network slice capabilities tags associated with respective network slice identities, wherein a network slice capability tag relates to the functional capabilities of the associated portion of the mobile communications network. 3. The method of claim 1, wherein the step of selecting is based on one or more criteria including:
a user preference; a network slice type preferred by a mobile network operator, MNO, for a particular service or application to be used by the user equipment; a network slice type preferred by a mobile network operator, MNO, for one or more services or applications to which the user equipment is subscribed; a network slice type preferred by a mobile virtual network operator, MVNO, for a particular service or application to be used by the user equipment; a network slice type preferred by a mobile virtual network operator, MVNO, for one or more services or applications to which the user equipment is subscribed; or a degree of correlation between the capabilities of an application or service to be used by the user equipment and the capabilities of the network slice of the network. 4. The method of claim 3, wherein a network slice type relates to a service type, user equipment type, or a business criteria. 5. The method of claim 1, wherein step of selecting a network slice comprises selecting a network slice using an anchoring application running on the user equipment. 6. The method of claim 5, wherein the anchoring application is preloaded onto the user equipment, or loaded onto the user equipment by a user of the user equipment. 7. The method of claim 6, further comprising the step of pre-registering the user equipment with a network node using the anchoring application, to inform the network node that the user equipment wishes to receive a list of network slice identities. 8. The method of claim 1, further comprising the step of performing an authentication procedure through the selected network slice. 9. The method of claim 1, further comprising the step of routing traffic through the selected network slice. 10. The method of claim 1, further comprising the step of attaching one or more other applications or services to the selected network slice. 11. The method of claim 10, wherein attaching one or more other applications or services to the network slice comprises associating a secondary network slice with the initially selected network slice. 12. The method of claim 1, wherein the list of network slice identities is received from a network node. 13. The method of claim 1, wherein each portion of the mobile communications network forming a network slice comprises all the required network resources which together form a logical network to serve a defined business purpose or customer. 14. A method in a network node for attaching a user equipment to a mobile communications network, the method comprising:
advertising a list of network slice identities, wherein each network slice identity identifies a portion of the mobile communications network that can serve as a logical network for a set of user equipment; receiving a network slice attachment request from a user equipment, requesting attachment of the user equipment to a selected network slice of the mobile communications network; and if attachment to the network slice is granted; informing the user equipment of an initial access point where the user equipment can make an initial attachment directly to the network. 15. The method of claim 14 wherein, prior to the step of receiving a network slice attachment request, the method comprises:
receiving a request from a user equipment to register with a mobile network operator, MNO, or virtual mobile network operator, MVNO; and
assigning a global unique user equipment identity, GUID, to the user equipment, and a default network slice identity of a network slice that the user equipment can use. 16. The method of claim 14 wherein prior to the step of advertising a list of network slice identities, the method comprises:
retrieving from a database a list of network slices available in the mobile communications network, and the corresponding network slice identities of the available network instances. 17. The method of claim 14, further comprising the steps of:
obtaining a temporary identity relating to the user equipment, and an authentication access point to be used by the user equipment for initial access to the mobile communications network; and sending the temporary identity and authentication access point to the user equipment. 18-19. (canceled) 20. A user equipment for attaching to a mobile communications network, the user equipment comprising:
a processor; and a memory, said memory containing instructions executable by said processor, wherein said user equipment is operative to: receive a list of network slice identities, wherein a network slice identity identifies a portion of the mobile communications network that serves as a logical network for a set of user equipment; select a network slice based on one or more criteria; and send a network slice attachment request to a network node, for requesting attachment of the user equipment to the selected network slice of the mobile communications network. 21. A network node for attaching a user equipment to a mobile communications network, the network node comprising:
a processor; and a memory, said memory containing instructions executable by said processor, wherein said network node is operative to: advertise a list of network slice identities, wherein each network slice identity identifies a portion of the mobile communications network that can serve as a logical network for a set of user equipment; receive a network slice attachment request from a user equipment, requesting attachment of the user equipment to a selected network slice of the mobile communications network; and if attachment to the network slice is granted; inform the user equipment of an initial access point where the user equipment can make an initial attachment directly to the network. | 2,400 |
9,488 | 9,488 | 16,237,665 | 2,465 | A method and apparatus for improving the reliability of a digital communications system is provided. In accordance with at least one embodiment, power of a transmitted signal is controlled to improve reliability. In accordance with at least one embodiment, timing of a transmitted signal is controlled to improve reliability. In accordance with at least one embodiment, interference is detected. In accordance with at least one embodiment, interference is localized. In accordance with at least one embodiment, combinatorial processing is used to increase reliability. In accordance with at least one embodiment, gradual rekeying is performed. In accordance with at least one embodiment, confirmed stepwise progression rekeying is performed. In accordance with at least one embodiment, transmission detection is provided. In accordance with at least one embodiment, reporting of cryptographic mode utilization is provided. | 1. A method comprising:
truncating, in a radio, a data transmission before normal completion of the data transmission; listening, in the radio, for interference; and restarting, in the radio, transmission of the data transmission from a beginning of the data transmission. 2. The method of claim 1 further comprising:
localizing a source of the interference. 3. The method of claim 2 wherein the truncating, listening, and restarting are repeated with the truncating occurring progressively later in the data transmission. 4. The method of claim 1 wherein the truncating a data transmission before normal completion of the data transmission comprises:
immediately switching, in the radio, from a transmission mode to a reception mode. 5. The method of claim 1 wherein the restarting comprises:
in response to an interfering signal being detected during reception after the truncating, waiting, in the radio, until the interfering signal is not longer present; and
in response to the interfering signal no longer being detected during reception after the truncating, restarting, in the radio, the data transmission. 6. The method of claim 5 wherein the restarting, in the radio, transmission comprises:
restarting, in the radio, transmission of a frame synchronization (FS) data portion. 7. The method of claim 5 wherein the restarting, in the radio, transmission further comprises:
restarting, in the radio, transmission of a frame synchronization (FS) data portion and at least a portion of a network identifier (NID). 8. The method of claim 1 further comprising:
after the restarting, in the radio, transmission, again truncating the data transmission;
again listening, in the radio, for the interference; and
again restarting, in the radio, transmission of the data transmission from the beginning of the data transmission, transmitting a frame synchronization (FS) data portion, a network identifier (NID), and a payload data unit. 9. The method of claim 8 wherein the payload data unit is selected from a group consisting of a packet data unit (PDU), a first logical link data unit (LDU1), a second logical link data unit (LDU2), and a terminator data unit (TDU). 10. An apparatus comprising:
a radio transmitter; and a radio receiver, the apparatus configured to truncate a data transmission by the radio transmitter before normal completion of the data transmission, the apparatus configured to cause the radio receiver to listen for interference, and the apparatus configured to restart transmission of the data transmission by the radio transmitter from a beginning of the data transmission. 11. The apparatus of claim 10 further configured to localize a source of the interference. 12. The apparatus of claim 11 wherein the truncating, listening, and restarting are repeated with the truncating occurring progressively later in the data transmission. 13. The apparatus of claim 10 wherein the truncating a data transmission by the radio transmitter before normal completion of the data transmission is performed by the apparatus immediately switching from a transmission mode of the radio transmitter to a reception mode of the radio receiver. 14. The apparatus of claim 10 wherein the apparatus is configured to restart transmission of the data transmission by the radio transmitter from a beginning of the data transmission by, in response to an interfering signal being detected during reception after the truncating, waiting until the interfering signal is not longer present, and, in response to the interfering signal no longer being detected during reception after the truncating, restarting the data transmission. 15. The apparatus of claim 14 wherein the apparatus is configured to perform restarting the data transmission by restarting transmission of a frame synchronization (FS) data portion. 16. The apparatus of claim 14 wherein the apparatus is configured to perform restarting the data transmission by restarting transmission of a frame synchronization (FS) data portion and at least a portion of a network identifier (ND). 17. The apparatus of claim 10 wherein the apparatus is configured to, after the restarting transmission, to again truncate the data transmission, to again listen for the interference, and to again restart transmission of the data transmission from the beginning of the data transmission, transmitting a frame synchronization (FS) data portion, a network identifier (ND), and a payload data unit. 18. The apparatus of claim 17 wherein the payload data unit is selected from a group consisting of a packet data unit (PDU), a first logical link data unit (LDU1), a second logical link data unit (LDU2), and a terminator data unit (TDU). 19. A method comprising:
truncating, in a radio, a data transmission before normal completion of the data transmission; listening, in the radio, for interference; restarting, in the radio, transmission of the data transmission from a beginning of the data transmission; and iteratively continuing to truncate, listen, and restart progressively, with truncation occurring at different data portions of the data transmission. 20. The method of claim 19 wherein, for a first iteration, truncation occurs upon transmission of a portion of a frame synchronization (FS) data portion, wherein, for a second iteration, truncation occurs upon transmission of the FS data portion and a portion of a network identifier (ND) data portion, and wherein, for a third iteration, truncation occurs upon transmission of the FS data portion, the ND data portion, and a portion of a payload data unit. | A method and apparatus for improving the reliability of a digital communications system is provided. In accordance with at least one embodiment, power of a transmitted signal is controlled to improve reliability. In accordance with at least one embodiment, timing of a transmitted signal is controlled to improve reliability. In accordance with at least one embodiment, interference is detected. In accordance with at least one embodiment, interference is localized. In accordance with at least one embodiment, combinatorial processing is used to increase reliability. In accordance with at least one embodiment, gradual rekeying is performed. In accordance with at least one embodiment, confirmed stepwise progression rekeying is performed. In accordance with at least one embodiment, transmission detection is provided. In accordance with at least one embodiment, reporting of cryptographic mode utilization is provided.1. A method comprising:
truncating, in a radio, a data transmission before normal completion of the data transmission; listening, in the radio, for interference; and restarting, in the radio, transmission of the data transmission from a beginning of the data transmission. 2. The method of claim 1 further comprising:
localizing a source of the interference. 3. The method of claim 2 wherein the truncating, listening, and restarting are repeated with the truncating occurring progressively later in the data transmission. 4. The method of claim 1 wherein the truncating a data transmission before normal completion of the data transmission comprises:
immediately switching, in the radio, from a transmission mode to a reception mode. 5. The method of claim 1 wherein the restarting comprises:
in response to an interfering signal being detected during reception after the truncating, waiting, in the radio, until the interfering signal is not longer present; and
in response to the interfering signal no longer being detected during reception after the truncating, restarting, in the radio, the data transmission. 6. The method of claim 5 wherein the restarting, in the radio, transmission comprises:
restarting, in the radio, transmission of a frame synchronization (FS) data portion. 7. The method of claim 5 wherein the restarting, in the radio, transmission further comprises:
restarting, in the radio, transmission of a frame synchronization (FS) data portion and at least a portion of a network identifier (NID). 8. The method of claim 1 further comprising:
after the restarting, in the radio, transmission, again truncating the data transmission;
again listening, in the radio, for the interference; and
again restarting, in the radio, transmission of the data transmission from the beginning of the data transmission, transmitting a frame synchronization (FS) data portion, a network identifier (NID), and a payload data unit. 9. The method of claim 8 wherein the payload data unit is selected from a group consisting of a packet data unit (PDU), a first logical link data unit (LDU1), a second logical link data unit (LDU2), and a terminator data unit (TDU). 10. An apparatus comprising:
a radio transmitter; and a radio receiver, the apparatus configured to truncate a data transmission by the radio transmitter before normal completion of the data transmission, the apparatus configured to cause the radio receiver to listen for interference, and the apparatus configured to restart transmission of the data transmission by the radio transmitter from a beginning of the data transmission. 11. The apparatus of claim 10 further configured to localize a source of the interference. 12. The apparatus of claim 11 wherein the truncating, listening, and restarting are repeated with the truncating occurring progressively later in the data transmission. 13. The apparatus of claim 10 wherein the truncating a data transmission by the radio transmitter before normal completion of the data transmission is performed by the apparatus immediately switching from a transmission mode of the radio transmitter to a reception mode of the radio receiver. 14. The apparatus of claim 10 wherein the apparatus is configured to restart transmission of the data transmission by the radio transmitter from a beginning of the data transmission by, in response to an interfering signal being detected during reception after the truncating, waiting until the interfering signal is not longer present, and, in response to the interfering signal no longer being detected during reception after the truncating, restarting the data transmission. 15. The apparatus of claim 14 wherein the apparatus is configured to perform restarting the data transmission by restarting transmission of a frame synchronization (FS) data portion. 16. The apparatus of claim 14 wherein the apparatus is configured to perform restarting the data transmission by restarting transmission of a frame synchronization (FS) data portion and at least a portion of a network identifier (ND). 17. The apparatus of claim 10 wherein the apparatus is configured to, after the restarting transmission, to again truncate the data transmission, to again listen for the interference, and to again restart transmission of the data transmission from the beginning of the data transmission, transmitting a frame synchronization (FS) data portion, a network identifier (ND), and a payload data unit. 18. The apparatus of claim 17 wherein the payload data unit is selected from a group consisting of a packet data unit (PDU), a first logical link data unit (LDU1), a second logical link data unit (LDU2), and a terminator data unit (TDU). 19. A method comprising:
truncating, in a radio, a data transmission before normal completion of the data transmission; listening, in the radio, for interference; restarting, in the radio, transmission of the data transmission from a beginning of the data transmission; and iteratively continuing to truncate, listen, and restart progressively, with truncation occurring at different data portions of the data transmission. 20. The method of claim 19 wherein, for a first iteration, truncation occurs upon transmission of a portion of a frame synchronization (FS) data portion, wherein, for a second iteration, truncation occurs upon transmission of the FS data portion and a portion of a network identifier (ND) data portion, and wherein, for a third iteration, truncation occurs upon transmission of the FS data portion, the ND data portion, and a portion of a payload data unit. | 2,400 |
9,489 | 9,489 | 16,003,077 | 2,413 | Some embodiments provide a method for a forwarding element that receives a packet. The method determines whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets. When the packet does not match any flow entries in the first cache, the method determines whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets. The method executes a set of actions specified by a flow entry matched by the packet in one of the first and second caches. | 1. For a forwarding element, a method comprising:
receiving a packet at the forwarding element; determining whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets; when the packet does not match any flow entries in the first cache, determining whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets; and executing a set of actions specified by a flow entry matched by the packet in one of the first and second caches. 2. The method of claim 1, wherein:
the first cache comprises a decision tree and the second cache comprises a plurality of tables, each table based on a different set of packet header fields; determining whether the packet matches any flow entries in the first cache comprises searching the decision tree; determining whether the packet matches any flow entries in the second cache comprises performing a tuple space search over the plurality of tables. 3. The method of claim 2 further comprising:
identifying a new flow entry to add to the first and second caches;
adding the new flow entry to the second cache; and
storing the new flow entry for addition to the first cache with any other new flow entries upon rebuilding of the decision tree. 4. The method of claim 3, wherein the new flow entry matches on a particular set of packet header fields, wherein adding the new flow entry to the second cache comprises adding the new flow entry to a particular table based on the particular set of packet header fields. 5. The method of claim 4 further comprising:
after adding the new flow entry to the second cache but prior to rebuilding the decision tree, receiving a second packet;
determining whether the second packet matches any flow entries in the decision tree cache;
when the second packet matches a flow entry in the decision tree cache, searching at least the particular table to determine whether the packet matches any flow entries in the particular table with a higher priority than the flow entry matched in the decision tree cache. 6. The method of claim 3 further comprising rebuilding the decision tree to include the new flow entry and any additional flow entries added to the second cache after a previous instance of rebuilding the decision tree. 7. The method of claim 3, wherein the decision tree is rebuilt after a fixed period of time. 8. The method of claim 3, wherein the decision tree is rebuilt after a miss rate for the first cache exceeds a threshold. 9. The method of claim 2, wherein each of the flow entries comprises a set of match conditions and a set of actions to execute if the set of match conditions are met, the method further comprising:
identifying a flow entry in the first and second caches for which the set of actions is to be modified; and modifying the set of actions specified by the flow entry in both of the first and second caches. 10. The method of claim 2 further comprising:
identifying a particular flow entry to remove from the first and second caches, wherein the particular flow entry is stored in a particular table of the plurality of tables;
removing the particular flow entry from the particular table; and
marking as invalid a leaf node of the decision tree that corresponds to the particular flow entry. 11. The method of claim 1, wherein when the packet does not match any flow entries in the first or second caches, the forwarding element processes the packet according to a plurality of flow entries organized in a set of flow tables having a plurality of stages. 12. The method of claim 11, wherein the plurality of flow entries organized in the set of flow tables are OpenFlow entries. 13. The method of claim 11 further comprising generating a new flow entry for the first and second caches based on the processing of the packet according to the plurality of flow entries. 14. The method of claim 1, wherein the first and second caches are aggregate caches, wherein each of a plurality of flow entries in the first and second caches specifies a set of actions to execute on packets for an aggregate group of data flows that have a set of packet header field values in common. 15. The method of claim 14 further comprising, prior to determining whether the packet matches any flow entries in the first cache, determining whether the packet matches any flow entries in an exact-match cache, wherein each flow entry in the exact match cache specifies a set of actions to execute on packets for a single data flow. 16. The method of claim 1, wherein the forwarding element is a software forwarding element that executes in virtualization software of a host machine. 17. A non-transitory machine readable medium storing a forwarding element for execution by at least one processing unit, the forwarding element comprising sets of instructions for:
receiving a packet; determining whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets; when the packet does not match any flow entries in the first cache, determining whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets; and executing a set of actions specified by a flow entry matched by the packet in one of the first and second caches. 18. The non-transitory machine readable medium of claim 17, wherein:
the first cache comprises a decision tree and the second cache comprises a plurality of tables, each table based on a different set of packet header fields; the set of instructions for determining whether the packet matches any flow entries in the first cache comprises a set of instructions for searching the decision tree; the set of instructions for determining whether the packet matches any flow entries in the second cache comprises a set of instructions for performing a tuple space search over the plurality of tables. 19. The non-transitory machine readable medium of claim 18, wherein the forwarding element further comprises sets of instructions for:
identifying a new flow entry to add to the first and second caches; adding the new flow entry to the second cache; and storing the new flow entry for addition to the first cache with any other new flow entries upon rebuilding of the decision tree. 20. The non-transitory machine readable medium of claim 19, wherein the forwarding element further comprises a set of instructions for rebuilding the decision tree to include the new flow entry and any additional flow entries added to the second cache after a previous instance of rebuilding the decision tree. 21. The non-transitory machine readable medium of claim 18, wherein each of the flow entries comprises a set of match conditions and a set of actions to execute if the set of match conditions are met, the forwarding element further comprising sets of instructions for:
identifying a flow entry in the first and second caches for which the set of actions is to be modified; and modifying the set of actions specified by the flow entry in both of the first and second caches. 22. The non-transitory machine readable medium of claim 18, wherein the forwarding element further comprises sets of instructions for:
identifying a particular flow entry to remove from the first and second caches, wherein the particular flow entry is stored in a particular table of the plurality of tables; removing the particular flow entry from the particular table; and marking as invalid a leaf node of the decision tree that corresponds to the particular flow entry. 23. The non-transitory machine readable medium of claim 17, wherein the forwarding element further comprises sets of instructions for:
when the packet does not match any flow entries in the first or second caches, processing the packet according to a plurality of flow entries organized in a set of flow tables having a plurality of stages; and generating a new flow entry for the first and second caches based on the processing of the packet according to the plurality of flow entries. | Some embodiments provide a method for a forwarding element that receives a packet. The method determines whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets. When the packet does not match any flow entries in the first cache, the method determines whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets. The method executes a set of actions specified by a flow entry matched by the packet in one of the first and second caches.1. For a forwarding element, a method comprising:
receiving a packet at the forwarding element; determining whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets; when the packet does not match any flow entries in the first cache, determining whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets; and executing a set of actions specified by a flow entry matched by the packet in one of the first and second caches. 2. The method of claim 1, wherein:
the first cache comprises a decision tree and the second cache comprises a plurality of tables, each table based on a different set of packet header fields; determining whether the packet matches any flow entries in the first cache comprises searching the decision tree; determining whether the packet matches any flow entries in the second cache comprises performing a tuple space search over the plurality of tables. 3. The method of claim 2 further comprising:
identifying a new flow entry to add to the first and second caches;
adding the new flow entry to the second cache; and
storing the new flow entry for addition to the first cache with any other new flow entries upon rebuilding of the decision tree. 4. The method of claim 3, wherein the new flow entry matches on a particular set of packet header fields, wherein adding the new flow entry to the second cache comprises adding the new flow entry to a particular table based on the particular set of packet header fields. 5. The method of claim 4 further comprising:
after adding the new flow entry to the second cache but prior to rebuilding the decision tree, receiving a second packet;
determining whether the second packet matches any flow entries in the decision tree cache;
when the second packet matches a flow entry in the decision tree cache, searching at least the particular table to determine whether the packet matches any flow entries in the particular table with a higher priority than the flow entry matched in the decision tree cache. 6. The method of claim 3 further comprising rebuilding the decision tree to include the new flow entry and any additional flow entries added to the second cache after a previous instance of rebuilding the decision tree. 7. The method of claim 3, wherein the decision tree is rebuilt after a fixed period of time. 8. The method of claim 3, wherein the decision tree is rebuilt after a miss rate for the first cache exceeds a threshold. 9. The method of claim 2, wherein each of the flow entries comprises a set of match conditions and a set of actions to execute if the set of match conditions are met, the method further comprising:
identifying a flow entry in the first and second caches for which the set of actions is to be modified; and modifying the set of actions specified by the flow entry in both of the first and second caches. 10. The method of claim 2 further comprising:
identifying a particular flow entry to remove from the first and second caches, wherein the particular flow entry is stored in a particular table of the plurality of tables;
removing the particular flow entry from the particular table; and
marking as invalid a leaf node of the decision tree that corresponds to the particular flow entry. 11. The method of claim 1, wherein when the packet does not match any flow entries in the first or second caches, the forwarding element processes the packet according to a plurality of flow entries organized in a set of flow tables having a plurality of stages. 12. The method of claim 11, wherein the plurality of flow entries organized in the set of flow tables are OpenFlow entries. 13. The method of claim 11 further comprising generating a new flow entry for the first and second caches based on the processing of the packet according to the plurality of flow entries. 14. The method of claim 1, wherein the first and second caches are aggregate caches, wherein each of a plurality of flow entries in the first and second caches specifies a set of actions to execute on packets for an aggregate group of data flows that have a set of packet header field values in common. 15. The method of claim 14 further comprising, prior to determining whether the packet matches any flow entries in the first cache, determining whether the packet matches any flow entries in an exact-match cache, wherein each flow entry in the exact match cache specifies a set of actions to execute on packets for a single data flow. 16. The method of claim 1, wherein the forwarding element is a software forwarding element that executes in virtualization software of a host machine. 17. A non-transitory machine readable medium storing a forwarding element for execution by at least one processing unit, the forwarding element comprising sets of instructions for:
receiving a packet; determining whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets; when the packet does not match any flow entries in the first cache, determining whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets; and executing a set of actions specified by a flow entry matched by the packet in one of the first and second caches. 18. The non-transitory machine readable medium of claim 17, wherein:
the first cache comprises a decision tree and the second cache comprises a plurality of tables, each table based on a different set of packet header fields; the set of instructions for determining whether the packet matches any flow entries in the first cache comprises a set of instructions for searching the decision tree; the set of instructions for determining whether the packet matches any flow entries in the second cache comprises a set of instructions for performing a tuple space search over the plurality of tables. 19. The non-transitory machine readable medium of claim 18, wherein the forwarding element further comprises sets of instructions for:
identifying a new flow entry to add to the first and second caches; adding the new flow entry to the second cache; and storing the new flow entry for addition to the first cache with any other new flow entries upon rebuilding of the decision tree. 20. The non-transitory machine readable medium of claim 19, wherein the forwarding element further comprises a set of instructions for rebuilding the decision tree to include the new flow entry and any additional flow entries added to the second cache after a previous instance of rebuilding the decision tree. 21. The non-transitory machine readable medium of claim 18, wherein each of the flow entries comprises a set of match conditions and a set of actions to execute if the set of match conditions are met, the forwarding element further comprising sets of instructions for:
identifying a flow entry in the first and second caches for which the set of actions is to be modified; and modifying the set of actions specified by the flow entry in both of the first and second caches. 22. The non-transitory machine readable medium of claim 18, wherein the forwarding element further comprises sets of instructions for:
identifying a particular flow entry to remove from the first and second caches, wherein the particular flow entry is stored in a particular table of the plurality of tables; removing the particular flow entry from the particular table; and marking as invalid a leaf node of the decision tree that corresponds to the particular flow entry. 23. The non-transitory machine readable medium of claim 17, wherein the forwarding element further comprises sets of instructions for:
when the packet does not match any flow entries in the first or second caches, processing the packet according to a plurality of flow entries organized in a set of flow tables having a plurality of stages; and generating a new flow entry for the first and second caches based on the processing of the packet according to the plurality of flow entries. | 2,400 |
9,490 | 9,490 | 15,693,067 | 2,449 | In some examples, push control may include generation of a learning-based decision model based on analysis of data associated with historical usage of an application. For a request for content associated with usage of the application, the learning-based decision model may be analyzed to determine a next request for additional content expected to occur after the request for content. Further, a push operation may be performed to push the additional content associated with the next request to a source of the request for content. | 1. An apparatus comprising:
a processor; and a non-transitory computer readable medium storing machine readable instructions that when executed by the processor cause the processor to:
generate, based on analysis of data associated with historical usage of an application, a learning-based decision model;
ascertain a request for content associated with usage of the application;
determine, based on analysis of the learning-based decision model, a next request for additional content expected to occur after the request for content; and
perform a push operation to push the additional content associated with the next request to a source of the request for content. 2. The apparatus according to claim 1, wherein the push operation includes a Hypertext Transfer Protocol version 2 (HTTP/2) Push. 3. The apparatus according to claim 1, wherein the data associated with the historical usage of the application includes at least one of:
a user identification (ID) of a user associated with usage of the application; a location of the user associated with usage of the application; or a language of the application. 4. The apparatus according to claim 1, wherein the learning-based decision model accounts for a hit rate of a plurality of next requests, including the next request, and wherein the hit rate represents a number of times each of the plurality of next requests occurs after the request for content. 5. The apparatus according to claim 1, wherein the instructions to determine the next request comprise instructions to:
determine, based on analysis of a conversion rate between different steps representing requests in the learning-based decision model, the next request for additional content expected to occur after the request for content, wherein the conversion rate accounts for a number of times a step occurs relative to a previous step. 6. The apparatus according to claim 1, wherein the learning-based decision model includes a plurality of steps that represent requests, and wherein the request for content represents an initial step of the plurality of steps in the learning-based decision model, and the next request represents a step subsequent to the initial step. 7. The apparatus according to claim 1, wherein the instructions are further to cause the processor to:
determine, based on the analysis of the learning-based decision model, a time of usage of the additional content, wherein the time of usage represents a time when a user expects to use the additional content after usage of the content from the request for content, and wherein the instructions to perform the push operation comprise instructions to perform, based on the determined time of usage of the additional content, the push operation to push the additional content associated with the next request to the source of the request for content. 8. The apparatus according to claim 1, wherein the instructions are further to cause the processor to:
determine, based on the analysis of the learning-based decision model, a further request for further content expected to occur after the next request; pack a stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request, and wherein the instructions to perform the push operation comprise instructions to perform the push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source of the request for content. 9. The apparatus according to claim 8, wherein the instructions are further to cause the processor to:
pack, based on sizes of the additional content and the further content, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 10. The apparatus according to claim 8, wherein the instructions are further to cause the processor to:
determine whether an available time associated with the stream to be pushed to the source of the request for content is greater than a time associated with the additional content associated with the next request and the further content associated with the further request, wherein the available time represents a total time allocated to the stream to push content to the source; and in response to a determination that the available time associated with the stream to be pushed to the source of the request for content is greater than the time associated with the additional content associated with the next request and the further content associated with the further request, pack the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 11. The apparatus according to claim 8, wherein the instructions are further to cause the processor to:
determine a bandwidth and available time associated with the stream to be pushed to the source of the request for content; generate a rectangular area based on the determined bandwidth and available time; and pack, based on arrangement of the additional content and the further content in the rectangular area, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 12. The apparatus according to claim 11, wherein the instructions are further to cause the processor to:
pack, based on the arrangement of the additional content and the further content that minimizes empty spaces in the rectangular area and eliminates overlap of content in the rectangular area, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 13. A computer implemented method comprising:
ascertaining a request for content associated with usage of an application; determining, based on analysis of a learning-based decision model that is generated based on analysis of data associated with historical usage of the application,
a next request for additional content expected to occur after the request for content, and
a further request for further content expected to occur after the next request;
packing a stream to be pushed to a source of the request for content with the additional content associated with the next request and the further content associated with the further request; and performing a push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source. 14. The method according to claim 13, wherein the push operation includes a Hypertext Transfer Protocol version 2 (HTTP/2) Push. 15. The method according to claim 13, wherein determining the next and the further requests comprises:
determining, based on analysis of a conversion rate between different steps representing requests in the learning-based decision model,
the next request for additional content expected to occur after the request for content, and
the further request for further content expected to occur after the next request, wherein the conversion rate accounts for a number of times a step occurs relative to a previous step. 16. The method according to claim 13, further comprising:
determining, based on the analysis of the learning-based decision model, a time of usage of the additional content and the further content, wherein the time of usage represents a time when a user expects to use the additional content and the further content after usage of the content from the request for content; and wherein performing the push operation comprises performing, based on the determined time of usage of the additional content and the further content, the push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source. 17. A non-transitory computer readable medium having stored thereon machine readable instructions, the machine readable instructions, when executed, cause a processor to:
ascertain a request for content associated with usage of an application; determine, based on analysis of a learning-based decision model that is generated based on analysis of data associated with historical usage of the application, a next request for additional content expected to occur after the request for content; and perform a push operation to push the additional content associated with the next request to a source of the request for content. 18. The non-transitory computer readable medium according to claim 17, wherein the machine readable instructions, when executed, further cause the processor to:
determine, based on the analysis of the learning-based decision model, a further request for further content expected to occur after the next request; pack a stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request; and wherein the instructions to perform the push operation comprise instructions to perform the push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source of the request for content. 19. The non-transitory computer readable medium according to claim 18, wherein the machine readable instructions, when executed, further cause the processor to:
pack, based on sizes of the additional content and the further content, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 20. The non-transitory computer readable medium according to claim 18, wherein the machine readable instructions, when executed, further cause the processor to:
determine whether an available time associated with the stream to be pushed to the source of the request for content is greater than a time associated with the additional content associated with the next request and the further content associated with the further request, wherein the available time represents a total time allocated to the stream to push content to the source; and in response to a determination that the available time associated with the stream to be pushed to the source of the request for content is greater than the time associated with the additional content associated with the next request and the further content associated with the further request, pack the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. | In some examples, push control may include generation of a learning-based decision model based on analysis of data associated with historical usage of an application. For a request for content associated with usage of the application, the learning-based decision model may be analyzed to determine a next request for additional content expected to occur after the request for content. Further, a push operation may be performed to push the additional content associated with the next request to a source of the request for content.1. An apparatus comprising:
a processor; and a non-transitory computer readable medium storing machine readable instructions that when executed by the processor cause the processor to:
generate, based on analysis of data associated with historical usage of an application, a learning-based decision model;
ascertain a request for content associated with usage of the application;
determine, based on analysis of the learning-based decision model, a next request for additional content expected to occur after the request for content; and
perform a push operation to push the additional content associated with the next request to a source of the request for content. 2. The apparatus according to claim 1, wherein the push operation includes a Hypertext Transfer Protocol version 2 (HTTP/2) Push. 3. The apparatus according to claim 1, wherein the data associated with the historical usage of the application includes at least one of:
a user identification (ID) of a user associated with usage of the application; a location of the user associated with usage of the application; or a language of the application. 4. The apparatus according to claim 1, wherein the learning-based decision model accounts for a hit rate of a plurality of next requests, including the next request, and wherein the hit rate represents a number of times each of the plurality of next requests occurs after the request for content. 5. The apparatus according to claim 1, wherein the instructions to determine the next request comprise instructions to:
determine, based on analysis of a conversion rate between different steps representing requests in the learning-based decision model, the next request for additional content expected to occur after the request for content, wherein the conversion rate accounts for a number of times a step occurs relative to a previous step. 6. The apparatus according to claim 1, wherein the learning-based decision model includes a plurality of steps that represent requests, and wherein the request for content represents an initial step of the plurality of steps in the learning-based decision model, and the next request represents a step subsequent to the initial step. 7. The apparatus according to claim 1, wherein the instructions are further to cause the processor to:
determine, based on the analysis of the learning-based decision model, a time of usage of the additional content, wherein the time of usage represents a time when a user expects to use the additional content after usage of the content from the request for content, and wherein the instructions to perform the push operation comprise instructions to perform, based on the determined time of usage of the additional content, the push operation to push the additional content associated with the next request to the source of the request for content. 8. The apparatus according to claim 1, wherein the instructions are further to cause the processor to:
determine, based on the analysis of the learning-based decision model, a further request for further content expected to occur after the next request; pack a stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request, and wherein the instructions to perform the push operation comprise instructions to perform the push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source of the request for content. 9. The apparatus according to claim 8, wherein the instructions are further to cause the processor to:
pack, based on sizes of the additional content and the further content, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 10. The apparatus according to claim 8, wherein the instructions are further to cause the processor to:
determine whether an available time associated with the stream to be pushed to the source of the request for content is greater than a time associated with the additional content associated with the next request and the further content associated with the further request, wherein the available time represents a total time allocated to the stream to push content to the source; and in response to a determination that the available time associated with the stream to be pushed to the source of the request for content is greater than the time associated with the additional content associated with the next request and the further content associated with the further request, pack the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 11. The apparatus according to claim 8, wherein the instructions are further to cause the processor to:
determine a bandwidth and available time associated with the stream to be pushed to the source of the request for content; generate a rectangular area based on the determined bandwidth and available time; and pack, based on arrangement of the additional content and the further content in the rectangular area, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 12. The apparatus according to claim 11, wherein the instructions are further to cause the processor to:
pack, based on the arrangement of the additional content and the further content that minimizes empty spaces in the rectangular area and eliminates overlap of content in the rectangular area, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 13. A computer implemented method comprising:
ascertaining a request for content associated with usage of an application; determining, based on analysis of a learning-based decision model that is generated based on analysis of data associated with historical usage of the application,
a next request for additional content expected to occur after the request for content, and
a further request for further content expected to occur after the next request;
packing a stream to be pushed to a source of the request for content with the additional content associated with the next request and the further content associated with the further request; and performing a push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source. 14. The method according to claim 13, wherein the push operation includes a Hypertext Transfer Protocol version 2 (HTTP/2) Push. 15. The method according to claim 13, wherein determining the next and the further requests comprises:
determining, based on analysis of a conversion rate between different steps representing requests in the learning-based decision model,
the next request for additional content expected to occur after the request for content, and
the further request for further content expected to occur after the next request, wherein the conversion rate accounts for a number of times a step occurs relative to a previous step. 16. The method according to claim 13, further comprising:
determining, based on the analysis of the learning-based decision model, a time of usage of the additional content and the further content, wherein the time of usage represents a time when a user expects to use the additional content and the further content after usage of the content from the request for content; and wherein performing the push operation comprises performing, based on the determined time of usage of the additional content and the further content, the push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source. 17. A non-transitory computer readable medium having stored thereon machine readable instructions, the machine readable instructions, when executed, cause a processor to:
ascertain a request for content associated with usage of an application; determine, based on analysis of a learning-based decision model that is generated based on analysis of data associated with historical usage of the application, a next request for additional content expected to occur after the request for content; and perform a push operation to push the additional content associated with the next request to a source of the request for content. 18. The non-transitory computer readable medium according to claim 17, wherein the machine readable instructions, when executed, further cause the processor to:
determine, based on the analysis of the learning-based decision model, a further request for further content expected to occur after the next request; pack a stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request; and wherein the instructions to perform the push operation comprise instructions to perform the push operation to push the packed stream including the additional content associated with the next request and the further content associated with the further request to the source of the request for content. 19. The non-transitory computer readable medium according to claim 18, wherein the machine readable instructions, when executed, further cause the processor to:
pack, based on sizes of the additional content and the further content, the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. 20. The non-transitory computer readable medium according to claim 18, wherein the machine readable instructions, when executed, further cause the processor to:
determine whether an available time associated with the stream to be pushed to the source of the request for content is greater than a time associated with the additional content associated with the next request and the further content associated with the further request, wherein the available time represents a total time allocated to the stream to push content to the source; and in response to a determination that the available time associated with the stream to be pushed to the source of the request for content is greater than the time associated with the additional content associated with the next request and the further content associated with the further request, pack the stream to be pushed to the source of the request for content with the additional content associated with the next request and the further content associated with the further request. | 2,400 |
9,491 | 9,491 | 16,177,858 | 2,461 | Certain aspects of the present disclosure relate to methods and apparatus for resource allocation for physical uplink control channel (PUCCH) used to carry uplink control information (UCI). Certain aspects provide a method for wireless communication by a user equipment. The method generally includes receiving downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to the user equipment a subset of resources available for transmitting UCI in a PUCCH transmission, wherein the DCI is received on one or more resources of a first physical downlink control channel (PDCCH) transmission. The method further includes identifying resources within the subset indicated by the RI bits to transmit the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission. The method further includes transmitting the UCI using the identified resources. | 1. A method for wireless communications by a user equipment, comprising:
receiving downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to the user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is received on one or more resources of a first physical downlink control channel (PDCCH) transmission; identifying resources within the subset indicated by the RI bits to transmit the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and transmitting the UCI using the identified resources. 2. The method of claim 1, further comprising:
receiving multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 3. The method of claim 2, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 4. The method of claim 2, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 5. The method of claim 2, wherein the UCI acknowledging the multiple PDCCH transmissions is sent in a same uplink (UL) slot. 6. The method of claim 1, wherein at least two of the plurality of subsets have different sizes. 7. The method of claim 1, wherein each of the plurality of subsets has the same size. 8. The method of claim 1, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 9. The method of claim 1, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 10. A method for wireless communications by a user equipment, comprising:
receiving, from a base station, an uplink grant comprising one or more downlink assignment index (DAI) bits; determining a number of bits to use to transmit an acknowledgement (ACK) based on the DAI bits; and transmitting, to the base station, the ACK using the determined number of bits. 11. The method of claim 10, wherein transmitting the ACK comprises transmitting the ACK on a physical uplink shared channel (PUSCH). 12. The method of claim 11, wherein when the determined number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the determined number of bits is greater than 2 the ACK is rate matched around the PUSCH. 13. The method of claim 10, wherein the user equipment and base station are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. 14. A method for wireless communications by a network entity, comprising:
transmitting downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to a user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is transmitted on one or more resources of a first physical downlink control channel (PDCCH) transmission; identifying resources within the subset indicated by the RI bits to monitor for the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and monitoring the identified resources for the UCI. 15. The method of claim 14, further comprising:
transmitting multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 16. The method of claim 15, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 17. The method of claim 15, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 18. The method of claim 15, wherein the UCI acknowledging the multiple PDCCH transmissions is communicated in a same uplink (UL) slot. 19. The method of claim 14, wherein at least two of the plurality of subsets have different sizes. 20. The method of claim 14, wherein each of the plurality of subsets has the same size. 21. The method of claim 14, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 22. The method of claim 14, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 23. A method for wireless communications by a network entity, comprising:
transmitting, to a user equipment, an uplink grant comprising one or more downlink assignment index (DAI) bits indicating a number of bits for the user equipment to use to transmit an acknowledgement (ACK) based on the DAI bits; and receiving, from the user equipment, the ACK using the number of bits. 24. The method of claim 23, wherein receiving the ACK comprises receiving the ACK on a physical uplink shared channel (PUSCH). 25. The method of claim 24, wherein when the number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the number of bits is greater than 2 the ACK is rate matched around the PUSCH. 26. The method of claim 23, wherein the user equipment and network entity are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. 27. A user equipment comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
receive downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to the user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is received on one or more resources of a first physical downlink control channel (PDCCH) transmission;
identify resources within the subset indicated by the RI bits to transmit the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and
transmit the UCI using the identified resources. 28. The user equipment of claim 27, wherein the processor is further configured to:
receive multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 29. The user equipment of claim 28, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 30. The user equipment of claim 28, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 31. The user equipment of claim 28, wherein the UCI acknowledging the multiple PDCCH transmissions is sent in a same uplink (UL) slot. 32. The user equipment of claim 27, wherein at least two of the plurality of subsets have different sizes. 33. The user equipment of claim 27, wherein each of the plurality of subsets has the same size. 34. The user equipment of claim 27, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 35. The user equipment of claim 27, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 36. A user equipment comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
receive, from a base station, an uplink grant comprising one or more downlink assignment index (DAI) bits;
determine a number of bits to use to transmit an acknowledgement (ACK) based on the DAI bits; and
transmit, to the base station, the ACK using the determined number of bits. 37. The user equipment of claim 36, wherein to transmit the ACK comprises to transmit the ACK on a physical uplink shared channel (PUSCH). 38. The user equipment of claim 37, wherein when the determined number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the determined number of bits is greater than 2 the ACK is rate matched around the PUSCH. 39. The user equipment of claim 36, wherein the user equipment and base station are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. 40. A network entity comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
transmit downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to a user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is transmitted on one or more resources of a first physical downlink control channel (PDCCH) transmission;
identify resources within the subset indicated by the RI bits to monitor for the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and
monitor the identified resources for the UCI. 41. The network entity of claim 40, wherein the processor is further configured to:
transmit multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 42. The network entity of claim 41, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 43. The network entity of claim 41, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 44. The network entity of claim 41, wherein the UCI acknowledging the multiple PDCCH transmissions is communicated in a same uplink (UL) slot. 45. The network entity of claim 40, wherein at least two of the plurality of subsets have different sizes. 46. The network entity of claim 40, wherein each of the plurality of subsets has the same size. 47. The network entity of claim 40, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 48. The network entity of claim 40, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 49. A network entity comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
transmit, to a user equipment, an uplink grant comprising one or more downlink assignment index (DAI) bits indicating a number of bits for the user equipment to use to transmit an acknowledgement (ACK) based on the DAI bits;
and
receive, from the user equipment, the ACK using the number of bits. 50. The network entity of claim 49, wherein to receive the ACK comprises to receive the ACK on a physical uplink shared channel (PUSCH). 51. The network entity of claim 50, wherein when the number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the number of bits is greater than 2 the ACK is rate matched around the PUSCH. 52. The network entity of claim 49, wherein the user equipment and network entity are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. | Certain aspects of the present disclosure relate to methods and apparatus for resource allocation for physical uplink control channel (PUCCH) used to carry uplink control information (UCI). Certain aspects provide a method for wireless communication by a user equipment. The method generally includes receiving downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to the user equipment a subset of resources available for transmitting UCI in a PUCCH transmission, wherein the DCI is received on one or more resources of a first physical downlink control channel (PDCCH) transmission. The method further includes identifying resources within the subset indicated by the RI bits to transmit the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission. The method further includes transmitting the UCI using the identified resources.1. A method for wireless communications by a user equipment, comprising:
receiving downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to the user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is received on one or more resources of a first physical downlink control channel (PDCCH) transmission; identifying resources within the subset indicated by the RI bits to transmit the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and transmitting the UCI using the identified resources. 2. The method of claim 1, further comprising:
receiving multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 3. The method of claim 2, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 4. The method of claim 2, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 5. The method of claim 2, wherein the UCI acknowledging the multiple PDCCH transmissions is sent in a same uplink (UL) slot. 6. The method of claim 1, wherein at least two of the plurality of subsets have different sizes. 7. The method of claim 1, wherein each of the plurality of subsets has the same size. 8. The method of claim 1, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 9. The method of claim 1, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 10. A method for wireless communications by a user equipment, comprising:
receiving, from a base station, an uplink grant comprising one or more downlink assignment index (DAI) bits; determining a number of bits to use to transmit an acknowledgement (ACK) based on the DAI bits; and transmitting, to the base station, the ACK using the determined number of bits. 11. The method of claim 10, wherein transmitting the ACK comprises transmitting the ACK on a physical uplink shared channel (PUSCH). 12. The method of claim 11, wherein when the determined number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the determined number of bits is greater than 2 the ACK is rate matched around the PUSCH. 13. The method of claim 10, wherein the user equipment and base station are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. 14. A method for wireless communications by a network entity, comprising:
transmitting downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to a user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is transmitted on one or more resources of a first physical downlink control channel (PDCCH) transmission; identifying resources within the subset indicated by the RI bits to monitor for the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and monitoring the identified resources for the UCI. 15. The method of claim 14, further comprising:
transmitting multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 16. The method of claim 15, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 17. The method of claim 15, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 18. The method of claim 15, wherein the UCI acknowledging the multiple PDCCH transmissions is communicated in a same uplink (UL) slot. 19. The method of claim 14, wherein at least two of the plurality of subsets have different sizes. 20. The method of claim 14, wherein each of the plurality of subsets has the same size. 21. The method of claim 14, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 22. The method of claim 14, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 23. A method for wireless communications by a network entity, comprising:
transmitting, to a user equipment, an uplink grant comprising one or more downlink assignment index (DAI) bits indicating a number of bits for the user equipment to use to transmit an acknowledgement (ACK) based on the DAI bits; and receiving, from the user equipment, the ACK using the number of bits. 24. The method of claim 23, wherein receiving the ACK comprises receiving the ACK on a physical uplink shared channel (PUSCH). 25. The method of claim 24, wherein when the number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the number of bits is greater than 2 the ACK is rate matched around the PUSCH. 26. The method of claim 23, wherein the user equipment and network entity are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. 27. A user equipment comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
receive downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to the user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is received on one or more resources of a first physical downlink control channel (PDCCH) transmission;
identify resources within the subset indicated by the RI bits to transmit the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and
transmit the UCI using the identified resources. 28. The user equipment of claim 27, wherein the processor is further configured to:
receive multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 29. The user equipment of claim 28, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 30. The user equipment of claim 28, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 31. The user equipment of claim 28, wherein the UCI acknowledging the multiple PDCCH transmissions is sent in a same uplink (UL) slot. 32. The user equipment of claim 27, wherein at least two of the plurality of subsets have different sizes. 33. The user equipment of claim 27, wherein each of the plurality of subsets has the same size. 34. The user equipment of claim 27, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 35. The user equipment of claim 27, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 36. A user equipment comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
receive, from a base station, an uplink grant comprising one or more downlink assignment index (DAI) bits;
determine a number of bits to use to transmit an acknowledgement (ACK) based on the DAI bits; and
transmit, to the base station, the ACK using the determined number of bits. 37. The user equipment of claim 36, wherein to transmit the ACK comprises to transmit the ACK on a physical uplink shared channel (PUSCH). 38. The user equipment of claim 37, wherein when the determined number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the determined number of bits is greater than 2 the ACK is rate matched around the PUSCH. 39. The user equipment of claim 36, wherein the user equipment and base station are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. 40. A network entity comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
transmit downlink control information (DCI) comprising one or more resource indicator (RI) bits configured to indicate to a user equipment a subset of resources available for transmitting uplink control information (UCI) in a physical uplink control channel (PUCCH) transmission, wherein the DCI is transmitted on one or more resources of a first physical downlink control channel (PDCCH) transmission;
identify resources within the subset indicated by the RI bits to monitor for the UCI based on an implicit mapping of PDCCH resources to PUCCH resources and the one or more resources of the first PDCCH transmission; and
monitor the identified resources for the UCI. 41. The network entity of claim 40, wherein the processor is further configured to:
transmit multiple PDCCH transmissions on multiple component carriers (CCs) or across multiple slots, wherein the UCI acknowledges the multiple PDCCH transmissions. 42. The network entity of claim 41, wherein the first PDCCH transmission is a last transmission of the multiple PDCCH transmissions. 43. The network entity of claim 41, wherein the first PDCCH transmission has a smallest component carrier (CC) index of the multiple PDCCH transmissions. 44. The network entity of claim 41, wherein the UCI acknowledging the multiple PDCCH transmissions is communicated in a same uplink (UL) slot. 45. The network entity of claim 40, wherein at least two of the plurality of subsets have different sizes. 46. The network entity of claim 40, wherein each of the plurality of subsets has the same size. 47. The network entity of claim 40, wherein the implicit mapping is based on a control channel element (CCE) index of the first PDCCH transmission. 48. The network entity of claim 40, wherein a number of RI bits is X, wherein a total number of PUCCH resources is Y, wherein a total number of subsets of the PUCCH resources is 2̂X, wherein (Y modulo 2̂X) of the total number of subsets consist of (floor(Y/2̂X)+1) PUCCH resources and any remaining of the total number of subsets consist of (floor(Y/2̂X)) PUCCH resources. 49. A network entity comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
transmit, to a user equipment, an uplink grant comprising one or more downlink assignment index (DAI) bits indicating a number of bits for the user equipment to use to transmit an acknowledgement (ACK) based on the DAI bits;
and
receive, from the user equipment, the ACK using the number of bits. 50. The network entity of claim 49, wherein to receive the ACK comprises to receive the ACK on a physical uplink shared channel (PUSCH). 51. The network entity of claim 50, wherein when the number of bits is 1 or 2 the ACK punctures the PUSCH, and wherein when the number of bits is greater than 2 the ACK is rate matched around the PUSCH. 52. The network entity of claim 49, wherein the user equipment and network entity are configured with a semi-static HARQ-ACK codebook size, and wherein a number of DAI bits is one and the one DAI bit indicates whether or not to transmit the ACK. | 2,400 |
9,492 | 9,492 | 15,665,668 | 2,484 | Disclosed are various embodiments for presenting a user interface in association with video content features. A video content feature is rendered on at least one display. A current scene in the video content feature is determined. Cast members are determined who have appeared in the current scene from a beginning of the current scene up to a current time in the current scene. A user interface is rendered on at least one display. The user interface includes selectable cast member components that each include an image of a cast member, a name of the cast member, and a name of a respective character performed by the cast member. | 1. A system, comprising:
at least one computing device; and at least one application executable in the at least one computing device, wherein when executed the at least one application causes the at least one computing device to at least:
render a video content feature on at least one display;
obtain a command from a user;
determine a current scene in the video content feature; and
render a user interface on the at least one display in response to the command being obtained from the user, the user interface including a plurality of selectable cast member components, individual ones of the plurality of selectable cast member components including an image of a respective one of a plurality of cast members who perform in the current scene, a name of the respective one of the plurality of cast members, and a name of a respective character performed by the respective one of the plurality of cast members. 2. The system of claim 1, wherein at least one of the plurality of cast members who perform in the current scene are not shown in the video content feature when the user interface is rendered. 3. The system of claim 1, wherein the command is a pause command. 4. The system of claim 1, wherein the command is a play command, and the at least one application is configured to automatically hide the user interface after passage of a predefined time. 5. The system of claim 1, wherein the user interface partially obscures the video content feature. 6. The system of claim 5, wherein a portion of the video content feature that is not obscured by the user interface is presented as darkened or dimmed while the user interface is rendered. 7. The system of claim 1, wherein playback of the video content feature continues while the user interface is rendered on the at least one display. 8. The system of claim 1, wherein the video content feature is segmented into a plurality of scenes, at least two of the plurality of scenes being of unequal length, and the current scene being one of the plurality of scenes. 9. A system, comprising:
at least one computing device; and at least one application executable in the at least one computing device, wherein when executed the at least one application causes the at least one computing device to at least:
render a video content feature on at least one display;
determine a current scene in the video content feature;
determine a plurality of cast members who have appeared in the current scene from a beginning of the current scene up to a current time in the current scene; and
render a user interface on the at least one display, the user interface including a plurality of selectable cast member components, individual ones of the plurality of selectable cast member components including an image of a respective one of the plurality of cast members, a name of the respective one of the plurality of cast members, and a name of a respective character performed by the respective one of the plurality of cast members. 10. The system of claim 9, wherein a user selection of one of the plurality of selectable cast member components causes a detail user interface to be rendered on the at least one display, the detail user interface including a selectable related video content feature component corresponding to another video content feature in which a particular cast member corresponding to the one of the plurality of selectable cast member components is also a cast member. 11. The system of claim 9, wherein when executed the at least one application further causes the at least one computing device to at least:
determine an additional cast member who appears in the current scene after the current time in the current scene; and dynamically update the user interface to include an additional selectable cast member component at a time relative to when the additional cast member appears in the current scene, the additional selectable cast member component including an image of the additional cast member, a name of the additional cast member, and a name of a respective character performed by the additional cast member. 12. The system of claim 9, wherein the user interface does not include selectable cast member components corresponding to at least one cast member who appears in the current scene but has not appeared in the current scene by the current time. 13. The system of claim 9, wherein all of the plurality of selectable cast member components remain shown in the user interface during a remaining portion of the current scene while one or more of the plurality of cast members do not appear on screen in the video content feature. 14. A method, comprising:
rendering, by at least one computing device, a video content feature on at least one display; obtaining, by the at least one computing device, a command from a user; determining, by the at least one computing device, a current scene in the video content feature; and rendering, by the at least one computing device, a user interface on the at least one display in response to the command being obtained from the user, the user interface including a plurality of selectable cast member components, individual ones of the plurality of selectable cast member components including an image of a respective one of a plurality of cast members who perform in the current scene, a name of the respective one of the plurality of cast members, and a name of a respective character performed by the respective one of the plurality of cast members. 15. The method of claim 14, further comprising:
determining, by the at least one computing device, that a plurality of generic images of a particular cast member of the plurality of cast members are available, the plurality of generic images depicting the particular cast member out of character; selecting, by the at least one computing device, a single generic image of the plurality of generic images that has a date nearest in time to a date of the video content feature by comparing a respective date of individual ones of the plurality of generic images with the date of the video content feature; and including, by the at least one computing device, the single generic image in a particular selectable cast member component of the plurality of selectable cast member components that corresponds to the particular cast member. 16. The method of claim 14, further comprising:
determining, by the at least one computing device, that a generic image of a particular cast member of the plurality of cast members is unavailable, the generic image of the particular cast member depicting the particular cast member out of character; identifying, by the at least one computing device, a character image of the particular cast member in response to determining that the generic image is unavailable, the character image of the cast member depicting the particular cast member in character in the video content feature; and including, by the at least one computing device, the character image in a particular selectable cast member component of the plurality of selectable cast member components that corresponds to the particular cast member. 17. The method of claim 14, wherein at least one of the plurality of cast members vocally, but not visually, performs a character in the video content feature. 18. The method of claim 14, wherein at least one of the plurality of cast members visually, but not vocally, performs a character in the video content feature. 19. The method of claim 14, further comprising obtaining, by the at least one computing device, extrinsic data that is generated includes a division of the video content feature into a plurality of scenes and associates each scene of a plurality of scenes with a respective set of characters that appear in the scene. 20. The method of claim 14, further comprising automatically hiding, by the at least one computing device, the user interface after passage of a predefined time. | Disclosed are various embodiments for presenting a user interface in association with video content features. A video content feature is rendered on at least one display. A current scene in the video content feature is determined. Cast members are determined who have appeared in the current scene from a beginning of the current scene up to a current time in the current scene. A user interface is rendered on at least one display. The user interface includes selectable cast member components that each include an image of a cast member, a name of the cast member, and a name of a respective character performed by the cast member.1. A system, comprising:
at least one computing device; and at least one application executable in the at least one computing device, wherein when executed the at least one application causes the at least one computing device to at least:
render a video content feature on at least one display;
obtain a command from a user;
determine a current scene in the video content feature; and
render a user interface on the at least one display in response to the command being obtained from the user, the user interface including a plurality of selectable cast member components, individual ones of the plurality of selectable cast member components including an image of a respective one of a plurality of cast members who perform in the current scene, a name of the respective one of the plurality of cast members, and a name of a respective character performed by the respective one of the plurality of cast members. 2. The system of claim 1, wherein at least one of the plurality of cast members who perform in the current scene are not shown in the video content feature when the user interface is rendered. 3. The system of claim 1, wherein the command is a pause command. 4. The system of claim 1, wherein the command is a play command, and the at least one application is configured to automatically hide the user interface after passage of a predefined time. 5. The system of claim 1, wherein the user interface partially obscures the video content feature. 6. The system of claim 5, wherein a portion of the video content feature that is not obscured by the user interface is presented as darkened or dimmed while the user interface is rendered. 7. The system of claim 1, wherein playback of the video content feature continues while the user interface is rendered on the at least one display. 8. The system of claim 1, wherein the video content feature is segmented into a plurality of scenes, at least two of the plurality of scenes being of unequal length, and the current scene being one of the plurality of scenes. 9. A system, comprising:
at least one computing device; and at least one application executable in the at least one computing device, wherein when executed the at least one application causes the at least one computing device to at least:
render a video content feature on at least one display;
determine a current scene in the video content feature;
determine a plurality of cast members who have appeared in the current scene from a beginning of the current scene up to a current time in the current scene; and
render a user interface on the at least one display, the user interface including a plurality of selectable cast member components, individual ones of the plurality of selectable cast member components including an image of a respective one of the plurality of cast members, a name of the respective one of the plurality of cast members, and a name of a respective character performed by the respective one of the plurality of cast members. 10. The system of claim 9, wherein a user selection of one of the plurality of selectable cast member components causes a detail user interface to be rendered on the at least one display, the detail user interface including a selectable related video content feature component corresponding to another video content feature in which a particular cast member corresponding to the one of the plurality of selectable cast member components is also a cast member. 11. The system of claim 9, wherein when executed the at least one application further causes the at least one computing device to at least:
determine an additional cast member who appears in the current scene after the current time in the current scene; and dynamically update the user interface to include an additional selectable cast member component at a time relative to when the additional cast member appears in the current scene, the additional selectable cast member component including an image of the additional cast member, a name of the additional cast member, and a name of a respective character performed by the additional cast member. 12. The system of claim 9, wherein the user interface does not include selectable cast member components corresponding to at least one cast member who appears in the current scene but has not appeared in the current scene by the current time. 13. The system of claim 9, wherein all of the plurality of selectable cast member components remain shown in the user interface during a remaining portion of the current scene while one or more of the plurality of cast members do not appear on screen in the video content feature. 14. A method, comprising:
rendering, by at least one computing device, a video content feature on at least one display; obtaining, by the at least one computing device, a command from a user; determining, by the at least one computing device, a current scene in the video content feature; and rendering, by the at least one computing device, a user interface on the at least one display in response to the command being obtained from the user, the user interface including a plurality of selectable cast member components, individual ones of the plurality of selectable cast member components including an image of a respective one of a plurality of cast members who perform in the current scene, a name of the respective one of the plurality of cast members, and a name of a respective character performed by the respective one of the plurality of cast members. 15. The method of claim 14, further comprising:
determining, by the at least one computing device, that a plurality of generic images of a particular cast member of the plurality of cast members are available, the plurality of generic images depicting the particular cast member out of character; selecting, by the at least one computing device, a single generic image of the plurality of generic images that has a date nearest in time to a date of the video content feature by comparing a respective date of individual ones of the plurality of generic images with the date of the video content feature; and including, by the at least one computing device, the single generic image in a particular selectable cast member component of the plurality of selectable cast member components that corresponds to the particular cast member. 16. The method of claim 14, further comprising:
determining, by the at least one computing device, that a generic image of a particular cast member of the plurality of cast members is unavailable, the generic image of the particular cast member depicting the particular cast member out of character; identifying, by the at least one computing device, a character image of the particular cast member in response to determining that the generic image is unavailable, the character image of the cast member depicting the particular cast member in character in the video content feature; and including, by the at least one computing device, the character image in a particular selectable cast member component of the plurality of selectable cast member components that corresponds to the particular cast member. 17. The method of claim 14, wherein at least one of the plurality of cast members vocally, but not visually, performs a character in the video content feature. 18. The method of claim 14, wherein at least one of the plurality of cast members visually, but not vocally, performs a character in the video content feature. 19. The method of claim 14, further comprising obtaining, by the at least one computing device, extrinsic data that is generated includes a division of the video content feature into a plurality of scenes and associates each scene of a plurality of scenes with a respective set of characters that appear in the scene. 20. The method of claim 14, further comprising automatically hiding, by the at least one computing device, the user interface after passage of a predefined time. | 2,400 |
9,493 | 9,493 | 16,080,386 | 2,484 | The invention relates to a device and a method for performing an eye gaze mapping (M), in which at least one point of vision (B) and/or a viewing direction of at least one person ( 10 ) in relation to at least one scene recording (S) of a scene ( 12 ) viewed by the at least one person ( 10 ) is mapped onto a reference (R). At least a part of an algorithm (A 1, A 2, A 3 ) for performing the eye gaze mapping (M) is thereby selected from multiple predetermined algorithms (A 1, A 2, A 3 ) as a function of at least one parameter (P), and the eye gaze mapping (M) is performed on the basis of the at least one part of the algorithm (A 1, A 2, A 3 ). | 1-15. (canceled) 16. A method comprising:
obtaining a plurality of scene images of a scene; determining, based on the plurality of scene images, a dynamism parameter of the scene; obtaining a plurality of eye tracking measurements respectively corresponding to the plurality of scene images; and generating a view image based on the plurality of scene images and the corresponding plurality of eye tracking measurements, wherein generating the view image is further based on the dynamism parameter. 17. The method of claim 16, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates a first value, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates a second value, generating the view image according to a second algorithm different than the first algorithm. 18. The method of claim 16, wherein determining the dynamism parameter of the scene includes classifying the scene into one of a plurality of predefined groups. 19. The method of claim 16, wherein the dynamism parameter indicates an amount of temporal variability of the scene. 20. The method of claim 16, wherein the dynamic parameter indicates whether the scene is a static scene or a moving scene. 21. The method of claim 20, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates that the scene is a moving scene, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates that the scene is a static scene, generating the view image according to a second algorithm that is move computationally efficient that the first algorithm. 22. The method of claim 16, wherein the dynamism parameter indicates whether a background of the scene is temporally unchanging or temporally variable. 23. The method of claim 22, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates that the background of the scene is temporally unchanging, generating the view image according to a first algorithm that ignores the background; and in accordance with a determination that the dynamism parameter indicates that the background of the scene is temporally variable, generating the view image according to a second algorithm in which the background is analyzed. 24. The method of claim 16, wherein the dynamism parameter indicates objects of the scene that are moving or varying. 25. The method of claim 16, wherein generating the view image includes:
determining, based on the plurality of scene images of the scene and the corresponding plurality of eye tracking measurements, a corresponding plurality of viewpoints of a reference image of the scene. 26. The method of claim 25, wherein at least one of the plurality of scene images of the scene is from a different perspective than the reference image of the scene. 27. An apparatus comprising:
a scene camera to capture a plurality of scene images of a scene; an eye tracker to generate a corresponding plurality of eye tracking measurements; and a processor to:
determine, based on the plurality of scene images, a dynamism parameter of the scene; and
generate a view image based on the plurality of scene images and the corresponding plurality of eye tracking measurements, wherein generating the view image is further based on the dynamism parameter. 28. The apparatus of claim 27, wherein the processor is to generate the view image further based on the dynamism parameter by:
in accordance with a determination that the dynamism parameter indicates a first value, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates a second value, generating the view image according to a second algorithm different than the first algorithm. 29. The apparatus of claim 27, wherein the dynamism parameter indicates an amount of temporal variability of the scene. 30. The apparatus of claim 27, wherein the dynamic parameter indicates whether the scene is a static scene or a moving scene. 31. The apparatus of claim 27, wherein the dynamism parameter indicates whether a background of the scene is temporally unchanging or temporally variable. 32. A non-transitory computer-readable medium encoding instructions which, when executed, cause a processor to perform operations comprising:
obtaining a plurality of scene images of a scene; determining, based on the plurality of scene images, a dynamism parameter of the scene; obtaining a plurality of eye tracking measurements respectively corresponding to the plurality of scene images; and generating a view image based on the plurality of scene images and the corresponding plurality of eye tracking measurements, wherein generating the view image is further based on the dynamism parameter. 33. The non-transitory computer-readable medium of claim 32, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates a first value, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates a second value, generating the view image according to a second algorithm different than the first algorithm. 34. The apparatus of claim 32, wherein the dynamism parameter indicates an amount of temporal variability of the scene. 35. The apparatus of claim 32, wherein the dynamism parameter indicates whether a background of the scene is temporally unchanging or temporally variable. | The invention relates to a device and a method for performing an eye gaze mapping (M), in which at least one point of vision (B) and/or a viewing direction of at least one person ( 10 ) in relation to at least one scene recording (S) of a scene ( 12 ) viewed by the at least one person ( 10 ) is mapped onto a reference (R). At least a part of an algorithm (A 1, A 2, A 3 ) for performing the eye gaze mapping (M) is thereby selected from multiple predetermined algorithms (A 1, A 2, A 3 ) as a function of at least one parameter (P), and the eye gaze mapping (M) is performed on the basis of the at least one part of the algorithm (A 1, A 2, A 3 ).1-15. (canceled) 16. A method comprising:
obtaining a plurality of scene images of a scene; determining, based on the plurality of scene images, a dynamism parameter of the scene; obtaining a plurality of eye tracking measurements respectively corresponding to the plurality of scene images; and generating a view image based on the plurality of scene images and the corresponding plurality of eye tracking measurements, wherein generating the view image is further based on the dynamism parameter. 17. The method of claim 16, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates a first value, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates a second value, generating the view image according to a second algorithm different than the first algorithm. 18. The method of claim 16, wherein determining the dynamism parameter of the scene includes classifying the scene into one of a plurality of predefined groups. 19. The method of claim 16, wherein the dynamism parameter indicates an amount of temporal variability of the scene. 20. The method of claim 16, wherein the dynamic parameter indicates whether the scene is a static scene or a moving scene. 21. The method of claim 20, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates that the scene is a moving scene, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates that the scene is a static scene, generating the view image according to a second algorithm that is move computationally efficient that the first algorithm. 22. The method of claim 16, wherein the dynamism parameter indicates whether a background of the scene is temporally unchanging or temporally variable. 23. The method of claim 22, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates that the background of the scene is temporally unchanging, generating the view image according to a first algorithm that ignores the background; and in accordance with a determination that the dynamism parameter indicates that the background of the scene is temporally variable, generating the view image according to a second algorithm in which the background is analyzed. 24. The method of claim 16, wherein the dynamism parameter indicates objects of the scene that are moving or varying. 25. The method of claim 16, wherein generating the view image includes:
determining, based on the plurality of scene images of the scene and the corresponding plurality of eye tracking measurements, a corresponding plurality of viewpoints of a reference image of the scene. 26. The method of claim 25, wherein at least one of the plurality of scene images of the scene is from a different perspective than the reference image of the scene. 27. An apparatus comprising:
a scene camera to capture a plurality of scene images of a scene; an eye tracker to generate a corresponding plurality of eye tracking measurements; and a processor to:
determine, based on the plurality of scene images, a dynamism parameter of the scene; and
generate a view image based on the plurality of scene images and the corresponding plurality of eye tracking measurements, wherein generating the view image is further based on the dynamism parameter. 28. The apparatus of claim 27, wherein the processor is to generate the view image further based on the dynamism parameter by:
in accordance with a determination that the dynamism parameter indicates a first value, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates a second value, generating the view image according to a second algorithm different than the first algorithm. 29. The apparatus of claim 27, wherein the dynamism parameter indicates an amount of temporal variability of the scene. 30. The apparatus of claim 27, wherein the dynamic parameter indicates whether the scene is a static scene or a moving scene. 31. The apparatus of claim 27, wherein the dynamism parameter indicates whether a background of the scene is temporally unchanging or temporally variable. 32. A non-transitory computer-readable medium encoding instructions which, when executed, cause a processor to perform operations comprising:
obtaining a plurality of scene images of a scene; determining, based on the plurality of scene images, a dynamism parameter of the scene; obtaining a plurality of eye tracking measurements respectively corresponding to the plurality of scene images; and generating a view image based on the plurality of scene images and the corresponding plurality of eye tracking measurements, wherein generating the view image is further based on the dynamism parameter. 33. The non-transitory computer-readable medium of claim 32, wherein generating the view image further based on the dynamism parameter includes:
in accordance with a determination that the dynamism parameter indicates a first value, generating the view image according to a first algorithm; and in accordance with a determination that the dynamism parameter indicates a second value, generating the view image according to a second algorithm different than the first algorithm. 34. The apparatus of claim 32, wherein the dynamism parameter indicates an amount of temporal variability of the scene. 35. The apparatus of claim 32, wherein the dynamism parameter indicates whether a background of the scene is temporally unchanging or temporally variable. | 2,400 |
9,494 | 9,494 | 15,467,460 | 2,435 | A technique to implement access control from within an application begins by dynamically-generating a “management scope” for a transaction associated with a set of managed resources. The management scope is a collection of permissions defined by at least one of: a set of roles, and a set of resource administration rights, that are assigned to a first operator that issues the transaction. As the transaction executes, a request to alter the transaction is then received from a second operator. According to the technique, the management scope for the transaction and associated with the first operator is then evaluated against a management scope associated with the second operator. Upon determining the management scope associated with the first operator has a given relationship to the management scope for the second operator, the transaction is permitted to be altered in response to the request. The given relationship is scoped by one or more rules. | 1. A method of access control from within an application, comprising:
for a transaction associated with a set of managed resources, dynamically generating a management scope for the transaction, the management scope being a collection of permissions defined by at least one of: a set of one or more roles, and one or more resource administration rights, that are assigned to a first operator that issues the transaction; as the transaction executes, and upon receipt of a request to alter the transaction, the request being initiated by a second operator distinct from the first operator, evaluating the management scope for the transaction and associated with the first operator against a management scope associated with the second operator; and upon determining that the management scope associated with the first operator has a given relationship to the management scope for the second operator, permitting the transaction to be altered in response to the request. 2. The method as described in claim 1 wherein the given relationship is defined by an equal rule that specifies that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator. 3. The method as described in claim 1 wherein the given relationship is defined by a superset rule that specifies that a set of roles or a set of resource administration rights for the second operator contains those of the first operator. 4. The method as described in claim 1 wherein the given relationship is defined by an equal rule together with a superset rule, the equal rule specifying that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator, and the superset rule specifying that a set of roles or a set of resource administration rights for the second operator contain those of the first operator. 5. The method as described in claim 3 wherein the resource administration rights for the second operator are obtained by evaluating other information. 6. The method as described in claim 1 wherein the collection of permissions is defined within the application. 7. Apparatus, comprising:
a hardware processor; computer memory holding computer program instructions executed by the hardware processor to provide access control from within an application, the computer program instructions comprising program code configured to:
for a transaction associated with a set of managed resources, dynamically generate a management scope for the transaction, the management scope being a collection of permissions defined by at least one of: a set of one or more roles, and one or more resource administration rights, that are assigned to a first operator that issues the transaction;
as the transaction executes, and upon receipt of a request to alter the transaction, the request being initiated by a second operator distinct from the first operator, evaluate the management scope for the transaction and associated with the first operator against a management scope associated with the second operator; and
upon determining that the management scope associated with the first operator has a given relationship to the management scope for the second operator, permit the transaction to be altered in response to the request. 8. The apparatus as described in claim 7 wherein the given relationship is defined by an equal rule that specifies that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator. 9. The apparatus as described in claim 7 wherein the given relationship is defined by a superset rule that specifies that a set of roles or a set of resource administration rights for the second operator contains those of the first operator. 10. The apparatus as described in claim 7 wherein the given relationship is defined by an equal rule together with a superset rule, the equal rule specifying that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator, and the superset rule specifying that a set of roles or a set of resource administration rights for the second operator contain those of the first operator. 11. The apparatus as described in claim 9 wherein the resource administration rights for the second operator are obtained by evaluating other information. 12. The apparatus as described in claim 7 wherein the collection of permissions is defined within the application. 13. A computer program product in a non-transitory computer readable medium, the computer program product holding computer program instructions which, when executed by a data processing system, perform access control, the computer program instructions configured to:
for a transaction associated with a set of managed resources, dynamically generate a management scope for the transaction, the management scope being a collection of permissions defined by at least one of: a set of one or more roles, and one or more resource administration rights, that are assigned to a first operator that issues the transaction; as the transaction executes, and upon receipt of a request to alter the transaction, the request being initiated by a second operator distinct from the first operator, evaluate the management scope for the transaction and associated with the first operator against a management scope associated with the second operator; and upon determining that the management scope associated with the first operator has a given relationship to the management scope for the second operator, permit the transaction to be altered in response to the request. 14. The computer program product as described in claim 13 wherein the given relationship is defined by an equal rule that specifies that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator. 15. The computer program product as described in claim 13 wherein the given relationship is defined by a superset rule that specifies that a set of roles or a set of resource administration rights for the second operator contains those of the first operator. 16. The computer program product as described in claim 13 wherein the given relationship is defined by an equal rule together with a superset rule, the equal rule specifying that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator, and the superset rule specifying that a set of roles or a set of resource administration rights for the second operator contain those of the first operator. 17. The computer program product as described in claim 15 wherein the resource administration rights for the second operator are obtained by evaluating other information. 18. The computer program product as described in claim 13 wherein the collection of permissions is defined within the application. | A technique to implement access control from within an application begins by dynamically-generating a “management scope” for a transaction associated with a set of managed resources. The management scope is a collection of permissions defined by at least one of: a set of roles, and a set of resource administration rights, that are assigned to a first operator that issues the transaction. As the transaction executes, a request to alter the transaction is then received from a second operator. According to the technique, the management scope for the transaction and associated with the first operator is then evaluated against a management scope associated with the second operator. Upon determining the management scope associated with the first operator has a given relationship to the management scope for the second operator, the transaction is permitted to be altered in response to the request. The given relationship is scoped by one or more rules.1. A method of access control from within an application, comprising:
for a transaction associated with a set of managed resources, dynamically generating a management scope for the transaction, the management scope being a collection of permissions defined by at least one of: a set of one or more roles, and one or more resource administration rights, that are assigned to a first operator that issues the transaction; as the transaction executes, and upon receipt of a request to alter the transaction, the request being initiated by a second operator distinct from the first operator, evaluating the management scope for the transaction and associated with the first operator against a management scope associated with the second operator; and upon determining that the management scope associated with the first operator has a given relationship to the management scope for the second operator, permitting the transaction to be altered in response to the request. 2. The method as described in claim 1 wherein the given relationship is defined by an equal rule that specifies that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator. 3. The method as described in claim 1 wherein the given relationship is defined by a superset rule that specifies that a set of roles or a set of resource administration rights for the second operator contains those of the first operator. 4. The method as described in claim 1 wherein the given relationship is defined by an equal rule together with a superset rule, the equal rule specifying that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator, and the superset rule specifying that a set of roles or a set of resource administration rights for the second operator contain those of the first operator. 5. The method as described in claim 3 wherein the resource administration rights for the second operator are obtained by evaluating other information. 6. The method as described in claim 1 wherein the collection of permissions is defined within the application. 7. Apparatus, comprising:
a hardware processor; computer memory holding computer program instructions executed by the hardware processor to provide access control from within an application, the computer program instructions comprising program code configured to:
for a transaction associated with a set of managed resources, dynamically generate a management scope for the transaction, the management scope being a collection of permissions defined by at least one of: a set of one or more roles, and one or more resource administration rights, that are assigned to a first operator that issues the transaction;
as the transaction executes, and upon receipt of a request to alter the transaction, the request being initiated by a second operator distinct from the first operator, evaluate the management scope for the transaction and associated with the first operator against a management scope associated with the second operator; and
upon determining that the management scope associated with the first operator has a given relationship to the management scope for the second operator, permit the transaction to be altered in response to the request. 8. The apparatus as described in claim 7 wherein the given relationship is defined by an equal rule that specifies that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator. 9. The apparatus as described in claim 7 wherein the given relationship is defined by a superset rule that specifies that a set of roles or a set of resource administration rights for the second operator contains those of the first operator. 10. The apparatus as described in claim 7 wherein the given relationship is defined by an equal rule together with a superset rule, the equal rule specifying that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator, and the superset rule specifying that a set of roles or a set of resource administration rights for the second operator contain those of the first operator. 11. The apparatus as described in claim 9 wherein the resource administration rights for the second operator are obtained by evaluating other information. 12. The apparatus as described in claim 7 wherein the collection of permissions is defined within the application. 13. A computer program product in a non-transitory computer readable medium, the computer program product holding computer program instructions which, when executed by a data processing system, perform access control, the computer program instructions configured to:
for a transaction associated with a set of managed resources, dynamically generate a management scope for the transaction, the management scope being a collection of permissions defined by at least one of: a set of one or more roles, and one or more resource administration rights, that are assigned to a first operator that issues the transaction; as the transaction executes, and upon receipt of a request to alter the transaction, the request being initiated by a second operator distinct from the first operator, evaluate the management scope for the transaction and associated with the first operator against a management scope associated with the second operator; and upon determining that the management scope associated with the first operator has a given relationship to the management scope for the second operator, permit the transaction to be altered in response to the request. 14. The computer program product as described in claim 13 wherein the given relationship is defined by an equal rule that specifies that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator. 15. The computer program product as described in claim 13 wherein the given relationship is defined by a superset rule that specifies that a set of roles or a set of resource administration rights for the second operator contains those of the first operator. 16. The computer program product as described in claim 13 wherein the given relationship is defined by an equal rule together with a superset rule, the equal rule specifying that a set of roles or a set of resource administration rights for the second operator correspond to those of the first operator, and the superset rule specifying that a set of roles or a set of resource administration rights for the second operator contain those of the first operator. 17. The computer program product as described in claim 15 wherein the resource administration rights for the second operator are obtained by evaluating other information. 18. The computer program product as described in claim 13 wherein the collection of permissions is defined within the application. | 2,400 |
9,495 | 9,495 | 15,626,017 | 2,448 | A method and apparatus of a network element that processes control plane data in a network element is described. In an exemplary embodiment, the device receives control plane data with a network element operating system, where at least a functionality of the network element operating system is executing in a container of the network element. In addition, the network element includes a data plane with a plurality of hardware tables and the host operating system. Furthermore, the network element processes the control plane data with the network element operating system. The network element additionally updates at least one of the plurality of hardware tables with the process control plane data using the network element operating system. | 1. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to process control plane data in a network element, the method comprising:
receiving control plane data by a network element operating system of the network element, wherein at least a functionality of the network element operating system is executing in a container of the network element, the network element including a data plane with a plurality of hardware tables and the host operating system; and processing the control plane data by the network element operating system. 2. The machine-readable medium of claim 1, further comprising:
updating, by the network element operating system, at least one of the plurality of hardware tables with the processed control plane data. 2. The machine-readable medium of claim 1, wherein vendors of the network element operating system and the host operating system are different. 3. The machine-readable medium of claim 1, wherein vendors of the network element operating system and the network element are different. 4. The machine-readable medium of claim 1, wherein the network element operating system updates the at least one of the plurality of hardware tables using a device driver. 5. The machine-readable medium of claim 1, wherein one of the plurality of hardware tables is selected from the group consisting of a routing table, a media access control address table, and an access control list. 6. The machine-readable medium of claim 1, wherein the network element further includes a control plane, wherein the network element operating system is part of the control plane. 7. The machine-readable medium of claim 1, wherein the network element operating system is isolated and the host operating system is accessible to devices other than the network element. 8. The machine-readable medium of claim 1, wherein the host operating system is isolated. 9. The machine-readable medium of claim 8, wherein the network element operating system manages a physical management interface of the network element. 10. The machine-readable medium of claim 9, further comprising:
bridging the physical management interface to a virtual interface associated with the container. 11. The machine-readable medium of claim 1, wherein each of the network element operating system and the host operating system are visible to other devices. 12. The machine-readable medium of claim 1, wherein a third-party process executes within the container. 13. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to process control plane data in a network element, the method comprising:
receiving control plane data by at least one of a plurality of processes of a network element operating system of the network element, wherein the plurality of processes is executing in a plurality of containers of the network element, the network element including a data plane with a plurality of hardware tables; processing the control plane data by the at least one of the plurality of processes; and updating, by the at least one of the plurality of processes, at least one of the plurality of hardware tables with the processed control plane data. 14. The machine-readable medium of claim 13, wherein vendors of the network element operating system and the host operating system are different. 15. The machine-readable medium of claim 13, wherein vendors of the network element operating system and the network element are different. 16. The machine-readable medium of claim 13, wherein each of the plurality of processes is selected for the group consisting of a routing agent, a policy agent, fan agent, light emitting diode agent, temperature sensor agent, database process, management processes, and process manager. 17. The machine-readable medium of claim 13, wherein a routing agent is selected from the group consisting of a Border Gateway Protocol agent, Open Shortest Path First routing agent, multicast routing agent, and Routing Information Base Agent 18. The machine-readable medium of claim 13, wherein the network element operating system updates the at least one of the plurality of hardware tables using a device driver. 19. The machine-readable medium of claim 13, wherein a container is namespace instance of an operating-system level virtualization. 20. The machine-readable medium of claim 13, wherein a third-party process executes within the container. | A method and apparatus of a network element that processes control plane data in a network element is described. In an exemplary embodiment, the device receives control plane data with a network element operating system, where at least a functionality of the network element operating system is executing in a container of the network element. In addition, the network element includes a data plane with a plurality of hardware tables and the host operating system. Furthermore, the network element processes the control plane data with the network element operating system. The network element additionally updates at least one of the plurality of hardware tables with the process control plane data using the network element operating system.1. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to process control plane data in a network element, the method comprising:
receiving control plane data by a network element operating system of the network element, wherein at least a functionality of the network element operating system is executing in a container of the network element, the network element including a data plane with a plurality of hardware tables and the host operating system; and processing the control plane data by the network element operating system. 2. The machine-readable medium of claim 1, further comprising:
updating, by the network element operating system, at least one of the plurality of hardware tables with the processed control plane data. 2. The machine-readable medium of claim 1, wherein vendors of the network element operating system and the host operating system are different. 3. The machine-readable medium of claim 1, wherein vendors of the network element operating system and the network element are different. 4. The machine-readable medium of claim 1, wherein the network element operating system updates the at least one of the plurality of hardware tables using a device driver. 5. The machine-readable medium of claim 1, wherein one of the plurality of hardware tables is selected from the group consisting of a routing table, a media access control address table, and an access control list. 6. The machine-readable medium of claim 1, wherein the network element further includes a control plane, wherein the network element operating system is part of the control plane. 7. The machine-readable medium of claim 1, wherein the network element operating system is isolated and the host operating system is accessible to devices other than the network element. 8. The machine-readable medium of claim 1, wherein the host operating system is isolated. 9. The machine-readable medium of claim 8, wherein the network element operating system manages a physical management interface of the network element. 10. The machine-readable medium of claim 9, further comprising:
bridging the physical management interface to a virtual interface associated with the container. 11. The machine-readable medium of claim 1, wherein each of the network element operating system and the host operating system are visible to other devices. 12. The machine-readable medium of claim 1, wherein a third-party process executes within the container. 13. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to process control plane data in a network element, the method comprising:
receiving control plane data by at least one of a plurality of processes of a network element operating system of the network element, wherein the plurality of processes is executing in a plurality of containers of the network element, the network element including a data plane with a plurality of hardware tables; processing the control plane data by the at least one of the plurality of processes; and updating, by the at least one of the plurality of processes, at least one of the plurality of hardware tables with the processed control plane data. 14. The machine-readable medium of claim 13, wherein vendors of the network element operating system and the host operating system are different. 15. The machine-readable medium of claim 13, wherein vendors of the network element operating system and the network element are different. 16. The machine-readable medium of claim 13, wherein each of the plurality of processes is selected for the group consisting of a routing agent, a policy agent, fan agent, light emitting diode agent, temperature sensor agent, database process, management processes, and process manager. 17. The machine-readable medium of claim 13, wherein a routing agent is selected from the group consisting of a Border Gateway Protocol agent, Open Shortest Path First routing agent, multicast routing agent, and Routing Information Base Agent 18. The machine-readable medium of claim 13, wherein the network element operating system updates the at least one of the plurality of hardware tables using a device driver. 19. The machine-readable medium of claim 13, wherein a container is namespace instance of an operating-system level virtualization. 20. The machine-readable medium of claim 13, wherein a third-party process executes within the container. | 2,400 |
9,496 | 9,496 | 14,513,755 | 2,446 | Disclosed are methods and systems for providing content. An example method can comprise receiving, at a content provider, a request for a content transmission from a first device and determining a parameter related to the first content transmission and comparing the parameter to a threshold. An example method can comprise determining, by the content provider, a second content transmission based on the comparison to the threshold and providing the second content transmission to the first in response to the request. | 1. A method, comprising:
receiving, at a content provider, a request for a first multicast content transmission from a first device; determining a parameter related to the first multicast content transmission; comparing the parameter to a threshold; determining, by the content provider, a second multicast content transmission based on a comparison to the threshold; and providing the second multicast content transmission to the first device in response to the request. 2. The method of claim 1, wherein the second multicast content transmission is identified as the first multicast content transmission when the second multicast content transmission is provided in response to the request. 3. The method of claim 1, wherein the second multicast content transmission is provided instead of the first multicast content transmission. 4. The method of claim 1, wherein determining the second multicast content transmission is also based on a characteristic associated with the first device. 5. The method of claim 4, wherein the characteristic comprises at least one of a screen size, a bandwidth, a screen resolution, a location, and a client account feature. 6. The method of claim 1, wherein the first multicast content transmission comprises content at a first bit rate, and wherein the second multicast content transmission comprises the content at a second bit rate, and wherein the first bit rate is different than the second bit rate. 7. The method of claim 1, wherein the parameter is a number of users at least one of accessing, requesting, and receiving the first multicast content transmission. 8. A method, comprising:
determining a parameter related to a first multicast content transmission having a first bit rate; comparing the parameter to a threshold; adjusting the first bit rate to a second bit rate based on a comparison of the parameter to the threshold; and providing the first multicast content transmission having the second bit rate. 9. The method of claim 8, wherein the parameter comprises a number of devices accessing the first multicast content transmission. 10. The method of claim 8, wherein the parameter is based on a measurement of a buffer of at least one device accessing the first multicast content transmission. 11. The method of claim 8, further comprising receiving a request for the first multicast content transmission having the first bit rate, wherein the first multicast content transmission having the second bit rate is provided in response to the request. 12. The method of claim 8, wherein the first multicast content transmission having the second bit rate is identified as the first multicast content transmission having the first bit rate. 13. The method of claim 8, wherein the first bit rate is adjusted to the second bit rate based on a characteristic associated with a device that is at least one of requesting, accessing, and receiving the first multicast content transmission. 14. The method of claim 13, wherein the characteristic comprises at least one of a screen size, a bandwidth, a screen resolution, a location, and a client account feature. 15. A method, comprising:
requesting a first multicast content transmission; and receiving a second multicast content transmission, wherein the second multicast content transmission is received in response to the requesting of the first multicast content transmission, and wherein the second multicast content transmission is received instead of the first multicast content transmission based on a number of users accessing the first multicast content transmission. 16. The method of claim 15, wherein the second multicast content transmission is received instead of the first multicast content transmission based on the number of users accessing the first multicast content transmission being below a threshold. 17. The method of claim 15, wherein the second multicast content transmission is identified as the first multicast content transmission when the second multicast content transmission is received in response to the requesting of the first multicast content transmission. 18. The method of claim 15, wherein the second multicast content transmission is received based on a characteristic associated with a device that is requesting the first multicast content transmission, and wherein the second multicast content transmission is selected for and provided to the device. 19. The method of claim 18, wherein the characteristic comprises at least one of a screen size, a bandwidth, a screen resolution, a location, and a client account feature. 20. The method of claim 18, wherein the characteristic is based on a measurement of a buffer of at least one device accessing the first multicast content transmission. | Disclosed are methods and systems for providing content. An example method can comprise receiving, at a content provider, a request for a content transmission from a first device and determining a parameter related to the first content transmission and comparing the parameter to a threshold. An example method can comprise determining, by the content provider, a second content transmission based on the comparison to the threshold and providing the second content transmission to the first in response to the request.1. A method, comprising:
receiving, at a content provider, a request for a first multicast content transmission from a first device; determining a parameter related to the first multicast content transmission; comparing the parameter to a threshold; determining, by the content provider, a second multicast content transmission based on a comparison to the threshold; and providing the second multicast content transmission to the first device in response to the request. 2. The method of claim 1, wherein the second multicast content transmission is identified as the first multicast content transmission when the second multicast content transmission is provided in response to the request. 3. The method of claim 1, wherein the second multicast content transmission is provided instead of the first multicast content transmission. 4. The method of claim 1, wherein determining the second multicast content transmission is also based on a characteristic associated with the first device. 5. The method of claim 4, wherein the characteristic comprises at least one of a screen size, a bandwidth, a screen resolution, a location, and a client account feature. 6. The method of claim 1, wherein the first multicast content transmission comprises content at a first bit rate, and wherein the second multicast content transmission comprises the content at a second bit rate, and wherein the first bit rate is different than the second bit rate. 7. The method of claim 1, wherein the parameter is a number of users at least one of accessing, requesting, and receiving the first multicast content transmission. 8. A method, comprising:
determining a parameter related to a first multicast content transmission having a first bit rate; comparing the parameter to a threshold; adjusting the first bit rate to a second bit rate based on a comparison of the parameter to the threshold; and providing the first multicast content transmission having the second bit rate. 9. The method of claim 8, wherein the parameter comprises a number of devices accessing the first multicast content transmission. 10. The method of claim 8, wherein the parameter is based on a measurement of a buffer of at least one device accessing the first multicast content transmission. 11. The method of claim 8, further comprising receiving a request for the first multicast content transmission having the first bit rate, wherein the first multicast content transmission having the second bit rate is provided in response to the request. 12. The method of claim 8, wherein the first multicast content transmission having the second bit rate is identified as the first multicast content transmission having the first bit rate. 13. The method of claim 8, wherein the first bit rate is adjusted to the second bit rate based on a characteristic associated with a device that is at least one of requesting, accessing, and receiving the first multicast content transmission. 14. The method of claim 13, wherein the characteristic comprises at least one of a screen size, a bandwidth, a screen resolution, a location, and a client account feature. 15. A method, comprising:
requesting a first multicast content transmission; and receiving a second multicast content transmission, wherein the second multicast content transmission is received in response to the requesting of the first multicast content transmission, and wherein the second multicast content transmission is received instead of the first multicast content transmission based on a number of users accessing the first multicast content transmission. 16. The method of claim 15, wherein the second multicast content transmission is received instead of the first multicast content transmission based on the number of users accessing the first multicast content transmission being below a threshold. 17. The method of claim 15, wherein the second multicast content transmission is identified as the first multicast content transmission when the second multicast content transmission is received in response to the requesting of the first multicast content transmission. 18. The method of claim 15, wherein the second multicast content transmission is received based on a characteristic associated with a device that is requesting the first multicast content transmission, and wherein the second multicast content transmission is selected for and provided to the device. 19. The method of claim 18, wherein the characteristic comprises at least one of a screen size, a bandwidth, a screen resolution, a location, and a client account feature. 20. The method of claim 18, wherein the characteristic is based on a measurement of a buffer of at least one device accessing the first multicast content transmission. | 2,400 |
9,497 | 9,497 | 16,146,305 | 2,422 | A system and method wherein geographic data is used to configure a controlling device to control operations of a target device and/or to configure the controlling device to control tuning operations of a target device. The system additionally provides for the harmonization of controlling device configurations made on the controlling device and/or a remote computer. | 1-27. (canceled) 28. A computer-implemented method for making a selection for a channel control system through a computing device comprising:
receiving a request for a transmission code to perform a television function on the channel control system; determining an internet protocol (“IP”) address associated with the computing device; receiving a location identifier associated with the IP address; receiving a television service provider identifier based on the location identifier; receiving a television function identifier; selecting the transmission code including instructions to perform the television function on the channel control system; and transmitting the transmission code. 29. The method of claim 28, wherein the transmission code comprises a radio frequency (RF) protocol transmission code. 30. The method of claim 28, wherein the transmission code comprises a point-to-point protocol transmission code. 31. The method of claim 28, wherein the transmission code comprises a network protocol transmission code. 32. The method of claim 28 further comprising: receiving configuration information, the configuration information including information associated with the channel control system. 33. The method of claim 28, wherein the channel control system is configured on at least one of a television, a set-top box, and a digital video recorder. 34. The method of claim 28, wherein the television function comprises selecting a television channel for the channel control system. 35. The method of claim 34, wherein the television channel includes digitally-distributed television channels obtained through online streaming. 36. The method of claim 28, wherein the television function identifier is based on the television service provider identifier. 37. The method of claim 36, wherein the television service provider identifier is selected from a set of television service provider identifiers based on an association of the television service provider identifier with a television service provider operating at the location associated with the location identifier. 38. The method of claim 28, wherein receiving a television function identifier further comprises: transmitting a television service provider identifier; receiving electronic program guide information associated with the television service provider identifier; and wherein the television function identifier is based on the electronic program guide information. | A system and method wherein geographic data is used to configure a controlling device to control operations of a target device and/or to configure the controlling device to control tuning operations of a target device. The system additionally provides for the harmonization of controlling device configurations made on the controlling device and/or a remote computer.1-27. (canceled) 28. A computer-implemented method for making a selection for a channel control system through a computing device comprising:
receiving a request for a transmission code to perform a television function on the channel control system; determining an internet protocol (“IP”) address associated with the computing device; receiving a location identifier associated with the IP address; receiving a television service provider identifier based on the location identifier; receiving a television function identifier; selecting the transmission code including instructions to perform the television function on the channel control system; and transmitting the transmission code. 29. The method of claim 28, wherein the transmission code comprises a radio frequency (RF) protocol transmission code. 30. The method of claim 28, wherein the transmission code comprises a point-to-point protocol transmission code. 31. The method of claim 28, wherein the transmission code comprises a network protocol transmission code. 32. The method of claim 28 further comprising: receiving configuration information, the configuration information including information associated with the channel control system. 33. The method of claim 28, wherein the channel control system is configured on at least one of a television, a set-top box, and a digital video recorder. 34. The method of claim 28, wherein the television function comprises selecting a television channel for the channel control system. 35. The method of claim 34, wherein the television channel includes digitally-distributed television channels obtained through online streaming. 36. The method of claim 28, wherein the television function identifier is based on the television service provider identifier. 37. The method of claim 36, wherein the television service provider identifier is selected from a set of television service provider identifiers based on an association of the television service provider identifier with a television service provider operating at the location associated with the location identifier. 38. The method of claim 28, wherein receiving a television function identifier further comprises: transmitting a television service provider identifier; receiving electronic program guide information associated with the television service provider identifier; and wherein the television function identifier is based on the electronic program guide information. | 2,400 |
9,498 | 9,498 | 16,805,608 | 2,454 | A method and apparatus generate and process transport packets. A method of processing a transport packet at receiving entity includes identifying, in response to receiving the transport packet, a payload type based on a field indicating the payload type in a packet header for the transport packet. The method also includes identifying, in response to identifying that the payload type is a streaming mode payload type, a delivery data unit type of DU data in the transport packet based on a field indicating the delivery data unit type in a streaming mode payload header for the DU data. Additionally, the method includes processing the DU data according to the identified delivery data unit type. | 1. A method of transmitting media contents, the method comprising:
identifying at least one media processing unit (MPU) comprising one or more media fragment units (MFUs) based on media data of the media contents; and transmitting a transport packet including a packet header and a payload comprising payload data generated from the at least one MPU, wherein the packet header comprises a type field indicating a type of the payload data and a random access point (RAP) flag indicating that the payload contains a RAP to a data stream of a media data type, wherein, in case that the type field is set to a first value indicating that the payload data is a media-aware fragment of the MPU, the payload consists of a first payload header for a MPU mode prior to the payload data, the first payload header comprising a data type field indicating a fragment type of the payload data, a fragmentation indicator (f_i) comprising information about fragmentation of the payload data, an aggregation flag (A) indicating that more than one delivery data unit is in the payload, and a fragment counter (frag_count) indicating a number of payload containing fragments of a same delivery data unit succeeding the payload, and wherein, in case that the type field is set to a second value indicating that the payload data is a generic object including the MPU completely, the payload consists of a second payload header for a generic file delivery (GFD) mode prior to the payload data, the second payload header comprising a L field indicating that the transport packet is a last delivered packet of the generic object, a B field indicating that the transport packet comprising a last byte of the generic object, a code point field indicating an opaque identifier that is passed a packet payload decoder to convey information on the payload, and a start offset indicating a location of the payload data in the generic object. 2. The method of claim 1, wherein the generic object in the payload data comprises a complete MPU. 3. The method of claim 1, wherein the fragment type indicated by the data type field is one of MPU metadata, movie fragment metadata, and MFU. | A method and apparatus generate and process transport packets. A method of processing a transport packet at receiving entity includes identifying, in response to receiving the transport packet, a payload type based on a field indicating the payload type in a packet header for the transport packet. The method also includes identifying, in response to identifying that the payload type is a streaming mode payload type, a delivery data unit type of DU data in the transport packet based on a field indicating the delivery data unit type in a streaming mode payload header for the DU data. Additionally, the method includes processing the DU data according to the identified delivery data unit type.1. A method of transmitting media contents, the method comprising:
identifying at least one media processing unit (MPU) comprising one or more media fragment units (MFUs) based on media data of the media contents; and transmitting a transport packet including a packet header and a payload comprising payload data generated from the at least one MPU, wherein the packet header comprises a type field indicating a type of the payload data and a random access point (RAP) flag indicating that the payload contains a RAP to a data stream of a media data type, wherein, in case that the type field is set to a first value indicating that the payload data is a media-aware fragment of the MPU, the payload consists of a first payload header for a MPU mode prior to the payload data, the first payload header comprising a data type field indicating a fragment type of the payload data, a fragmentation indicator (f_i) comprising information about fragmentation of the payload data, an aggregation flag (A) indicating that more than one delivery data unit is in the payload, and a fragment counter (frag_count) indicating a number of payload containing fragments of a same delivery data unit succeeding the payload, and wherein, in case that the type field is set to a second value indicating that the payload data is a generic object including the MPU completely, the payload consists of a second payload header for a generic file delivery (GFD) mode prior to the payload data, the second payload header comprising a L field indicating that the transport packet is a last delivered packet of the generic object, a B field indicating that the transport packet comprising a last byte of the generic object, a code point field indicating an opaque identifier that is passed a packet payload decoder to convey information on the payload, and a start offset indicating a location of the payload data in the generic object. 2. The method of claim 1, wherein the generic object in the payload data comprises a complete MPU. 3. The method of claim 1, wherein the fragment type indicated by the data type field is one of MPU metadata, movie fragment metadata, and MFU. | 2,400 |
9,499 | 9,499 | 16,657,919 | 2,454 | A method of migrating a user profile to a virtual desktop infrastructure (VDI) system includes enumerating applications installed at an endpoint of a user, retrieving a list of application settings files, determining file and registry locations of user profile data relating to the applications installed at the endpoint from the application settings files, and retrieving the user profile data from the determined file and registry locations and storing the user profile data in a shared storage. When a user logs into a virtual desktop of the VDI system, the user profile data is retrieved from the shared storage and imported into file and registry locations specified by the application settings files of applications that are installed in the virtual desktop. | 1. A method of migrating a user profile to a virtual desktop infrastructure (VDI) system, comprising:
preparing a user profile for migration at an endpoint of a user by:
enumerating applications installed at the endpoint,
retrieving a list of application settings files,
determining file and registry locations of user profile data relating to the applications installed at the endpoint from the application settings files, and
retrieving the user profile data from the determined file and registry locations and storing the user profile data in a shared storage; and
when a user logs into a virtual desktop of the VDI system, retrieving the user profile data from the shared storage and importing the retrieved user profile data into file and registry locations specified by the application settings files of applications that are installed in the virtual desktop. 2. The method of claim 1, wherein preparing the user profile for the migration further comprises:
determining that one or more of the applications installed at the endpoint of the user does not have a corresponding application settings file, and generating an application settings file for each of said one or more of the applications and storing each of the generated application settings files in the shared storage to be used during migration of other users who log in subsequently. 3. The method of claim 1, wherein the virtual desktop is hosted in a virtual machine and a virtual disk for the virtual machine includes a base disk, an application volume, and a writable volume into which the user profile data is imported. 4. The method of claim 3, wherein the base disk and the application volume are shared by other users of the VDI. 5. The method of claim 1, wherein the endpoint is a physical endpoint device. 6. The method of claim 1, wherein the endpoint is a virtual machine. 7. The method of claim 6, wherein the virtual machine is hosting a first virtual desktop of the user, and a virtual disk for the virtual machine includes a base disk, an application volume, and a writable volume from which the user profile data is retrieved. 8. The method of claim 7, wherein the base disk contains an image of a migration tool that is launched when the user logs into the first virtual desktop to execute steps of retrieving the user profile data from the determined file and registry locations and storing the user profile data in the shared storage. 9. (canceled) 10. (canceled) 11. (canceled) 12. (canceled) 13. (canceled) 14. (canceled) 15. A computer system comprising:
an endpoint of a user, wherein the endpoint has applications installed therein and a processor configured to carry out a method of preparing a user profile for migration from the endpoint to a virtual desktop infrastructure (VDI) system, said method comprising:
enumerating applications installed at the endpoint,
retrieving a list of application settings files,
determining file and registry locations of user profile data relating to the applications installed at the endpoint from the application settings files, and
retrieving the user profile data from the determined file and registry locations and storing the user profile data in a shared storage; and
a VDI system having a virtual machine hosting a virtual desktop of the user, the virtual desktop having applications installed therein and the virtual machine being configured to:
when the user logs into the virtual desktop, retrieve the user profile data from the shared storage and import the retrieved user profile data into file and registry locations specified by the application settings files of the applications that are installed in the virtual desktop. 16. The computer system of claim 15, wherein the method of preparing the user profile for the migration further comprises:
determining that one or more of the applications installed at the endpoint of the user does not have a corresponding application settings file, and generating an application settings file for each of said one or more of the applications and storing each of the generated application settings files in the shared storage to be used during migration of other users who log in subsequently. 17. The computer system of claim 15, wherein the endpoint is a physical endpoint device. 18. The computer system of claim 15, wherein the endpoint is a first virtual machine. 19. The computer system of claim 18, wherein the first virtual machine is hosting a first virtual desktop of the user, and a virtual disk for the first virtual machine includes a base disk, an application volume, and a writable volume from which the user profile data is retrieved. 20. The computer system of claim 19, wherein the base disk contains an image of a migration tool that is launched when the user logs into the virtual desktop to execute steps of retrieving the user profile data from the determined file and registry locations and storing the user profile data in the shared storage. | A method of migrating a user profile to a virtual desktop infrastructure (VDI) system includes enumerating applications installed at an endpoint of a user, retrieving a list of application settings files, determining file and registry locations of user profile data relating to the applications installed at the endpoint from the application settings files, and retrieving the user profile data from the determined file and registry locations and storing the user profile data in a shared storage. When a user logs into a virtual desktop of the VDI system, the user profile data is retrieved from the shared storage and imported into file and registry locations specified by the application settings files of applications that are installed in the virtual desktop.1. A method of migrating a user profile to a virtual desktop infrastructure (VDI) system, comprising:
preparing a user profile for migration at an endpoint of a user by:
enumerating applications installed at the endpoint,
retrieving a list of application settings files,
determining file and registry locations of user profile data relating to the applications installed at the endpoint from the application settings files, and
retrieving the user profile data from the determined file and registry locations and storing the user profile data in a shared storage; and
when a user logs into a virtual desktop of the VDI system, retrieving the user profile data from the shared storage and importing the retrieved user profile data into file and registry locations specified by the application settings files of applications that are installed in the virtual desktop. 2. The method of claim 1, wherein preparing the user profile for the migration further comprises:
determining that one or more of the applications installed at the endpoint of the user does not have a corresponding application settings file, and generating an application settings file for each of said one or more of the applications and storing each of the generated application settings files in the shared storage to be used during migration of other users who log in subsequently. 3. The method of claim 1, wherein the virtual desktop is hosted in a virtual machine and a virtual disk for the virtual machine includes a base disk, an application volume, and a writable volume into which the user profile data is imported. 4. The method of claim 3, wherein the base disk and the application volume are shared by other users of the VDI. 5. The method of claim 1, wherein the endpoint is a physical endpoint device. 6. The method of claim 1, wherein the endpoint is a virtual machine. 7. The method of claim 6, wherein the virtual machine is hosting a first virtual desktop of the user, and a virtual disk for the virtual machine includes a base disk, an application volume, and a writable volume from which the user profile data is retrieved. 8. The method of claim 7, wherein the base disk contains an image of a migration tool that is launched when the user logs into the first virtual desktop to execute steps of retrieving the user profile data from the determined file and registry locations and storing the user profile data in the shared storage. 9. (canceled) 10. (canceled) 11. (canceled) 12. (canceled) 13. (canceled) 14. (canceled) 15. A computer system comprising:
an endpoint of a user, wherein the endpoint has applications installed therein and a processor configured to carry out a method of preparing a user profile for migration from the endpoint to a virtual desktop infrastructure (VDI) system, said method comprising:
enumerating applications installed at the endpoint,
retrieving a list of application settings files,
determining file and registry locations of user profile data relating to the applications installed at the endpoint from the application settings files, and
retrieving the user profile data from the determined file and registry locations and storing the user profile data in a shared storage; and
a VDI system having a virtual machine hosting a virtual desktop of the user, the virtual desktop having applications installed therein and the virtual machine being configured to:
when the user logs into the virtual desktop, retrieve the user profile data from the shared storage and import the retrieved user profile data into file and registry locations specified by the application settings files of the applications that are installed in the virtual desktop. 16. The computer system of claim 15, wherein the method of preparing the user profile for the migration further comprises:
determining that one or more of the applications installed at the endpoint of the user does not have a corresponding application settings file, and generating an application settings file for each of said one or more of the applications and storing each of the generated application settings files in the shared storage to be used during migration of other users who log in subsequently. 17. The computer system of claim 15, wherein the endpoint is a physical endpoint device. 18. The computer system of claim 15, wherein the endpoint is a first virtual machine. 19. The computer system of claim 18, wherein the first virtual machine is hosting a first virtual desktop of the user, and a virtual disk for the first virtual machine includes a base disk, an application volume, and a writable volume from which the user profile data is retrieved. 20. The computer system of claim 19, wherein the base disk contains an image of a migration tool that is launched when the user logs into the virtual desktop to execute steps of retrieving the user profile data from the determined file and registry locations and storing the user profile data in the shared storage. | 2,400 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.