Patent application number | Description | Published |
20090323640 | FAIR RESOURCE SHARING IN WIRELESS COMMUNICATIONS - Providing for fair resource sharing among wireless nodes in a wireless communication environment is described herein. By way of example, fairness can comprise establishing a set of resource sharing credits for wireless nodes. By expending credits, a node can borrow a resource of another node, to enable or enhance operation of the borrowing node. Credits for the borrowing node are decreased based on consumption of a shared resource, or credits for the lending node are increased based on such consumption, or both. Once an amount of credits expires, a node can be restricted from borrowing further resources until enough resources are lent to build up a suitable amount of credits. Accordingly, fairness can comprise correlating shared resource consumption with shared resource provisioning, to encourage participation in cooperative wireless communications. | 12-31-2009 |
20090325479 | RELAY ANTENNA INDEXING FOR SHARED ANTENNA COMMUNICATION - Providing for distributed processing for a set of wireless communication devices to implement distributed, multi-antenna communication via one or more of the devices is described herein. By way of example, a relay link can be established between one or more wireless transceivers. The link can be utilized to distribute an indexing parameter to a remote transceiver. The indexing parameter can be employed to identify a set of index-specific instructions configured for a particular wireless node of a network. Based on the instructions and indexing parameter, such transceiver can locally compute and transmit, or receive and decode, a stream of traffic data for the multi-antenna communication. Thus, for instance, a P-P link between UTs can be employed to implement increased throughput and reduced interference benefits of multi-antenna communication for unplanned configurations of mobile devices. | 12-31-2009 |
20090325480 | METHOD AND APPARATUS FOR SELECTING AND PROCESSING SIGNALS FROM A SOURCE STATION AND RELAY STATIONS - Techniques for selecting and processing signals from different stations in a wireless network are described. A destination station may receive a direct signal from a source station and at least one relay signal from at least one relay station. The destination station may determine metrics for the source and relay stations, e.g., based on pilots received from these stations. The destination station may select at least one signal to process from among the direct and relay signals based on the metrics for the source and relay stations. The destination station may select the direct signal if the metric for the source station exceeds a threshold. The destination station may select the relay signal from each relay station having a metric exceeding at least one threshold. The destination station may process the at least one selected signal to recover a transmission sent by the source station to the destination station. | 12-31-2009 |
20100002656 | OPPORTUNISTIC RELAY SCHEDULING IN WIRELESS COMMUNICATIONS - Systems and methodologies are described that facilitate providing opportunistic relay node communication based on scheduling of other communications in a wireless network. In particular, a relay node can maintain a backhaul link with an access point and an access link with a mobile device to facilitate communicating information therebetween. Time slots during which the backhaul link is active can be determined and avoided during scheduling access link communications with the mobile device. Furthermore, resource assignments from the access point to the mobile device can be monitored and decoded such that time slots associated therewith can also be determined and avoided. Thus, the relay node can communicate with mobile devices in time slots where the backhaul link is inactive and/or the mobile devices are not occupied communicating directly with the access point. | 01-07-2010 |
20100022263 | SYSTEM AND METHOD FOR NETWORK MANAGEMENT - Various systems and methods for network management are disclosed. In one embodiment, a network management system comprises a receiver for receiving data from a plurality of entities, including base stations and/or subscriber handsets, a processor for generating a network map or a recommendation based on the received data, a display device for displaying the network map or recommendation, and a transmitter for transmitting instructions based on the recommendation. | 01-28-2010 |
20120289248 | SYSTEM AND METHOD FOR NETWORK MANAGEMENT - Various systems and methods for network management are disclosed. In one embodiment, a network management system comprises a receiver for receiving data from a plurality of entities, including base stations and/or subscriber handsets, a processor for generating a network map or a recommendation based on the received data, a display device for displaying the network map or recommendation, and a transmitter for transmitting instructions based on the recommendation. | 11-15-2012 |
20120290720 | SYSTEM AND METHOD FOR NETWORK MANAGEMENT - Various systems and methods for network management are disclosed. In one embodiment, a network management system comprises a receiver for receiving data from a plurality of entities, including base stations and/or subscriber handsets, a processor for generating a network map or a recommendation based on the received data, a display device for displaying the network map or recommendation, and a transmitter for transmitting instructions based on the recommendation. | 11-15-2012 |
20120307765 | Fair Resource Sharing in Wireless Communication - Providing for fair resource sharing among wireless nodes in a wireless communication environment is described herein. By way of example, fairness can comprise establishing a set of resource sharing credits for wireless nodes. By expending credits, a node can borrow a resource of another node, to enable or enhance operation of the borrowing node. Credits for the borrowing node are decreased based on consumption of a shared resource, or credits for the lending node are increased based on such consumption, or both. Once an amount of credits expires, a node can be restricted from borrowing further resources until enough resources are lent to build up a suitable amount of credits. Accordingly, fairness can comprise correlating shared resource consumption with shared resource provisioning, to encourage participation in cooperative wireless communications. | 12-06-2012 |
Patent application number | Description | Published |
20090019685 | Composite Structure having Ceramic Truss Core and Method for Making the Same - A CMC sandwich used to fabricate CMC structures includes facesheets bonded to a core reinforced with a ceramic truss comprising an array of CMC pins. The binder matrix in the ends of the pins is removed, leaving exposed, flexible ceramic fibers. The exposed ceramic fibers are bent so as to extend parallel to the facesheets, and are bonded to one or more plies of the facesheets. The binder matrix in the ends of the ceramic pins may be removed by mechanical or chemical processes. | 01-22-2009 |
20090035510 | COMPOSITE STRUCTURE HAVING REINFORCED CORE AND METHOD OF MAKING SAME - A polymer-based composite sandwich includes a core bonded between fiber reinforced resin facesheets. The core includes a truss formed by groups of composite pins held in a low density foam. The pins in each group intersect to form nodes adjacent to one of the facesheets. The ends of the pins extend parallel and are bonded to the facesheets. | 02-05-2009 |
20090263627 | Exhaust Washed Structure And Associated Composite Structure And Method Of Fabrication - A composite structure and an associated exhaust washed structure are provided which may be formed of ceramic matrix composite (CMC) materials. A method of fabricating a composite structure which may include the CMC material is also provided. A composite structure may include a corrugated septum extending in a lengthwise direction. The composite structure may also include a flute within which the corrugated septum is disposed to form, for example, a partitioned flute assembly. | 10-22-2009 |
20100151189 | Composite Structure Having Reinforced Core and Method of Making Same - A polymer-based composite sandwich includes a reinforced core bonded between a pair of composite facesheets. The core includes a truss formed by groups of composite pins held in place by a layer of structural foam. The pins in the groups are radially arranged around nodes. The ends of the pins are splayed and sandwiched between the foam layer and the facesheets. | 06-17-2010 |
20120066882 | EXHAUST WASHED STRUCTURE AND ASSOCIATED COMPOSITE STRUCTURE AND METHOD OF FABRICATION - A composite structure and an associated exhaust washed structure are provided which may be formed of ceramic matrix composite (CMC) materials. A method of fabricating a composite structure which may include the CMC material is also provided. A composite structure may include a corrugated septum extending in a lengthwise direction. The composite structure may also include a flute within which the corrugated septum is disposed to form, for example, a partitioned flute assembly. | 03-22-2012 |
20130230690 | Composite Structure and Method of Making the Same - A polymer-based composite sandwich includes a reinforced core bonded between a pair of composite facesheets. The core includes a truss formed by groups of composite pins held in place by a layer of structural foam. The pins in the groups are radially arranged around nodes. The ends of the pins are splayed and sandwiched between the foam layer and the facesheets. | 09-05-2013 |
Patent application number | Description | Published |
20130013535 | Method for Summarizing Event-Related Texts To Answer Search Queries - A method and apparatus for receiving training data that comprise a plurality of event-and-time-specific texts that are contextually related to a plurality of events; iteratively processing the training data to generate a modified network model that defines a plurality of states; receiving additional data that comprise a plurality of additional event-and-time-specific texts that are contextually related to a particular event; processing the additional data by applying the modified network model to the additional data to identify, within the plurality of additional event-and-time specific texts, a particular set of texts that belong to a particular state of the plurality of states; identifying, within the particular set of texts, one or more texts that are most representative of all texts in the particular set of texts that belong to the particular state; wherein the method is performed by one or more special-purpose computing devices. | 01-10-2013 |
20140172820 | METHOD FOR SUMMARIZING EVENT-RELATED TEXTS TO ANSWER SEARCH QUERIES - A method and apparatus for receiving training data that comprise a plurality of event-and-time-specific texts that are contextually related to a plurality of events; iteratively processing the training data to generate a modified network model that defines a plurality of states; receiving additional data that comprise a plurality of additional event-and-time-specific texts that are contextually related to a particular event; processing the additional data by applying the modified network model to the additional data to identify, within the plurality of additional event-and-time specific texts, a particular set of texts that belong to a particular state of the plurality of states; identifying, within the particular set of texts, one or more texts that are most representative of all texts in the particular set of texts that belong to the particular state; wherein the method is performed by one or more special-purpose computing devices. | 06-19-2014 |
20150142721 | Selecting Users to Receive a Recommendation to Establish Connection to an Object in a Social Networking System - A social networking system identifies users to receive a recommendation to establish a connection to an object maintained by the social networking system. The social networking system determines one or more classifiers identifying attributes of users to receive the recommendation based on attributes of users connected to the object and additional users connected to those users. The attributes of an additional user may be weighted by a factor that provides a measure of the overlap between the attributes of the additional user and a user connected to the object. | 05-21-2015 |
20150213370 | LABEL INFERENCE IN A SOCIAL NETWORK - At least one embodiment of this disclosure includes a method of inferring attribute labels for a user in a social networking system based on the user's social connections and user-specified attribute labels in the social networking system. The method can include: establishing variational equations based on attribute labels of nodes in an ego network in a social graph of a social networking system; determining likelihood scores for at least a portion of the attribute labels of neighboring nodes from a focal user node in the ego network based on user-specified attribute labels from the social networking system; and calculating probability distributions of possible attribute labels for the focal user node of the ego network based on the variational equations and the likelihood scores. | 07-30-2015 |
Patent application number | Description | Published |
20130205284 | OWNERSHIP ACQUIRE POLICY SELECTION - There is provided a computer-implemented method of performing ownership acquire policy selection. The method includes compiling an atomic section to generate an instrumented executable. The instrumented executable is configured to generate a runtime abort graph describing a plurality of computer memory accesses made by the instrumented executable. The method also includes selecting each of a plurality of policies based on the runtime abort graph. The plurality of policies include a first policy and a second policy. The first policy is different from the second policy. The method further includes compiling the atomic section to generate a modified executable. The modified executable is configured to perform the computer memory accesses according to the selected policies. | 08-08-2013 |
20130268945 | IDENTIFYING GLOBALLY CONSISTENT STATES IN A MULTITHREADED PROGRAM - In a method of identifying a globally consistent state in a multithreaded program, a plurality of locally consistent states is identified, in which a locally consistent state of a thread comprises a set of memory locations and their corresponding data values accessed between points in the multithreaded program where no locks are held. Globally consistent states are identified based at least in part on the locally consistent states. | 10-10-2013 |
20130290780 | RECOVERY SEGMENTS - In one example, a method for implementing recovery segments includes sending an application message from a parent process executed by a first computing device to a child process executed by a second computing device and identifying a dependency created by the application message. This identified dependency is included in a dependence set of the child process and saved. A checkpoint is generated by the parent process and a checkpoint message that includes dependency information is sent from the parent process to the child process. The child process modifies the dependence set according to the dependency information and generates a second checkpoint that is saved in nonvolatile memory of the second computing device. Upon occurrence of a failure of the parent process, the child process reverts to a most recent checkpoint generated by the child process that does not include the effects of processing an orphan message. | 10-31-2013 |
20140040898 | DISTRIBUTED TRANSACTION PROCESSING - A system includes an initiator and processing nodes. The initiator distributes portions of a transaction among the processing nodes. Each processing node has at least one downstream neighbor to which the processing node sends commit messages. The commit messages include a commit status of the processing node. The downstream neighbor is also a processing node. | 02-06-2014 |
20140067761 | LOGGING MODIFICATIONS TO A VARIABLE IN PERSISTENT MEMORY - A log entry is created in persistent memory that represents a modification to a variable that resides in persistent memory. A log entry is created in persistent memory that represents a synchronization operation. A program-order based dynamic ordering relationship is created between two successive log entries within an execution entity. A synchronization-order based dynamic ordering relationship is created between two log entries corresponding to synchronization operations in concurrently executing distinct execution entities of said execution instance. | 03-06-2014 |
20140281269 | NON-VOLATILE MEMORY UPDATE TRACKING - A technique includes performing an update to a location of a non-volatile memory. The update is created by execution of at least one machine executable instruction of a plurality of machine executable instructions. The technique includes using a processor-based machine to selectively track the update to allow recovery of the execution to a given consistency point based at least in part on whether the machine executable instruction(s) creating the update are located within a synchronized section of the plurality of machine executable instructions. | 09-18-2014 |
20140359201 | PERSISTENT MEMORY GARBAGE COLLECTION - A technique includes identifying a dependency between a first persistent memory region and at least one other persistent memory region. The technique includes using a process having access to the first persistent memory region to selectively perform garbage collection for the first persistent memory region based at least in part on whether the process has access to the other persistent memory region(s) from which the first persistent memory region depends. | 12-04-2014 |
Patent application number | Description | Published |
20140129783 | SYSTEM AND METHOD FOR ALLOCATING MEMORY OF DIFFERING PROPERTIES TO SHARED DATA OBJECTS - A system and method for allocating shared memory of differing properties to shared data objects and a hybrid stack data structure. In one embodiment, the system includes: (1) a hybrid stack creator configured to create, in the shared memory, a hybrid stack data structure having a lower portion having a more favorable property and a higher portion having a less favorable property and (2) a data object allocator associated with the hybrid stack creator and configured to allocate storage for shared data object in the lower portion if the lower portion has a sufficient remaining capacity to contain the shared data object and alternatively allocate storage for the shared data object in the higher portion if the lower portion has an insufficient remaining capacity to contain the shared data object. | 05-08-2014 |
20140129812 | SYSTEM AND METHOD FOR EXECUTING SEQUENTIAL CODE USING A GROUP OF HREADS AND SINGLE-INSTRUCTION, MULTIPLE-THREAD PROCESSOR INCORPORATING THE SAME - A system and method for executing sequential code in the context of a single-instruction, multiple-thread (SIMT) processor. In one embodiment, the system includes: (1) a pipeline control unit operable to create a group of counterpart threads of the sequential code, one of the counterpart threads being a master thread, remaining ones of the counterpart threads being slave threads and (2) lanes operable to: (2 | 05-08-2014 |
20140130021 | SYSTEM AND METHOD FOR TRANSLATING PROGRAM FUNCTIONS FOR CORRECT HANDLING OF LOCAL-SCOPE VARIABLES AND COMPUTING SYSTEM INCORPORATING THE SAME - A system and method of translating functions of a program. In one embodiment, the system includes: (1) a local-scope variable identifier operable to identify local-scope variables employed in the at least some of the functions as being either thread-shared local-scope variables or thread-private local-scope variables and (2) a function translator associated with the local-scope variable identifier and operable to translate the at least some of the functions to cause thread-shared memory to be employed to store the thread-shared local-scope variables and thread-private memory to be employed to store the thread-private local-scope variables. | 05-08-2014 |
20140130052 | SYSTEM AND METHOD FOR COMPILING OR RUNTIME EXECUTING A FORK-JOIN DATA PARALLEL PROGRAM WITH FUNCTION CALLS ON A SINGLE-INSTRUCTION-MULTIPLE-THREAD PROCESSOR - A system and method for compiling or runtime executing a fork-join data parallel program with function calls. In one embodiment, the system includes: (1) a partitioner operable to partition groups into a master group and at least one worker group and (2) a thread designator associated with the partitioner and operable to designate only one thread from the master group for execution and all threads in the at least one worker group for execution. | 05-08-2014 |
Patent application number | Description | Published |
20140222550 | Advertising with Video Ad Creatives - The serving of advertisements with (e.g., on) video documents may be improved in a number of ways. For example, a system may (a) accept information defining at least one ad spot associated with at least one instance of an video document, (b) accept offers to have advertisements served in the ad spot(s), and (c) arbitrate among competing advertisements, using at least the offers, to determine at least one advertisement to be served in that ad spot(s). As another example, a system may (a) accept relevance information for an advertisement, (b) determine at least one video document using the accepted relevance information, (c) present information about the video document(s) to an advertiser associated with the advertisement, and (d) accept, from the advertiser, an offer to have its advertisement served with at least one of the video document(s) accepted. As yet another example, a system may (a) accept relevance information for an video document, (b) determine a plurality of advertisements relevant to the video document using the relevance information and serving constraints of the advertisements, and (c) select at least one of the determined relevant advertisements to be served with the video document. Examples of video documents include video files published on the Internet, television programs, live or recorded talk shows, video-voice mail, segments of an video conversation, etc. | 08-07-2014 |
20150154661 | Advertising with video ad creatives - The serving of advertisements with (e.g., on) video documents may be improved in a number of ways. For example, a system may (a) accept information defining at least one ad spot associated with at least one instance of an video document, (b) accept offers to have advertisements served in the ad spot(s), and (c) arbitrate among competing advertisements, using at least the offers, to determine at least one advertisement to be served in that ad spot(s). As another example, a system may (a) accept relevance information for an advertisement, (b) determine at least one video document using the accepted relevance information, (c) present information about the video document(s) to an advertiser associated with the advertisement, and (d) accept, from the advertiser, an offer to have its advertisement served with at least one of the video document(s) accepted. As yet another example, a system may (a) accept relevance information for an video document, (b) determine a plurality of advertisements relevant to the video document using the relevance information and serving constraints of the advertisements, and (c) select at least one of the determined relevant advertisements to be served with the video document. Examples of video documents include video files published on the Internet, television programs, live or recorded talk shows, video-voice mail, segments of an video conversation, etc. | 06-04-2015 |
20150156547 | ADVERTISING WITH VIDEO AD CREATIVES - The serving of advertisements with (e.g., on) video documents may be improved in a number of ways. For example, a system may (a) accept information defining at least one ad spot associated with at least one instance of an video document, (b) accept offers to have advertisements served in the ad spot(s), and (c) arbitrate among competing advertisements, using at least the offers, to determine at least one advertisement to be served in that ad spot(s). As another example, a system may (a) accept relevance information for an advertisement, (b) determine at least one video document using the accepted relevance information, (c) present information about the video document(s) to an advertiser associated with the advertisement, and (d) accept, from the advertiser, an offer to have its advertisement served with at least one of the video document(s) accepted. As yet another example, a system may (a) accept relevance information for an video document, (b) determine a plurality of advertisements relevant to the video document using the relevance information and serving constraints of the advertisements, and (c) select at least one of the determined relevant advertisements to be served with the video document. Examples of video documents include video files published on the Internet, television programs, live or recorded talk shows, video-voice mail, segments of an video conversation, etc. | 06-04-2015 |
Patent application number | Description | Published |
20090046601 | TOPOLOGY CONTROLLED DISCOVERY FOR NEXT HOP DETERMINATION - In a particular embodiment of the present invention, a particular node in an ad hoc network is configured with a desirable number of neighbor nodes and equipped with a transmission power level hierarchy. The particular node may adjust a transmission power level to a different level in the transmission power level hierarchy, based on a number of responses received from neighbor nodes after the particular node broadcasts a request at current transmission power level. This adjustment process is repeated until the particular node acquires a desirable number of neighbor nodes. | 02-19-2009 |
20090046712 | PREDICTIVE ROUTING TECHNIQUE IN THE AD HOC WIRELESS NETWORK - In a particular embodiment of the present invention, a forwarding node in an ad hoc network collects sets of node information pertaining to its neighbor nodes. An example of a type of node information is history information that indicates previous time periods during which a neighbor node has been available for communication. Other types of node information may include proximity information that indicates how far a neighbor node is from the forwarding node. In selecting a routing path, the forwarding node takes into account information collected in the sets of node information. A routing path can be selected to include a neighbor node having the highest probability to be available for communication. Additionally or alternatively, a routing path may be selected to minimize the power transmission level required for the forwarding node to forward data packets. | 02-19-2009 |
20120210136 | ENABLING SECURE ACCESS TO SENSOR NETWORK INFRASTRUCTURE USING MULTIPLE INTERFACES AND APPLICATION-BASED GROUP KEY SELECTION - A method implemented in a network element for controlling access to a set of resources on a per-application basis, the set of resources including subsets of the resources where each subset is accessible to a set of one or more applications through the use of a separate group key, the method comprising the steps of receiving an authentication request from a node communicatively connected to the network element through a first network interface of the network element, the authentication request including a certificate for the node, validating the certificate for the node, determining that the certificate has been authorized for the set of one or more applications through a query of a certificate database, retrieving each group key that corresponds to the set of one or more applications through a query of a group key database, and returning each group key retrieved from the group key database to the node. | 08-16-2012 |
20120287932 | Label Switched Routing To Connect Low Power Network Domains - A network element is described. In one embodiment includes receiving a packet from the host in the first domain at the network element in the first domain, the packet including a destination address to the host in the second domain, the destination address being formed by replacing an Interface Identifier of an IP address by a second domain label and a shortened Media Access Control (MAC) address, the second domain label identifying the second domain. A routing label and the shortened MAC address are attached to the received packet, and the packet is sent on a label switched path indicated by the label to the second domain. | 11-15-2012 |
20130117434 | SERVICE ASSURANCE USING NETWORK MEASUREMENT TRIGGERS - A method performed in a network element for reacting to communication performance measurements that fall outside of communication performance thresholds. The network element generates a communication performance measurement between a first endpoint and a second endpoint, wherein each endpoint is a point of communication in the network and at least the first endpoint resides on the network element. The network element retrieves a communication performance threshold and determines whether the communication performance measurement falls outside of the communication performance threshold. The network element generates a trigger associated with the communication performance measurement and the communication performance threshold when it is determined that the communication performance measurement falls outside of the communication performance threshold. The network element retrieves a registered handler associated with the generated trigger to indicate that the registered handler requires execution in response to the generated trigger and executes the registered handler. | 05-09-2013 |
20140169183 | METHOD AND APPARATUS FOR AUGMENTING TWAMP - According to another embodiment of the invention, TWAMP path discovery is performed to determine a sequence of IP addresses of a forward direction TWAMP E2E path to be traversed by two different TWAMP test sessions between a Sender and a Reflector. Then, additional TWAMP test request packets are transmitted for the different TWAMP test sessions; and TWAMP test reply messages are received responsive to respective ones of the TWAMP test request packets. Responsive to the TWAMP test reply messages, a PM is determined that is specific to the different sequences of IP addresses of the forward direction TWAMP E2E paths traversed by the two different TWAMP test sessions. | 06-19-2014 |
20140301215 | PACKET INTERCEPTION AND TIMESTAMPING FOR ERROR ESTIMATION IN ACTIVE MEASUREMENT PROTOCOLS - A method in a network device. The method is one of estimating a time delay between when a software timestamp is generated for an active measurement protocol test packet and when the active measurement protocol test packet is transmitted from the network device onto a link. The method includes generating an error estimation packet, generating a software timestamp (ts) for the error estimation packet, and transmitting the error estimation packet toward a network interface. The method also includes intercepting the error estimation packet before it is transmitted from the network device onto the link, and generating an interception timestamp (ti) for the error estimation packet after intercepting the error estimation packet. The time delay is estimated based on a difference between the interception timestamp and the software timestamp. | 10-09-2014 |
20150244618 | BASEBAND UNIT (BBU) IMPLEMENTATION FOR FACILITATING 6LOWPAN DATA ACCESS - A scheme for providing access to 6LoWPAN data in a wireless access network. In one embodiment, a Digital Unit (DU) of the wireless access network is provided with IP bridging functionality for packaging 6LO data as a control channel message. When the DU element receives 6LO data from an external router, the data is packaged in a format specified for a control channel associated with a CPRI link coupling to a Radio Unit (RU). The bridging functionality is operative to transmit the control channel message (including the packaged 6LO data packets) to the RU element based on an address mapping between the destination IP address of the 6LO data packets and an address of the 6LO endpoint coupled to the RU element. | 08-27-2015 |
20150244840 | ACTIVE ANTENNA ELEMENT (AAE) IMPLEMENTATION FOR FACILITATING 6LOWPAN DATA ACCESS - A scheme for providing access to 6LoWPAN data in a wireless access network comprising a Digital Unit (DU) coupled to one or more Radio Units (RU) via CPRI links, each RU in turn coupled to one or more radio dot (RD) elements via Ethernet cable links. In one embodiment, an RD element includes a cable front-end interfaced with the Ethernet cable link, a radio front-end interfaced between the cable front-end and an antenna or a suitable access point. A sensor component may be included that is configured to generate sensor data with respect to a measurement variable, which sensor data may be packaged in a 6LoWPAN data format for transmission to the RU element coupled to the RD element. | 08-27-2015 |
20150245245 | PICO-RRU-BASED NETWORK IMPLEMENTATION FOR FACILITATING 6LOWPAN DATA ACCESS - A scheme for providing access to 6LoWPAN data in a Pico-Remote Radio Unit (PRRU)-based wireless access network. In one embodiment, the PRRU network comprises a Baseband Unit (BBU) coupled to one or more remote Radio Hub (RHUB) elements via a first set of CPRI links, each RHUB element in turn coupled to one or more PRRU elements via corresponding second sets of CPRI links. The BBU element comprises an interface for communicating 6LoWPAN data to and from a router coupled to an IPv6 network. The BBU element also includes a bridging functionality operative to determine endpoint PRRU elements' addresses and corresponding RHUB elements' addresses by querying an address mapping database. | 08-27-2015 |
20150245332 | SYSTEMS, METHODS, APPARATUSES, DEVICES AND ASSOCIATED COMPUTER-READABLE MEDIA FOR PROVIDING 6LOWPAN DATA ACCESS - A scheme for providing access to 6LoWPAN data in a wireless access network. In one embodiment, a Radio Unit (RU) of the access network is provided with IP bridging functionality for packaging 6LO data as a control channel message. When the RU element receives 6LO data from an external router, the data is packaged in a format specified for a control channel associated with an Ethernet cable link coupling the RU element to a 6LO endpoint of the access network. The bridging functionality is operative to transmit the control channel message (including the packaged 6LO data packets) to the 6LO endpoint based on an address mapping between the destination IP address of the 6LO data packets and the 6LO endpoint's address. | 08-27-2015 |