Title of Invention

A METHOD OF PERFORMING RELIABLE DATA TRANSFER IN COMMUNICATION SYSTEMS.

Abstract The present invention generally relates to telecommunication systems, and more particularly to a technique for achieving best-effort and reliable delivery, together with fragmentation and framing. The invention includes procedures for re-transmission, fragmentation and framing, while operating with a single sequence space, in a link protocol of a communication system. A single sequence space is utilized and, therefore, a single link protocol for providing best-effort and reliable data transfer is used. At the transmitter, the link protocol re-transmits a missed data packet, while at the receiver, the link protocol re-sequences the missed packet. The link protocol further provides fragmentation, framing and re-assembly of data packets. The fragments may be either a part of a higher layer packet or a complete higher layer jacket. A first field, indicating the type of delivery employed for each packet, is added in the header of the link protocol. The delivery may be Best Effort or Reliable, which is indicated by one bit of information with 0 for denoting Best Effort packet and 1 for Reliable. A second field, indicating the framing information of each higher layer packet is added in the link protocol header. This Segment Info field may include two bits: a First Segment bit, identifying the first segment of the higher layer packet, and, a Last Segment bit, identifying the last segment of the higher layer packet. Another field for Sequence Number is included in each segment of the packet, for identifying missed packets or segments by the receiver. These fields are used by the link protocol for performing fragmentation, re-assembly, framing and retransmissions.
Full Text FIELD OF THE INVENTION
The present invention is in the field of communication technology. It generally relates to transfer of data between a transmitter and a receiver, which are part of a communication system and has a link protocol that provides best effort and reliable delivery mechanisms along with fragmentation and framing. Specifically it falls to a reuse of the link protocol to data transfer, both reliable and best effort, using a single instance of link protocol. More accurately it is a system and method for performing reliable and best effort data transfer in a communication system to perform retransmission, fragmentation and framing using a single sequence space in a link protocol.
BRIEF DESCRIPTION OF RELATED ART
There are sophisticated technologies available in the prior art for data transmission over a communication network. Two modalities of data delivery have known in prior art: best effort delivery (non-reliable data delivery) and reliable data delivery-
US patent titled "Data transmission using common sliding" (US Patent No 7072973) describes a networking protocol that supports the sending of reliable and non-reliable data in a common sliding window. Here the data to be sent is packaged into package or frames, where each frame has a header. Each frame also includes a sequence number, which indicates the order in which the frames are sent. The sender then sends the frame to a recipient over an appropriate communication network, (e.g., UDP, modem, etc.) As the packets are received, the recipient of the packets keeps track of the sequence numbe/s of received packets to determine whether any packets are missing and selectively acknowledges those packets that have been received. The selective acknowledgment is performed using a mask, where each bit in the mask indicates the presence or absence of a packet as an offset
from a reference value. Based on the mask, the sender re-sends non-received reliable packets, and creates a second mask which indicates non-reliable non- received packets that will not be re-sent. As per the prior art, the system employ the link protocol to attain the reliable data delivery by assigning the sequence number which retransmit the missed data units at the transmitter and re-' sequencing of data units if received out of order. The link protocol is often used
r —— -■
in wireless communication systems due to the foreseen error rate.
One of the major disadvantage of the above prior art is that the retransmission of the lost packets is undertaken only in the case of a reliable packet. But in the case of a non-reliable packet, the packet is not retransmitted, even if the packet is not received by the recipient.
* —— — —R
Another US patent titled'Methods and Protocol for simultaneous tuning of reliable and non-reliable channels of a single network communication link" (US Patent No 6438603) states an application layer protocol that supports reliable and non-reliable message transfer between a local and remote computer on a shared communication link. In the instant prior art application layer protocol (DP Protocol) uses a non-reliable transport layer protocol to implement both reliable and non-reliable channels over the shared link. When application programs want to send reliable data messages, they designate the data as such, and the application layer protocol sends the data in reliable messages with a request for acknowledgement. When application programs want to send non-critical data, they designate the data as such, and the application layer protocol sends the data in non-reliable messages that are not re-sent when dropped. Though it does not ensure delivery of non-reliable messages, the application layer selectively uses a request to acknowledge the non-reliable messages to gather
■ 1 J
operational data about the link. Acknowledgements are requested in the form of ACKs (Acknowledgement) or NACKs (Negative Acknowledgement) for both reliable and non-reliable packets. The protocol uses requests for acknowledgement for the dual purpose of ensuring reliable delivery for reliable messages and maintaining operational characteristics used to tune the link. In particular, the protocol uses the operational characteristics to detect link
saturation, tp calculate outbound bandwidth, to calculate a wait time for clearing backlogged messages and for adjusting the send rate based on the calculated bandwidth. This scheme enables the protocol to adapt the send rate based on varying link conditions.
Yet another US patent titled "Methods and apparatus for data transmission" (US Patent No. 7072309) describes a communication system, which request retransmission of data and can be either Negative Acknowledgement (NAK) based, or Acknowledgement (ACK) based.
A notable disadvantage of all the above prior art documents is that none of them provides an effective method for retransmission of non-reliable data. In- some of them functionalities of retransmission and fragmentation are performed by two separate link protocols. Each link protocol has its own sequence space, resulting in two sequence spaces for said functionalities. One such example is Signaling Link Protocol used in EVDO (SLP-D and SLP-F).
Another drawback is that the protocol architecture may become complex due to separation of best effort and reliable data transfer. It is also a drawback that in some prior arts, more resources may be required, since fragmentation, framing and reliable data transfer is not considered as the scope of a single sequence space in a link protocol.
r 11 11 *
The present invention has been made to solve the above described problems and therefore preferably has an object to create a link protocol that performs retransmission, fragmentation and framing using single sequence space in a single link protocol instance for both best effort and reliable data transfer.
SUMMARY OF THE INVENTION
The primary objective of the invention is to provide a system and method
for achieving best effort and reliable data delivery in a communication system, together with fragmentation and framing, using a single sequence space in a single protocol-
It is another object of the invention to provide a method for performing reliable and best effort data transfer with fragmentation and framing link protocols used in communication systems.
Further object of this invention is to provide a link protocol with a single sequence space for performing retransmission, fragmentation and framing.
A method for performing reliable and best effort data transfer in a communication system with fragmentation, framing and retransmission using a single sequence space (one instance of link protocol), the method comprising of
a) Fragmentation of data at the transmitter and framing of fragmented data into higher layer characterized in that the header of each framed packet at the transmitter comprises a one-bit delivery type field for indicating the receiver as to whether the data delivery is by best effort data transmission (in which the data need not be buffered for retransmission), or by reliable data transmission in, which the data is buffered for possible retransmission in the event that the receiver does not send an acknowledgement(ACK) or sends a negative acknowledgement (NAK) based on the link configuration; and
b) The receiver identifies, where possible, identify(based on first segment, last
,
segment fields and delivery type of current received packet),the delivery type of missed packets and a determination that the missed packets belong to best
effort data transmission decides not to send NAK if link is configured as NAK
- - • 1 1 ■■ '
based and does not wait for retransmission for those missed packets if link is configured as ACK based.
(i)
The invention also provides a system to perform the best effort data transfer with fragmentation and framing and re-transmission in single link space protocol
It is a feature of the invention that the link protocol re-transmits a missed data packet at the transmitter whereas it re-sequences the missed packet at the receiver.
Another feature of this invention is that the link protocol provides fragmentation, framing and re-assembly of data packets.
It is yet another feature of the invention that the fragments may be either a part of a higher layer packet or a complete higher layer packet-
It is another feature of the invention to provide certain fields in the link protocol for performing fragmentation, re-assembly, framing and retransmissions.
It is another feature of the invention that the first field is added in the header of the link protocol, which indicates the type of delivery employed for each packet.
It is again a feature of the invention that the second field, indicates the
framing information of each higher layer packet
■. ■— ... ■
It is yet another feature of the invention that the field segment info
u
contains, the two bits viz. a first segment bit which identify the first segment of the higher layer packet and a last segment bit, identifying the last segment of the higher layer packet.
It is also a feature of the invention that a field sequence number is included in each segment of the packet, for identifying missed packets or segments by the receiver.
These and other objects, features and advantages of the present invention will become more readily apparent from a reading of the following detailed description taken in conjunction with the drawings in which
BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS Figure 1 depicts Transmitter Procedures in an ACK based link protocol Figure 2 depicts Receiver Procedures in an ACK based link protocol Figure 3 depicts Transmitter Procedures in a NAK based link protocol Figure 4 depicts Receiver Procedures in a NAK based link protocol Figure 5 depicts Identification of missed fragments as Best Effort
DETAILED DESCRIPTION OF THE INVENTION
The preferred embodiments of the present invention will now be explained with reference to the accompanying drawings. It should be understood however that the disclosed embodiments are merely exemplary of the invention, which may be embodied in various forms. The following description and drawings are not to be construed as limiting the invention and numerous specific details are described to provide a thorough understanding of the present invention, as the basis for the claims and as a basis for teaching one skilled in the art how to^ make and/or use the invention. However in certain instances, well-known or conventional details are not described in order not to unnecessarily obscure the present invention in detail.
Before going to the ins and outs of the invention let us see the context in which the invention is used. The invention is used in data transmission over a communication network especially in telephone networking. Its objective is for the best effort and reliable data transfer along with fragmentation and framing in a link protocol over a communication network. It describes the procedures involved for retransmission, fragmentation and framing when operating with a
single sequence space, in a link protocol. The present invention requires only
—■
one sequence space and hence one link protocol to provide best effort and reliable data transfer.
Over a communication network, data transfer is between transmitter and ——
the receiver. In the present invention the transmitter in the link protocol forms one or more fragments with higher layer packet as payload. The higher layer packet is split to multiple fragments if the lower layer transmission capability is less than the higher layer packet size. Each such fragment is assigned a unique sequence number from the same sequence space by the link protocol-
According to the present invention, the manufacturers are placed in an advantageous situation to utilise the particular features present on a single space link protocol for best effort and reliable data transfer over a communication network.
The current invention provides a single link protocol, which performs retransmission at the transmitter and re-sequencing at the receiver for each missed data packet. It also provides fragmentation, framing and re-assembly of data packets. The layer above link protocol, whose data is transferred, is referred as Higher Layer, in the below description. The fragment referred in the below description can be a part of the higher layer packet or a complete higher layer packet. Also link protocol contains a header, which is added to each packet at the transmitter, with information required for retransmission, fragmentation, and framing.
The Delivery Type field is generally filled by the transmitter based on the information provided by the higher layer for each packet. Higher layer could indicate whether the packet needs to be transmitted as a Best Effort or Reliable packet and corresponding values are filled in header of each of the fragment transmitted by the link protocol. First Segment and Last Segment fields are filled by the transmitter based on the position of the fragment in the higher layer packet. The receiver uses the First Segment, Last Segment fields along with the sequence number to re-assemble the complete higher layer packet. The receiver in the link protocol will receive packet in sequence. Receiver assembles the fragments of a packet using First segment and last segment and delivers the packets to layer above link protocol. The receiver cannot assemble the packets if some of the link layer protocol packets are lost-
Similar to method in prior art, a field, Delivery Type, is added in the link protocol header to indicate the type of delivery for each packet, which would be Best Effort or Reliable. The Delivery Type field may be one bit of information taking a value of 0 for denoting Best Effort packet and a value of 1 for identifying that the packet is reliable-
While indicating the framing of information to each higher layer packet, a segment info field is added to the link protocol. The Segment Info field may be 2 bits, one referred as First Segment, for identifying whether the segment is the first segment of the higher layer packet, and another referred as Last Segment, for identifying whether the segment is the last segment of the higher layer packet. A field for Sequence Number is present in each segment of the packet, which is used by the receiver for identifying missed packets or segments. Fields specified herewith are used by the link protocol to perform fragmentation, re- assembly, framing and retransmissions.
The current invention takes advantage of the new method of using single
^
space for retransmission, fragmentation and framing. A single link protocoj instance is sufficient for facilitating both reliable and best effort traffic. While using this, the memory can be reduced and used for other applications and protocol architecture can be simplified.
The transmitter will complete transmitting all the fragments of a higher layer packet before transmission of next higher layer packet. This ensures that the fragments of any best effort and reliable higher layer packet will not be interleaved during transmission..
Referring to Fig 1 depicts Transmitter Procedures in an ACK based link protocol. From FIG1 it can be seen that for reliable data delivery in the higher layer, Link Protocol Data Transmitter starts an ACK timer for each fragment transmitted. The transmitter does not start an ACK timer for fragments of packets, which can be delivered by best effort. For reliable delivery fragments transmitter expects an ACK from the receiver within a period of ACK timer. If an ACK is received from the receiver before the ACK timer expires for a reliable fragment, the ACK timer is stopped and the fragment is not retransmitted. If the transmitter does not receive the ACK for the reliable fragment till ACK timer expiry, the fragment is retransmitted by the transmitter
There could be plurality of such retransmissions by the transmitter, which is modified based on the requirements and constraints of the link protocol and higher layer protocols. This plurality is termed as ACK rounds. For achieving plurality of retransmissions by the transmitter, the transmitter restarts the ACK timer after the first ACK timer expiry and after the first retransmission of the data unit. The transmitter expects an ACK only for the reliable fragments, to be received within ACK timer interval. The transmitter stores the reliable higher layer packets in queues till the ACK is received from the receiver or till a Stale timer interval, so that the fragments can be retransmitted. The transmitter does not queue the best effort higher layer packets.
Fig 2 depicts the Receiver Procedures in an ACK based link protocol.
Link Protocol Data Receiver receives fragments of best effort and reliable higher layer packets without any interleaving. All the received fragments are re¬assembled to form higher layer packets based on first segment and last segment and passed to higher layer.
When a first segment of best effort packet is received, all the following received link layer protocol receives the segments of the same packet until next link layer packet is received by the first segment set.
All the link layer protocol packets received after receiving the first segment of a best effort packet will belong to the same packet till a link layer protocol packet with last segment bit set is received. If any of the fragments are missed before last fragment is received, all the fragments of best effort packets are discarded till first segment of a best effort packet is received.
When reliable fragments are received, the receiver sends ACK for sequence number of each fragment. The link protocol starts an abort timer for each missed reliable fragment. The abort timer is set to the time within which the receiver expects the transmitter to retransmit the missed fragments. The value for abort timer is decided based on the value of ACK timer used in the transmitter and the ACK rounds configured for the link protocol.
As a preferred embodiment of the current invention, the link protocol in the receiver identifies whether one or more missed fragments belong to a best effort packet. If all of the missed fragments can be identified as best effort fragments, the abort timer need not be started for these fragments. If the number of missed fragments is one, and if the current fragment received is the middle or the last fragment of a best effort packet, the missed fragment can be identified as fragments of best effort packets, and abort timer need not be started for the missed fragments.
Suppose the number of missed fragments is one, and if the previous fragment received is the first or the middle fragment of a best effort packet, the missed fragment can be identified as fragments of best effort packets, and abort timer need not be started for the missed fragments. If the number of missed fragments is two,'and if the current fragment received is the middle or the last fragment of a best effort packet, and if the previous fragment received is the first or the middle fragment of a best effort packet, the missed fragment can be identified as fragments of best effort packets, and abort timer need not be started for the missed fragments.
In all other cases, where the missed fragments can not be identified to be fragments of a best effort higher packet the abort timer will be started at the receiver for all the missed fragments.
As an embodiment of the invention, once the abort timer is started at the receiver, the received reliable fragments which form a complete packet with the missed fragments are queued by the link protocol in the receiver, and are not passed onto the higher layer, and the received fragments which form complete packets are passed to higher. In the receiver, the link protocol not only ensures that the abort timer is started for the missed reliable fragments, but also takes care that the queue due to missed reliable fragments does not impact the delivery of complete packets to the higher layer. When abort timer expires for the missed fragments, the received fragments which form partial packets are discarded or passed to higher layer.
Fig.3 depicts Transmitter Procedures in a NAK based link protocol
As an embodiment of the invention, once the higher layer packet is transmitted in one or more fragments the transmitter stores the delivery type for all sequence numbers and payload for the sequence numbers carrying reliable packet. This information is stored by the transmitter for a period of stale timer. This information is used by the transmitter to identify the delivery type for each sequence number when a NAK is received from the receiver for missed fragments. One skilled in the related art may note that the NAK will be sent by the receiver for sequence number of best effort packets, since the receiver does not have information about whether the sequence numbers corresponding to missed fragments belong to a best effort or a reliable higher layer packets.
When a NAK is received from the receiver, the transmitter ignores the sequence numbers whose delivery type is best effort using information in the transmitter stored while transmitting the higher layer packets. Transmitter retransmits the payload (fragment of higher layer reliable packet) for the reliable sequence numbers conveyed in the NAK. The link protocol may support a plurality of such retransmissions based on the requirements and capabilities of the higher layer protocol and the link protocol.
Fig 4 depicts the Receiver Procedures in a NAK based link protocol. Receiver is receiving fragments of best effort and reliable higher layer packets without any interleaving. All the received fragments are re-assembled to form higher layer packets based on first segment and last segment and passed to higher layer. When a first segment of best effort packet is received all the following received link layer protocol receives the segments of the same packet until next link layer packet's first segment set is received.
All the link layer protocol packets received after receiving the first segment of a best effort packet will belong to the same packet till a link layer protocol packet with last segment bit set is received. If any of the fragments are missed before last fragment is received, all the fragments of best effort packets are discarded till first segment of a best effort packet is received.
The link protocol starts an abort timer for each missed reliable fragments and sends a NAK for the sequence numbers. The abort timer is set to the time within which the receiver expects the transmitter to retransmit the missed fragments. The receiver cannot identify whether the missed fragments belong to best effort packet or reliable packet. In some cases explained below receiver can identify that all the missed fragments belong to best effort in which case receiver need not start abort timer and send a NAK. One skilled in the related art may note that NAK may be sent with sequence numbers corresponding to fragments of best effort packets.
Figure 5 depicts Identification of missed fragments as Best Effort.
The preferred embodiment of the present invention, the link protocol in the receiver identifies whether one or more missed fragments belong to a best effort packet in the following manner. If all of the missed fragments can be identified as best effort fragments, NAK need not be sent by the receiver and abort timer need not be started for these fragments. If the number of missed fragments is one, and if the current fragment received is the middle or the last fragment of a best effort packet, the missed fragment can be identified as fragments of best effort packets, NAK is not sent and abort timer need not be started for the missed fragments. If the number of missed fragments is one, and if the previous fragment received is the first or the middle fragment of a best effort packet, the missed fragment can be identified as fragments of best effort packets, NAK is not sent and abort timer need not be started for the missed fragments. If the number of missed fragments is two, and if the current fragment received is the middle or the last fragment of a best effort packet, and if the previous fragment received is the first or the middle fragment of a best effort packet, the missed fragment can be identified as fragments of best effort packets, NAK is not sent and abort timer need not be started for the missed fragments.
In all other cases, where the missed fragments cannot be identified to be fragments of a best effort higher packet, the receiver sends a NAK for missed sequence numbers and starts an abort timer.
As an embodiment of the invention, once the abort timer is started at the receiver, the received reliable fragments which form a complete packet with the missed fragments are queued by the link protocol in the receiver, and are not passed onto the higher layer, and the received fragments which form complete packets are passed to higher. At the receiver, the link protocol not only ensures that the abort timer is started for the missed reliable fragments, but also takes care that the queue due to missed reliable fragments does not impact the delivery of complete packets to the higher layer. When abort timer expires for the missed fragments, the received fragments which form partial packets are discarded or passed to higher layer.
The link protocol may incorporate a NAK mechanism with plurality of NAK sent by the receiver for each missed data unit. The receiver in the link protocol does not know whether the missed data units are best effort or reliable, and plurality of NAK may be sent by the receiver for best effort fragments.
As another embodiment of the invention, the transmitter on receiving a NAK will inform the receiver that few data units missed by the receiver were best effort, and so, the receiver need not send further NAK for those best effort fragments. The receiver will stop sending NAK for the sequence numbers of best effort fragments on receiving this delivery type information from the transmitter.
Alternatives
1. In the invention, the best effort fragments are discarded by the link protocol in the receiver, if some of the best effort fragments are lost. This is one method, and an alternative is to send the partial best effort fragments to higher layer. Further recovery of complete packet with partial fragments is assumed to be the responsibility of the higher layer.
The foregoing functional description applies generally to all the embodiments of the invention set forth herein after. Each subsequently described alternatives embodiments are to be interpreted in the light of the foregoing descriptions. Also numerous specific details are provided, such as examples of components and/or methods, to provide a thorough understanding of embodiments of the present invention One skilled in the relevant art will recognize, however, that an embodiment of the invention can be practiced without one or more of the specific details, or with other apparatus, systems, assemblies, methods, components, materials, parts, and/or the like. In other instances, well-known structures, materials, or operations are not specifically shown or described in detail to avoid obscuring aspects of embodiments of the present invention.
>
GLOSSARY OF TERMS AND DEFINITIONS THEREOF
ACK: An acknowledgement message sent by the receiver to the transmitter on
successful reception of each reliable data unit.
ACK Timer: Time for when the transmitter waits for an acknowledgement from the receiver.
Abort Timer: Time for when the receiver waits to retrieve the missed data units from the transmitter.
Fragmentation: The functionality of splitting a higher layer packet to multiple fragments based on lower layer transmission capabilities. Framing: The functionality of forming complete packet from multiple fragments of the packet using information about position of the fragment in the packet. NAK: A message sent by the receiver to the transmitter on failure of reception of some reliable data units. Starting sequence number of the data unit and number of missed data units may be informed in a NAK.
Reliable: A delivery type in which the transmitter ensures that the packet is received by the receiver, by retrying transmission multiple rounds. Retransmission: The functionality of transmitter transmitting the already transmitted fragment again, when the receiver does not seem to have received the fragment.
RLP: Radio Link Protocol, used in communication systems for facilitating retransmissions, fragmentation and framing.
SLP: Signaling Link Protocol, used in communication systems for carrying signaling or control messages of radio protocols.
Stale Timer: Time for when the transmitter queues the information transmitted that assists in processing the NAK if received from the receiver.



