• Title/Summary/Keyword: Ingress/egress

Search Result 42, Processing Time 0.02 seconds

UPC Schemes on the Frame Relay/ATM Interworking in ATM Networks (FR/ATM 연동에서의 UPC 방식)

  • Nam, Yun-Seok;Park, Won-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.3108-3115
    • /
    • 1999
  • Frame relay needs UPC function for the multiplexed logical connections to prevent malicious user traffic from incoming to network, to guarantee the QoS of conformed user traffic, and to protect the normal operation of network system. On the FR/ATM interworking in ATM networks, the UPC may be conducted either by cell-based ATM UPC or frame-based FR UPC. Frames come into and traverse ATm networks by segmentation to ATM cells. Of course, FR QoS should be guaranteed in spite of segmentation and reassembly in ATM networks. In this paper, we compared the QoS of cell-based ATM UPC and frame-based FR UPC in terms of analysis and simulation in case of ingress of excess traffic over negotiated traffic parameters at user-to-network interface. Also we studied frame-based UPC schemes including window-based FR UPC and frame-based VSA which is an ATM UPC algorithm recommended by ITU-T. We described introductions to frame relay including frame structure and FR/ATM interworking, FR traffic parameters and their relationship, comparison of FR QoS between frame-based FR UPC and cell-based ATM UPC, comparison of FR UPC schemes, necessities of egress traffic control, and conclusions.

  • PDF

VDSL 가입자 전송기술 개발 및 표준화 동향

  • 강규민;임기홍
    • Information and Communications Magazine
    • /
    • v.16 no.10
    • /
    • pp.112-124
    • /
    • 1999
  • 본 논문에서는 FTTC/VDSL (Fiber-to-the-Curb/Very High-speed Digital Subscriber Line) 전송시스템의 개발동향과 ANSI, ETSI, ITU등의 표준화 위원회에서 현재 진행중인 VDSL 시스템의 표준화 작업에 대해 기술하였다. 특히, POTS (Plain Old Telephone Service), BA-ISDA(Basic Access Integrated Services Digital Network), HDSL(High-rate Digital Subscriber Line), SDSL (Single-pair HDSL), ADSL(Asymmetric Digital Subscriber Line) 등의 다양한 xDSL (Digital Subscriber Line) 서비스들에서 발생하는 NEXT (Near-end Crosstalk)/FEXT (Far-end Crosstalk)와 같은 crosstalk를 최소화하기 위해 제안된 VDSL시스템의 주파수 대역과 PSD (Power Spectral Density) mask에 관해 설명하고, 순방향(down-stream) 채널과 역방향(upstream) 채널의 데이터 전송률이 대칭적인 VDSL전송시스템과 비대칭적인 VDSL 전송시스템 간의 주파수대역의 호환성 문제, RFI(Radio Frequency Interference) ingress/egress 문제의 해결 방안에 관해 기술하였다. 또한, 현재 VDSL Coalition과 VDSL Alliance 간에 논의 중인 VDSL 전송시스템의 변복조 방식에 관한 표준화 작업과정 및 순방향과 역방향에 할당될 band 개수에 따른 시스템 성능의 장단점 등에 관해 살펴보았다. 끝으로 현재 국내에서 개발되고 있는 FTTC/VDSL 전송시스템의 전체구조를 요약하고, 네트워크에서 가입자쪽으로 순방향 데이터 전송에 사용된 51.84 Mb/s 19-CAP (Carrierless Amplitude/Phase Modulation) 전송시스템과 가입자 댁내에서 네트워크 방향으로 역방향 데이터 전송에 사용된 1.62 Mb/s QPSK (Quadrature Phase Shift Keying) burst-mode TDMA (Time Division Multiple Access) 전송시스템 등의 동작 원리 및 구조를 기술하였다.

  • PDF

An Efficient Load Balanced Cost Calculation Scheme for QoS Routing in On-line Game Service (온라인 게임에서 QoS 라우팅을 위한 부하균등 비용산정 방식)

  • 이동철;홍종준
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.1
    • /
    • pp.114-119
    • /
    • 2003
  • An efficient QoS routing scheme for improving on-line games services needs to find a path that satisfies a given noS requirements while consuming as few resources as possible. In this paper, we propose a scheme of calculating resources' costs for precomputation QoS routing schemes. For a domain in the networks. the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load. We. therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

  • PDF

Eclipse Spectrum of Her X-1 Observed by ASCA in the Low Intensity State

  • Choi, C.S.;Seon, K.I.
    • Bulletin of the Korean Space Science Society
    • /
    • 1995.10a
    • /
    • pp.30-30
    • /
    • 1995
  • We present the results of analysis on the X-ray observations of the binary X-ray pulsar Her X-I. made with ASCA/SIS on August 13-14. 1993. An eclipse transition from ingress to egress was fully covered by the observations. The main findings are as follows; (1) a model of power-law plus black-body is required to interpret the entire eclipse spectrum. and the black-body component appears at < 0.7 keV. (2) the power-law continuum which has photon index ${\alpha}\;=\;{0.84^{\;+0.14}}_{\;-0.19}$ is very similar to that of detected by Ginga/LAC (${\alpha}\;=\;0.80\;{\pm}\;0.04$), (3) the calculated eclipse flux of $2^{-10}\;keV.{\;}~{\;}1.8{\pm}10^{-11}{\;}ergs{\;}cm^{-2}s^{-1}$, is consistent with the Ginga observation carried out in the high intensity state ~2.0{\pm}10^{-11}{\;}ergs{\;}cm^{-2}s^{-1}$, (4) there is no significant absorption feature. and an upper limit of the aborption column $NH{\;}\leq{\;}3{\pm}10^{20}\;cm^{-2}$ is determined at the 90% confidence limit. Based on these results, we suggest that extended matter surrounding the binary system should be existed persistently with stable conditions, and scattering of the source continuum by the matter is responsible for the eclipse emission.ission.

  • PDF

