Next generation networks (NGN) stipulate an open access of core networks, which were previously closed. Service-oriented architecture (SOA) is a promising way to provide the access to third party providers. So, web services, as the prevalent realisation of SOA, constitute a standard middleware between service providers and cellular networks. However the spread of new innovative services run into the problem of the privacy of personal data. Indeed, service providers will hold more and more sensitive information and users are suspicious for revealing their personal data to unauthorized and unwanted parties. Henceforth, current web service standards lack of a clear solution for providing privacy policy. We suggest that the open access of operator networks to third parties goes with the respect of the privacy policy of users. In this paper, we propose to add to parlay X gateway a novel privacy Web service, which is responsible for managing and ensuring privacy of users. To validate our solution, we apply it to location services (LCS), which is a major capability provided by 2G and 3G cellular networks.
{"title":"Privacy Based Access to Parlay X Location Services","authors":"N. Ajam","doi":"10.1109/ICNS.2008.34","DOIUrl":"https://doi.org/10.1109/ICNS.2008.34","url":null,"abstract":"Next generation networks (NGN) stipulate an open access of core networks, which were previously closed. Service-oriented architecture (SOA) is a promising way to provide the access to third party providers. So, web services, as the prevalent realisation of SOA, constitute a standard middleware between service providers and cellular networks. However the spread of new innovative services run into the problem of the privacy of personal data. Indeed, service providers will hold more and more sensitive information and users are suspicious for revealing their personal data to unauthorized and unwanted parties. Henceforth, current web service standards lack of a clear solution for providing privacy policy. We suggest that the open access of operator networks to third parties goes with the respect of the privacy policy of users. In this paper, we propose to add to parlay X gateway a novel privacy Web service, which is responsible for managing and ensuring privacy of users. To validate our solution, we apply it to location services (LCS), which is a major capability provided by 2G and 3G cellular networks.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121069292","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}
Resource ReSerVation Protocol-Traffic Engineering (RSVP-TE), and Label Distribution Protocol (LDP) may be used to set up Point to Multi Point (P2MP) trees in MPLS. RSVP-TE performs better in optimizing network resources, while LDP is simpler but has no guarantee on resource optimization. This paper presents a comparative study between RSVP-TE and LDP in regards of resource optimization and the resulting impact on the amount of memory consumed. It shows that the amount of memory needed in the case of RSVP-TE grows linearly as the size of the tree increases. In contrast, an approximate constant behavior is observed in the case of LDP, yielding an important scalability property. The paper then proposes two extension to LDP aiming to achieve better resource optimization. In both extension, a new leaf is provided a partial tree knowledge, by involving either all the nodes of the tree or only its leaves. The leaf joins the tree by connecting to the closest node among the known ones. Valuable comparisons with RSVP-TE are performed, and they represent an important background to decide when and how to use each protocol.
在MPLS中，可以使用RSVP-TE (Resource ReSerVation Protocol- traffic Engineering)协议和LDP (Label Distribution Protocol)协议建立P2MP (Point to Multi Point)树。RSVP-TE在优化网络资源方面表现更好，而LDP更简单，但不能保证资源的优化。本文介绍了RSVP-TE和LDP在资源优化方面的比较研究以及由此产生的对内存消耗量的影响。它表明，在RSVP-TE的情况下，所需的内存量随着树大小的增加而线性增长。相反，在LDP的情况下观察到一个近似的常数行为，产生一个重要的可伸缩性属性。为了实现更好的资源优化，本文对LDP进行了两种扩展。在这两种扩展中，通过涉及树的所有节点或仅涉及树的叶子，为新的叶子提供部分树知识。叶子通过连接到已知节点中最近的节点来加入树。与RSVP-TE进行了有价值的比较，它们代表了决定何时以及如何使用每种协议的重要背景。
{"title":"On Optimizing Leaf Initiated Point to Multi Point Trees in MPLS","authors":"M. Chaitou, J. L. Roux","doi":"10.1109/ICNS.2008.46","DOIUrl":"https://doi.org/10.1109/ICNS.2008.46","url":null,"abstract":"Resource ReSerVation Protocol-Traffic Engineering (RSVP-TE), and Label Distribution Protocol (LDP) may be used to set up Point to Multi Point (P2MP) trees in MPLS. RSVP-TE performs better in optimizing network resources, while LDP is simpler but has no guarantee on resource optimization. This paper presents a comparative study between RSVP-TE and LDP in regards of resource optimization and the resulting impact on the amount of memory consumed. It shows that the amount of memory needed in the case of RSVP-TE grows linearly as the size of the tree increases. In contrast, an approximate constant behavior is observed in the case of LDP, yielding an important scalability property. The paper then proposes two extension to LDP aiming to achieve better resource optimization. In both extension, a new leaf is provided a partial tree knowledge, by involving either all the nodes of the tree or only its leaves. The leaf joins the tree by connecting to the closest node among the known ones. Valuable comparisons with RSVP-TE are performed, and they represent an important background to decide when and how to use each protocol.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131651904","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 proposed mobile agent collects the load index and performs the distributed scheduling considering the behavior of the different kinds of applications. The environments obtained were considered due to the application of parallel processing of using medical images as well as the comparison of their performance time to measure them. The objective of this paper is to offer alternatives of processes scheduling aiming at maximize the use of the machines.
{"title":"Analysis of Scheduling Techniques in Distributed Parallel Environments Using Mobile Agents","authors":"G.M. Marques, R. J. Sabatine, K. Branco","doi":"10.1109/ICNS.2008.52","DOIUrl":"https://doi.org/10.1109/ICNS.2008.52","url":null,"abstract":"The proposed mobile agent collects the load index and performs the distributed scheduling considering the behavior of the different kinds of applications. The environments obtained were considered due to the application of parallel processing of using medical images as well as the comparison of their performance time to measure them. The objective of this paper is to offer alternatives of processes scheduling aiming at maximize the use of the machines.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128164241","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}
Today, telecom providers are facing changing challenges. To stay ahead in the competition and provide market leading offerings, carriers need to enable a global ecosystem of third party independent application developers to deliver converged services. This is the aim of leveraging a open standards- based service delivery platform. To identify and to cope with those challenges is the main target of the EU funded project IST DAIDALOS II. And a central point to satisfy the changing user needs is the provision of a well working, user friendly and personalized service discovery. This paper describes our work in the project on a middleware in a framework for pervasive service usage. We have designed an architecture for it, that enables full transparency to the user, grants high compatibility and extendability by a modular and pluggable conception and allows for interoperability with most known service discovery protocols. Our multi-protocol service discovery and the four phases service filtering concept enabling personalization should allow for the best possible results in service discovery.
{"title":"Personalizable Service Discovery in Pervasive Systems","authors":"K. Frank, V. Suraci, J. Mitic","doi":"10.1109/ICNS.2008.21","DOIUrl":"https://doi.org/10.1109/ICNS.2008.21","url":null,"abstract":"Today, telecom providers are facing changing challenges. To stay ahead in the competition and provide market leading offerings, carriers need to enable a global ecosystem of third party independent application developers to deliver converged services. This is the aim of leveraging a open standards- based service delivery platform. To identify and to cope with those challenges is the main target of the EU funded project IST DAIDALOS II. And a central point to satisfy the changing user needs is the provision of a well working, user friendly and personalized service discovery. This paper describes our work in the project on a middleware in a framework for pervasive service usage. We have designed an architecture for it, that enables full transparency to the user, grants high compatibility and extendability by a modular and pluggable conception and allows for interoperability with most known service discovery protocols. Our multi-protocol service discovery and the four phases service filtering concept enabling personalization should allow for the best possible results in service discovery.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470525","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}
A. Durantini, M. Petracca, F. Vatalaro, Alberto Civardi, F. Ananasso
The paper contributes to the evolution of Public Safety and Disaster Relief (PSDR) communications by specifying a solution for interoperability and integration among Professional Mobile Radio systems (TETRA and Simulcast), public systems (GSM/GPRS/UMTS), and broadband wireless technologies, such as WiMAX. A policy for PSDR services scheduling and fundamental guidelines for mapping the quality of service over heterogeneous networks are presented. Hence, the paper outlines the key issues to be debated by a regulatory authority. Operation of the devised PSDR mobile integration solution is tested to ensure complete connectivity among users adopting different communication standards, as well as to enable distributed services provisioning guaranteeing always best connection to bandwidth demanding applications provided by an IP-based core network. Finally, the employment of the envisaged integration platform is detailed in Mobile Ad-Hoc and Wireless Sensor Networks.
{"title":"Integration of Broadband Wireless Technologies and PMR Systems for Professional Communications","authors":"A. Durantini, M. Petracca, F. Vatalaro, Alberto Civardi, F. Ananasso","doi":"10.1109/ICNS.2008.30","DOIUrl":"https://doi.org/10.1109/ICNS.2008.30","url":null,"abstract":"The paper contributes to the evolution of Public Safety and Disaster Relief (PSDR) communications by specifying a solution for interoperability and integration among Professional Mobile Radio systems (TETRA and Simulcast), public systems (GSM/GPRS/UMTS), and broadband wireless technologies, such as WiMAX. A policy for PSDR services scheduling and fundamental guidelines for mapping the quality of service over heterogeneous networks are presented. Hence, the paper outlines the key issues to be debated by a regulatory authority. Operation of the devised PSDR mobile integration solution is tested to ensure complete connectivity among users adopting different communication standards, as well as to enable distributed services provisioning guaranteeing always best connection to bandwidth demanding applications provided by an IP-based core network. Finally, the employment of the envisaged integration platform is detailed in Mobile Ad-Hoc and Wireless Sensor Networks.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133599453","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 lack of source address validation on the Internet makes attack with IP spoofing a serious problem. Many methods have been proposed to solve this problem, and among them, SPM and ARBIF are effective and feasible ones. We have implemented an IPv6 source address validation device with these two methods embedded, and this device is an open framework for other source address validation mechanisms.
{"title":"Design and Implementation of an IPv6 Source Address Validation Device","authors":"Guang Yao, J. Bi","doi":"10.1109/ICNS.2008.25","DOIUrl":"https://doi.org/10.1109/ICNS.2008.25","url":null,"abstract":"The lack of source address validation on the Internet makes attack with IP spoofing a serious problem. Many methods have been proposed to solve this problem, and among them, SPM and ARBIF are effective and feasible ones. We have implemented an IPv6 source address validation device with these two methods embedded, and this device is an open framework for other source address validation mechanisms.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132780448","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 the current Internet, there is a real need for the online real-time traffic identification technique to provide different services for real-time and bulk applications. Previously, it is easy to identify real-time traffic by checking the protocol/port number in IP header, however, it becomes more difficult due to the existence of real-time traffic over TCP connection, P2P and VPN. Previously, we have proposed the online identification method based on flow statistics without checking the protocol/port number to solve these problems. However, this technique performance is unstable due to environment dependency. In this paper, at first, we reanalyze the characteristics of bulk and streaming traffic flows, which shows that the packet arrival interval varies significantly among high-bitrate, low- bitrate and bulk flows. Second, we propose a new identification method without using a fixed threshold depending on network environment. Finally, testing shows that its identification accuracy is higher than that of a previous method, which recognizes only two types of flows. It also shows that the improved method is robust against differences in the network environment.
{"title":"Environment-Independent Online Real-Time Traffic Identification","authors":"M. Tai, S. Ata, I. Oka","doi":"10.1109/ICNS.2008.44","DOIUrl":"https://doi.org/10.1109/ICNS.2008.44","url":null,"abstract":"In the current Internet, there is a real need for the online real-time traffic identification technique to provide different services for real-time and bulk applications. Previously, it is easy to identify real-time traffic by checking the protocol/port number in IP header, however, it becomes more difficult due to the existence of real-time traffic over TCP connection, P2P and VPN. Previously, we have proposed the online identification method based on flow statistics without checking the protocol/port number to solve these problems. However, this technique performance is unstable due to environment dependency. In this paper, at first, we reanalyze the characteristics of bulk and streaming traffic flows, which shows that the packet arrival interval varies significantly among high-bitrate, low- bitrate and bulk flows. Second, we propose a new identification method without using a fixed threshold depending on network environment. Finally, testing shows that its identification accuracy is higher than that of a previous method, which recognizes only two types of flows. It also shows that the improved method is robust against differences in the network environment.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121311418","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}
Multi-geocasting in wireless sensor network and ad hoc network is the delivery of packets from a source (or sink) to all the nodes located in several geographic areas. The objectives of a multi-geocasting protocol are guaranteed message delivery and low transmission cost. All the existing protocols guarantee delivery only in dense networks. In this paper, we present two multi-geocast protocols which guarantee delivery of the packets whatever is the density of the sensor network (dense or sparse). They are also suitable for networks with irregular distributions with gaps or obstacles.
{"title":"Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks","authors":"N. Hadid, J. Myoupo","doi":"10.1109/ICNS.2008.50","DOIUrl":"https://doi.org/10.1109/ICNS.2008.50","url":null,"abstract":"Multi-geocasting in wireless sensor network and ad hoc network is the delivery of packets from a source (or sink) to all the nodes located in several geographic areas. The objectives of a multi-geocasting protocol are guaranteed message delivery and low transmission cost. All the existing protocols guarantee delivery only in dense networks. In this paper, we present two multi-geocast protocols which guarantee delivery of the packets whatever is the density of the sensor network (dense or sparse). They are also suitable for networks with irregular distributions with gaps or obstacles.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116587484","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}
Adaptive charging architecture and mechanism is a hot research arena for Next Generation Service Network (NGSN). In this paper a new reconfigurable charging management platform is proposed to support adaptive charging rule generation and modification as well as reconfiguration of charging related network elements according to the static subscription charging agreement and dynamic charging information provided during the service session. The platform is apart of the Adaptive Service Provisioning Architecture (ASPA).
{"title":"A Reconfigurable Charging Management Platform within the Adaptive Service Provisioning Architecture of NGN","authors":"Zhu Hao, Mi Zhengkun, Peng Rongqun","doi":"10.1109/ICNS.2008.26","DOIUrl":"https://doi.org/10.1109/ICNS.2008.26","url":null,"abstract":"Adaptive charging architecture and mechanism is a hot research arena for Next Generation Service Network (NGSN). In this paper a new reconfigurable charging management platform is proposed to support adaptive charging rule generation and modification as well as reconfiguration of charging related network elements according to the static subscription charging agreement and dynamic charging information provided during the service session. The platform is apart of the Adaptive Service Provisioning Architecture (ASPA).","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121479044","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 addition to bit errors and packet collisions, packets in ad hoc networks are lost due to missing routes and unreachable next hop nodes. The latter is costly, since these packets consume scarce network resources as they are retransmitted up to transmission-threshold times before being discarded. In this paper we demonstrate, through experimental test beds and simulation, the advantage of ingress queuing. By comparing the experimental results with the simulation we illustrate the difference between actual behaviour and the behaviour of the system abstraction. The latter has value in itself, since simulation by far is the preferred methodology in ad hoc networks.
{"title":"Test-Bed Evaluation of Ingress Queuing for Improved Packet Delivery","authors":"L. Landmark, Knut Øvsthus, Ø. Kure","doi":"10.1109/ICNS.2008.13","DOIUrl":"https://doi.org/10.1109/ICNS.2008.13","url":null,"abstract":"In addition to bit errors and packet collisions, packets in ad hoc networks are lost due to missing routes and unreachable next hop nodes. The latter is costly, since these packets consume scarce network resources as they are retransmitted up to transmission-threshold times before being discarded. In this paper we demonstrate, through experimental test beds and simulation, the advantage of ingress queuing. By comparing the experimental results with the simulation we illustrate the difference between actual behaviour and the behaviour of the system abstraction. The latter has value in itself, since simulation by far is the preferred methodology in ad hoc networks.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357436","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
扫码关注我们
求助内容：
应助结果提醒方式：