Search

Derek Yeung Phones & Addresses

  • South San Francisco, CA
  • San Mateo, CA
  • Pontiac, MI
  • San Bruno, CA
  • San Francisco, CA

Work

Company: Mortgage connection Address: 1435 Huntington Ave # 102, South San Francisco, CA 94080 Phones: (650) 553-9880 Position: Owner Industries: Mortgage Bankers and Loan Correspondents

Professional Records

License Records

Derek Emory Yeung

License #:
065025872 - Expired
Issued Date:
Jun 30, 1999
Expiration Date:
Sep 30, 2000
Type:
Licensed Certified Public Accountant

Resumes

Resumes

Derek Yeung Photo 1

Owner

View page
Location:
South San Francisco, CA
Industry:
Real Estate
Work:
Mortgage Connection
Owner
Derek Yeung Photo 2

Derek Yeung

View page

Business Records

Name / Title
Company / Classification
Phones & Addresses
Derek Yeung
Owner
Mortgage Connection
Mortgage Bankers and Loan Correspondents
1435 Huntington Ave # 102, South San Francisco, CA 94080
Website: mortgageconnection.net
Derek Yeung
Owner
Mortgage Connection
Mortgage Bankers and Loan Correspondents
1435 Huntington Ave # 102, South San Francisco, CA 94080
Website: mortgageconnection.net
Derek C. Yeung
President, Owner
Mortgage Connection
Loan Broker · Mortgage Broker · Real Estate Loans
1435 Huntington Ave, South San Francisco, CA 94080
(650) 553-9880, (650) 553-9878

Publications

Us Patents

Methods And Apparatus For Providing Loop Free Routing Tables

View page
US Patent:
7889712, Feb 15, 2011
Filed:
Dec 23, 2005
Appl. No.:
11/318217
Inventors:
Dheerendra Talur - Fremont CA, US
Rex Fernando - San Jose CA, US
Avneesh Sachdev - San Jose CA, US
Derek Man-Kit Yeung - Union City CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
H04L 12/28
US Classification:
370351
Abstract:
A router is described that includes a routing table containing route information and a module to evaluate a route and detect a loop path associated with the route using the routing table. A process is described to detect and eliminate routing loops associated with recursive routes in a routing table, so as to provide a routing table that will be loop free.

Csnp Cache For Efficient Periodic Csnp In A Router

View page
US Patent:
20060227790, Oct 12, 2006
Filed:
Nov 15, 2005
Appl. No.:
11/280950
Inventors:
Derek Yeung - Union City CA, US
Christian Hopps - San Francisco CA, US
Nair Venugopal - Fremont CA, US
Anthony Li - Los Altos CA, US
International Classification:
H04L 12/56
H04L 12/28
US Classification:
370395310
Abstract:
A networking device such as a router may include, in one embodiment, a database storing a plurality of link state entries, and a cache operatively coupled with the database, the cache storing entries relating to the link state entries of the database. The networking device may also include a module for sending, over a network, packets including link state data, the module operatively coupled with the cache. In one example, the module accesses the cache to create one or more packets including link state data. Embodiments of the invention may be used for forming CSNP packets (complete sequence number packets) without the need for having to repeatedly walking a link state database in order to form the CNSP packets.

Congestion Mitigation And Avoidance

View page
US Patent:
20140064082, Mar 6, 2014
Filed:
Aug 31, 2012
Appl. No.:
13/601957
Inventors:
Derek Man-Kit Yeung - Fremont CA, US
Ali Sajassi - San Ramon CA, US
Hong Zhang - Palo Alto CA, US
International Classification:
H04L 12/803
US Classification:
370235
Abstract:
In one embodiment, a method is provided for congestion mitigation. In this method, a congestion level of data flows along a path is monitored relative to a threshold. Here, each data flow is associated with a flow identifier. Based on detection that the congestion level exceeds the threshold, the flow identifier of a number (e.g., one or more) of the data flows is changed to a different flow identifier. This change results in the number of the data flows redirected to a different path. In an alternate embodiment, another method is provided for congestion avoidance. In this method, a data flow transmitted along a single path is received, and the data flow is split into multiple micro data flows. A different flow identifier is then assigned to each micro data flow. This change results in the multiple micro data flows distributed along multiple different paths.

Independent Datastore In A Network Routing Environment

