The paper concerns the minimization of the average delay of packets in the computer network. The formulated problem is NP complete. The authors proposed a solution that may be reachable in satisfying time using heuristic methods. Authors take into consideration the proposed algorithms which are based on ideas such as simulated annealing, taboo search and genetic approach. In order to compare performance of these methods the experimentation system has been made. This system was implemented in C++ and Borland builder 6.0 programming environment. The created application allows to make investigations along with the complex experiments showing the current state of network and the obtained results in convenient way by utilizing visualization module and presentation module. The results of example research are shown and discussed.
{"title":"Comparison of Heuristic Methods Applied to Optimization of Computer Networks","authors":"K. Lenarski, A. Kasprzak, I. Pozniak-Koszalka","doi":"10.1109/ICN.2008.81","DOIUrl":"https://doi.org/10.1109/ICN.2008.81","url":null,"abstract":"The paper concerns the minimization of the average delay of packets in the computer network. The formulated problem is NP complete. The authors proposed a solution that may be reachable in satisfying time using heuristic methods. Authors take into consideration the proposed algorithms which are based on ideas such as simulated annealing, taboo search and genetic approach. In order to compare performance of these methods the experimentation system has been made. This system was implemented in C++ and Borland builder 6.0 programming environment. The created application allows to make investigations along with the complex experiments showing the current state of network and the obtained results in convenient way by utilizing visualization module and presentation module. The results of example research are shown and discussed.","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":"116747751","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}
F. Vanhaverbeke, M. Moeneclaey, K. Laevens, N. Degrande, D. D. Vleeschauwer
We examine the efficiency of two FEC strategies for the protection of HDTV video packets transmitted at variable bit rate. The first FEC strategy pursues packet protection by means of a fixed Reed-Solomon code. The second strategy encodes a set of packets within a fixed time frame resulting in Reed-Solomon codes of variable length. We quantify the performance of both strategies for a representative movie where the HDTV video packets are transmitted at variable bit rate over a channel that is subjected to independent errors and error bursts.
{"title":"Comparison of Two Forward Error Correction Approaches for Packet Protection in HDTV with Variable Bit Rate Transmission","authors":"F. Vanhaverbeke, M. Moeneclaey, K. Laevens, N. Degrande, D. D. Vleeschauwer","doi":"10.1109/ICN.2008.74","DOIUrl":"https://doi.org/10.1109/ICN.2008.74","url":null,"abstract":"We examine the efficiency of two FEC strategies for the protection of HDTV video packets transmitted at variable bit rate. The first FEC strategy pursues packet protection by means of a fixed Reed-Solomon code. The second strategy encodes a set of packets within a fixed time frame resulting in Reed-Solomon codes of variable length. We quantify the performance of both strategies for a representative movie where the HDTV video packets are transmitted at variable bit rate over a channel that is subjected to independent errors and error bursts.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"516 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":"131438390","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. Thepvilojanapong, S. Motegi, A. Idoue, H. Horiuchi
Personal healthcare is a promising market of a personal area network (PAN). The PAN consists of a data collector and multiple wearable sensors which must send data to the collector according to the frequency specified by each PAN. The data collector may be any hand-held or portable device, e.g., a mobile phone, a PDA, or a wristwatch. An individual user needs a PAN in order to detect, track, or manage his/her health. Multiple PANs for such purposes are likely to coexist in a same area, especially a place where a large number of users exist. Because multiple PANs must share resources (e.g., wireless channels, transmitting time) in this scenario, a problem of packet collisions among such PANs is unavoidable. As a result, the personal healthcare system using PAN cannot be provided as a service for the users because the data collector cannot collect sensing data from each sensor correctly. This paper proposes an adaptive scheme to allocate resources for coexisting PANs. The scheme distinguishes a PAN and a node when allocating resources such as wireless channel and transmitting time. Resources are dynamically allocated according to the current number of PANs that exist in the same area. In particular, the proposed scheme automatically reallocates resources when any PANs come into or leave from the coexisting area. As one of salient features, the scheme allocates transmitting time to meet a requirement on reporting interval determined by an application. Thus applications that are sensitive to delay can collect sensing data correctly and in time. The evaluation results show that our scheme achieves higher packet delivery rate than the standard ZigBee.
{"title":"Resource Allocation for Coexisting ZigBee-Based Personal Area Networks","authors":"N. Thepvilojanapong, S. Motegi, A. Idoue, H. Horiuchi","doi":"10.1109/ICN.2008.29","DOIUrl":"https://doi.org/10.1109/ICN.2008.29","url":null,"abstract":"Personal healthcare is a promising market of a personal area network (PAN). The PAN consists of a data collector and multiple wearable sensors which must send data to the collector according to the frequency specified by each PAN. The data collector may be any hand-held or portable device, e.g., a mobile phone, a PDA, or a wristwatch. An individual user needs a PAN in order to detect, track, or manage his/her health. Multiple PANs for such purposes are likely to coexist in a same area, especially a place where a large number of users exist. Because multiple PANs must share resources (e.g., wireless channels, transmitting time) in this scenario, a problem of packet collisions among such PANs is unavoidable. As a result, the personal healthcare system using PAN cannot be provided as a service for the users because the data collector cannot collect sensing data from each sensor correctly. This paper proposes an adaptive scheme to allocate resources for coexisting PANs. The scheme distinguishes a PAN and a node when allocating resources such as wireless channel and transmitting time. Resources are dynamically allocated according to the current number of PANs that exist in the same area. In particular, the proposed scheme automatically reallocates resources when any PANs come into or leave from the coexisting area. As one of salient features, the scheme allocates transmitting time to meet a requirement on reporting interval determined by an application. Thus applications that are sensitive to delay can collect sensing data correctly and in time. The evaluation results show that our scheme achieves higher packet delivery rate than the standard ZigBee.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"11 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":"128122024","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 propose a new evaluation approach to evaluate the service scalability of network architectures, that aims to study service scalability of network architectures in current Internet architecture and help evaluate designs of next generation Internet (NGI). The key idea is to measure existing network services using the concept of service utility. While service utility indicates whether service deployed in network can get good achievement which considers the index of user satisfaction in network service usage and network costs. After analyzing different types of services existing in current network, we explain the design rationale behind this evaluation approach and present analysis results of different types of services in different network architectures. The analysis results show that our approach is feasible to evaluate service scalability of network architectures, even if it needs further study to evaluate service scalability of the whole Internet architecture with more powerful cost and utility functions.
{"title":"Evaluating Service Scalability of Network Architectures","authors":"Qi Li, Mingwei Xu, Ke Xu, Jianping Wu","doi":"10.1109/ICN.2008.68","DOIUrl":"https://doi.org/10.1109/ICN.2008.68","url":null,"abstract":"We propose a new evaluation approach to evaluate the service scalability of network architectures, that aims to study service scalability of network architectures in current Internet architecture and help evaluate designs of next generation Internet (NGI). The key idea is to measure existing network services using the concept of service utility. While service utility indicates whether service deployed in network can get good achievement which considers the index of user satisfaction in network service usage and network costs. After analyzing different types of services existing in current network, we explain the design rationale behind this evaluation approach and present analysis results of different types of services in different network architectures. The analysis results show that our approach is feasible to evaluate service scalability of network architectures, even if it needs further study to evaluate service scalability of the whole Internet architecture with more powerful cost and utility functions.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"31 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":"134088866","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}
Several factors greatly influence the quality of service (QoS) in multihop wireless mesh networks (WMNs). These include the transmission range, number of gateways, number of nodes served by each gateway, gateway location, relay load and access fairness. While finding an optimal solution to simultaneously satisfy the above constraints is known to be MV-hard, near optimal solutions can be found within the feasibility region in polynomial time using heuristic algorithms. In this paper, first we present a near optimal heuristics algorithm for gateway placement, and later we compare its performance with some previously known sub-optimal solutions.
{"title":"Gateway Placement with QoS Constraints in Wireless Mesh Networks","authors":"Y. Drabu, H. Peyravi","doi":"10.1109/ICN.2008.89","DOIUrl":"https://doi.org/10.1109/ICN.2008.89","url":null,"abstract":"Several factors greatly influence the quality of service (QoS) in multihop wireless mesh networks (WMNs). These include the transmission range, number of gateways, number of nodes served by each gateway, gateway location, relay load and access fairness. While finding an optimal solution to simultaneously satisfy the above constraints is known to be MV-hard, near optimal solutions can be found within the feasibility region in polynomial time using heuristic algorithms. In this paper, first we present a near optimal heuristics algorithm for gateway placement, and later we compare its performance with some previously known sub-optimal solutions.","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":"121897681","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 propose a robust packet detection algorithm for the differentially bi-orthogonal chirp-spread-spectrum (DBO-CSS). The conventional packet detection algorithms based on auto-correlation cannot avoid side band noise because of the band hopping property of the DBO-CSS. If we, therefore, use the conventional packet detection algorithms in the DBO-CSS, the performance degradation of the packet detector will break out. First, the proposed detector includes matched filters to eliminate the side band noise. Second, the proposed detector also includes auto-correlators in order to make outputs of matched filters inphase. Finally, the proposed detector gathers the energy of all sub-chirps by the summation. When we use the Permutator, the proposed detector works regardless of piconet. Simulation results show that we can detect packets in -4 dB SNR in AWGN channel and also in 0 dB in multipath channel.
{"title":"Robust Packet Detection Algorithm for DBO-CSS","authors":"Seong-Hyun Jang, Sang-Hun Yoon, J. Chong","doi":"10.1109/ICN.2008.93","DOIUrl":"https://doi.org/10.1109/ICN.2008.93","url":null,"abstract":"In this paper, we propose a robust packet detection algorithm for the differentially bi-orthogonal chirp-spread-spectrum (DBO-CSS). The conventional packet detection algorithms based on auto-correlation cannot avoid side band noise because of the band hopping property of the DBO-CSS. If we, therefore, use the conventional packet detection algorithms in the DBO-CSS, the performance degradation of the packet detector will break out. First, the proposed detector includes matched filters to eliminate the side band noise. Second, the proposed detector also includes auto-correlators in order to make outputs of matched filters inphase. Finally, the proposed detector gathers the energy of all sub-chirps by the summation. When we use the Permutator, the proposed detector works regardless of piconet. Simulation results show that we can detect packets in -4 dB SNR in AWGN channel and also in 0 dB in multipath channel.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"161 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":"122863445","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 techniques have been proposed for the clustering and selection of clusterheads in mobile ad hoc networks. However, most existing techniques use only a single quality measure to distinguish between the capabilities of the nodes in the selection of clusterheads. This bounds the efficiency of the selection process and degrades network performance. In this paper, we present a scalable clustering framework that can generate flexible clustering techniques that use as many quality measures as desired. The proposed framework allows customization of the clustering techniques in order to seek specific network merits such as stability and fairness. Simulation results show significant improvements on overall network performance when using a clustering technique, developed using proposed framework, over existing lowest ID technique.
针对移动特设网络的聚类和簇头选择，人们提出了许多技术。然而，大多数现有技术在选择簇头时仅使用单一质量度量来区分节点的能力。这限制了选择过程的效率，降低了网络性能。在本文中，我们提出了一种可扩展的聚类框架，它可以生成灵活的聚类技术，并根据需要使用多种质量度量。所提出的框架允许对聚类技术进行定制，以寻求特定的网络优点，如稳定性和公平性。仿真结果表明，与现有的最低 ID 技术相比，使用建议框架开发的聚类技术能显著提高整体网络性能。
{"title":"Stable and Fair MANETs: A Scalable Multi-Measure Clustering Framework","authors":"A. Mahdy, J. Deogun","doi":"10.1109/ICN.2008.116","DOIUrl":"https://doi.org/10.1109/ICN.2008.116","url":null,"abstract":"Many techniques have been proposed for the clustering and selection of clusterheads in mobile ad hoc networks. However, most existing techniques use only a single quality measure to distinguish between the capabilities of the nodes in the selection of clusterheads. This bounds the efficiency of the selection process and degrades network performance. In this paper, we present a scalable clustering framework that can generate flexible clustering techniques that use as many quality measures as desired. The proposed framework allows customization of the clustering techniques in order to seek specific network merits such as stability and fairness. Simulation results show significant improvements on overall network performance when using a clustering technique, developed using proposed framework, over existing lowest ID technique.","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":"129538684","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}
Data Vortex networks with different routing and forwarding path arrangements are studied. To keep the bufferless routing nodes, the binary tree decoding stages in Data Vortex network are shown to achieve best combined routing performance in throughput and latency. When k is too large, the general k-ary decoding stages introduce too much deflection latency penalty, so this paper focuses on the performance comparison between the binary tree (k=2) decoding and 4-ary decoding (k=4) cases. The results have shown that even though a much smaller number of cylinder levels are required in a network of k=4, there is only slight reduction in the average packet latency within the network. On the other hand, the traffic backpressure induced throughput limit and the additional implementation cost in 4-ary decoding networks have proved that binary tree decoding stages offer the optimum performance under bufferless operations. The study has in part shown the advantages of Data Vortex network topology over many two dimensional multiple stage interconnection networks (MIN) if only deflection is allowed for bufferless operation.
{"title":"Optimum Routing and Forwarding Arrangement in Bufferless Data Vortex Switch Network","authors":"Qimin Yang","doi":"10.1109/ICN.2008.94","DOIUrl":"https://doi.org/10.1109/ICN.2008.94","url":null,"abstract":"Data Vortex networks with different routing and forwarding path arrangements are studied. To keep the bufferless routing nodes, the binary tree decoding stages in Data Vortex network are shown to achieve best combined routing performance in throughput and latency. When k is too large, the general k-ary decoding stages introduce too much deflection latency penalty, so this paper focuses on the performance comparison between the binary tree (k=2) decoding and 4-ary decoding (k=4) cases. The results have shown that even though a much smaller number of cylinder levels are required in a network of k=4, there is only slight reduction in the average packet latency within the network. On the other hand, the traffic backpressure induced throughput limit and the additional implementation cost in 4-ary decoding networks have proved that binary tree decoding stages offer the optimum performance under bufferless operations. The study has in part shown the advantages of Data Vortex network topology over many two dimensional multiple stage interconnection networks (MIN) if only deflection is allowed for bufferless operation.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"37 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":"129581366","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}
Fixed alternative routing algorithms are currently used for call establishment in voice communication systems of air traffic services. Under certain conditions, the standardized routing scheme create suboptimal routing decisions. A simple extension of the currently used algorithm prevents routes from being selected during call setup, if the particular route has recently been used for an unsuccessful call setup. The modification solves the stated routing problem and its performance is compared with other dynamic algorithms.
{"title":"Routing Performance in Air Traffic Services Networks","authors":"T. Rausch, H. Zeilinger, A. Kaindl","doi":"10.1109/ICN.2008.117","DOIUrl":"https://doi.org/10.1109/ICN.2008.117","url":null,"abstract":"Fixed alternative routing algorithms are currently used for call establishment in voice communication systems of air traffic services. Under certain conditions, the standardized routing scheme create suboptimal routing decisions. A simple extension of the currently used algorithm prevents routes from being selected during call setup, if the particular route has recently been used for an unsuccessful call setup. The modification solves the stated routing problem and its performance is compared with other dynamic algorithms.","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":"130087963","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}
G. Mattos, R. Lins, Andrei de Araújo Formiga, Francisco Heron de Carvalho Junior
The use of clusters and grids for high-performance applications has become widespread lately. In general, one associates clusters with dedicated LANs and grids with WANs and internets. This paper reports the results of a comparative analysis between cluster and grid performance when executing a load-balanced, image processing application in a local-area network. The results obtained show almost no difference in total execution times, indicating that grid software may be used advantageously in LANs to run similar load-balanced applications.
{"title":"A Comparison of Cluster and Grid Configurations Executing Image Processing Tasks in a Local Network","authors":"G. Mattos, R. Lins, Andrei de Araújo Formiga, Francisco Heron de Carvalho Junior","doi":"10.1109/ICN.2008.75","DOIUrl":"https://doi.org/10.1109/ICN.2008.75","url":null,"abstract":"The use of clusters and grids for high-performance applications has become widespread lately. In general, one associates clusters with dedicated LANs and grids with WANs and internets. This paper reports the results of a comparative analysis between cluster and grid performance when executing a load-balanced, image processing application in a local-area network. The results obtained show almost no difference in total execution times, indicating that grid software may be used advantageously in LANs to run similar load-balanced applications.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"38 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":"121383154","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
扫码关注我们
求助内容：
应助结果提醒方式：