{"title":"A delayed multiple copy retransmission scheme for data communication in wireless networks","authors":"Jing Zhu, Z. Niu, Yi Wu","doi":"10.1109/ICON.2001.962359","DOIUrl":"https://doi.org/10.1109/ICON.2001.962359","url":null,"abstract":"We propose a delayed multiple copy retransmission (DMCR) scheme for data communication in wireless networks, by which multiple copies of a lost link layer frame are retransmitted at the link layer one-by-one with a delay in between. The number of the copies gradually increases as the number of retransmissions increases. For implementing DMCR scheme in a typical mobile communication system, an interleaving scheme is also proposed. Moreover, a simplified method called polling is suggested when retransmission times are very limited. We compare our scheme with the previous non-delayed retransmission scheme on the performance of both channel capacity and total transmission time. Numerical results show that the DMCR can achieve higher performance. The effect of the delay time on end-to-end TCP throughput is investigated as well.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130252835","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}
{"title":"Adaptive mobile multimedia QoS control and resource management","authors":"Jianfeng Wang, Peng Cao, Xuejun Yang","doi":"10.1109/ICON.2001.962363","DOIUrl":"https://doi.org/10.1109/ICON.2001.962363","url":null,"abstract":"Soft QoS control and network resource management are key techniques to support adaptive multimedia services.We propose a novel adaptive multimedia service model based on application class and QoS grade and a new bandwidth allocation scheme for efficient and fair utilization of wireless network resource. Service performance, scalability and overhead issues are analyzed.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123760069","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}
{"title":"A two-phase approach for virtual topology reconfiguration of wavelength-routed WDM optical networks","authors":"N. Sreenath, G.R. Panesar, C. Murthy","doi":"10.1109/ICON.2001.962370","DOIUrl":"https://doi.org/10.1109/ICON.2001.962370","url":null,"abstract":"In a WDM network, messages are carried in all-optical form using lightpaths. These set of semi-permanent light-paths may be viewed as a virtual topology. Virtual topologies are designed to optimize some objective function with traffic as the input. The virtual topology may need to be changed in response to the changing traffic patterns. This process of changing the virtual topology is called reconfiguration. We view the reconfiguration as an on-line process and it provides a tradeoff between the objective function value and the number of changes to the virtual topology. The objective function value decides how best the topology is suited for the given traffic demand. The number of changes decides the extent of disruption of traffic in the network while making a transition to the new virtual topology. We develop a heuristic based on a two-phase approach. The effectiveness of the proposed heuristics is verified by extensive simulation experiments.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125277059","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}
{"title":"An optimal frame size predictor for indoor wireless network","authors":"S. Ci, H. Sharif, A. Young","doi":"10.1109/ICON.2001.962361","DOIUrl":"https://doi.org/10.1109/ICON.2001.962361","url":null,"abstract":"An optimal frame size predictor for an indoor wireless network is studied. A Kalman filter is employed in order to predict optimal frame size. The closed form of state transition equation and observation equations under indoor wireless channel are derived. For analyzing the proposed predictor, a revised wall attenuation factor (WAF) indoor wireless channel model is developed and discussed. Through simulation, it is shown that the proposed algorithm can substantially lower the estimation error by the order of 10/sup 2/. Moreover it is also easy to implement. In the context of optimal frame size prediction, the proposed prediction methodology can be applied to predict other state parameters like receiving power bit error rate etc., and is also applicable to outdoor wireless networks.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129578225","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}
{"title":"Performance analysis of CDPA: an approach for new cellular access","authors":"S. Malarvizhi, M. Meenakshi","doi":"10.1109/ICON.2001.962360","DOIUrl":"https://doi.org/10.1109/ICON.2001.962360","url":null,"abstract":"This paper presents a new access method in a cellular environment, known as capture-division packet access, a packet-oriented architecture that overcomes most of the limitations of present cellular systems. The channel reuse of this method is an new alternative compared to TDMA, FDMA and CDMA multiple-access schemes. In CDPA a single frequency channel is used and parallel transmissions are achieved through the \"capture\" capability of receivers. CDPA integrates the multiple access and channel reuse issues to achieve a high degree of spectral efficiency. It allows each user to access the entire channel, for brief periods of time. Spectrum sharing is done by exploiting the different path losses suffered by the various signals as they appear at the base stations (BS). Packets that are not captured are almost immediately retransmitted. The need for extra radio traffic in handover is eliminated, as CDPA is a connectionless approach with any BS. The CDPA method has been simulated under various system parameters and its performance is analyzed.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128361170","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}
{"title":"Load balancing algorithms for Internet video and audio server","authors":"D. Niyato, C. Srinilta","doi":"10.1109/ICON.2001.962320","DOIUrl":"https://doi.org/10.1109/ICON.2001.962320","url":null,"abstract":"This paper reports the application of load balancing algorithms on Internet video and audio media server. We took into account two server architectures: centralized and distributed load balancing; and five load balancing algorithms: random, round-robin, adaptive bidding, diffusion, and state change broadcast. The startup time and system distance were measured in the experiments. The results show that the response time of distributed load balancing is less than the centralized load balancing architecture. And algorithms that use more load information can balance the load on video and audio media server better, but produce more response time.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124027393","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}
{"title":"PKI and digital certification infrastructure","authors":"R. Hunt","doi":"10.1109/ICON.2001.962346","DOIUrl":"https://doi.org/10.1109/ICON.2001.962346","url":null,"abstract":"Secure VPN technology is only possible with the use of appropriate security systems such as encryption, digital signatures, digital certificates, public/private key pairs, non-repudiation, and time-stamping. A PKI comprises a system of certificates, certificate authorities, subjects, relying partners, registration authorities, and key repositories that provide for safe and reliable communications. This paper discusses these key technologies focusing particularly on standardisation as well as looking at some of the challenges pending its widespread operation in the industry.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123539860","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}
{"title":"A very accurate approximation for cell loss ratio in ATM networks","authors":"A. Haghighat, K. Faez","doi":"10.1109/ICON.2001.962354","DOIUrl":"https://doi.org/10.1109/ICON.2001.962354","url":null,"abstract":"We like to find the cell loss ratio in ATM networks when the statistical multiplexing is an important factor. In this paper, first we have proposed the combination of three analytical expressions, which approximate the cell loss probability, based on the fluid-flow approximation model and two stationary approximation models. Second, we have provided a very accurate numerical model for the finite buffer, which lies at the input of each VP. The sources are statistically independent and each traffic source has a two-state Markov model. This simulation is done at the cell level and its results are very accurate. We have compared the results of the numerical simulation with the results of the analytical approximation models. Also we have used linear estimation to find an accurate expression for cell loss approximation in ATM networks.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"16 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114092171","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}
Johannes Schmitt, Frank A. Zdarsky, M. Karsten, R. Steinmetz
{"title":"Heterogeneous multicast in heterogeneous QoS networks","authors":"Johannes Schmitt, Frank A. Zdarsky, M. Karsten, R. Steinmetz","doi":"10.1109/ICON.2001.962366","DOIUrl":"https://doi.org/10.1109/ICON.2001.962366","url":null,"abstract":"Supporting heterogeneous receivers in a multicast group is of particular importance in large internetworks as, e.g., the Internet, due to the large diversity of end-system and network access capabilities. Furthermore, it is the nature of large-scale internetworks which makes homogeneous quality of service (QoS) support unrealistic at least for the middle-term future. Therefore, we investigate the implications of differing multicast models in heterogeneous QoS networks. In particular, we approach the problem an edge devices faces when mapping a heterogeneous QoS multicast from an overlaid QoS system onto a system providing only a homogeneous QoS multicast. The generic solution technique we propose for this problem is called foresting. The idea of foresting is to support a heterogeneous multicast by a forest of homogeneous multicast trees. We develop different foresting algorithms and compare them by extensive simulations.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125651143","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}
{"title":"A framework-based approach to build adaptive multimedia applications with quality of service","authors":"Sediane Carmem Lunardi, F. Dotti","doi":"10.1109/ICON.2001.962395","DOIUrl":"https://doi.org/10.1109/ICON.2001.962395","url":null,"abstract":"The current Internet provides a single class best-effort service. However, the continuous data traffic (e.g., audio and video) of new applications that are emerging over the Internet have different characteristics if compared to conventional data traffic (e.g., text and images) and consequently have different QoS (quality of service) requirements. Several approaches have been developed trying to guarantee QoS. The development of applications that have the capability to adapt their behavior, depending on the network performance, is one example of such approaches. Inside this context, this paper introduces the development of application programming interface (API) to incorporate QoS in multimedia applications. This API has QoS monitoring functions through RTCP (real time control protocol) packets and QoS adaptation functions through the application of adaptation policies.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133963755","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}