Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.966196
Xiang Yu, I. Thng, Yuming Jiang, C. Qiao
We analyze the arrival process of long range dependent (LRD) traffic and demonstrate that it is a Weibull bounded burstiness (WBB) process. By decomposing a generalized processor sharing (GPS) system into isolated queues and servers, we then obtain two upper bounds on the individual session queue length, which are useful for quality of service (QoS) control. We also demonstrate that some parameters in determining the upper bound on an individual session queue, such as the index, the asymptotic constant and the decay rate may be affected by other flows existing in the GPS system. However, under certain conditions, by carefully choosing the GPS weight parameters, an individual session with LRD traffic input can be well isolated from other flows.
{"title":"Upper bounds for individual queue length distribution in GPS with LRD traffic input","authors":"Xiang Yu, I. Thng, Yuming Jiang, C. Qiao","doi":"10.1109/GLOCOM.2001.966196","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966196","url":null,"abstract":"We analyze the arrival process of long range dependent (LRD) traffic and demonstrate that it is a Weibull bounded burstiness (WBB) process. By decomposing a generalized processor sharing (GPS) system into isolated queues and servers, we then obtain two upper bounds on the individual session queue length, which are useful for quality of service (QoS) control. We also demonstrate that some parameters in determining the upper bound on an individual session queue, such as the index, the asymptotic constant and the decay rate may be affected by other flows existing in the GPS system. However, under certain conditions, by carefully choosing the GPS weight parameters, an individual session with LRD traffic input can be well isolated from other flows.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.966287
Wee-Peng Ang, H. K. Garg
A new iterative channel estimator for turbo decoding over flat fading channel is studied using the optimum log-MAP turbo decoder and the reduced-complexity sub-optimum max-log-MAP turbo decoder. Initially, pilot symbols are used to estimate the complex channel gain and noise variance. After each decoding iteration, only the detected message bits are fed back to the channel estimator to improve the channel estimates. The moving average filter, the FIR filter and the FFT filter are studied and compared to the optimum Wiener filter. It is shown that under very slow fading rate of f/sub d/T/sub s/ = 0.005, the various filters perform closely to one another. Under a faster fading rate of f/sub d/T/sub s/ = 0.02, the FFT filter and FIR filter respectively achieved performance within about 1/2 dB and 1 dB of that achieved by the optimum Wiener filter for a BER of 3 /spl times/ 10/sup -4/. When the max-log-MAP turbo decoder is used, performance degrades by up to about 0.5 dB for the same BER compared to the case of using the log-MAP turbo decoder.
{"title":"A new iterative channel estimator for the log-MAP & max-log-MAP turbo decoder in Rayleigh fading channel","authors":"Wee-Peng Ang, H. K. Garg","doi":"10.1109/GLOCOM.2001.966287","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966287","url":null,"abstract":"A new iterative channel estimator for turbo decoding over flat fading channel is studied using the optimum log-MAP turbo decoder and the reduced-complexity sub-optimum max-log-MAP turbo decoder. Initially, pilot symbols are used to estimate the complex channel gain and noise variance. After each decoding iteration, only the detected message bits are fed back to the channel estimator to improve the channel estimates. The moving average filter, the FIR filter and the FFT filter are studied and compared to the optimum Wiener filter. It is shown that under very slow fading rate of f/sub d/T/sub s/ = 0.005, the various filters perform closely to one another. Under a faster fading rate of f/sub d/T/sub s/ = 0.02, the FFT filter and FIR filter respectively achieved performance within about 1/2 dB and 1 dB of that achieved by the optimum Wiener filter for a BER of 3 /spl times/ 10/sup -4/. When the max-log-MAP turbo decoder is used, performance degrades by up to about 0.5 dB for the same BER compared to the case of using the log-MAP turbo decoder.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116494144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.965568
H. Behairy, Shih-Chun Chang
We present a class of concatenated codes called parallel concatenated Gallager codes (PCGC) using low-density parity-check (LDPC) component codes. We report simulation results for PCGC that outperform those for comparable LDPC codes both in additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. The good performance of PCGC increases the capacity of CDMA systems while the reduced encoding and decoding complexity of such codes keep the signal processing delays within a reasonable limit.
{"title":"Parallel concatenated Gallager codes for CDMA applications","authors":"H. Behairy, Shih-Chun Chang","doi":"10.1109/GLOCOM.2001.965568","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965568","url":null,"abstract":"We present a class of concatenated codes called parallel concatenated Gallager codes (PCGC) using low-density parity-check (LDPC) component codes. We report simulation results for PCGC that outperform those for comparable LDPC codes both in additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. The good performance of PCGC increases the capacity of CDMA systems while the reduced encoding and decoding complexity of such codes keep the signal processing delays within a reasonable limit.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122085273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.966321
Heechang Kim, K. Wong, Wai Chen, C. L. Lau
Many domain-based micro-mobility schemes have been proposed to improve deficiencies of Mobile IP. The micro-mobility schemes provide efficient and fast handoff by localizing mobility impacts when the movement is within a domain. However they lack QoS support. This paper proposes mobility-aware MPLS as a micro-mobility scheme. The proposed scheme provides an efficient micro-mobility with continuous QoS support by combining the advantages of MPLS, such as IP QoS support, with the advantage of host-based micro-mobility schemes, such as low-latency handoffs.
{"title":"Mobility-aware MPLS in IP-based wireless access networks","authors":"Heechang Kim, K. Wong, Wai Chen, C. L. Lau","doi":"10.1109/GLOCOM.2001.966321","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966321","url":null,"abstract":"Many domain-based micro-mobility schemes have been proposed to improve deficiencies of Mobile IP. The micro-mobility schemes provide efficient and fast handoff by localizing mobility impacts when the movement is within a domain. However they lack QoS support. This paper proposes mobility-aware MPLS as a micro-mobility scheme. The proposed scheme provides an efficient micro-mobility with continuous QoS support by combining the advantages of MPLS, such as IP QoS support, with the advantage of host-based micro-mobility schemes, such as low-latency handoffs.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125939317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.965834
V. Tamilraj, S. Subramaniam
We consider a multichannel optical network that provides circuit-switched service. Different rates may be provided to sessions by allocating a variable number of channels to the sessions. In this paper, a new analytical model to compute the blocking probabilities of dual-rate sessions (sessions having one of two rates) is presented. The model considers channel-switching constraints along a session's path but ignores the correlation between link channel occupancies. The model is applicable to a variety of scenarios such as wavelength-grooming networks and all-optical TDM wavelength-routing networks. Simulations to show the usefulness of the model are also presented.
{"title":"An analytical blocking model for dual-rate sessions in multichannel optical networks","authors":"V. Tamilraj, S. Subramaniam","doi":"10.1109/GLOCOM.2001.965834","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965834","url":null,"abstract":"We consider a multichannel optical network that provides circuit-switched service. Different rates may be provided to sessions by allocating a variable number of channels to the sessions. In this paper, a new analytical model to compute the blocking probabilities of dual-rate sessions (sessions having one of two rates) is presented. The model considers channel-switching constraints along a session's path but ignores the correlation between link channel occupancies. The model is applicable to a variety of scenarios such as wavelength-grooming networks and all-optical TDM wavelength-routing networks. Simulations to show the usefulness of the model are also presented.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126005459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.965838
Jingyi He, S. Chan, D. Tsang
The multicast routing and wavelength assignment (MC-RWA) problem is generally studied with the objective of maximizing the number of multicast groups admitted, or equivalently, to minimize the call (or session) blocking probability given a certain number of wavelengths. While this approach is sound, a better objective is to maximize the total number of users served (i.e., minimizing the user blocking probability) by allowing part of a multicast group to be admitted. We present for the first time a formulation of the MC-RWA problem with such an objective. The formulation is a nonlinear integer program, which in general is complex to solve. We therefore propose a heuristic algorithm based on linear programming (LP). We further develop a simpler MAX-FIRST algorithm, which achieves almost the same performance as the LP algorithm. These algorithms are for static MC-RWA, where the multicast trees are predetermined and cannot be changed during the wavelength assignment. We extend the algorithms to dynamic MC-RWA, where new multicast trees can be built for unserved groups. We finally present upper and lower bounds on the user blocking probability for the static MC-RWA.
{"title":"Routing and wavelength assignment for WDM multicast networks","authors":"Jingyi He, S. Chan, D. Tsang","doi":"10.1109/GLOCOM.2001.965838","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965838","url":null,"abstract":"The multicast routing and wavelength assignment (MC-RWA) problem is generally studied with the objective of maximizing the number of multicast groups admitted, or equivalently, to minimize the call (or session) blocking probability given a certain number of wavelengths. While this approach is sound, a better objective is to maximize the total number of users served (i.e., minimizing the user blocking probability) by allowing part of a multicast group to be admitted. We present for the first time a formulation of the MC-RWA problem with such an objective. The formulation is a nonlinear integer program, which in general is complex to solve. We therefore propose a heuristic algorithm based on linear programming (LP). We further develop a simpler MAX-FIRST algorithm, which achieves almost the same performance as the LP algorithm. These algorithms are for static MC-RWA, where the multicast trees are predetermined and cannot be changed during the wavelength assignment. We extend the algorithms to dynamic MC-RWA, where new multicast trees can be built for unserved groups. We finally present upper and lower bounds on the user blocking probability for the static MC-RWA.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124794087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.965513
W. Hamouda, P. McLane
We consider the application of iterative interference cancellation (IC) schemes to improve the convergence speed of the linear adaptive minimum mean-squared error (MMSE) receiver in a direct-sequence code-division multiple-access (DS-CDMA) system. Our aim is to reduce the overhead introduced during the training period. This will be achieved using an iterative interference cancellation algorithm such as the parallel interference cancellation (PIC) algorithm. The proposed system makes use of the available knowledge of the training sequences for all users (i.e., at the base station) to jointly cancel the multiple access interference (MAI) and adapts to the MMSE optimum filter taps using the combined adaptive MMSE/PIC. An examination of the adaptive MMSE/PIC receiver reveals that it is near-far resistant. Moreover, it is shown that using the least-mean-square (LMS) as a simple form of the adaptive MMSE receiver, the proposed algorithm requires only a few tens of symbols for convergence as compared to a few hundred training symbols needed for the conventional adaptive LMS receiver. Also employing a more complex, yet faster, a recursive-least squares algorithm (RLS) convergence is reached with few training symbols when PIC is used.
{"title":"Multiuser interference cancellation aided adaptation of a MMSE receiver for direct-sequence code-division multiple-access systems","authors":"W. Hamouda, P. McLane","doi":"10.1109/GLOCOM.2001.965513","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965513","url":null,"abstract":"We consider the application of iterative interference cancellation (IC) schemes to improve the convergence speed of the linear adaptive minimum mean-squared error (MMSE) receiver in a direct-sequence code-division multiple-access (DS-CDMA) system. Our aim is to reduce the overhead introduced during the training period. This will be achieved using an iterative interference cancellation algorithm such as the parallel interference cancellation (PIC) algorithm. The proposed system makes use of the available knowledge of the training sequences for all users (i.e., at the base station) to jointly cancel the multiple access interference (MAI) and adapts to the MMSE optimum filter taps using the combined adaptive MMSE/PIC. An examination of the adaptive MMSE/PIC receiver reveals that it is near-far resistant. Moreover, it is shown that using the least-mean-square (LMS) as a simple form of the adaptive MMSE receiver, the proposed algorithm requires only a few tens of symbols for convergence as compared to a few hundred training symbols needed for the conventional adaptive LMS receiver. Also employing a more complex, yet faster, a recursive-least squares algorithm (RLS) convergence is reached with few training symbols when PIC is used.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129414228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.965903
P. S. Chanda, Anurag Kumar, A. Kherani
The general problem we consider is the analysis of a model in which there are several routes in a network, on each route elastic flows arrive randomly according to some arrival process, and each flow transfers a finite volume of data sampled from some distribution. We are interested in computing a measure of average flow throughput on each route, for a given bandwidth sharing mechanism. Such models arise in problems of network dimensioning and traffic engineering. In this paper, we assume Poisson arrivals of file transfer requests on each route, the transfer volumes are fluid and arbitrarily distributed. At each instant the network shares the bandwidth among the ongoing flows according to the max-min fair bandwidth sharing mechanism, ie, instantaneous max-min fair (IMMF) sharing. The measure of performance we consider is the time average bandwidth obtained by flows on each route. We propose a heuristic algorithm for obtaining an approximation for this performance measure for arbitrary routes in an arbitrary network topology. Simulations with various network topologies are used to evaluate the proposal. In spite of its simplicity, we find that the approximation works quite well in a variety or topologies that we have studied.
{"title":"An approximate calculation of max-min fair throughputs for non-persistent elastic flows","authors":"P. S. Chanda, Anurag Kumar, A. Kherani","doi":"10.1109/GLOCOM.2001.965903","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965903","url":null,"abstract":"The general problem we consider is the analysis of a model in which there are several routes in a network, on each route elastic flows arrive randomly according to some arrival process, and each flow transfers a finite volume of data sampled from some distribution. We are interested in computing a measure of average flow throughput on each route, for a given bandwidth sharing mechanism. Such models arise in problems of network dimensioning and traffic engineering. In this paper, we assume Poisson arrivals of file transfer requests on each route, the transfer volumes are fluid and arbitrarily distributed. At each instant the network shares the bandwidth among the ongoing flows according to the max-min fair bandwidth sharing mechanism, ie, instantaneous max-min fair (IMMF) sharing. The measure of performance we consider is the time average bandwidth obtained by flows on each route. We propose a heuristic algorithm for obtaining an approximation for this performance measure for arbitrary routes in an arbitrary network topology. Simulations with various network topologies are used to evaluate the proposal. In spite of its simplicity, we find that the approximation works quite well in a variety or topologies that we have studied.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129699796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.965944
K. Tsudaka, Masanobu Kawahara, A. Matsumoto, H. Okada
A wireless adhoc network consists of mobile nodes that may move often. The mobility of nodes results in a change in routes, requiring some mechanism for determining new routes. A number of routing protocols have already been proposed for wireless Ad-hoc networks. In these conventional protocols, transmission power of each node is kept constant This paper proposes an approach to control transmission power to improve the performance of routing protocols. By controlling power, the proposed Power Control Routing (PCR) improves the network capacity and power consumption. Simulation experiments show that PCR has high network capacity and low power consumption.
无线自组织网络由可经常移动的移动节点组成。节点的迁移会导致路由的变化，这就需要某种机制来确定新的路由。对于无线自组织网络，已经提出了许多路由协议。在这些传统协议中，每个节点的传输功率都是保持不变的。本文提出了一种控制传输功率的方法，以提高路由协议的性能。PCR (power Control Routing，功率控制路由)通过控制功率来提高网络容量和功耗。仿真实验表明，聚合酶链反应具有高网络容量和低功耗的特点。
{"title":"Power control routing for multi hop wireless ad-hoc network","authors":"K. Tsudaka, Masanobu Kawahara, A. Matsumoto, H. Okada","doi":"10.1109/GLOCOM.2001.965944","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965944","url":null,"abstract":"A wireless adhoc network consists of mobile nodes that may move often. The mobility of nodes results in a change in routes, requiring some mechanism for determining new routes. A number of routing protocols have already been proposed for wireless Ad-hoc networks. In these conventional protocols, transmission power of each node is kept constant This paper proposes an approach to control transmission power to improve the performance of routing protocols. By controlling power, the proposed Power Control Routing (PCR) improves the network capacity and power consumption. Simulation experiments show that PCR has high network capacity and low power consumption.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128461647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.966187
Haitao Wu, Keping Long, Shiduan Cheng, Jian Ma
IETF proposes the differentiated services (DiffServ) architecture to implement QoS in the Internet. However, recent studies have shown that under various conditions, the existing DiffServ mechanism may have problems of unfairness and inefficient resource utilization, thereby failing to achieve the desired QoS for TCP flows running over assured services. This paper considers that the idea of TCP friendly congestion control should be used in traffic conditioning (TC) for AF PHB (assured forwarding per-hop behavior), especially when the customer expects to achieve better performance by out-of-profile traffic. This paper also proposes using a direct congestion control scheme (DCCS) and dynamic traffic conditioning (DTC) to achieve fairness between responsive and unresponsive aggregates as well as better allocations for responsive flows (TCP) with different packet lengths, micro-flow number, round trip time (RTT) etc. Moreover, a better resource utilization can be achieved at the same time.
{"title":"Direct congestion control scheme (DCCS) for differentiated services IP networks","authors":"Haitao Wu, Keping Long, Shiduan Cheng, Jian Ma","doi":"10.1109/GLOCOM.2001.966187","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966187","url":null,"abstract":"IETF proposes the differentiated services (DiffServ) architecture to implement QoS in the Internet. However, recent studies have shown that under various conditions, the existing DiffServ mechanism may have problems of unfairness and inefficient resource utilization, thereby failing to achieve the desired QoS for TCP flows running over assured services. This paper considers that the idea of TCP friendly congestion control should be used in traffic conditioning (TC) for AF PHB (assured forwarding per-hop behavior), especially when the customer expects to achieve better performance by out-of-profile traffic. This paper also proposes using a direct congestion control scheme (DCCS) and dynamic traffic conditioning (DTC) to achieve fairness between responsive and unresponsive aggregates as well as better allocations for responsive flows (TCP) with different packet lengths, micro-flow number, round trip time (RTT) etc. Moreover, a better resource utilization can be achieved at the same time.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129554832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：