We claim
1) A method for performing reliable and best effort data transfer in a communication system with fragmentation, framing and retransmission using a single sequence space (one instance of link protocol), the method comprising,
a) Fragmentation of data at the transmitter and framing of fragmented data into higher layer characterized in that the header of each framed packet at the transmitter comprises a one-bit delivery type field for indicating the receiver as to whether the data delivery is by best effort data transmission (in which the data need not be buffered for retransmission), or by reliable data transmission in which the data is buffered for possible retransmission in the event that the receiver does not send an acknowledgement(ACK) or sends a negative acknowledgement (NAK) based on the link configuration; and
h) the receiver identifies, where possible, (based on first segment, last segment fields and delivery type of current received packet),the delivery type of missed packets and a determination that the missed packets belong to best effort data transmission decides not to send NAK if link is configured as NAK^ based and does not wait for retransmission for those missed packets if link is,. configured as ACK based.
2) The method according to claim 1 wherein the delivery field contains 0 for best effort data transmission and T for reliable data transmission.
3) The method as claimed in claim 1, wherein the link protocol re-transmits a missed data packet at the transmitter whereas it re-sequences the missed packet at the receiver.
4) The method according to Claim 1, wherein the fragments may be either a part of a higher laver packet or a complete higher layer packet.
5) The method as claimed in claim 1, wherein the field segment info
~ ~ ">•
contains, two bits, a first segment bit which identify the first segment of
• • —> ■—>—
the higher layer packet and a last segment bit, identifying the last^ segment of the higher layer packet.
6) The method as claimed in claim 1, wherein the higher layer packet is split intn multiple fragments with unique sequence number.
7) The method as claimed in claim 1, wherein the delivery of packets by the
transmitter based on the information provided by the higher layer for each
■ — ■»
packet.
8) The method as claimed in claim 1, wherein the link protocol receiver receives the reliable fragments and sends acknowledge signal (ACK) for sequence number of each fragment.
9) The method as claimed in claim 1, wherein the link protocol in the
" — * — •
receiver identifies whether one or more missed fragments belong to a best effort packet.
10) A system for the best effort data transfer with fragmentation and framing in link protocol, substantially as herein described with reference to the accompanying drawings.
11) A method for, performing reliable and best effort data transfer with fragmentation and framing in link protocols substantially as herein described with reference to the accompanying drawings1 I

