Pub Date : 2005-03-13DOI: 10.1109/INFCOM.2005.1498348
D. Madigan, E. Einahrawy, R. Martin, Wen-Hua Ju, P. Krishnan, A. Krishnakumar
In this paper, we introduce a new approach to location estimation where, instead of locating a single client, we simultaneously locate a set of wireless clients. We present a Bayesian hierarchical model for indoor location estimation in wireless networks. We demonstrate that our model achieves accuracy that is similar to other published models and algorithms. By harnessing prior knowledge, our model eliminates the requirement for training data as compared with existing approaches, thereby introducing the notion of a fully adaptive zero profiling approach to location estimation.
{"title":"Bayesian indoor positioning systems","authors":"D. Madigan, E. Einahrawy, R. Martin, Wen-Hua Ju, P. Krishnan, A. Krishnakumar","doi":"10.1109/INFCOM.2005.1498348","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498348","url":null,"abstract":"In this paper, we introduce a new approach to location estimation where, instead of locating a single client, we simultaneously locate a set of wireless clients. We present a Bayesian hierarchical model for indoor location estimation in wireless networks. We demonstrate that our model achieves accuracy that is similar to other published models and algorithms. By harnessing prior knowledge, our model eliminates the requirement for training data as compared with existing approaches, thereby introducing the notion of a fully adaptive zero profiling approach to location estimation.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"52 56 1","pages":"1217-1227 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80414667","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497894
Li, Jeremy, R. Morris, Kaashoek, Thomer, Gil
Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.
{"title":"A performance vs. cost framework for evaluating DHT design tradeoffs under churn","authors":"Li, Jeremy, R. Morris, Kaashoek, Thomer, Gil","doi":"10.1109/INFCOM.2005.1497894","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497894","url":null,"abstract":"Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"6 1","pages":"225-236 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81553722","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497893
M. Andrews
We consider the problem of scheduling data in overloaded networks. We wish to maximize the total profit of data that is served. We first consider a single server that has to schedule data over time-varying channels. This model is motivated by scheduling in wireless networks. Our objective is to maximize the total amount of data scheduled to user by time. In contrast to most previous work we assume that the channel conditions are defined by an adversary rather than a stationary, stochastic process. We give lower bounds on how competitive an online algorithm can be and show that the hounds are nearly matched by a simple randomized algorithm. We also consider a situation in which packets with associated profits are injected into a network of servers. We wish to schedule the packets in the network and maximize the profit of data that reaches its destination. We show that if the servers are allowed to exchange control packets that inform each other of the congestion in the network then we can approximate the optimum profit arbitrarily closely. We also show that without these control packets this is not possible. Our results are motivated by recent work on primal-dual algorithms for flow control in networks. The key difference between our approach and this previous work is that we take into account the scheduling dynamics in the network.
{"title":"Maximizing profit in overloaded networks","authors":"M. Andrews","doi":"10.1109/INFCOM.2005.1497893","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497893","url":null,"abstract":"We consider the problem of scheduling data in overloaded networks. We wish to maximize the total profit of data that is served. We first consider a single server that has to schedule data over time-varying channels. This model is motivated by scheduling in wireless networks. Our objective is to maximize the total amount of data scheduled to user by time. In contrast to most previous work we assume that the channel conditions are defined by an adversary rather than a stationary, stochastic process. We give lower bounds on how competitive an online algorithm can be and show that the hounds are nearly matched by a simple randomized algorithm. We also consider a situation in which packets with associated profits are injected into a network of servers. We wish to schedule the packets in the network and maximize the profit of data that reaches its destination. We show that if the servers are allowed to exchange control packets that inform each other of the congestion in the network then we can approximate the optimum profit arbitrarily closely. We also show that without these control packets this is not possible. Our results are motivated by recent work on primal-dual algorithms for flow control in networks. The key difference between our approach and this previous work is that we take into account the scheduling dynamics in the network.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"44 1","pages":"217-224 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82556828","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498320
Min Ding, Dechang Chen, Kai Xing, Xiuzhen Cheng
This paper targets the identification of faulty sensors and detection of the reach of events in sensor networks with faulty sensors. Typical applications include the detection of the transportation front line of a contamination and the diagnosis of network health. We propose and analyze two novel algorithms for faulty sensor identification and fault-tolerant event boundary detection. These algorithms are purely localized and thus scale well to large sensor networks. Their computational overhead is low, since only simple numerical operations are involved. Simulation results indicate that these algorithms can clearly detect the event boundary and can identify faulty sensors with a high accuracy and a low false alarm rate when as many as 20% sensors become faulty. Our work is exploratory in that the proposed algorithms can accept any kind of scalar values as inputs, a dramatic improvement over existing works that take only 0/1 decision predicates. Therefore, our algorithms are generic. They can be applied as long as the "events" can be modelled by numerical numbers. Though designed for sensor networks, our algorithms can be applied to the outlier detection and regional data analysis in spatial data mining.
{"title":"Localized fault-tolerant event boundary detection in sensor networks","authors":"Min Ding, Dechang Chen, Kai Xing, Xiuzhen Cheng","doi":"10.1109/INFCOM.2005.1498320","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498320","url":null,"abstract":"This paper targets the identification of faulty sensors and detection of the reach of events in sensor networks with faulty sensors. Typical applications include the detection of the transportation front line of a contamination and the diagnosis of network health. We propose and analyze two novel algorithms for faulty sensor identification and fault-tolerant event boundary detection. These algorithms are purely localized and thus scale well to large sensor networks. Their computational overhead is low, since only simple numerical operations are involved. Simulation results indicate that these algorithms can clearly detect the event boundary and can identify faulty sensors with a high accuracy and a low false alarm rate when as many as 20% sensors become faulty. Our work is exploratory in that the proposed algorithms can accept any kind of scalar values as inputs, a dramatic improvement over existing works that take only 0/1 decision predicates. Therefore, our algorithms are generic. They can be applied as long as the \"events\" can be modelled by numerical numbers. Though designed for sensor networks, our algorithms can be applied to the outlier detection and regional data analysis in spatial data mining.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"1 1","pages":"902-913 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90856256","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497913
C. Xiao, B. Bing, G. Chang
Wavelength division multiplexing passive optical networks (WDM PONs) can dynamically offer each end user a unique optical wavelength for data transmission as well as the possibility of wavelength reuse and aggregation, thereby ensuring scalability in bandwidth assignment. In this paper, we propose a new byte size clock (BSC) reservation MAC scheme that not only arbitrates upstream transmission and prevents optical collisions, but also varies bandwidth according to demand and priority, reduces request delay using pre-allocation and delta compression, and handles the addition/reconfiguration of network nodes efficiently. The new access scheme exploits both WDM and TDM to cater for both light and heavy bandwidth requirements and supports both Ethernet and ATM packets without segmenting or aggregating them. Our proposed protocol is not only backward compatible with APON and EPON, but also provides a better utilization of the access link in terms of the throughput and delay. In addition, the amount of pre-allocated bandwidth can be minimized using delta compression, which in turns reduces the latency due to the request and grant mechanism. We analyzed, evaluated, and simulated the performance and practicality of the proposed scheme.
{"title":"An efficient reservation MAC protocol with preallocation for high-speed WDM passive optical networks","authors":"C. Xiao, B. Bing, G. Chang","doi":"10.1109/INFCOM.2005.1497913","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497913","url":null,"abstract":"Wavelength division multiplexing passive optical networks (WDM PONs) can dynamically offer each end user a unique optical wavelength for data transmission as well as the possibility of wavelength reuse and aggregation, thereby ensuring scalability in bandwidth assignment. In this paper, we propose a new byte size clock (BSC) reservation MAC scheme that not only arbitrates upstream transmission and prevents optical collisions, but also varies bandwidth according to demand and priority, reduces request delay using pre-allocation and delta compression, and handles the addition/reconfiguration of network nodes efficiently. The new access scheme exploits both WDM and TDM to cater for both light and heavy bandwidth requirements and supports both Ethernet and ATM packets without segmenting or aggregating them. Our proposed protocol is not only backward compatible with APON and EPON, but also provides a better utilization of the access link in terms of the throughput and delay. In addition, the amount of pre-allocated bandwidth can be minimized using delta compression, which in turns reduces the latency due to the request and grant mechanism. We analyzed, evaluated, and simulated the performance and practicality of the proposed scheme.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"1 1","pages":"444-454 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89343500","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497906
F. Baccelli, Ki Beak Kim, D. D. Vleeschauwer
This paper analyzes the performance of a large population composed of several classes of long lived TCP flows experiencing packet losses due to random transmission errors and to congestion created by the sharing of a common tail-drop or RED bottleneck router. Each class has a different transmission error rate. This setting is used to analyze the competition between wired and wireless users in an access network, where one class (the wired class) has no or small (like BER in DSL) transmission error losses whereas the other class has higher transmission error losses, or the competition between DSL flows using different coding schemes. We propose a natural and simple model for the joint throughput evolution of several classes of TCP flows under such a mix of losses. Two types of random transmission error losses are considered: one where losses are Poisson and independent of the rate of the flow, and one where the losses are still Poisson but with an intensity that is proportional to the rate of the source. We show that the large population model where the population tends to infinity has a threshold (given in closed form) below which there are no congestion losses at all in steady state, and above which there is a stationary limiting regime in which we can compute both the mean value and the distribution of the rate obtained by each class of flow. We also show that the maximum mean value for the aggregated rate is achieved at the threshold.
{"title":"Analysis of the competition between wired, DSL and wireless users in an access network","authors":"F. Baccelli, Ki Beak Kim, D. D. Vleeschauwer","doi":"10.1109/INFCOM.2005.1497906","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497906","url":null,"abstract":"This paper analyzes the performance of a large population composed of several classes of long lived TCP flows experiencing packet losses due to random transmission errors and to congestion created by the sharing of a common tail-drop or RED bottleneck router. Each class has a different transmission error rate. This setting is used to analyze the competition between wired and wireless users in an access network, where one class (the wired class) has no or small (like BER in DSL) transmission error losses whereas the other class has higher transmission error losses, or the competition between DSL flows using different coding schemes. We propose a natural and simple model for the joint throughput evolution of several classes of TCP flows under such a mix of losses. Two types of random transmission error losses are considered: one where losses are Poisson and independent of the rate of the flow, and one where the losses are still Poisson but with an intensity that is proportional to the rate of the source. We show that the large population model where the population tends to infinity has a threshold (given in closed form) below which there are no congestion losses at all in steady state, and above which there is a stationary limiting regime in which we can compute both the mean value and the distribution of the rate obtained by each class of flow. We also show that the maximum mean value for the aggregated rate is achieved at the threshold.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"5 1","pages":"362-373 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86404349","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498352
Xiaojun Lin, N. Shroff, R. Srikant
In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints and design routing algorithms to optimally utilize the available energy. The energy model allows vastly different energy sources in heterogeneous environments. The proposed algorithm is shown to achieve a competitive ratio (i.e., the ratio of the performance of any off-line algorithm that has knowledge of all past and future packet arrivals to the performance of our online algorithm) that is asymptotically optimal with respect to the number of nodes in the network. The algorithm assumes no statistical information on packet arrivals and can easily be incorporated into existing routing frameworks (e.g., proactive or on-demand methodologies) in a distributed fashion. Simulation results confirm that the algorithm performs very well in terms of maximizing the throughput of an energy-constrained network. Further, a new threshold-based scheme is proposed to reduce the routing overhead while incurring only minimum performance degradation.
{"title":"Asymptotically optimal power-aware routing for multihop wireless networks with renewable energy sources","authors":"Xiaojun Lin, N. Shroff, R. Srikant","doi":"10.1109/INFCOM.2005.1498352","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498352","url":null,"abstract":"In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints and design routing algorithms to optimally utilize the available energy. The energy model allows vastly different energy sources in heterogeneous environments. The proposed algorithm is shown to achieve a competitive ratio (i.e., the ratio of the performance of any off-line algorithm that has knowledge of all past and future packet arrivals to the performance of our online algorithm) that is asymptotically optimal with respect to the number of nodes in the network. The algorithm assumes no statistical information on packet arrivals and can easily be incorporated into existing routing frameworks (e.g., proactive or on-demand methodologies) in a distributed fashion. Simulation results confirm that the algorithm performs very well in terms of maximizing the throughput of an energy-constrained network. Further, a new threshold-based scheme is proposed to reduce the routing overhead while incurring only minimum performance degradation.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"32 1","pages":"1262-1272 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77095557","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498326
P. Giaccone, Emilio Leonardi, D. Shah
The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assumes the availability of infinite queue-size. Instead, in this paper, we study the maximal achievable throughput in a flow-controlled lossless network with finite-queue size. In such networks, throughput depends on the packet scheduling policy utilized. As the main of this paper, we obtain a dynamic scheduling policy that achieves the maximal throughput (equal to the maximal throughput in the presence of infinite queue-size) with a minimal finite queue-size at the internal nodes of the network. Though the performance of the policy is ideal, it is quite complex and hence difficult to implement. This leads us to a design of simpler and possibly implementable policy. We obtain a natural trade-off between throughput and queue-size for this policy. We apply our results to the packet switches with buffered crossbar architecture. We propose a simple, implementable, distributed scheduling policy which provides high throughput in the presence of minimal internal buffer. We also obtain a natural trade-off between throughput, internal speedup and buffer-size providing a switch designer with a gamut of designs. To the best of authors' knowledge, this is one of the first attempts to study the throughput for general networks with finite queue-size. We believe that our methods are general and can be useful in other contexts.
{"title":"On the maximal throughput of networks with finite buffers and its application to buffered crossbars","authors":"P. Giaccone, Emilio Leonardi, D. Shah","doi":"10.1109/INFCOM.2005.1498326","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498326","url":null,"abstract":"The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assumes the availability of infinite queue-size. Instead, in this paper, we study the maximal achievable throughput in a flow-controlled lossless network with finite-queue size. In such networks, throughput depends on the packet scheduling policy utilized. As the main of this paper, we obtain a dynamic scheduling policy that achieves the maximal throughput (equal to the maximal throughput in the presence of infinite queue-size) with a minimal finite queue-size at the internal nodes of the network. Though the performance of the policy is ideal, it is quite complex and hence difficult to implement. This leads us to a design of simpler and possibly implementable policy. We obtain a natural trade-off between throughput and queue-size for this policy. We apply our results to the packet switches with buffered crossbar architecture. We propose a simple, implementable, distributed scheduling policy which provides high throughput in the presence of minimal internal buffer. We also obtain a natural trade-off between throughput, internal speedup and buffer-size providing a switch designer with a gamut of designs. To the best of authors' knowledge, this is one of the first attempts to study the throughput for general networks with finite queue-size. We believe that our methods are general and can be useful in other contexts.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"16 1","pages":"971-980 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76461852","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498353
Sándor Rácz, Tamás Jakabfy, J. Farkas, Csaba Antal
Admission control algorithms used in access networks for multiplexed voice sources are typically based on aggregated system characteristics, such as aggregate loss probability. Even though the relation of these aggregate performance measures to the performance of specific flows is not trivial, it has gained limited attention so far. We propose an admission control method that provides flow level QoS guarantees. The proposed method is based on Gaussian approximation applied for the bufferless multiplexing model. We show that the flow level packet loss violation probability can be approximated as the quantile of a normal distribution and we give a method to calculate its mean and variance. The obtained admission control formula includes the moments of the activity factor distribution.
{"title":"Connection admission control for flow level QoS in bufferless models","authors":"Sándor Rácz, Tamás Jakabfy, J. Farkas, Csaba Antal","doi":"10.1109/INFCOM.2005.1498353","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498353","url":null,"abstract":"Admission control algorithms used in access networks for multiplexed voice sources are typically based on aggregated system characteristics, such as aggregate loss probability. Even though the relation of these aggregate performance measures to the performance of specific flows is not trivial, it has gained limited attention so far. We propose an admission control method that provides flow level QoS guarantees. The proposed method is based on Gaussian approximation applied for the bufferless multiplexing model. We show that the flow level packet loss violation probability can be approximated as the quantile of a normal distribution and we give a method to calculate its mean and variance. The obtained admission control formula includes the moments of the activity factor distribution.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"55 1","pages":"1273-1282 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88401696","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498497
Ashish Raniwala, T. Chiueh
Even though multiple non-overlapped channels exist in the 2.4 GHz and 5 GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a result, these networks rarely can fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. This prevents them from being used as an ISP's wireless last-mile access network or as a wireless enterprise backbone network. In this paper, we propose a multi-channel wireless mesh network (WMN) architecture (called Hyacinth) that equips each mesh network node with multiple 802.11 network interface cards (NICs). The central design issues of this multi-channel WMN architecture are channel assignment and routing. We show that intelligent channel assignment is critical to Hyacinth's performance, present distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets, and compare their performance against a centralized algorithm that performs the same functions. Through an extensive simulation study, we show that even with just 2 NICs on each node, it is possible to improve the network throughput by a factor of 6 to 7 when compared with the conventional single-channel ad hoc network architecture. We also describe and evaluate a 9-node Hyacinth prototype that Is built using commodity PCs each equipped with two 802.11a NICs.
{"title":"Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network","authors":"Ashish Raniwala, T. Chiueh","doi":"10.1109/INFCOM.2005.1498497","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498497","url":null,"abstract":"Even though multiple non-overlapped channels exist in the 2.4 GHz and 5 GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a result, these networks rarely can fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. This prevents them from being used as an ISP's wireless last-mile access network or as a wireless enterprise backbone network. In this paper, we propose a multi-channel wireless mesh network (WMN) architecture (called Hyacinth) that equips each mesh network node with multiple 802.11 network interface cards (NICs). The central design issues of this multi-channel WMN architecture are channel assignment and routing. We show that intelligent channel assignment is critical to Hyacinth's performance, present distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets, and compare their performance against a centralized algorithm that performs the same functions. Through an extensive simulation study, we show that even with just 2 NICs on each node, it is possible to improve the network throughput by a factor of 6 to 7 when compared with the conventional single-channel ad hoc network architecture. We also describe and evaluate a 9-node Hyacinth prototype that Is built using commodity PCs each equipped with two 802.11a NICs.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"73 1","pages":"2223-2234 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91377081","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
扫码关注我们
求助内容：
应助结果提醒方式：