詳細検索結果
以下の条件での結果を表示する: 検索条件を変更
クエリ検索: "Zeroconf"
11件中 1-11の結果を表示しています
  • 吉廣 卓哉, 島田 将行, 岡部 寿男, 岩間 一雄
    システム制御情報学会論文誌
    2002年 15 巻 6 号 294-301
    発行日: 2002/06/15
    公開日: 2011/10/13
    ジャーナル フリー
    We propose a new framework for stateless auto-configuration of IPv6 site-local addresses with “zero configuration.” When a router is connected to a link as the first router, it becomes the link leader and generates an address prefix with randomly generated 16-bit subnet ID for the segment. In order to assure the uniqueness of the prefix addresses, we show a protocol, which is an extension of RIPng, for detecting prefixes conflicts. When a conflict is detected, it is notified to its segment leader immediately. The segment leader generates a new prefix and renumber to new one via IPv6 address renumbering scheme. And, exploiting the IPv6 feature that multiple addresses can coexist on an interface, we realize such a routing algorithm that can protect the connections using old addresses for a fixed time.
  • 柴田 賀昭
    映像情報メディア学会年次大会講演予稿集
    2013年 2013 巻 14-3
    発行日: 2013/08/28
    公開日: 2017/05/24
    会議録・要旨集 フリー
    A project is ongoing at SMPTE to enhance applications of UMID, the SMPTE standard globally unique AV material identifier. While already identified the UMID application principles which are to be reflected to upcoming revised SMPTE RP 205, how to realize the UMID resolution protocol to convert a given UMID into its URL is under intensive study. In this paper, we report the latest status of the project as well as the feasibility study of DNS (Domain Name System) to be used as a basis of the UMID resolution protocol implementations.
  • Gang DENG, Hong WANG, Zhenghu GONG, Lin CHEN, Xu ZHOU
    IEICE Transactions on Information and Systems
    2015年 E98.D 巻 12 号 2071-2081
    発行日: 2015/12/01
    公開日: 2015/12/01
    ジャーナル フリー
    Address configuration is a key problem in data center networks. The core issue of automatic address configuration is assigning logical addresses to the physical network according to a blueprint, namely logical-to-device ID mapping, which can be formulated as a graph isomorphic problem and is hard. Recently years, some work has been proposed for this problem, such as DAC and ETAC. DAC adopts a sub-graph isomorphic algorithm. By leveraging the structure characteristic of data center network, DAC can finish the mapping process quickly when there is no malfunction. However, in the presence of any malfunctions, DAC need human effort to correct these malfunctions and thus is time-consuming. ETAC improves on DAC and can finish mapping even in the presence of malfunctions. However, ETAC also suffers from some robustness and efficiency problems. In this paper, we present GA-MAP, a data center networks address mapping algorithm based on genetic algorithm. By intelligently leveraging the structure characteristic of data center networks and the global search characteristic of genetic algorithm, GA-MAP can solve the address mapping problem quickly. Moreover, GA-MAP can even finish address mapping when physical network involved in malfunctions, making it more robust than ETAC. We evaluate GA-MAP via extensive simulation in several of aspects, including computation time, error-tolerance, convergence characteristic and the influence of population size. The simulation results demonstrate that GA-MAP is effective for data center addresses mapping.
  • Yujin Noishiki, Hidetoshi Yokota
    Information and Media Technologies
    2010年 5 巻 1 号 231-242
    発行日: 2010年
    公開日: 2010/03/15
    ジャーナル フリー
    The development of wireless technologies, cellular networks, WiFi, and Bluetooth has created heterogeneous network environments. In these environments, users can access anything at anytime, anywhere using these wireless technologies; however, in order to make full use of such wireless networks, users need to discover whether or not wireless networks exist in their vicinity and select the most appropriate one. Then, users have to obtain and input parameter settings for the wireless networks to begin communication. In this paper, we propose a network composition framework that enables automatic connections to a wireless network suitable for the user's context with minimal interaction. Based on this framework, we introduce network composition procedures which realize network discovery, network selection, configuration information notification, and device configuration with the support of a cellular network connection. We implement the proposed framework and procedures in a real environment comprised of cellular phones and laptop PCs. We examine implemented functions and their performance using this experimental implementation and present several attractive examples of actual use.
  • Yujin Noishiki, Hidetoshi Yokota
    Journal of Information Processing
    2009年 17 巻 306-317
    発行日: 2009年
    公開日: 2009/12/09
    ジャーナル フリー
    The development of wireless technologies, cellular networks, WiFi, and Bluetooth has created heterogeneous network environments. In these environments, users can access anything at anytime, anywhere using these wireless technologies; however, in order to make full use of such wireless networks, users need to discover whether or not wireless networks exist in their vicinity and select the most appropriate one. Then, users have to obtain and input parameter settings for the wireless networks to begin communication. In this paper, we propose a network composition framework that enables automatic connections to a wireless network suitable for the user's context with minimal interaction. Based on this framework, we introduce network composition procedures which realize network discovery, network selection, configuration information notification, and device configuration with the support of a cellular network connection. We implement the proposed framework and procedures in a real environment comprised of cellular phones and laptop PCs. We examine implemented functions and their performance using this experimental implementation and present several attractive examples of actual use.
  • Jin-Ok HWANG, Sung-Gi MIN
    IEICE Transactions on Communications
    2009年 E92.B 巻 1 号 126-130
    発行日: 2009/01/01
    公開日: 2009/01/01
    ジャーナル 認証あり
    Most routing protocols in MANET use IP addresses as one of the most important routing information. To implement the routing protocol of MANET, the IP assignment in MANET should be solved. Allocating IP addresses is one of current key issues in the MANET, due to the absence of a centralized agent server. Previous methods require a large address space or can not use all the IP addresses of the given IP address space. For that reason, many IP addresses remain unused. To resolve this, we propose an IP address assignment protocol that uses the contiguous IP address assignment strategy without unused IP addresses. Simulations perform on ns-2 and confirm the viability of our protocol.
  • 行田 弘一
    情報通信研究機構研究報告
    2005年 51 巻 1.2 号 217-225
    発行日: 2005年
    公開日: 2019/12/05
    研究報告書・技術報告書 オープンアクセス
  • Ryu Watanabe, Toshiaki Tanaka
    電気学会論文誌C(電子・情報・システム部門誌)
    2008年 128 巻 10 号 1516-1527
    発行日: 2008/10/01
    公開日: 2008/10/01
    ジャーナル フリー
    Recently, wireless LAN (WLAN) technology has become a major wireless communication method. The communication bandwidth is increasing and speeds have attained rates exceeding 100 Mbps. Therefore, WLAN technology is regarded as one of the promising communication methods for future networks. In addition, public WLAN connection services can be used in many locations. However, the number of the access points (AP) is insufficient for seamless communication and it cannot be said that users can use the service ubiquitously. An ad-hoc network style connection can be used to expand the coverage area of a public WLAN service. By relaying the user messages among the user nodes, a node can obtain an Internet connection via an AP, even though the node is located outside the AP's direct wireless connection area. Such a coverage area extending technology has many advantages thanks to the feature that no additional infrastructure is required. Therefore, there is a strong demand for this technology as it allows the cost-effective construction of future networks.
    When a secure ad-hoc routing protocol is used for message exchange in the WLAN service, the message routes are protected from malicious behavior such as route forging and can be maintained appropriately. To do this, however, a new node that wants to join the WLAN service has to obtain information such as the public key certificate and IP address in order to start secure ad-hoc routing. In other words, an initial setup is required for every network node to join the WLAN service properly. Ordinarily, such information should be assigned from the AP. However, new nodes cannot always contact an AP directly. Therefore, there are problems about information delivery in the initial setup of a network node. These problems originate in the multi hop connection based on the ad-hoc routing protocols.
    In order to realize an expanded area WLAN service, in this paper, the authors propose a secure public key certificate and address provision scheme during the initial setup phase on mobile nodes for the service. The proposed scheme also considers the protection of user privacy. Accordingly, none of the user nodes has to reveal their unique and persistent information to other nodes. Instead of using such information, temporary values are sent by an AP to mobile nodes and used for secure ad-hoc routing operations. Therefore, our proposed scheme prevents tracking by malicious parties by avoiding the use of unique information. Moreover, a test bed was also implemented based on the proposal and an evaluation was carried out in order to confirm performance. In addition, the authors describe a countermeasure against denial of service (DoS) attacks based on the approach to privacy protection described in our proposal.
  • 井上 朋哉, 高野 祐輝, 三輪 信介, 篠田 陽一
    コンピュータ ソフトウェア
    2011年 28 巻 4 号 4_222-4_240
    発行日: 2011/10/25
    公開日: 2011/11/30
    ジャーナル フリー
    インターネット上のサービスリソースを表すために,DNSにおけるSRV-RRや,Bonjour/AvahiにおけるmDNSのような,IPアドレスとポート番号の対情報をアプリケーション層の識別子として提供する方法が提案されている.しかし,名前解決にDNSレゾルバを利用するような一般的なネットワークソフトウェアでは,これらの手法により提供されるアプリケーション識別子を直接利用することが難しい.そのため,それぞれの専用レゾルバを利用したプログラムを別途作成することが必要となっていた.そこで我々は,Kademliaを利用したDTUNベースの名前解決基盤の設計を行った.その名前解決基盤では,アプリケーション識別子としてサービスネームを提供することで,既存のネットワークアプリケーションソフトウェア自体には手を加えることなくアプリケーション層の名前解決が可能となる.本論文では,その設計と実証プログラムであるPRISON/CAGEの実装について述べ評価を行う.また,そのソースコードはインターネット上でBSDライセンスにて公開しているため,誰でも自由に利用・改変が可能となっている.
  • 電子情報通信学会 通信ソサイエティマガジン
    2007年 2007 巻 1 号 1_17-1_29
    発行日: 2007/06/01
    公開日: 2011/06/03
    ジャーナル フリー
  • 高田 敏弘
    人工知能
    2004年 19 巻 4 号 454-461
    発行日: 2004/07/01
    公開日: 2020/09/29
    解説誌・一般情報誌 フリー
feedback
Top