View page
US Patent:
20210406101, Dec 30, 2021
Filed:
Sep 8, 2021
Appl. No.:
17/469609
Inventors:
- San Jose CA, US
Keyur Patel - San Jose CA, US
Derek Man-Kit Yeung - Fremont CA, US
Alpesh Patel - San Ramon CA, US
Lawrence Rolfe Kreeger - Fremont CA, US
International Classification:
G06F 9/54
H04L 12/707
H04L 12/723
H04L 12/44
H04L 12/46
H04L 12/753
G06F 16/27
G06F 16/23
G06F 16/22
G06F 9/455
H04L 12/66
H04L 12/751
H04L 12/721
G06F 9/48
H04L 12/703
H04L 12/741
H04L 12/803
H04L 29/06
H04L 12/28
H04L 12/713
H04L 29/08
Abstract:
Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

Loop Conflict Avoidance In A Network Computing Environment

View page
US Patent:
20210390000, Dec 16, 2021
Filed:
Aug 27, 2021
Appl. No.:
17/459505
Inventors:
- San Jose CA, US
Keyur Patel - San Jose CA, US
Derek Man-Kit Yeung - Fremont CA, US
Nalinaksh Pai - San Ramon CA, US
Kalyani Rajaraman - San Jose CA, US
Vikram Ragukumar - Pleasanton CA, US
International Classification:
G06F 9/54
H04L 12/707
H04L 12/723
H04L 12/44
H04L 12/46
H04L 12/753
G06F 16/27
G06F 16/23
G06F 16/22
G06F 9/455
H04L 12/66
H04L 12/751
H04L 12/721
G06F 9/48
H04L 12/703
H04L 12/741
H04L 12/803
H04L 29/06
H04L 12/28
H04L 12/713
H04L 29/08
Abstract:
Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

Single Node And Multiple Node Datastore Architecture In A Network Routing Environment

View page
US Patent:
20200065317, Feb 27, 2020
Filed:
Aug 23, 2019
Appl. No.:
16/549369
Inventors:
- San Jose CA, US
Keyur Patel - San Jose CA, US
Derek Man-Kit Yeung - Fremont CA, US
Alpesh Patel - San Ramon CA, US
Lawrence Rolfe Kreeger - Fremont CA, US
Nalinaksh Pai - San Ramon CA, US
International Classification:
G06F 16/27
G06F 16/22
G06F 16/23
Abstract:
Systems, methods, and devices for offloading network data to a datastore. A system includes a plurality of instances of a datastore node in a single networking device, each of the plurality of instances of the datastore node comprising: a datastore; a publisher independent of the datastore for publishing data to the datastore; a subscriber independent of the datastore for receiving information from the datastore; a replicator agent configured to connect to the datastore as a publisher or a subscriber; and a persistent storage agent configured to connect to the datastore as a publisher or a subscriber.

First Hop Gateway Redundancy In A Network Computing Environment

View page
US Patent:
20200067812, Feb 27, 2020
Filed:
Aug 23, 2019
Appl. No.:
16/549852
Inventors:
- San Jose CA, US
Keyur Patel - San Jose CA, US
Derek Man-Kit Yeung - Fremont CA, US
Lawrence Rolfe Kreeger - Fremont CA, US
Shitanshu Shah - Cupertino CA, US
Lalit Kumar - Milpitas CA, US
Kalyani Rajaraman - San Jose CA, US
Vikram Ragukumar - Pleasanton CA, US
Nalinaksh Pai - San Ramon CA, US
International Classification:
H04L 12/751
H04L 12/721
H04L 12/66
H04L 12/46
G06F 9/455
Abstract:
Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a first switch and a second switch in a network topology. The system includes a host virtual machine in communication with at least one of the first switch and the second switch. The system includes a routed peer link connecting the first switch to the second switch. The system is such that the first switch and the second switch have the same Internet protocol (IP) address and media access control (MAC) address.

Loop Conflict Avoidance In A Network Computing Environment

View page
US Patent:
20200067822, Feb 27, 2020
Filed:
Aug 23, 2019
Appl. No.:
16/549752
Inventors:
- San Jose CA, US
Keyur Patel - San Jose CA, US
Derek Man-Kit Yeung - Fremont CA, US
Nalinaksh Pai - San Ramon CA, US
Kalyani Rajaraman - San Jose CA, US
Vikram Ragukumar - Pleasanton CA, US
International Classification:
H04L 12/707
H04L 12/723
H04L 12/753
H04L 12/46
H04L 12/44
Abstract:
Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.
Derek Chun Yeung from South San Francisco, CA, age ~62 Get Report