To accommodate best-effort multimedia Internet protocol (IP) connections in mobile environments, we introduced new criteria for TCP-friendliness and developed a control algorithm for the transient response and stability in the packet transmission rate. We improved the maximum throughput and QoS guaranteed congestion control algorithm (MAQS) by using these two solutions, and solved the following problems that Reno and conventional congestion control algorithms have: (1) network congestion cannot be avoided when the round-trip time (RTT) is short and the holding time is long, (2) the packet transmission rate of a long-RTT connection is small when it is multiplexed with short-RTT connections, (3) the packet transmission rate cannot be adjusted quickly when the channel capacity changes according to hand-off.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hideki SATOH, "A Congestion Control Algorithm Suitable for Multimedia IP Communications over Mobile Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 7, pp. 1585-1592, July 2003, doi: .
Abstract: To accommodate best-effort multimedia Internet protocol (IP) connections in mobile environments, we introduced new criteria for TCP-friendliness and developed a control algorithm for the transient response and stability in the packet transmission rate. We improved the maximum throughput and QoS guaranteed congestion control algorithm (MAQS) by using these two solutions, and solved the following problems that Reno and conventional congestion control algorithms have: (1) network congestion cannot be avoided when the round-trip time (RTT) is short and the holding time is long, (2) the packet transmission rate of a long-RTT connection is small when it is multiplexed with short-RTT connections, (3) the packet transmission rate cannot be adjusted quickly when the channel capacity changes according to hand-off.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_7_1585/_p
Copy
@ARTICLE{e86-a_7_1585,
author={Hideki SATOH, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Congestion Control Algorithm Suitable for Multimedia IP Communications over Mobile Networks},
year={2003},
volume={E86-A},
number={7},
pages={1585-1592},
abstract={To accommodate best-effort multimedia Internet protocol (IP) connections in mobile environments, we introduced new criteria for TCP-friendliness and developed a control algorithm for the transient response and stability in the packet transmission rate. We improved the maximum throughput and QoS guaranteed congestion control algorithm (MAQS) by using these two solutions, and solved the following problems that Reno and conventional congestion control algorithms have: (1) network congestion cannot be avoided when the round-trip time (RTT) is short and the holding time is long, (2) the packet transmission rate of a long-RTT connection is small when it is multiplexed with short-RTT connections, (3) the packet transmission rate cannot be adjusted quickly when the channel capacity changes according to hand-off.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Congestion Control Algorithm Suitable for Multimedia IP Communications over Mobile Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1585
EP - 1592
AU - Hideki SATOH
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2003
AB - To accommodate best-effort multimedia Internet protocol (IP) connections in mobile environments, we introduced new criteria for TCP-friendliness and developed a control algorithm for the transient response and stability in the packet transmission rate. We improved the maximum throughput and QoS guaranteed congestion control algorithm (MAQS) by using these two solutions, and solved the following problems that Reno and conventional congestion control algorithms have: (1) network congestion cannot be avoided when the round-trip time (RTT) is short and the holding time is long, (2) the packet transmission rate of a long-RTT connection is small when it is multiplexed with short-RTT connections, (3) the packet transmission rate cannot be adjusted quickly when the channel capacity changes according to hand-off.
ER -