Hierarchical Inter-Domain based QoS Routing in a Wide Area of Network (대규모 네트워크를 위한 계층적 도메인간 QoS 라우팅)

  • Hong Jong-Joon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.3 s.35
    • /
    • pp.209-217
    • /
    • 2005
  • In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources' costs for precomputation schemes in hierarchical routing is proposed. and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

  • PDF

Observation of transiting exoplanet TrES-2b at Maidanak Observatory in Uzbekistan

  • Yang, Yun-A;Lee, Sang-Gak;Kang, Won-Seok
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.36 no.1
    • /
    • pp.28.1-28.1
    • /
    • 2011
  • We observed the transiting exoplanet, TrES-2b, with 1.5m telescope at Maidanak Observatory in Uzbekistan. We observed TrES-2 system for six nights, which contained two orbital periods of the planet. Therefore, we obtained the entire light curve of TrES-2b, which covered not only the whole primary transit containing both ingress and egress part, but also non-transit region. We used both R and Y band filters. Especially, Y filter is used first for transit observation and covers relatively longer wavelength ($1.02{\mu}m$ of center wavelength), to provide the light curve less affected by limb darkening. By fitting best model light curve for the obtained one, we determined these observables, transit depth, transit length, and planet's orbital period, which led to the determination of five physical parameters, stellar radius R*, stellar mass M*, inclination i, semi-major axis a, and planetary radius Rp. We will discuss of these results.

  • PDF

Load Balanced QoS Routing for Precomputation of QoS Routes (QoS 경로의 선계산을 적용한 부하분산 QoS 라우팅)

  • 홍종준
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.121-127
    • /
    • 2003
  • In this paper, we propose a load balancing QoS routing on a targe scale network. We use the scheme in which it calculates the cost of resources with a precomputation and then selects a path among multiple paths based on the calculated cost for each resources. We also use the QoS routing scheme for the transit and the intra-traffic on a large scale domain-based network. For a domain in networks, this routing scheme precomputes K multiple paths between all pairs made up with each ingress and egress border routers along with the consideration of a load balancing, and then picks up paths having the high probability on the Path selection. This routing scheme can be applied for the transit traffic and the intra traffic and combines the Inter-domain and intra-domain routings seamlessly and put a high priority on the transit traffic Thus, these schemes make Possible both the global use of network resources and the load balancing.

  • PDF

A Study on Logical Cooperative Entity-Based Multicast Architecture Supporting Heterogeneous Group Mobility in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크에서 이질적 그룹 이동성을 지원하는 논리적 협업 개체 기반의 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.171-178
    • /
    • 2007
  • In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

Point-to-Multipoint Services and Hierarchical QoS on PBB-TE System (PBB-TE 기반의 패킷전송시스템에서 멀티캐스트 서비스와 계층적 QoS 구현)

  • Lee, Won-Kyoung;Choi, Chang-Ho;Kim, Sun-Me
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.433-442
    • /
    • 2012
  • We have proposed a solution to multicast services and an advanced quality of service (QoS) mechanism on a packet transport system (PTS) based on PBB-TE. The point-to-multipoint (PtMP) connection in the PBB-TE system have been realized by grouping point-to-point (PtP) PTL trunks and mapping a BSI onto the PtP PTL trunks using a multicast backbone destination address. To provide end-to-end QoS of the PtMP services, the hierarchical QoS scheme for backbone service instances and connection-oriented paths has been implemented in the PTS. For providing different capabilities for service selection and priority selection, the PTS offers to customers three basic types of the port-based, C-tagged, and S-tagged service interface defined by the IEEE 802.1ah. To offer to customers different capabilities of the layer 3 applications and services, moreover, an IP-flow service interface have been added. In order to evaluate traffic performance for PtMP services in the PTS, the PtMP throughputs for the link capacity of 1 Gbps at the four service interfaces were measured in the leaves of the ingress edge node, the transit node, and the egress edge node. The throughputs were about 96 % because the B-MAC overhead of 22 bytes occupies 4% of the 512-byte packet. The QoS performance is ability to guarantee an application or a user a required bandwidth, and could be evaluated by the accuracy of policing or shaping. The accuracy of the policing scheme and the accuracy of the shaping scheme were 99% and 99.3% respectively.

Load Balanced Cost Calculation Scheme for Efficient Precomputation of QoS Routes (QoS경로의 효율적인 선계산을 위한 부하균등 비용산정 방식)

  • 홍종준;김승훈;이균하
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11C
    • /
    • pp.140-147
    • /
    • 2001
  • In this paper, we propose a scheme of calculating resources\` costs for precomputation in QoS routing schemes. This scheme is effective in respect to the g1oba1 network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load and then selects paths with the probability of path selection. We, therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And for analysis of a load balancing cost calculation proposed a simulation is done.

  • PDF