Method and System for Managing Time-Sensitive Packetized Data Streams at a Receiver

• US 20070058652A1
• Filed: 11/02/2006
• Published: 03/15/2007
• Est. Priority Date: 05/03/2001
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Surazski, Luke, Dunlap, Richard, Knappe, Michael, Hahn, Paul
• Granted Patent: US 8,102,766 B2
• Time in Patent Office: Days
• US Class Current: 370/412
• CPC Class Codes: H04J 3/0632 Synchronisation of packets and cells, e.g. transmission of voice via a packet network, circuit emulation service [CES] queuing arrangements in packet switching elements H04L49/90; synchronising systems for the synchronous transmission of a pulse code modulated video signal with one or more other pulse code modulated signals H04N7/56
• CPC Class Codes: H04Q 2213/13034 A/D conversion, code compression/expansion
• CPC Class Codes: H04Q 2213/13389 LAN, internet

Abstract

According to one embodiment of the invention, a method for managing time-sensitive packetized data streams at a receiver includes receiving a time-sensitive packet of a data stream, analyzing an energy level of a payload signal of the packet, and determining whether to drop the packet based on the energy level of the payload signal.

Claims

1. (canceled)

2. (canceled)

3. (canceled)

4. (canceled)

5. (canceled)

6. (canceled)

7. (canceled)

8. (canceled)

9. (canceled)

10. (canceled)

11. (canceled)

12. (canceled)

13. (canceled)

14. (canceled)

15. (canceled)

16. (canceled)

17. (canceled)

18. (canceled)

19. (canceled)

20. (canceled)

21. (canceled)

22. (canceled)

23. (canceled)

24. (canceled)

25. (canceled)

26. (canceled)

27. (canceled)

28. (canceled)

29. (canceled)

30. (canceled)

31. (canceled)

32. (canceled)

33. (canceled)

34. (canceled)

35. A method for managing time-sensitive packetized data streams at a receiver, comprising:

receiving a time-sensitive packet of a data stream;

comparing an energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

either dropping or playing the packet based on the comparison.

36. The method of claim 35, further comprising:

storing the packet in a buffer; and

wherein either dropping or playing the packet based on the comparison comprises either dropping or playing the packet based on the comparison and a fullness of the buffer.

37. The method of claim 36, further comprising determining whether an overflow condition exists in the buffer.

38. The method of claim 36, further comprising determining whether to insert a filler packet based on the comparison and the fullness of the buffer.

39. The method of claim 38, wherein determining whether to insert the filler packet comprises:

determining if an underrun condition exists in the buffer; and

determining if a previous packet can be repeated or if a new packet needs to be inserted.

40. The method of claim 35, wherein the time-sensitive packet comprises a real-time packet.

41. The method of claim 35, wherein the payload signal is a voice signal.

42. The method of claim 35:

further comprising analyzing the energy level of the payload signal for the comparison of the energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

wherein analyzing the energy level of the payload signal of the packet comprises;

determining a short term average energy of the payload signal;

determining a noise floor estimate; and

comparing the short term average energy and the noise floor estimate.

43. A system for managing time-sensitive packetized data streams at a receiver, comprising:

an interface operable to receive a time-sensitive packet of a data stream; and

a processor coupled to the interface and operable to;

compare an energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

either drop or play the packet based on the comparison.

44. The system of claim 43, wherein the processor is further operable to:

store the packet in a buffer; and

wherein a processor operable to either drop or play the packet based on the comparison comprises a processor operable to either drop or play the packet based on the comparison and a fullness of the buffer.

45. The system of claim 44, wherein the processor is further operable to determine whether an overflow condition exists in the buffer.

46. The system of claim 44, wherein the processor is further operable to determine whether to insert a filler packet based on the comparison and the fullness of the buffer.

47. The system of claim 46, wherein a processor operable to determine whether to insert the filler packet comprises a processor operable to:

determine if an underrun condition exists in the buffer; and

determine if a previous packet can be repeated or if a new packet needs to be inserted.

48. The system of claim 43, wherein the time-sensitive packet comprises a real-time packet.

49. The system of claim 43, wherein the payload signal is a voice signal.

50. The system of claim 43:

wherein the processor is further operable to analyze the energy level of the payload signal for the comparison of the energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

wherein a processor operable to analyze the energy level of the payload signal of the packet comprises a processor operable to;

determine a short term average energy of the payload signal;

determine a noise floor estimate; and

compare the short term average energy and the noise floor estimate.

51. A set of logic encoded in media for managing time-sensitive packetized data streams at a receiver, the logic, when executed by a computer, operable to:

receive a time-sensitive packet of a data stream;

compare an energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

either drop or play the packet based on the comparison.

52. The logic of claim 51, further operable to:

store the packet in a buffer; and

wherein logic operable to either drop or play the packet based on the comparison comprises logic operable to either drop or play the packet based on the comparison and a fullness of the buffer.

53. The logic of claim 52, wherein the logic is further operable to determine whether an overflow condition exists in the buffer.

54. The logic of claim 52, further operable to determine whether to insert a filler packet based on the comparison and the fullness of the buffer.

55. The logic of claim 54, wherein the logic is further operable to:

determine if an underrun condition exists in the buffer; and

determine if a previous packet can be repeated or if a new packet needs to be inserted.

56. The logic of claim 51, wherein the time-sensitive packet comprises a real-time packet.

57. The logic of claim 51, wherein the payload signal is a voice signal.

58. The logic of claim 51, wherein:

the logic is further operable to analyze the energy level of the payload signal for the comparison of the energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

wherein logic operable to analyze the energy level of the payload signal comprises logic operable to;

determine a short term average energy of the payload signal;

determine a noise floor estimate; and

compare the short term average energy and the noise floor estimate.

59. A system for managing time-sensitive packetized data streams at a receiver, comprising:

means for receiving a packet of a data stream;

means for comparing an energy level of a payload signal of the packet to an energy level of a payload signal of a previous packet; and

means for either dropping or playing the packet based on the comparison.

60. The system of claim 59, further comprising:

means for storing the packet in a buffer; and

wherein means for either dropping or playing the packet based on the comparison comprises means for either dropping or playing the packet based on the comparison and a fullness of the buffer.

61. The system of claim 60, further comprising means for determining whether an overflow condition exists in the buffer.

62. The method of claim 60, further comprising means for determining whether to insert a filler packet based on the comparison and the fullness of the buffer.

63. The method of claim 62, wherein means for determining whether to insert the filler packet comprises:

means for determining if an underrun condition exists in the buffer; and

means for determining if a previous packet can be repeated or if a new packet needs to be inserted.