Documents:

1347-CHE-2006 AMENDED PAGES OF SPECIFICATION 19-07-2013.pdf

1347-CHE-2006 AMENDED CLAIMS 19-07-2013.pdf

1347-CHE-2006 EXAMINATION REPORT REPLY RECEIVED 19-07-2013.pdf

1347-CHE-2006 FORM-1 19-07-2013.pdf

1347-CHE-2006 FORM-13 19-07-2013.pdf

1347-CHE-2006 OTHER PATENT DOCUMENT 19-07-2013.pdf

1347-CHE-2006 POWER OF ATTORNEY 03-09-2013.pdf

1347-CHE-2006 POWER OF ATTORNEY 19-07-2013.pdf

1347-CHE-2006 AMENDED CLAIMS 03-09-2013.pdf

1347-CHE-2006 EXAMINATION REPORT REPLY RECEIVED 03-09-2013.pdf

1347-CHE-2006 FORM.13 17-09-2007.pdf

1347-CHE-2006 ABSTRACT.pdf

1347-CHE-2006 CLAIMS.pdf

1347-CHE-2006 CORRESPONDENCE OTHERS.pdf

1347-CHE-2006 DESCRIPTION (COMPLETE).pdf

1347-CHE-2006 FORM 18.pdf

1347-CHE-2006 FORM 5.pdf

