127 0

An Efficient Method of Reselecting Grand Master in IEEE 802.1AS

Title
An Efficient Method of Reselecting Grand Master in IEEE 802.1AS
Author
박승권
Keywords
Reconfiguration; GM Sequence Table; Static Announce; BMCA
Issue Date
2014-10
Publisher
IEEE
Citation
Communications (APCC), 2014 Asia-Pacific Conference on, 2014 Oct, pp.303 - 308
Abstract
Recently, IEEE 802.3 Ethernet network is not limited to be used as the sub-network of a vehicle but also can be used as backbone network of a vehicle. Audio/Video Bridge (AVB) standard is about the Ethernet technology that can be used as a backbone network in a vehicle. AVB provides time-synchronized low latency streaming service through the Ethernet. 802.1 AS protocol in AVB can synchronize the time between different nodes through Grand Master (GM) which is selected by the Best Master Clock Algorithm (BMCA). If the synchronization message of GM is not received by another node within timeout interval, the protocol selects a new GM in the network through BMCA. This method can occur the bunching error because of consecutive exchange of messages. This paper proposes an efficient method to re-synchronize GM's time. This proposed method is to use a table which indicates a pre-defined sequence of GM to reconfigure GM. As a result, the reconfiguration procedure of GM with the sequence table can decrease generated traffic and a time when operating an existing BMCA procedure. In addition, this proposed method reduces the residence time of the bridge to prevent bunching of consecutive messages. Therefore, this paper proposes more efficient method of reselecting the GM than the BMCA.
URI
http://ieeexplore.ieee.org/document/7091652/http://hdl.handle.net/20.500.11754/52506
ISBN
978-1-4799-6435-2
ISSN
2163-0771
DOI
10.1109/APCC.2014.7091652
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE