There has been a considerable interest shown in the area of mobility. With the advent of powerful portable devices such as laptop and palmtop there is a growing trend amongst users to go the nomadic way. This implies that a user can get access to any service at any time without any interruption. Such nomadic computing poses several challenges in multicasting and security. We first consider a framework that has been proposed by Acharya, Bakre and Badrinath (see Rutgers DCS TechReport LCS R-TR 243, 1995) for multicasting in mobile IP networks. We extend this framework to support a secure multicasting service. We describe secure schemes for a mobile host to initiate, join and leave a multicast group. We also discuss the secure movement of mobile hosts in intra and inter campus environments.
{"title":"Secure multicast extensions for mobile networks","authors":"R. Shankaran, V. Varadharajan, M. Hitchens","doi":"10.1109/LCN.1999.802004","DOIUrl":"https://doi.org/10.1109/LCN.1999.802004","url":null,"abstract":"There has been a considerable interest shown in the area of mobility. With the advent of powerful portable devices such as laptop and palmtop there is a growing trend amongst users to go the nomadic way. This implies that a user can get access to any service at any time without any interruption. Such nomadic computing poses several challenges in multicasting and security. We first consider a framework that has been proposed by Acharya, Bakre and Badrinath (see Rutgers DCS TechReport LCS R-TR 243, 1995) for multicasting in mobile IP networks. We extend this framework to support a secure multicasting service. We describe secure schemes for a mobile host to initiate, join and leave a multicast group. We also discuss the secure movement of mobile hosts in intra and inter campus environments.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133049596","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}
Previous articles by Frank and Martini (see 22nd Annual Conference on Local Computer Networks, LCN '97, Minneapolis, 1997 and 23rd Annual Conference on Local Computer Networks, LCN'98, Boston, 1998) on the concept of ROBIN (Regulation Of Bandwidth in Intra-Networks) gave a motivation for and presented first results of our approach to regulate the sending bandwidth of data flows in heterogeneous campus networks by determining bottlenecks and possible rate limitations with a global knowledge of the network state based on the end-to-end operation of the mechanism. This paper presents the latest results of our performance study of the ROBIN approach with a focus on the scalability and the concept of data flow aggregation within the bandwidth regulation. The QoS properties of ROBIN together with the flow aggregation for the local domain show a close relation to the ideas of the differentiated services activities for QoS support in the Internet, which is also discussed in this paper.
{"title":"Flow aggregation and scalability with ROBIN: end-to-end regulation of bandwidth in intra-networks","authors":"S. Baatz, M. Frank, P. Martini, A. Wenzel","doi":"10.1109/LCN.1999.802023","DOIUrl":"https://doi.org/10.1109/LCN.1999.802023","url":null,"abstract":"Previous articles by Frank and Martini (see 22nd Annual Conference on Local Computer Networks, LCN '97, Minneapolis, 1997 and 23rd Annual Conference on Local Computer Networks, LCN'98, Boston, 1998) on the concept of ROBIN (Regulation Of Bandwidth in Intra-Networks) gave a motivation for and presented first results of our approach to regulate the sending bandwidth of data flows in heterogeneous campus networks by determining bottlenecks and possible rate limitations with a global knowledge of the network state based on the end-to-end operation of the mechanism. This paper presents the latest results of our performance study of the ROBIN approach with a focus on the scalability and the concept of data flow aggregation within the bandwidth regulation. The QoS properties of ROBIN together with the flow aggregation for the local domain show a close relation to the ideas of the differentiated services activities for QoS support in the Internet, which is also discussed in this paper.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125596070","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 our ongoing development of a network node architecture, which meets the requirements of dynamic run-time installation and configuration of network services. The objective is to provide a network service run-time system, which is independent from installed services and suitable for effective deployment of existing, new and future services. By developing network service specific resource abstractions, the architecture will be more flexible than existing approaches.
{"title":"On programming of network services","authors":"Ascan F. Morlang, I. Schieferdecker","doi":"10.1109/LCN.1999.801998","DOIUrl":"https://doi.org/10.1109/LCN.1999.801998","url":null,"abstract":"This paper introduces our ongoing development of a network node architecture, which meets the requirements of dynamic run-time installation and configuration of network services. The objective is to provide a network service run-time system, which is independent from installed services and suitable for effective deployment of existing, new and future services. By developing network service specific resource abstractions, the architecture will be more flexible than existing approaches.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125625047","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 describes an architecture for the management of QoS-enabled virtual private networks (VPNs) over the Internet. The architecture focuses on two important issues of VPNs: security and quality-of-service (QoS). The security achieved in VPNs is based on IPSec tunnels, while QoS can be supported by mechanisms as proposed by the differentiated services currently being defined by the IETF. We describe an architecture that is based on the concept of service brokers. These service brokers are used for communication between different domains (such as ISP and customer networks) as well as within domains. The architecture described in the paper is currently being implemented as part of the CATI project funded by the Swiss National Science Foundation (SNF).
{"title":"An architecture for managing QoS-enabled VPNs over the Internet","authors":"Manuel Günter, T. Braun, I. Khalil","doi":"10.1109/LCN.1999.802006","DOIUrl":"https://doi.org/10.1109/LCN.1999.802006","url":null,"abstract":"This paper describes an architecture for the management of QoS-enabled virtual private networks (VPNs) over the Internet. The architecture focuses on two important issues of VPNs: security and quality-of-service (QoS). The security achieved in VPNs is based on IPSec tunnels, while QoS can be supported by mechanisms as proposed by the differentiated services currently being defined by the IETF. We describe an architecture that is based on the concept of service brokers. These service brokers are used for communication between different domains (such as ISP and customer networks) as well as within domains. The architecture described in the paper is currently being implemented as part of the CATI project funded by the Swiss National Science Foundation (SNF).","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130985433","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 paper discusses the data flow and buffer management for an integrated ASIC performing the high level data link control (HDLC) protocol processing functions for large number of multi-rate (n/spl times/64 kbps) and/or sub-rate (p/spl times/8 kbps) logical channels supported over time division multiplexing (TDM) network interfaces. The highly integrated ASICs are sought-out by the original equipment manufacturers (OEMs) to meet the growing demand for port and connection density. The integration, however, poses a significant challenge for ASIC developers in managing the large number of data flows. Thus, a data flow and buffer management mechanism is required for efficiently managing the data flows so as to maximize the utilization of the network bandwidth and minimize the data loss. The design and analysis of such a mechanism is addressed. The mechanism implementation encompasses both the host and ASIC domains, however, the host domain design is given emphasis in the paper. The critical parameters in the sub-system are identified and characterized utilizing the simulation model. A prototype is built for the host domain in the network driver interface specifications (NDIS) framework in the form of a kernel mode device driver on a generic computing platform. The mechanism was tested satisfactorily with the programmable ASIC device that consists of an embedded reduced instruction set computer (RISC) processor and many significant features suitable for TDM based telecommunications and data communications applications.
{"title":"Data flow and buffer management in multi-channel data link controller","authors":"S. Varada, V. Oduol, A. Shelat","doi":"10.1109/LCN.1999.802007","DOIUrl":"https://doi.org/10.1109/LCN.1999.802007","url":null,"abstract":"The paper discusses the data flow and buffer management for an integrated ASIC performing the high level data link control (HDLC) protocol processing functions for large number of multi-rate (n/spl times/64 kbps) and/or sub-rate (p/spl times/8 kbps) logical channels supported over time division multiplexing (TDM) network interfaces. The highly integrated ASICs are sought-out by the original equipment manufacturers (OEMs) to meet the growing demand for port and connection density. The integration, however, poses a significant challenge for ASIC developers in managing the large number of data flows. Thus, a data flow and buffer management mechanism is required for efficiently managing the data flows so as to maximize the utilization of the network bandwidth and minimize the data loss. The design and analysis of such a mechanism is addressed. The mechanism implementation encompasses both the host and ASIC domains, however, the host domain design is given emphasis in the paper. The critical parameters in the sub-system are identified and characterized utilizing the simulation model. A prototype is built for the host domain in the network driver interface specifications (NDIS) framework in the form of a kernel mode device driver on a generic computing platform. The mechanism was tested satisfactorily with the programmable ASIC device that consists of an embedded reduced instruction set computer (RISC) processor and many significant features suitable for TDM based telecommunications and data communications applications.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129468773","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}
N. Georgantas, N. Papadoukakis, A. Liveris, E. Sykas
The widespread interest for wireless LAN applications has boosted relative research efforts during the last few years. Although both the IEEE and ETSI have proposed wireless LAN standards which utilise the advances in wireless technology to provide high bandwidth, the investigation of the capabilities of applied wireless technologies to provide LAN services are of both technical and economic interest. This paper proposes an implementation oriented architecture and set of functions for a wireless LAN which is based on the ETSI Digital Enhanced Cordless Telecommunications (DECT) protocol. It particularly presents a dynamic bandwidth management scheme, enabling the wireless LAN to efficiently support asynchronous data transfer services characterised by burst mode traffic. For the evaluation of the bandwidth management scheme, the paper proposes an analytic traffic model with adaptive service rate for each system queue and solves it based on a number of logical assumptions. The model is utilised to calculate parameters such as the average delay and the average number of packets in the system queues in order to approximately "describe" the behaviour of the system.
{"title":"Modelling of a bandwidth management scheme for DECT wireless access to a local area network","authors":"N. Georgantas, N. Papadoukakis, A. Liveris, E. Sykas","doi":"10.1109/LCN.1999.801994","DOIUrl":"https://doi.org/10.1109/LCN.1999.801994","url":null,"abstract":"The widespread interest for wireless LAN applications has boosted relative research efforts during the last few years. Although both the IEEE and ETSI have proposed wireless LAN standards which utilise the advances in wireless technology to provide high bandwidth, the investigation of the capabilities of applied wireless technologies to provide LAN services are of both technical and economic interest. This paper proposes an implementation oriented architecture and set of functions for a wireless LAN which is based on the ETSI Digital Enhanced Cordless Telecommunications (DECT) protocol. It particularly presents a dynamic bandwidth management scheme, enabling the wireless LAN to efficiently support asynchronous data transfer services characterised by burst mode traffic. For the evaluation of the bandwidth management scheme, the paper proposes an analytic traffic model with adaptive service rate for each system queue and solves it based on a number of logical assumptions. The model is utilised to calculate parameters such as the average delay and the average number of packets in the system queues in order to approximately \"describe\" the behaviour of the system.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115201478","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 term lip synchronisation applies to synchronising audio with the movement of a person's lips. If the data is out of synchronisation then human perception tends to identify the presentation as artificial, strange and annoying. We propose metrics to evaluate the degree of synchronisation for interactive multimedia communications. Through experimental results we demonstrate that such metrics are quite useful in providing quality of service (QoS) feedback to end users. A quantitative evaluation of the degree of synchronisation between loosely coupled multimedia tools is performed based on mean absolute deviation calculations and a subjective evaluation.
{"title":"Synchronisation skew: a QoS measurement study","authors":"S. Jha, A. Seneviratne","doi":"10.1109/LCN.1999.802000","DOIUrl":"https://doi.org/10.1109/LCN.1999.802000","url":null,"abstract":"The term lip synchronisation applies to synchronising audio with the movement of a person's lips. If the data is out of synchronisation then human perception tends to identify the presentation as artificial, strange and annoying. We propose metrics to evaluate the degree of synchronisation for interactive multimedia communications. Through experimental results we demonstrate that such metrics are quite useful in providing quality of service (QoS) feedback to end users. A quantitative evaluation of the degree of synchronisation between loosely coupled multimedia tools is performed based on mean absolute deviation calculations and a subjective evaluation.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122163026","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 a wireless environment, due to topology changes and characteristics of media (interference in radio signals) the bandwidth of a link is unpredictable and possibly very low, the error rates are variable and extremely high. Provisioning and guaranteeing quality of service (QoS) in such an environment is a very challenging problem. In this paper we propose an adaptive and QoS framework to support multimedia applications in a wireless networking environment. The proposed framework is hierarchical in nature with cluster of mobile end hosts connected to a base station, base stations are connected to a supervisory node, which in turn is connected to the wired infrastructure. The changing conditions in wireless due to interference and possibly mobility, entitle that the real-time applications needing stringent QoS should be adaptable. The framework uses a generic feedback mechanism to support adaptability at all layers of the wireless network. An overview of existing wireless architectures which support QoS is given. The architectures discussed are WAMIS (wireless adaptive multimedia information system), SWAN (seamless wireless ATM network), MMWN (multimedia support for mobile wireless networks), and QGMC (QoS guarantees in mobile computing). The proposed approach is compared with these existing methods.
{"title":"AQuaFWiN: adaptive QoS framework for multimedia in wireless networks and its comparison with other QoS frameworks","authors":"B. Vandalore, R. Jain, S. Fahmy, S. Dixit","doi":"10.1109/LCN.1999.802002","DOIUrl":"https://doi.org/10.1109/LCN.1999.802002","url":null,"abstract":"In a wireless environment, due to topology changes and characteristics of media (interference in radio signals) the bandwidth of a link is unpredictable and possibly very low, the error rates are variable and extremely high. Provisioning and guaranteeing quality of service (QoS) in such an environment is a very challenging problem. In this paper we propose an adaptive and QoS framework to support multimedia applications in a wireless networking environment. The proposed framework is hierarchical in nature with cluster of mobile end hosts connected to a base station, base stations are connected to a supervisory node, which in turn is connected to the wired infrastructure. The changing conditions in wireless due to interference and possibly mobility, entitle that the real-time applications needing stringent QoS should be adaptable. The framework uses a generic feedback mechanism to support adaptability at all layers of the wireless network. An overview of existing wireless architectures which support QoS is given. The architectures discussed are WAMIS (wireless adaptive multimedia information system), SWAN (seamless wireless ATM network), MMWN (multimedia support for mobile wireless networks), and QGMC (QoS guarantees in mobile computing). The proposed approach is compared with these existing methods.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115338670","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}
Distributed applications have often to determine consistent cuts (global states) in order to ensure virtual synchrony between independent tasks. Moreover most of the sequential programs can be cut out in more or less independent tasks; we group these tasks into phases to allow an asynchronous computation. The processes exchange messages without a particular ordering inside each phase. But messages of two successive phases must be ordered according to the causal relation. The paper presents the concept of causal-phase and an algorithm which guarantees that the change of phase of a distributed system is safely performed, i.e., that the causal ordering of the messages events is being respected. In contrast to previous approaches, our protocol is able to handle the multi-initiator case were the change of phase is simultaneously requested by several subprocesses without requiring any kind of master process. This special scheduling establishes a synchronization between two distinct phases, that may overlap, while preserving the asynchrony of the communications, without blocking the processes.
{"title":"A causal-phase ordering protocol with multi-initiators for overlapped broadcasts","authors":"L. Amanton, M. Naimi","doi":"10.1109/LCN.1999.802053","DOIUrl":"https://doi.org/10.1109/LCN.1999.802053","url":null,"abstract":"Distributed applications have often to determine consistent cuts (global states) in order to ensure virtual synchrony between independent tasks. Moreover most of the sequential programs can be cut out in more or less independent tasks; we group these tasks into phases to allow an asynchronous computation. The processes exchange messages without a particular ordering inside each phase. But messages of two successive phases must be ordered according to the causal relation. The paper presents the concept of causal-phase and an algorithm which guarantees that the change of phase of a distributed system is safely performed, i.e., that the causal ordering of the messages events is being respected. In contrast to previous approaches, our protocol is able to handle the multi-initiator case were the change of phase is simultaneously requested by several subprocesses without requiring any kind of master process. This special scheduling establishes a synchronization between two distinct phases, that may overlap, while preserving the asynchrony of the communications, without blocking the processes.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522188","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}
TCP traffic round-trip delay measurements have been carried out in the Ericsson Corporate Network. Based on these data a comprehensive analysis has been performed to identify basic state changes in the network and to find the parametric distribution of the round-trip delay. The main finding of our research is that the round-trip delay can be well approximated by a truncated normal distribution. A method for parameter setting with the statistical tests for validation is also presented. Finally, we discuss the possible explanations of this result.
{"title":"On the distribution of round-trip delays in TCP/IP networks","authors":"Tamás Éltetö, S. Molnár","doi":"10.1109/LCN.1999.802014","DOIUrl":"https://doi.org/10.1109/LCN.1999.802014","url":null,"abstract":"TCP traffic round-trip delay measurements have been carried out in the Ericsson Corporate Network. Based on these data a comprehensive analysis has been performed to identify basic state changes in the network and to find the parametric distribution of the round-trip delay. The main finding of our research is that the round-trip delay can be well approximated by a truncated normal distribution. A method for parameter setting with the statistical tests for validation is also presented. Finally, we discuss the possible explanations of this result.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123359714","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
扫码关注我们
求助内容：
应助结果提醒方式：