1347-che-2006-correspondnece-others.pdf

1347-che-2006-description(provisional).pdf

1347-che-2006-drawings.pdf

1347-che-2006-form 1.pdf

1347-che-2006-form 26.pdf


Patent Number 257339
Indian Patent Application Number 1347/CHE/2006
PG Journal Number 39/2013
Publication Date 27-Sep-2013
Grant Date 25-Sep-2013
Date of Filing 31-Jul-2006
Name of Patentee SAMSUNG INDIA SOFTWARE OPERATIONS PRIVATE LIMITED
Applicant Address Bagmane Lakeview, Block 'B', No. 66/1, Bagmane Tech Park, C V Raman Nagar, Byrasandra, Bangalore - 560093, KARNATAKA, INDIA
Inventors:
# Inventor's Name Inventor's Address
1 VADLAPUDI TIRUMALA SREE HARI VARA PRASAD Employed at Samsung India Software Operations Pvt. Ltd., having its office at, Bagmane Lakeview, Block 'B', No. 66/1, Bagmane Tech Park, C V Raman Nagar, Byrasandra, Bangalore - 560093,KARNATAKA, INDIA
2 RAVI KUMAR G Employed at Samsung India Software Operations Pvt. Ltd., having its office at, Bagmane Lakeview, Block 'B', No. 66/1, Bagmane Tech Park, C V Raman Nagar, Byrasandra, Bangalore - 560093,
3 SUNDAR RAJAN K Employed at Samsung India Software Operations Pvt. Ltd., having its office at, Bagmane Lakeview, Block 'B', No. 66/1, Bagmane Tech Park, C V Raman Nagar, Byrasandra, Bangalore - 560093,
PCT International Classification Number H04M 1/725
PCT International Application Number N/A
PCT International Filing date
PCT Conventions:
# PCT Application Number Date of Convention Priority Country
1 NA