Pub Date : 2001-11-25DOI: 10.1109/GLOCOM.2001.966368
T. Ozugur, A. Bellary, F. Sarkar
We first propose four-layer optimization for a UMTS coverage area: (i) cell-oriented intra-SGSN (serving GPRS service node) layer, which is optimized RAs (routing areas) covering the intra-SGSN signaling cost, paging cost and RA load balancing; (ii) RA-oriented intra-MSC (mobile switching centre) layer, which is optimized location areas (LA) covering the intra-MSC signaling cost and LA load balancing; (iii) RA-oriented inter-SGSN layer, which is optimized SGSN coverage areas covering the inter-SGSN signaling cost, RNC (radio network controller) and SGSN load balancing; (iv) LA-oriented inter-MSC layer, which is optimized MSC coverage areas covering the inter-MSC signaling cost and MSC load balancing. We focus on RA optimization, namely layers (i) and (iii). The optimization of MSC coverage areas and LAs is performed in a similar manner. We propose a schema-based niched Pareto genetic algorithm, which deals with multiple objectives by incorporating the concept of Pareto domination in its selection operator, and applying a niching pressure to spread its population out along the Pareto optimal tradeoff surface. The proposed genetic algorithm uses a schema-based partially matching crossover using tournaments of n size, where the crossover pairs are chosen in two steps, first based on the class ranking and then schema ranking. New offspring are modified using the geographical footprints to converge to the optimal solution faster.
{"title":"Multiobjective hierarchical 2G/3G mobility management optimization: niched Pareto genetic algorithm","authors":"T. Ozugur, A. Bellary, F. Sarkar","doi":"10.1109/GLOCOM.2001.966368","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966368","url":null,"abstract":"We first propose four-layer optimization for a UMTS coverage area: (i) cell-oriented intra-SGSN (serving GPRS service node) layer, which is optimized RAs (routing areas) covering the intra-SGSN signaling cost, paging cost and RA load balancing; (ii) RA-oriented intra-MSC (mobile switching centre) layer, which is optimized location areas (LA) covering the intra-MSC signaling cost and LA load balancing; (iii) RA-oriented inter-SGSN layer, which is optimized SGSN coverage areas covering the inter-SGSN signaling cost, RNC (radio network controller) and SGSN load balancing; (iv) LA-oriented inter-MSC layer, which is optimized MSC coverage areas covering the inter-MSC signaling cost and MSC load balancing. We focus on RA optimization, namely layers (i) and (iii). The optimization of MSC coverage areas and LAs is performed in a similar manner. We propose a schema-based niched Pareto genetic algorithm, which deals with multiple objectives by incorporating the concept of Pareto domination in its selection operator, and applying a niching pressure to spread its population out along the Pareto optimal tradeoff surface. The proposed genetic algorithm uses a schema-based partially matching crossover using tournaments of n size, where the crossover pairs are chosen in two steps, first based on the class ranking and then schema ranking. New offspring are modified using the geographical footprints to converge to the optimal solution faster.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":" 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113950547","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.965708
T. Vaidis, A. Polydoros
This paper investigates the effect of large frequency offset induced (FOI) intersymbol interference (ISI) on the performance of a digital receiver and proposes corresponding remedies. General expressions are derived for the exact representation of ISI caused by an arbitrary frequency offset at the output of the receiver matched filter. Specific examples are developed for the case of a square root raised cosine (SQRT-RC) pulse shape. It is shown that when FOI ISI compensation is performed digitally after the matched filtering operation, an equalizer is necessary for efficient data demodulation, even in the case of a non - dispersive channel. Maximum likelihood (ML) frequency offset estimation is revisited to accommodate the case of large FOI ISI. Its performance is assessed via simulation examples and compared to the derived Cramer-Rao bound. A combined equalization-frequency tracking scheme is also explored, in order to cope with residual frequency estimation errors and potential phase noise.
{"title":"Effects of large frequency offset in digital receivers and related algorithms","authors":"T. Vaidis, A. Polydoros","doi":"10.1109/GLOCOM.2001.965708","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965708","url":null,"abstract":"This paper investigates the effect of large frequency offset induced (FOI) intersymbol interference (ISI) on the performance of a digital receiver and proposes corresponding remedies. General expressions are derived for the exact representation of ISI caused by an arbitrary frequency offset at the output of the receiver matched filter. Specific examples are developed for the case of a square root raised cosine (SQRT-RC) pulse shape. It is shown that when FOI ISI compensation is performed digitally after the matched filtering operation, an equalizer is necessary for efficient data demodulation, even in the case of a non - dispersive channel. Maximum likelihood (ML) frequency offset estimation is revisited to accommodate the case of large FOI ISI. Its performance is assessed via simulation examples and compared to the derived Cramer-Rao bound. A combined equalization-frequency tracking scheme is also explored, in order to cope with residual frequency estimation errors and potential phase noise.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"6 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":"114026244","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.965873
D. Luong, J. Bíró
This paper concerns the fairness of TCP Vegas, a new version of TCP proposed by Brakmo et al., (1994). Firstly, we show some uncertainties in bandwidth allocation and buffer occupancy when the system is in the stable state. These uncertainties come from the using of two threshold values (/spl alpha/, /spl beta/) in the applied innovative congestion avoidance mechanism. We propose a modification in the existing implementations of TCP Vegas to reduce the uncertainties without losing the stability. Secondly, the notion of the ideal TCP Vegas, which has no uncertainties, is defined. We prove that the ideal TCP Vegas is exactly proportionally fair in bandwidth sharing. This property of the real TCP Vegas is tested by simulation. We also show how to implement weighted proportional fairness with TCP Vegas.
{"title":"On the proportional fairness of TCP Vegas","authors":"D. Luong, J. Bíró","doi":"10.1109/GLOCOM.2001.965873","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965873","url":null,"abstract":"This paper concerns the fairness of TCP Vegas, a new version of TCP proposed by Brakmo et al., (1994). Firstly, we show some uncertainties in bandwidth allocation and buffer occupancy when the system is in the stable state. These uncertainties come from the using of two threshold values (/spl alpha/, /spl beta/) in the applied innovative congestion avoidance mechanism. We propose a modification in the existing implementations of TCP Vegas to reduce the uncertainties without losing the stability. Secondly, the notion of the ideal TCP Vegas, which has no uncertainties, is defined. We prove that the ideal TCP Vegas is exactly proportionally fair in bandwidth sharing. This property of the real TCP Vegas is tested by simulation. We also show how to implement weighted proportional fairness with TCP Vegas.","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":"114759887","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.965905
Xudong Wang, Ye Chen
In this paper, a TDMA/FDD MAC protocol is developed for wireless multimedia systems based on a new resource updating scheme for VBR connections. Instead of using piggyback, a control time slot (TS) is dynamically allocated for a VBR connection to send the updating information to the base station (BS). A scheduler in the BS allocates a control TS to each VBR connection which needs to update resources. The updating information can be sent to BS without collision via allocated control TS. Combining the novel scheme with the QoS-based frame structure, not only the QoS of VBR connections is guaranteed, but also the performance of other traffic types is improved. The simulation is performed to evaluate the new MAC protocol.
{"title":"A wireless TDMA/FDD MAC protocol based on a novel resource updating scheme","authors":"Xudong Wang, Ye Chen","doi":"10.1109/GLOCOM.2001.965905","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965905","url":null,"abstract":"In this paper, a TDMA/FDD MAC protocol is developed for wireless multimedia systems based on a new resource updating scheme for VBR connections. Instead of using piggyback, a control time slot (TS) is dynamically allocated for a VBR connection to send the updating information to the base station (BS). A scheduler in the BS allocates a control TS to each VBR connection which needs to update resources. The updating information can be sent to BS without collision via allocated control TS. Combining the novel scheme with the QoS-based frame structure, not only the QoS of VBR connections is guaranteed, but also the performance of other traffic types is improved. The simulation is performed to evaluate the new MAC protocol.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"46 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":"124464903","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.965900
N. Huang, Whai-En Chen, Jiau-Yu Luo, Jun Chen
Typically, high-end routers/switches classify a packet by looking for multiple fields of the IP/TCP headers and recognize which flow the packet belongs to. Several packet classification algorithms to accelerate packet processing and reduce the memory requirement have been proposed. But it is not easy to implement these algorithms in hardware to lookup these multiple fields in the same time. This paper intends to design a novel packet classification engine capable of simultaneously processing multi-field searching, especially for the IPv6 packets with relative longer addresses (128 bits). To classify the IPv6 packets in wire-speed, the CLM (CAM-Like Memory)-based hardware architecture is considered and five fields (source IPv6 address, destination IPv6 address, source port, destination port, and protocol) are designed as the searching key. Evaluation results indicate that compared with the typical market leading delivering search engines, the proposed hardware architecture provides a 30% speed-up performance. A compact method is also provided to compress the bit-width required to represent the multi-field of an IPv6 packet. This saves the memory space required for the IPv6 rule table for about 20%.
{"title":"Design of multi-field IPv6 packet classifiers using ternary CAMs","authors":"N. Huang, Whai-En Chen, Jiau-Yu Luo, Jun Chen","doi":"10.1109/GLOCOM.2001.965900","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965900","url":null,"abstract":"Typically, high-end routers/switches classify a packet by looking for multiple fields of the IP/TCP headers and recognize which flow the packet belongs to. Several packet classification algorithms to accelerate packet processing and reduce the memory requirement have been proposed. But it is not easy to implement these algorithms in hardware to lookup these multiple fields in the same time. This paper intends to design a novel packet classification engine capable of simultaneously processing multi-field searching, especially for the IPv6 packets with relative longer addresses (128 bits). To classify the IPv6 packets in wire-speed, the CLM (CAM-Like Memory)-based hardware architecture is considered and five fields (source IPv6 address, destination IPv6 address, source port, destination port, and protocol) are designed as the searching key. Evaluation results indicate that compared with the typical market leading delivering search engines, the proposed hardware architecture provides a 30% speed-up performance. A compact method is also provided to compress the bit-width required to represent the multi-field of an IPv6 packet. This saves the memory space required for the IPv6 rule table for about 20%.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"28 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":"126478595","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.966243
K. Kumaran, A. Srinivasan, Qiong Wang, S. Lanning, K. G. Ramakrishnan
Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments.
{"title":"Efficient algorithms for location and sizing problems in network design","authors":"K. Kumaran, A. Srinivasan, Qiong Wang, S. Lanning, K. G. Ramakrishnan","doi":"10.1109/GLOCOM.2001.966243","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966243","url":null,"abstract":"Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"9 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":"126395086","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.966206
Aiguo Fei, Z. Duan, M. Gerla
Group multicast refers to the kind of multicast in which every member of a group may transmit data to the group. Several QoS-aware routing algorithms for group multicast proposed previously take into account bandwidth requirement (which is the most important QoS metric to consider for many applications) and build source-based tree for each individual group member. Per-source tree approach has some advantages over shared-tree approach but suffers the drawbacks of higher control overhead and being less scalable especially with group size. In this paper we present an algorithm which builds shared tree for group multicast and can accommodate multiple QoS requirements including bandwidth and inter-member delay. Besides the advantages of having less control overhead and better scalability, our algorithm can support dynamic membership without recomputing the whole tree. The results from simulation experiments for multicast with bandwidth reservation show that our algorithm has similar performance in terms of tree cost and bandwidth utilization compared with two other per-source tree algorithms.
{"title":"Constructing shared-tree for group multicast with QoS constraints","authors":"Aiguo Fei, Z. Duan, M. Gerla","doi":"10.1109/GLOCOM.2001.966206","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966206","url":null,"abstract":"Group multicast refers to the kind of multicast in which every member of a group may transmit data to the group. Several QoS-aware routing algorithms for group multicast proposed previously take into account bandwidth requirement (which is the most important QoS metric to consider for many applications) and build source-based tree for each individual group member. Per-source tree approach has some advantages over shared-tree approach but suffers the drawbacks of higher control overhead and being less scalable especially with group size. In this paper we present an algorithm which builds shared tree for group multicast and can accommodate multiple QoS requirements including bandwidth and inter-member delay. Besides the advantages of having less control overhead and better scalability, our algorithm can support dynamic membership without recomputing the whole tree. The results from simulation experiments for multicast with bandwidth reservation show that our algorithm has similar performance in terms of tree cost and bandwidth utilization compared with two other per-source tree algorithms.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"1 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":"128094617","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.966275
A. Grami, K. Gordon
Universal access to broadband networks is a major principle advanced by the Canadian government to guide the development and implementation of Canada's infrastructure. Satellites are uniquely qualified to ensure that broadband services are available to all Canadians at an affordable cost. To this effect, in this paper, an advanced high-capacity Ka-band satellite, which can ubiquitously extend the reach of broadband services to areas unserved or underserved by terrestrial networks, is proposed. The satellite has a bentpipe architecture with coverage of all of Canada via small elliptical beams. The satellite can provide Canadian households, government institutions, and enterprises with low-cost, two-way, high-speed, bandwidth-on-demand access to broadband services, while using attractive user terminals, in terms of size, cost, throughput, and performance. This paper presents the baseline definition of this advanced satellite, and discusses all aspects of the system design.
{"title":"Next-generation Ka-band satellite concept to extend the reach of Canada's broadband infrastructure","authors":"A. Grami, K. Gordon","doi":"10.1109/GLOCOM.2001.966275","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966275","url":null,"abstract":"Universal access to broadband networks is a major principle advanced by the Canadian government to guide the development and implementation of Canada's infrastructure. Satellites are uniquely qualified to ensure that broadband services are available to all Canadians at an affordable cost. To this effect, in this paper, an advanced high-capacity Ka-band satellite, which can ubiquitously extend the reach of broadband services to areas unserved or underserved by terrestrial networks, is proposed. The satellite has a bentpipe architecture with coverage of all of Canada via small elliptical beams. The satellite can provide Canadian households, government institutions, and enterprises with low-cost, two-way, high-speed, bandwidth-on-demand access to broadband services, while using attractive user terminals, in terms of size, cost, throughput, and performance. This paper presents the baseline definition of this advanced satellite, and discusses all aspects of the system design.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"118 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":"128169981","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.966210
S. Chong, Sangho Lee, Sungho Kang
We present a novel control-theoretic explicit rate (ER) allocation algorithm for the max-min flow control of elastic traffic services with minimum rate guarantee in the context of the ATM ABR service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-VC (virtual circuit) operations including per-VC queueing, per-VC accounting and per-VC state management are virtually removed, and stable in that by employing it the user transmission rates and the network queues are asymptotically stabilized at a unique equilibrium point at which max-min fairness with minimum rate guarantee and target queue lengths are achieved respectively. To improve the speed of convergence we normalize the controller gains of the algorithm by the estimate of the number of locally-bottlenecked VCs. The estimation scheme is also computationally simple and scalable since it does not require per-VC accounting either. We analyze the theoretical performance of the proposed algorithm and verify its agreement with the practical performance through simulations in the case of multiple bottleneck nodes. We believe that the proposed algorithm will serve as an encouraging solution to the max-min flow control not only in the context of ATM ABR service but also in general elastic traffic services.
{"title":"Control-theoretic max-min flow control with minimum rate guarantee","authors":"S. Chong, Sangho Lee, Sungho Kang","doi":"10.1109/GLOCOM.2001.966210","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966210","url":null,"abstract":"We present a novel control-theoretic explicit rate (ER) allocation algorithm for the max-min flow control of elastic traffic services with minimum rate guarantee in the context of the ATM ABR service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-VC (virtual circuit) operations including per-VC queueing, per-VC accounting and per-VC state management are virtually removed, and stable in that by employing it the user transmission rates and the network queues are asymptotically stabilized at a unique equilibrium point at which max-min fairness with minimum rate guarantee and target queue lengths are achieved respectively. To improve the speed of convergence we normalize the controller gains of the algorithm by the estimate of the number of locally-bottlenecked VCs. The estimation scheme is also computationally simple and scalable since it does not require per-VC accounting either. We analyze the theoretical performance of the proposed algorithm and verify its agreement with the practical performance through simulations in the case of multiple bottleneck nodes. We believe that the proposed algorithm will serve as an encouraging solution to the max-min flow control not only in the context of ATM ABR service but also in general elastic traffic services.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"49 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":"126002103","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.965184
Malcolm Peh, S. Hanly
We investigate the problem of reverse link resource allocation in a multi-class cellular network with specific network quality of service guarantees. Using maximum outage thresholds and outage probabilities, we approximate an acceptance region of feasible spatial intensity functions by a single linear constraint.
{"title":"Effective bandwidths for wireless networks","authors":"Malcolm Peh, S. Hanly","doi":"10.1109/GLOCOM.2001.965184","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965184","url":null,"abstract":"We investigate the problem of reverse link resource allocation in a multi-class cellular network with specific network quality of service guarantees. Using maximum outage thresholds and outage probabilities, we approximate an acceptance region of feasible spatial intensity functions by a single linear constraint.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"17 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":"121930403","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
扫码关注我们
求助内容：
应助结果提醒方式：