Abstract: The present invention provides a novel method for hierarchy of preplanned protected path for both node and link failure in the realm of Carrier Ethernet Technology. In the event of failure in a hierarchy, the traffic is switched from work (primary) path to protected (secondary) path. If such path does not exist within a given hierarchy then traffic is routed through multiple hierarchies until SLA is met or no path exists. Hierarchies make the network fault resilient.

Abstract: Embodiments disclosed herein relate to wireless communications, and more particularly to reducing interference in wireless communications. The principal object of this invention is to co-ordinate between two or more communication radios, present within the same device or a plurality of devices present close to each other, without interfering with other non-interfering devices. Embodiments disclosed herein disclose a scheme for reducing interference between any licensed and/or unlicensed radio.

Abstract: A mobile social networking platform including a system and method for cellular communications and accessing services using cellular communications. The system and method enable any mobile device user having a mobile station (MS) with minimal functionality to SMS to access a social network without installing any additional software on the MS. The system and method also enable the mobile user to access Location Based Services even if the network provides location information, without specifically requiring a GPS/GPRS enabled MS.

Abstract: Differentiating wireless uplink bandwidth request by connection priority. Embodiments herein relate to wireless communications, and more particularly to bandwidth management in wireless communications. Embodiments herein focus on multiplexing bandwidth requests on a common random access channel; specifically on contention resolution protocols for a common random access channel. Embodiments herein propose a differentiated back-off timer scheme to address the problems of QoS insensitivity and delay inequity, a set of back-off parameters to implement this scheme and a method of implementing existing well-known back-off strategies within this scheme's framework.

Abstract: The present invention provides a novel method for hierarchy of preplanned protected path for both node and link failure in the realm of Carrier Ethernet Technology. In the event of failure in a hierarchy, the traffic is switched from work (primary) path to protected (secondary) path. If such path does not exist within a given hierarchy then traffic is routed through multiple hierarchies until SLA is met YES or no path exists. Hierarchies make the network fault resilient.

Abstract: This invention is related to a method for Fast Connectivity Fault Management (CFM) of a service-network in the realm of Carrier Ethernet, comprises steps of: learning spanning tree topology of the service-network, exchanging Fast Connectivity Check Messages (Fast-CCM)s between the adjacent service-nodes of the tree, terminating the Fast-CCMs so received, to learn the fault, in the service-network, upon failure to receive a Fast-CCM through a service-port, and pro-actively notifying the fault by service nodes on either side of the faulty service-network.

Abstract: The present invention provides an improved transport protocol for lossy networks. This is accomplished by using computationally efficient techniques to manage invoking congestion control mechanisms to control the transmitted packets in lossy networks. The improved transport protocol receives multiple packets including a header and an associated sequence number. The network is monitored for congestion caused by the received packets and marks the header of some of the packets with an impending congestion indication, based on the outcome of the monitoring. The packets are then transmitted, and a receiver then returns acknowledgements of receipt of each of the transmitted packets. Each of the received acknowledgements includes an associated sequence number and any impending congestion indication assigned to the packet. The protocol monitors each of the received acknowledgements, and based on the outcome of the monitoring, invokes a congestion control mechanism to improve the performance of the transport protocol.

Abstract: The present invention provides an improved transport protocol for lossy networks. This is accomplished by using computationally efficient techniques to manage invoking congestion control mechanisms to control the transmitted packets in lossy networks. The improved transport protocol receives multiple packets including a header and an associated sequence number. The network is monitored for congestion caused by the received packets and marks the header of some of the packets with an impending congestion indication, based on the outcome of the monitoring. The packets are then transmitted, and a receiver then returns acknowledgements of receipt of each of the transmitted packets. Each of the received acknowledgements includes an associated sequence number and any impending congestion indication assigned to the packet. The protocol monitors each of the received acknowledgements, and based on the outcome of the monitoring, invokes a congestion control mechanism to improve the performance of the transport protocol.