Rapid growth of demand for various wireless communication services has led the industry and the researches to investigate on a new generation of telecommunication systems. One of the main objectives in designing and developing these systems is to provide the mobile user with a robust connection to different networks so that the users can move freely between heterogeneous networks while running their computing applications. Handoff is a process, which maintains a mobile user's active connection as it moves within wireless networks and vertical handoff considers handoff between different types of networks or otherwise stated between different network layers. In this paper a location estimation technique in multitier (overlay) networks with application to use with vertical handoff algorithm for optimization and network conditions improvement is proposed. First the concept of proposed algorithm for location estimation is discussed, then we talk about the simulation environment and some optimizations for our pattern classifier, finally a performance analysis demonstrates that significant improvement can be achieved from the proposed technique and its optimization.
{"title":"User location estimation in wireless networks with application to vertical handoff using pattern recognition","authors":"A. Mehbodniya, J. Chitizadeh","doi":"10.1109/ISCC.2005.152","DOIUrl":"https://doi.org/10.1109/ISCC.2005.152","url":null,"abstract":"Rapid growth of demand for various wireless communication services has led the industry and the researches to investigate on a new generation of telecommunication systems. One of the main objectives in designing and developing these systems is to provide the mobile user with a robust connection to different networks so that the users can move freely between heterogeneous networks while running their computing applications. Handoff is a process, which maintains a mobile user's active connection as it moves within wireless networks and vertical handoff considers handoff between different types of networks or otherwise stated between different network layers. In this paper a location estimation technique in multitier (overlay) networks with application to use with vertical handoff algorithm for optimization and network conditions improvement is proposed. First the concept of proposed algorithm for location estimation is discussed, then we talk about the simulation environment and some optimizations for our pattern classifier, finally a performance analysis demonstrates that significant improvement can be achieved from the proposed technique and its optimization.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116629825","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}
It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper the first buffer overflow time in a constant service rate queue is studied. In particular, the formulas for Laplace transform and expected value of its distribution for any initial queue size are proven. Moreover, numerical illustrations of analytical results are presented.
{"title":"Distribution of the first buffer overflow time in a deterministic service time queue","authors":"A. Chydzinski, Ryszard Winiarczyk","doi":"10.1109/ISCC.2005.54","DOIUrl":"https://doi.org/10.1109/ISCC.2005.54","url":null,"abstract":"It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper the first buffer overflow time in a constant service rate queue is studied. In particular, the formulas for Laplace transform and expected value of its distribution for any initial queue size are proven. Moreover, numerical illustrations of analytical results are presented.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123328937","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}
In this paper, the problem of allocating multiple finite resources to satisfy the quality of service (QoS) needs of multiple applications along multiple QoS dimensions is presented. A mathematical model that captures the dynamics of such adaptive problem is presented. This model formulates the problem as multiple-choice multidimensional 0-1 knapsack problem (MMKP), an NP-hard optimization problem. A heuristic algorithm is then proposed to solve the MMKP. Experimental results demonstrate that our proposed algorithm finds 96% optimal solutions on average, and outperforms other heuristic algorithms for MMKP. Furthermore, the time required is on average 50% to 70% less than that required by other benchmark heuristics. These two properties make this heuristic a strong candidate for use in real-time applications.
{"title":"Notice of Violation of IEEE Publication PrinciplesResource management and quality adaptation in distributed multimedia networks","authors":"A. E. Lawabni, A. Tewfik","doi":"10.1109/ISCC.2005.134","DOIUrl":"https://doi.org/10.1109/ISCC.2005.134","url":null,"abstract":"In this paper, the problem of allocating multiple finite resources to satisfy the quality of service (QoS) needs of multiple applications along multiple QoS dimensions is presented. A mathematical model that captures the dynamics of such adaptive problem is presented. This model formulates the problem as multiple-choice multidimensional 0-1 knapsack problem (MMKP), an NP-hard optimization problem. A heuristic algorithm is then proposed to solve the MMKP. Experimental results demonstrate that our proposed algorithm finds 96% optimal solutions on average, and outperforms other heuristic algorithms for MMKP. Furthermore, the time required is on average 50% to 70% less than that required by other benchmark heuristics. These two properties make this heuristic a strong candidate for use in real-time applications.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116042439","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}
The goal of expedited forwarding (EF) behavior is to provide a definition for low-loss, low-delay, and low-jitter service for network nodes that implement differentiated services (DiffServ) framework. Having strict timing requirement, EF traffic needs accurate and simple scheduler. Available simple schedulers suffer from various problems like starving low quality traffics and producing long bursts in the core of network. On the other hand, accurate approaches are expensive to implement in higher rates. Adaptive priority queue (ADPQ) is an adaptive approach which can control a node's output burst and removes the starvation threat while preserving delay- and jitter-constraints of delay-sensitive EF traffic. It is cheaper than fair queuing (FQ) techniques and presents great performance in face of TCP flows.
EF (expedited forwarding)行为的目标是为实现差异化服务(DiffServ)框架的网络节点提供一种低损耗、低延迟、低抖动的服务定义。EF交通具有严格的定时要求，需要准确、简单的调度程序。可用的简单调度器会遇到各种各样的问题，比如缺乏低质量的流量和在网络核心产生长时间的突发。另一方面，精确的方法在更高的速率下实现是昂贵的。自适应优先级队列(ADPQ)是一种自适应方法，它可以控制节点的输出突发并消除饥饿威胁，同时保留延迟敏感EF流量的延迟和抖动约束。它比公平排队(FQ)技术便宜，并且在面对TCP流时表现出出色的性能。
{"title":"ADPQ: an adaptive approach for expedited forwarding traffic scheduling","authors":"H. Khanmirza, S. Zarifzadeh, N. Yazdani","doi":"10.1109/ISCC.2005.20","DOIUrl":"https://doi.org/10.1109/ISCC.2005.20","url":null,"abstract":"The goal of expedited forwarding (EF) behavior is to provide a definition for low-loss, low-delay, and low-jitter service for network nodes that implement differentiated services (DiffServ) framework. Having strict timing requirement, EF traffic needs accurate and simple scheduler. Available simple schedulers suffer from various problems like starving low quality traffics and producing long bursts in the core of network. On the other hand, accurate approaches are expensive to implement in higher rates. Adaptive priority queue (ADPQ) is an adaptive approach which can control a node's output burst and removes the starvation threat while preserving delay- and jitter-constraints of delay-sensitive EF traffic. It is cheaper than fair queuing (FQ) techniques and presents great performance in face of TCP flows.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117255216","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}
B. Berde, Hanine Abdelkrim, M. Vigoureux, R. Douville, D. Papadimitriou
Automatically switched circuit establishment is a big step for the operators towards the automation of transport services. The aim is to reduce OPEX while improving service capabilities through a distributed generalized multi-protocol label switching (GMPLS) control plane. Nevertheless, the control plane may not operate on its own and, hence, network operators need a holistic service production platform where intensified traffic engineering (TE) capabilities exist when operating the control plane. The aim of this paper is to point out and discuss issues to be addressed and to provide guiding principles as well as a policy-based management (PBM) solution pertaining to enhanced TE related to the GMPLS control plane protocols and the corresponding network management issues.
{"title":"Improving network performance through policy-based management applied to generalized multi-protocol label switching","authors":"B. Berde, Hanine Abdelkrim, M. Vigoureux, R. Douville, D. Papadimitriou","doi":"10.1109/ISCC.2005.82","DOIUrl":"https://doi.org/10.1109/ISCC.2005.82","url":null,"abstract":"Automatically switched circuit establishment is a big step for the operators towards the automation of transport services. The aim is to reduce OPEX while improving service capabilities through a distributed generalized multi-protocol label switching (GMPLS) control plane. Nevertheless, the control plane may not operate on its own and, hence, network operators need a holistic service production platform where intensified traffic engineering (TE) capabilities exist when operating the control plane. The aim of this paper is to point out and discuss issues to be addressed and to provide guiding principles as well as a policy-based management (PBM) solution pertaining to enhanced TE related to the GMPLS control plane protocols and the corresponding network management issues.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128441045","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}
Tariq Al-Khasib, H. Alnuweiri, H. Fattah, Victor C. M. Leung
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved quality of service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called mini round robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.
{"title":"Fair and efficient frame-based scheduling algorithm for multimedia networks","authors":"Tariq Al-Khasib, H. Alnuweiri, H. Fattah, Victor C. M. Leung","doi":"10.1109/ISCC.2005.69","DOIUrl":"https://doi.org/10.1109/ISCC.2005.69","url":null,"abstract":"The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved quality of service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called mini round robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129924160","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}
We describe a modular reference implementation of an IP-based DSL access multiplexer (DSLAM). We identify deployment trends and primary tasks a future DSLAM has to offer. The implementation is representative of applications in access networks and indicative of real-world performance. To accomplish these goals our tool flow CRACC takes a modular application description and generates code for embedded processors that can easily be ported to different platforms. The derived implementation serves as a benchmark for DSLAM systems. It therefore allows the comparison of different architectures, partitioning, and mapping decisions. In addition to a full system benchmark, our reference implementation is a functionally correct realization with defined evaluation environment, traffic sources, and load scenarios. We present evaluation results of our DSLAM implementation on several embedded processors.
{"title":"Modular reference implementation of an IP-DSLAM","authors":"C. Sauer, M. Gries, Sören Sonntag","doi":"10.1109/ISCC.2005.106","DOIUrl":"https://doi.org/10.1109/ISCC.2005.106","url":null,"abstract":"We describe a modular reference implementation of an IP-based DSL access multiplexer (DSLAM). We identify deployment trends and primary tasks a future DSLAM has to offer. The implementation is representative of applications in access networks and indicative of real-world performance. To accomplish these goals our tool flow CRACC takes a modular application description and generates code for embedded processors that can easily be ported to different platforms. The derived implementation serves as a benchmark for DSLAM systems. It therefore allows the comparison of different architectures, partitioning, and mapping decisions. In addition to a full system benchmark, our reference implementation is a functionally correct realization with defined evaluation environment, traffic sources, and load scenarios. We present evaluation results of our DSLAM implementation on several embedded processors.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"10 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113980250","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}
This paper introduces a reliable multicast transport protocol RCCMP (reliable congestion controlled multicast protocol) that has been designed to be simple, scalable, reliable and TCP-friendly. The congestion control is a central part of the protocol, where the feedback of the worst receiver is used to control a transmission window in a TCP-like fashion. The scalability issue is addressed with an exponential timers scheme, that is also used to estimate the number of receivers involved in the communication. The protocol neither needs support from network elements nor maintains state information dependent of the number of receivers. The paper presents a number of simulation results on its performance. Besides, some design choices are evaluated.
{"title":"RCCMP: a TCP-friendly reliable multicast transport protocol","authors":"Javier Munoz Kirschberg, M. Delgado, S. Sallent","doi":"10.1109/ISCC.2005.130","DOIUrl":"https://doi.org/10.1109/ISCC.2005.130","url":null,"abstract":"This paper introduces a reliable multicast transport protocol RCCMP (reliable congestion controlled multicast protocol) that has been designed to be simple, scalable, reliable and TCP-friendly. The congestion control is a central part of the protocol, where the feedback of the worst receiver is used to control a transmission window in a TCP-like fashion. The scalability issue is addressed with an exponential timers scheme, that is also used to estimate the number of receivers involved in the communication. The protocol neither needs support from network elements nor maintains state information dependent of the number of receivers. The paper presents a number of simulation results on its performance. Besides, some design choices are evaluated.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124042783","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}
In end-to-end monitoring, traffic measurements are recorded at the source and destination nodes. In QoS distribution monitoring, the measurements are recorded at several intermediate nodes along a connection. End-to-end monitoring is conceptually simple and easy to implement, but not capable of localizing the degradation. Thus, any corrective action has to be applied end-to-end, which can be prohibitively expensive. Although QoS distribution monitoring holds the promise of being able to localize the degradation to a single domain, prevalent QoS distribution monitoring techniques do not consistently provide this capability. They also consume excessive resources in the monitoring process and rely on assumptions which are unlikely to hold in practice. In this paper we describe the design tradeoffs associated with QoS distribution monitoring and highlight the limitations of the existing research. We then describe a QoS distribution monitoring scheme which provides practical solutions to these challenges. Using extensive analysis we compare the efficiency of the proposed scheme to the prevalent ones.
{"title":"An efficient QoS distribution monitoring scheme","authors":"H. Elazhary, S. Gokhale, R. Ammar","doi":"10.1109/ISCC.2005.24","DOIUrl":"https://doi.org/10.1109/ISCC.2005.24","url":null,"abstract":"In end-to-end monitoring, traffic measurements are recorded at the source and destination nodes. In QoS distribution monitoring, the measurements are recorded at several intermediate nodes along a connection. End-to-end monitoring is conceptually simple and easy to implement, but not capable of localizing the degradation. Thus, any corrective action has to be applied end-to-end, which can be prohibitively expensive. Although QoS distribution monitoring holds the promise of being able to localize the degradation to a single domain, prevalent QoS distribution monitoring techniques do not consistently provide this capability. They also consume excessive resources in the monitoring process and rely on assumptions which are unlikely to hold in practice. In this paper we describe the design tradeoffs associated with QoS distribution monitoring and highlight the limitations of the existing research. We then describe a QoS distribution monitoring scheme which provides practical solutions to these challenges. Using extensive analysis we compare the efficiency of the proposed scheme to the prevalent ones.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126464600","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
扫码关注我们
求助内容：
应助结果提醒方式：