The triangular routing is one of the main problem in MIPv4. It leads to many attendant problems, namely the increment of impact of possible network partitions, load on the network and delay in delivering packets. The next generation IPv6 is designed to overcome this kind of problems. However, IPv4 and IPv6 are anticipated to coexist for a period of time. In addition, during IPv4 to IPv6 transition period, when network address translation protocol translation (NAT-PT) is used to connect IPv4 and IPv6 networks together, the triangular routing cannot be avoided. In this research, we study the effect of triangular routing and mobile IP-application layer gateway (MIP-ALG) in mixed IPv4/IPv6 networks using NS-2 simulator. The traffic models, namely HTTP, FTP and VoIP, are used in our simulation. The performance evaluation criteria are throughput and mean end-to-end delay. The simulation results show that the triangular routing degrades the performance of the mixed IPv4/IPv6 network. It is obvious that triangular routing reduces the peak throughput of HTTP and FTP traffics while it does not affect peak throughput of VoIP traffic. The mean end-to-end delay for HTTP, FTP and VoIP increase 45.45%, 47.61% and 52.74%, respectively. Finally, it is found that MIP-ALG can reduce the triangular routing effect, when direction of transmitting data is from IPv6 to MIPv4 network.
{"title":"Effect of Triangular Routing in Mixed IPv4/IPv6 Networks","authors":"T. Sanguankotchakorn, Preeda Jaiton","doi":"10.1109/ICN.2008.10","DOIUrl":"https://doi.org/10.1109/ICN.2008.10","url":null,"abstract":"The triangular routing is one of the main problem in MIPv4. It leads to many attendant problems, namely the increment of impact of possible network partitions, load on the network and delay in delivering packets. The next generation IPv6 is designed to overcome this kind of problems. However, IPv4 and IPv6 are anticipated to coexist for a period of time. In addition, during IPv4 to IPv6 transition period, when network address translation protocol translation (NAT-PT) is used to connect IPv4 and IPv6 networks together, the triangular routing cannot be avoided. In this research, we study the effect of triangular routing and mobile IP-application layer gateway (MIP-ALG) in mixed IPv4/IPv6 networks using NS-2 simulator. The traffic models, namely HTTP, FTP and VoIP, are used in our simulation. The performance evaluation criteria are throughput and mean end-to-end delay. The simulation results show that the triangular routing degrades the performance of the mixed IPv4/IPv6 network. It is obvious that triangular routing reduces the peak throughput of HTTP and FTP traffics while it does not affect peak throughput of VoIP traffic. The mean end-to-end delay for HTTP, FTP and VoIP increase 45.45%, 47.61% and 52.74%, respectively. Finally, it is found that MIP-ALG can reduce the triangular routing effect, when direction of transmitting data is from IPv6 to MIPv4 network.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132410250","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 we analyze the challenges and issues of transmitting multicast voice streams in a vehicular ad hoc network (VANET). The considered scenario focuses on the multicast transmission of multimedia signals (MP3 streams) between a static and a mobile node. We examine various technical solutions to guarantee vehicle-to-infrastructure connectivity, such as software enhancements and directional antennas. To overcome transmission problems, directions on how to build an optimized client-server streaming software suite are given. The proposed suite is tested with various safety messages in a real-world network testbed. Results of the experiments are presented in terms of both network layer (such as packet loss rate) and application layer (Mean Opinion Score) metrics. Results show how the specific context determines the distribution of error patterns. To improve the performance of the transmission by reducing the average burst error length, block interleaving techniques are taken into consideration. The presented results show that a reasoned choice of the hardware and software parameters enables the transmission of multicast vocal messages by means of the standard 802.11b protocol.
{"title":"Multicast Voice Transmission over Vehicular Ad Hoc Networks: Issues and Challenges","authors":"P. Bucciol, F. Ridolfo, Juan Carlos De Martin","doi":"10.1109/ICN.2008.107","DOIUrl":"https://doi.org/10.1109/ICN.2008.107","url":null,"abstract":"In this paper we analyze the challenges and issues of transmitting multicast voice streams in a vehicular ad hoc network (VANET). The considered scenario focuses on the multicast transmission of multimedia signals (MP3 streams) between a static and a mobile node. We examine various technical solutions to guarantee vehicle-to-infrastructure connectivity, such as software enhancements and directional antennas. To overcome transmission problems, directions on how to build an optimized client-server streaming software suite are given. The proposed suite is tested with various safety messages in a real-world network testbed. Results of the experiments are presented in terms of both network layer (such as packet loss rate) and application layer (Mean Opinion Score) metrics. Results show how the specific context determines the distribution of error patterns. To improve the performance of the transmission by reducing the average burst error length, block interleaving techniques are taken into consideration. The presented results show that a reasoned choice of the hardware and software parameters enables the transmission of multicast vocal messages by means of the standard 802.11b protocol.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115188768","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, we analyze a discrete-time priority queue with session-based arrivals. We consider a user population, where each user can start and end sessions. Sessions belong to one of two classes and generate a variable number of fixed-length packets which arrive to the queue at the rate of one packet per slot. The lengths of the sessions are generally distributed. Packets of the first class have transmission priority over the packets of the other class. The model is motivated by a web server handling delay-sensitive and delay-insensitive content. By using probability generating functions, some performance measures of the queue such as the moments of the packet delays of both classes are calculated. The impact of the priority scheduling discipline and of the session nature of the arrival process is shown by some numerical examples.
{"title":"Analysis of Priority Queues with Session-Based Arrival Streams","authors":"J. Walraevens, S. Wittevrongel, H. Bruneel","doi":"10.1109/ICN.2008.47","DOIUrl":"https://doi.org/10.1109/ICN.2008.47","url":null,"abstract":"In this paper, we analyze a discrete-time priority queue with session-based arrivals. We consider a user population, where each user can start and end sessions. Sessions belong to one of two classes and generate a variable number of fixed-length packets which arrive to the queue at the rate of one packet per slot. The lengths of the sessions are generally distributed. Packets of the first class have transmission priority over the packets of the other class. The model is motivated by a web server handling delay-sensitive and delay-insensitive content. By using probability generating functions, some performance measures of the queue such as the moments of the packet delays of both classes are calculated. The impact of the priority scheduling discipline and of the session nature of the arrival process is shown by some numerical examples.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720420","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}
Wireless sensor networks are increasingly being used in applications where QoS and low cost are the overriding considerations. Conventional schemes of using sensor nodes and incorporating these three phenomena (reliability, availability and serviceability) to attain QoS can effectively improve not only the reliability of the overall WSNs but security as well. We discuss the reverse look of QoS and hence present mathematically the three significant quality factors that should be currently taken into account in developing wireless sensor networks application services and security. We also discussed specific characteristics and constraints of wireless sensor networks, QoS factors required when developing security applications for such networks. To evaluated possibility of establishing secure wireless sensor network through QoS we have used Hawk nodes to demonstrate how security can be archived through QoS experimentally. The flow models show how the QoS can be integrated to increase the security and applications running in WSNs.
{"title":"QoS as Means of Providing WSNs Security","authors":"T. Pazynyuk, Jianzhong Li, G. Oreku, Liqiang Pan","doi":"10.1109/ICN.2008.22","DOIUrl":"https://doi.org/10.1109/ICN.2008.22","url":null,"abstract":"Wireless sensor networks are increasingly being used in applications where QoS and low cost are the overriding considerations. Conventional schemes of using sensor nodes and incorporating these three phenomena (reliability, availability and serviceability) to attain QoS can effectively improve not only the reliability of the overall WSNs but security as well. We discuss the reverse look of QoS and hence present mathematically the three significant quality factors that should be currently taken into account in developing wireless sensor networks application services and security. We also discussed specific characteristics and constraints of wireless sensor networks, QoS factors required when developing security applications for such networks. To evaluated possibility of establishing secure wireless sensor network through QoS we have used Hawk nodes to demonstrate how security can be archived through QoS experimentally. The flow models show how the QoS can be integrated to increase the security and applications running in WSNs.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125393118","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 we present an implementation and validation tests that allow a GNU/Linux node act as a PE router in a BGP/MPLS IP VPN architecture. Precisely, this implementation supports all the mandatory capabilities defined in RFC 4364 with regard to the data forwarding plane, such as VRFs to separate the traffic from different VPNs, MPLS to manage the VPN routes at PE nodes and MPLS tunnels for the communication between PEs. Moreover, this basic implementation is extended to support the operation defined in RFC 4797, which allows other lands of tunnel technologies to be used between PE nodes. We provide configuration examples for both cases, and finally complete the study with the addition of IPsec options to the PE-PE GRE tunnel communication.
在本文中，我们提出了一个允许GNU/Linux节点作为BGP/MPLS IP VPN架构中的PE路由器的实现和验证测试。准确地说，该实现支持RFC 4364中关于数据转发平面的所有必要功能，如vrf用于隔离不同VPN的流量，MPLS用于管理PE节点上的VPN路由，MPLS隧道用于PE之间的通信。此外，这个基本实现被扩展为支持RFC 4797中定义的操作，该操作允许在PE节点之间使用其他类型的隧道技术。我们提供了这两种情况的配置示例，最后在PE-PE GRE隧道通信中添加IPsec选项完成了研究。
{"title":"New Tunneling Capabilities for BGP/MPLS IP VPN in GNU/Linux","authors":"J. O. Fajardo, J. A. Picó, A. Muñoz","doi":"10.1109/ICN.2008.105","DOIUrl":"https://doi.org/10.1109/ICN.2008.105","url":null,"abstract":"In this paper we present an implementation and validation tests that allow a GNU/Linux node act as a PE router in a BGP/MPLS IP VPN architecture. Precisely, this implementation supports all the mandatory capabilities defined in RFC 4364 with regard to the data forwarding plane, such as VRFs to separate the traffic from different VPNs, MPLS to manage the VPN routes at PE nodes and MPLS tunnels for the communication between PEs. Moreover, this basic implementation is extended to support the operation defined in RFC 4797, which allows other lands of tunnel technologies to be used between PE nodes. We provide configuration examples for both cases, and finally complete the study with the addition of IPsec options to the PE-PE GRE tunnel communication.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128636466","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}
Kyriakos Koukoumpetsos, N. Antonopoulos, Kan Zhang, Georgios Exarchakos
Resource availability in pervasive environments is restricted by many either mobility- and/or security-related factors. Multi-agent systems deployed in such environments would have to rely on a potentially low number of hosts allowing and supporting the arrival and execution of foreign code. To address this issue, this paper proposes to decouple interaction of executing programs and services from the actual software mobility pattern used to realize this interaction. The proposed system (MoDeS - Mobility Decision System) dynamically decides on the best mobility method to implement a series of software interactions while satisfying the appropriate software constraints. The system takes as input an interaction plan and produces the corresponding mobility plan. A series of simulations were performed on single- and multi-hop scenarios which showed that MoDeS can significantly increase the availability of software interactions even in highly constraint environments.
{"title":"Improving Availability of Mobile Code Systems by Decoupling Interaction from Mobility","authors":"Kyriakos Koukoumpetsos, N. Antonopoulos, Kan Zhang, Georgios Exarchakos","doi":"10.1109/ICN.2008.61","DOIUrl":"https://doi.org/10.1109/ICN.2008.61","url":null,"abstract":"Resource availability in pervasive environments is restricted by many either mobility- and/or security-related factors. Multi-agent systems deployed in such environments would have to rely on a potentially low number of hosts allowing and supporting the arrival and execution of foreign code. To address this issue, this paper proposes to decouple interaction of executing programs and services from the actual software mobility pattern used to realize this interaction. The proposed system (MoDeS - Mobility Decision System) dynamically decides on the best mobility method to implement a series of software interactions while satisfying the appropriate software constraints. The system takes as input an interaction plan and produces the corresponding mobility plan. A series of simulations were performed on single- and multi-hop scenarios which showed that MoDeS can significantly increase the availability of software interactions even in highly constraint environments.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647133","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 contrast to the traditional 'fixed' network model, future devices will roam between points of attachment while maintaining the best Layer 2 connectivity. It therefore becomes critical for Mobile Nodes to determine semi-independently the most appropriate technology and Access Network for a given scenario. This supports both the dynamic selection of the 'best' point of attachment and near-seamless handoff. Several solutions have already been proposed both within standards bodies and the wider academic community. Our aim is to define an intelligent network selection mechanism, capable of representing and enforcing explicit user-defined parameters as part of a host-based handoff mechanism. Moreover, our proposal works both independently and in cooperation with network-based handoff mechanisms.
{"title":"Flexible Host-Based Handoff Selection for Next Generation Networks","authors":"M. Mackay, José Moura, C. Edwards","doi":"10.1109/ICN.2008.106","DOIUrl":"https://doi.org/10.1109/ICN.2008.106","url":null,"abstract":"In contrast to the traditional 'fixed' network model, future devices will roam between points of attachment while maintaining the best Layer 2 connectivity. It therefore becomes critical for Mobile Nodes to determine semi-independently the most appropriate technology and Access Network for a given scenario. This supports both the dynamic selection of the 'best' point of attachment and near-seamless handoff. Several solutions have already been proposed both within standards bodies and the wider academic community. Our aim is to define an intelligent network selection mechanism, capable of representing and enforcing explicit user-defined parameters as part of a host-based handoff mechanism. Moreover, our proposal works both independently and in cooperation with network-based handoff mechanisms.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127797743","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 IP multimedia subsystem (IMS) could very well be the best solution for most telecom operators. The more recent releases have included interfaces to fixed line networks and wireless LANs. This has consequences both for the migration of the core network as well as the integration of future mobile services and applications. Also, an interworking between IMS providers is considered to be a major step toward end-to-end IMS services and IPX (IP interworking exchanged) networks are introduced as the requirement to support QoS features in GSMA. But these architectures don't specify any requirements for e2e QoS through IPX networks. This purpose of this article is to research of IMS interworking network for enlarging IMS services guaranteeing e2e services quality and we suggest the IMIN (IMS interworking network) framework to guarantee IMS high quality end-to-end services.
{"title":"A Framework for IMS Interworking Networks with Quality of Service Guarantee","authors":"Jinho Hwang, Nakpo Kim, S. Kang, Jongseog Koh","doi":"10.1109/ICN.2008.69","DOIUrl":"https://doi.org/10.1109/ICN.2008.69","url":null,"abstract":"The IP multimedia subsystem (IMS) could very well be the best solution for most telecom operators. The more recent releases have included interfaces to fixed line networks and wireless LANs. This has consequences both for the migration of the core network as well as the integration of future mobile services and applications. Also, an interworking between IMS providers is considered to be a major step toward end-to-end IMS services and IPX (IP interworking exchanged) networks are introduced as the requirement to support QoS features in GSMA. But these architectures don't specify any requirements for e2e QoS through IPX networks. This purpose of this article is to research of IMS interworking network for enlarging IMS services guaranteeing e2e services quality and we suggest the IMIN (IMS interworking network) framework to guarantee IMS high quality end-to-end services.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127876443","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 clustering algorithm for applications running in backbone-assisted mobile ad hoc networks. The algorithm assigns weights both to the network nodes and to the communication links in order to elect local leaders, so called clusterheads.
{"title":"NLWCA Node and Link Weighted Clustering Algorithm for Backbone-Assisted Mobile Ad Hoc Networks","authors":"A. Andronache, S. Rothkugel","doi":"10.1109/ICN.2008.103","DOIUrl":"https://doi.org/10.1109/ICN.2008.103","url":null,"abstract":"This paper introduces a clustering algorithm for applications running in backbone-assisted mobile ad hoc networks. The algorithm assigns weights both to the network nodes and to the communication links in order to elect local leaders, so called clusterheads.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121789005","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}
Many P2P based wide-area storage systems are appeared to provide scalable storage services with idle resource from many unreliable clients. To minimize the data loss, quick replication is important to replace lost redundancy on other nodes in reaction to failures. The popular approach is the availability based replication which uses the individual node availability. However, with the high churn some replicas leave or fail within similar time. As a result, it requires bursty data traffic and sometimes it loses data. This paper explores the time-related replication which uses the information of the session time to prevent the bursty failures. It tries to get the primary replica which has enough time to replace the lost redundancy. Moreover, the sparse replicas spread on the timeline and the number of overlapped replicas lessens as best it can. Results from a simulation study suggest that the time-related replication keep the high data availability with less data copy traffic.
{"title":"Time-Related Replication for P2P Storage System","authors":"Kyungbaek Kim","doi":"10.1109/ICN.2008.27","DOIUrl":"https://doi.org/10.1109/ICN.2008.27","url":null,"abstract":"Many P2P based wide-area storage systems are appeared to provide scalable storage services with idle resource from many unreliable clients. To minimize the data loss, quick replication is important to replace lost redundancy on other nodes in reaction to failures. The popular approach is the availability based replication which uses the individual node availability. However, with the high churn some replicas leave or fail within similar time. As a result, it requires bursty data traffic and sometimes it loses data. This paper explores the time-related replication which uses the information of the session time to prevent the bursty failures. It tries to get the primary replica which has enough time to replace the lost redundancy. Moreover, the sparse replicas spread on the timeline and the number of overlapped replicas lessens as best it can. Results from a simulation study suggest that the time-related replication keep the high data availability with less data copy traffic.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126526144","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
扫码关注我们
求助内容：
应助结果提醒方式：