Lei Yanjing, Miao Kejian, M. Chunyan, Y. Xiaoyan, Kang Jichang
{"title":"A High-speed FC-based Token-Routing NIC Used for Cluster System","authors":"Lei Yanjing, Miao Kejian, M. Chunyan, Y. Xiaoyan, Kang Jichang","doi":"10.1109/APCC.2006.255930","DOIUrl":"https://doi.org/10.1109/APCC.2006.255930","url":null,"abstract":"To build a high performance/cost ratio cluster system used for meso-scale numerical weather forecast system for some medium and small cities, a cost-effective new switch network, FC-TRSN, is proposed and the FC-based token-routing NIC is researched. In this NIC, considering the characteristic of small and large packets, each kind of frame is specially designed to maximize the communication efficiency. In addition to the essential transceivers, almost all the functions are integrated into a single FPGA chip. So the NIC has low development cost, good flexibility and high efficiency. Up to now, this NIC has worked smoothly and steadily in a meteorological station in Huzhou, China","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114953","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}
{"title":"Stability Analysis Of A Third-Order Digital Sigma-Delta Modulator","authors":"A. Sadik, Z. M. Hussain, X. Yu","doi":"10.1109/APCC.2006.255855","DOIUrl":"https://doi.org/10.1109/APCC.2006.255855","url":null,"abstract":"The stability of a high-order sigma-delta modulator has been addressed under dc input. A new approach for stability analysis is proposed. A nonlinear circle map is suggested to model the dynamics of the modulator. The stability problem is handled using an analogy between the dynamics of the sigma-delta modulator and the sinusoidal digital phase-locked loop (DPLL). An approximate fixed point solution is presented and stability criteria are derived","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124554082","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}
{"title":"An On-demand and Dynamic Slot Assignment Protocol for Ad Hoc Networks","authors":"M. Xu, Minjian Zhao, Zhengwei Song, Shiju Li","doi":"10.1109/APCC.2006.255923","DOIUrl":"https://doi.org/10.1109/APCC.2006.255923","url":null,"abstract":"An on-demand and dynamic slot assignment (ODSA) protocol for ad hoc networks is proposed. The protocol assigns slots for nodes basing on information in their two-hop neighborhood, which can be collected by listening before slot assignment. In ODSA, a slot is divided into several mini-slots, and the reservation procedure is realized in the selected idle slot by message exchanging. ODSA can adapt to variations of application and network topology. Furthermore, it can ensure the time delays of nodes owning slots. ODSA has been studied in different network situations, and the results show that ODSA has smaller average access delay and higher channel utilization compared with FPRP","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099990","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}
{"title":"Agent based IPTV Channel Admission Control in BcN","authors":"Seong Bo Yang, J. Kim, S. Choi, J. Choi","doi":"10.1109/APCC.2006.255818","DOIUrl":"https://doi.org/10.1109/APCC.2006.255818","url":null,"abstract":"The IPTV system of BcN (broadband convergence network), which supports various IPTV contents such as real-time TV, video-on-demand and interactive services, will use admission control tests to guarantee predictable QoS (quality of service) for users and optimized profitability for IPTV service providers. For the test, this paper presents a threshold based admission control model which uses IPTV agents. The contribution of this paper is threefold. First, we present an analytical model for computing blocking probabilities of IPTV contents. Then, we extend the analytical model to perform profit analysis in the system. Finally, we show that the optimal threshold values and profits can be found by using our analytical model and performance analysis","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121852434","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}
{"title":"Performance Analysis of Mobile RSVP and Hierarchical Mobile RSVP","authors":"Hongseok Jeon, Jonghwa Yi","doi":"10.1109/APCC.2006.255797","DOIUrl":"https://doi.org/10.1109/APCC.2006.255797","url":null,"abstract":"MRSVP and HMRSVP are representative RSVP extensions for mobile Internet. They reserve resources in advance to expedite the RSVP process and adopt RSVP Tunnel to avoid the RSVP message invisibility problem in Mobile IP. However, they still suffer from issues such as excessive advanced reservations and bottleneck problem due to RSVP Tunnel. In this paper, we evaluate the each performance of MRSVP and HMRSVP via simulation, and analyze the simulation results in terms of above issues","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122375706","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}
{"title":"Experimental Evaluation of Ad Hoc Testbed in Indoor Scenarios","authors":"Fei Ye, Zhi Zhou, Z. Niu","doi":"10.1109/APCC.2006.255795","DOIUrl":"https://doi.org/10.1109/APCC.2006.255795","url":null,"abstract":"To date, indoor applications are becoming more and more important for ad hoc networks. However, indoor scenarios pose new challenges for ad hoc networks. In this paper, we verify the problem of best offered load in chain topology and experimentally evaluate the local repair function. Our observation indicates that unidirectional links and unstable links are two cutthroats of ad hoc networks in indoor scenarios. This paper aims to aid researchers in refining and developing on-demand ad hoc routing protocols to cope with challenges from indoor scenarios","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121553668","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}
{"title":"Sequential Clustering-based Beacon Scheduling in Hierarchically-Extended Wireless Sensor Network","authors":"Kun Hyun Kim, I. Kim, C. Kang, Sunny Ahn","doi":"10.1109/APCC.2006.255866","DOIUrl":"https://doi.org/10.1109/APCC.2006.255866","url":null,"abstract":"In this paper, we propose a new type of beacon scheduling scheme, referred to as a sequential clustering-based beacon scheduling (SCBS), which support efficient beacon slot assignment for hierarchically-extended wireless sensor networks. It is designed especially to minimize the number of beacon slots that are uniquely dedicated to each of CH and GW without any conflict under a single-frequency radio operation throughout network coverage area. In addition to the bandwidth efficiency, it leads to improvement of various performances, e.g., energy efficiency and delay, in both the downstream and upstream under a cluster-based hierarchical topology. It has been shown that SCBS is useful for extending the coverage of various WSN applications, including those covered by the current IEEE 802.15.4 standards","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114925047","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}
{"title":"Power Control with Outage Capacity Constraints","authors":"Kai‐Kit Wong","doi":"10.1109/APCC.2006.255916","DOIUrl":"https://doi.org/10.1109/APCC.2006.255916","url":null,"abstract":"This paper addresses the power distribution over K blocks of coded information to accommodate a certain rate for some probability in Rayleigh flat-fading channels given the causal channel state information at the transmitter (CSIT) and the channel statistics in the future. With such outage capacity constraint, time diversity can be accomplished by stochastically distributing the power among the blocks. For K=2, we derive the stochastic-optimal power policy in closed-form for transmit power minimization. For K>2, we propose to minimize the power by constraining an upper bound of the outage probability. In so doing, the problem becomes convex and permits a closed-form optimal power policy to be derived. Results demonstrate that the proposed power policy exploiting CSIT gives significant power reduction when compared to an equal-power policy for stringent outage settings","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130616138","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}
{"title":"Traffic Routing Between Best Effort Network and Premium Network","authors":"K. Lee, J. Hahm, Young Sun Kim","doi":"10.1109/APCC.2006.255963","DOIUrl":"https://doi.org/10.1109/APCC.2006.255963","url":null,"abstract":"Korean operators have started BcN implementation by replacement of old PSTN with access gateway. While, existing IP network has been expanded according to the increase of ADSL subscribers, metro Ethernet and various VoIP subscribers. New premium IP backbone for BcN and composite services has been installed and expanded based on MPLS functions, so one operator has two IP networks. Operator needs to have specific implementation plan for interoperation between new premium IP network and old best effort network and should consider many important issues. Here, traffic routing method is mentioned for route selection between premium IP network and best effort network from BcN and best effort subscribers according to the application services","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584746","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}
{"title":"Fuzzy TCP: Optimizing TCP Congestion Control","authors":"Hamed Nejad, M. Yaghmaee, Hamid Tabatabaee","doi":"10.1109/APCC.2006.255812","DOIUrl":"https://doi.org/10.1109/APCC.2006.255812","url":null,"abstract":"Efficient implementation of TCP for the Internet requires a precise determination of congestion window by the source TCP agent. This paper proposes a fuzzy implementation of TCP (fuzzy TCP), instead of current slow-start/congestion avoidance approach for efficiently determining size of the congestion window at each time a new acknowledgement receives. The scheme uses the current size of congestion window and the slow-start threshold (ssthresh) as well as the last and previous round trip times. The proposed fuzzy controller updates the size of congestion window using a fuzzy system. The approach is applied to the source agent and the destination TCP remains unchanged","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132366945","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号
